UGC NET Computer Science Solved Paper II June 2007 - Part 3

21.       The time required to find shortest path in a graph with n vertices and e edges is:
(A) O(e)
(B) O(n)
(C) O(e2)
(D) O(n2)
Answer: D
22.       Pre order is also known as:
(A) Depth first order
(B) Breadth first order
(C) Topological order
(D) Linear order
Answer: A
23.       The equivalent post fix express for d/(e+f) + b*c is:
(A) defbc/++
(B) def+/bc+*
(C) def+/bc*+
(D) None of these
Answer: C
24.       Which algorithm has same average, worst case and best case time?
(A) Binary search
(B) Maximum of n numbers
(C) Quick sort
(D) Fibonacci search
Answer: B
25.       Application of data structure in queue is:
(A) Level wise printing of tree
(B) Implementation of priority queues
(C) Function call implementation
(D) Depth first search in a graph
Answer: B
26.       In case of Bus/Tree topology signal balancing issue is overcome by:
(A) Strong Transmitter
(B) Polling
(C) Segmentation
(D) Modulation
Answer: C
27.       Which of the following techniques are used to control data flow?
1. Windowing   2. Routing    
3. RPCs             4. Buffering
(A) 1, 4
(B) 2, 3, 4
(C) 1, 3, 4
(D) 1, 2, 3, 4
Answer: A
28.       TDM is ................
(A) A primary/secondary type protocol
(B) A peer/peer protocol
(C) A Non-priority peer/peer protocol
(D) A priority type protocol
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: A
30.    Which of the following protocols is used to prevent looping?
(B) Spanning tree
(D) Fragment free switching
Answer: B

Pages   2   3   4   5 

Post a comment