Question 1     

A

Linked List



B

Graph with cycles



C

Graph without cycles



D

Tree

Question 2     

A

n*(n+1)/2



B

n*(n-1)



C

n*(n+1)



D

(n*(n+1))/2

Question 3     

A

Heap



B

Stack



C

Queue



D

Tree

Question 4     

A

Inorder traversal



B

Preorder traversal



C

Postorder traversal



D

None of the above

Question 5     

A

Testing whether the graph is connected



B

Computing a spanning forest of the graph



C

Checking if a cycle exist in a graph



D

All of the above.



E

None of the above

Question 6     

A

True



B

False

Question 7     

A

For generating Strongly Connected Components of a directed graph



B

For generating topological sort of a graph



C

Peer to Peer Networks



D

Detecting cycles in the graph

Question 8     

A

Queue



B

Stack



C

Heap



D

Linked List

Question 9     

A

When the graph has cycles



B

When degree of every node is one



C

When the graph is a Tree



D

When graph is linked list



E

Both 2 and 4

Question 10     

A

0



B

1



C

2



D

Some are visited and some are not visited