Time left:

[All Quizzes] → [Introduction to Algorithms] → [Random - All Topics]


1. ► Strongly connected component term is used in the context of directed graphs

A.
B.

2. ► Relaxation step is called O(E) times

A.
B.

3. ► Binary search on AVL trees can be done at most in O(lgn) steps

A.
B.

4. ► Binary search is there in algorithm package

A.
B.

5. ► Master method can solve all kinds of recurrences

A.
B.

6. ► Page ranking system has tree structure

A.
B.

7. ► Connected component algorithm is there in boost library

A.
B.

8. ► Breadth first walk on undirected graph cannot give connected components

A.
B.

9. ► A graph can have multiple connected components

A.
B.

10. ► Analysis of data structure is typically done on per operation basis

A.
B.

11. ► String matching is quite common in scripting languages

A.
B.

12. ► Harmonic series results in polynomial bounds

A.
B.

13. ► Connected component denotes close relationship among nodes

A.
B.

14. ► Implementation of Dijkstra’s algorithm can make use of heap

A.
B.

15. ► Once you start coding, data structure will come automatically

A.
B.


© 2016 VirtuQ™ Education All right reserved. | Terms of Use | Privacy Policy