21. If we have six
stack operations pushing and popping each of A, B and C-such that push (A) must
occur before push (B) which must occur before push (C), then A, C, B is a
possible order for the pop operations, since this could be our sequence : push
(A), pop (A), push (B), push (C), pop (C), pop (B). Which one of the following
orders could not be the order the pop operations are run, if we are to satisfy
the requirements described above?
(A) ABC
(B) CBA
(C) BAC
(D) CAB
Answer: D
22. What is the
most appropriate data structure to implement a priority queue?
(A) Heap
(B) Circular array
(C) Linked list
(D) Binary tree
Answer: A
23. In a complete binary
tree of n nodes, how far are the two most distant nodes? Assume each edge in
the path counts as !
(A) About log2n
(B) About 2 log2n
(C) About n log2n
(D) About 2n
Answer: B
24. A chained hash
table has an array size of 100. What is the maximum number of entries that can
be placed in the table?
(A) 100
(B) 200
(C) 10000
(D) There is no upper limit
Answer:
25. In a B tree of
order 5, the following keys are inserted as follows :
7, 8, 1, 4, 13, 20, 2, 6 and 5
How many elements are present in the root of the tree?
(A) 1
(B) 2
(C) 3
(D) 4
Answer: B
26. The ……………
field is the SNMP PDV reports an error in a response message.
(A) error index
(B) error status
(C) set request
(D) agent index
Answer: B
27. What does the
URL need to access documents?
I. Path name
II. Host name
III. DNS
IV. Retrieval method
V. Server port number
(A) I, II, III
(B) I, III, V
(C) I, II, IV
(D) III, IV, V
Answer: B
28. End-to-End
connectivity is provided from Last-to-Last in
(A) Network layer
(B) Session layer
(C) Transport layer
(D) Data link layer
Answer: C
29. What services does
the internet layer provide?
1. Quality of service
2. Routing
3. Addressing
4. Connection oriented delivery
5. Framing bits
(A) 1, 2, 3
(B) 2, 3, 4
(C) 1, 3, 4, 5
(D) 2, 3, 4, 5
Answer:
30. What is the
maximum operating rate of a wireless LAN using infrared communication?
(A) 1 mbps
(B) 2 mbps
(C) 5 mbps
(D) 11mbps
Answer: A
0 Comments