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

2. ► Dynamic programming works in the top down manner

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

4. ► Greedy algorithms always select local best possible solution

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

6. ► Binary is not a divide and conquer algorithm

7. ► Heap sort cannot be done in-place

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

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

10. ► Binary search performs in linear time

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

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

13. ► Topological sort requires O(V) space

14. ► Heap sort guarantees O(nlgn) performance

15. ► Topological sort is available in STL