Time left:

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


1. ► O(1) is linear time complexity

A.
B.

2. ► Frequent cheap operations compensate expensive operations

A.
B.

3. ► Only mobility based heuristic can be applied in list scheduling

A.
B.

4. ► Heuristic solutions can provide reasonable solutions quite fast

A.
B.

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

A.
B.

6. ► Quick sort can be done in-place

A.
B.

7. ► Initial distance on unconnected nodes from the source node is infinite in Dijkstra’s algorithm

A.
B.

8. ► Dijkstra’s algorithm cannot be used to compute all source shortest paths

A.
B.

9. ► Recurrences typically appear as the result of divide and conquer algorithms

A.
B.

10. ► Big-O notation makes sense only for large data set

A.
B.

11. ► Merge sort can be parallelized

A.
B.

12. ► Amortized analysis refers to average case complexity

A.
B.

13. ► Quick sort is one of the most extensively used sorting algorithm

A.
B.

14. ► Exact figures of memory usage is not important

A.
B.

15. ► Dijkstra’s algorithm makes greedy choice

A.
B.


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