ALGORITHMS |Gate-1993| Previous Year Questions| Set-15

previous year question of ALGORITHMS gate 1993

ALGORITHMS |Gate-1993|

  1. The root directory of a disk should be placed : [GATE – 1993]

a. at a fixed address in main memory
b. at a fixed location on the disk
c. anywhere on the disk
d. at a fixed location on the system disk
e. anywhere on the system disk

Answer : b)


  1. Consider a simple connected graph G with n vertices and n-edges (n>2). Then, which of the following statements are true? [GATE – 1993]

a. G has no cycles.
b. The graph obtained by removing any edge from G is not connected.
c. G has at least one cycle.
d. The graph obtained by removing any two edges from G is not connected.
e. Both C and D.

Answer : e)


  1. Complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing n vertices and m edges if the edges are sorted is __________ [GATE – 1993]

a. O(m log n)
b. O(m log m)
c. O(n log m)
d. O(n log n)

Answer : a)
ALGORITHMS |Gate-1993|


Back to GATE-HOME


Spread the love

Leave a Comment

Your email address will not be published. Required fields are marked *