Time left:

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


1. ► A ready list can be obtained through topological sort prior to scheduling

A.
B.

2. ► Dynamic programming works in the top down manner

A.
B.

3. ► Which of the following problem does not have exponential complexity

A.
B.

4. ► Greedy algorithms always select local best possible solution

A.
B.

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

A.
B.

6. ► Binary is not a divide and conquer algorithm

A.
B.

7. ► Heap sort cannot be done in-place

A.
B.

8. ► A simple depth-first walk is enough to give topological ordering

A.
B.

9. ► Amortized analysis is applicable when there is certain relationship between cheap and expensive operations

A.
B.

10. ► Binary search performs in linear time

A.
B.

11. ► Fibonacci series can be calculated efficiently with dynamic programming

A.
B.

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

A.
B.

13. ► Topological sort requires O(V) space

A.
B.

14. ► Heap sort guarantees O(nlgn) performance

A.
B.

15. ► Topological sort is available in STL

A.
B.


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