26
The word ‘public servant’ means :
Answer
D. All of the above
27
The world environment day is celebrated on …………….. of every year
Answer
-Question Cancelled
28
Every request for obtaining information under the Right to Information Act is to be disposed of with in:
Answer
C. 30 days
29
The Supreme Court of India recognized sexual harassment at work place as a violation of human rights in the case of :
Answer
B. Visakha v State of Rajasthan
30
The information exempted from disclosure under Section 8 of the Right to Information Act includes:
Answer
D. All the above.
31
The binary equivalent of decimal number 20.625 is
Answer
C. 10100.1010
32
A memory that contains 32K memory requires how many different addresses
Answer
B. 32768
33
An SDRAM chip has 4096 rows, a refresh time of 128ms, the memory bus runs at 166MHz and the refresh cycle takes 4 clock cycles. The refresh overhead is:
Answer
A. 0.00076
34
What is the address line for RST 4.5?
Answer
D. 0024H
35
Which of the following is a software interrupt?
Answer
B. RST 5
36
The expression E+((A+B)*D)-C can be written in Reverse Polish Notation as
Answer
D. EAB+D*+C
37
The maximum number of I/O devices that can be connected to 8085 microprocessor is
Answer
C. 65536
38
How many pins does a DDR SDRAM DIMM have?
Answer
A. 184
39
UART is
Answer
B. 8250
40
DMA Controller gets complete access to main memory through which technique?
Answer
A. Burst Mode
41
Which of the following represents the average-case performance of a quicksort algorithm?
Answer
D. O(nlog n)
42
Which of the following is not the required condition for binary search algorithm?
Answer
C. There must be mechanism to delete and/or insert element in list
43
A 3-ary tree is a tree in which every internal node has exactly 3 children. The number of leaf nodes in such a tree with 6 internal nodes will be
Answer
D. 13
44
Of the following sorting algorithms, the one which has a running time that is least dependent on the initial ordering of the input is
Answer
C. Merge sort
45
The number of edges in a regular graph of degree d and n vertices is
Answer
D. nd/2
46
The depth of a complete binary tree is given by
Answer
B. log n + 1
47
Convert the expression ((A+B)*C-(D-E)^(F+G)) to equivalent Postfix notation
Answer
A. AB+C*DE--FG+^
48
Merge sort uses
Answer
A. Divide and Conquer strategy
49
Linked lists are best suited
Answer
B. for the size of the structure and the data in the structure are constantly changing
50
The complexity of the average case of an algorithm is
Answer
A. much more complicated to analyze than that of worst case
Discussion
Ask a doubt or share a tip.
No comments yet — start the discussion.