Time left:

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


1. ► Dynamic programming also follows divide and conquer approach

A.
B.

2. ► Heap sort guarantees O(nlgn) performance

A.
B.

3. ► Heap sort makes use of heap data structure

A.
B.

4. ► Big-O notation has no hidden constant

A.
B.

5. ► Quick sort can be done in-place

A.
B.

6. ► Greedy algorithm works in bottom up manner

A.
B.

7. ► Brute force string matching relies on char by char comparison

A.
B.

8. ► Rabin-Karp algorithm reuses previously calculated hash values

A.
B.

9. ► Memory access pattern may help in optimizing program for specific architectures

A.
B.

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

A.
B.

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

A.
B.

12. ► Connected component denotes close relationship among nodes

A.
B.

13. ► Binary search is there in algorithm package

A.
B.

14. ► Topological sort requires O(V) space

A.
B.

15. ► For faster and frequent searches, sorted sequences are better to work on

A.
B.


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