1. ► O(1) is linear time complexity

2. ► Frequent cheap operations compensate expensive operations

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

4. ► Heuristic solutions can provide reasonable solutions quite fast

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

6. ► Quick sort can be done in-place

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

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

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

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

11. ► Merge sort can be parallelized

12. ► Amortized analysis refers to average case complexity

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

14. ► Exact figures of memory usage is not important

15. ► Dijkstra’s algorithm makes greedy choice