course_outline
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| course_outline [2013/06/20 18:32] – kargar | course_outline [2013/07/31 22:09] (current) – kargar | ||
|---|---|---|---|
| Line 9: | Line 9: | ||
| 4. Recursion-Section 3.5 | 4. Recursion-Section 3.5 | ||
| - | 5. Merge sort - Solving recurrences | + | 5. Merge sort-Section 11.1 |
| - | 6. Quick sort | + | 6. Quick sort-Section 11.2 |
| - | 7. Arrays | + | 7. Arrays |
| - | 8. Stacks | + | 8. Stacks-Section 5.1 |
| - | 9. Queues | + | 9. Queues-Section 5.2 |
| - | 10. Double-ended queues - Extendable | + | 10. Double-Ended Queues/Extendable |
| - | 11. Trees | + | 11. Trees-Sections 7.1 and 7.2 |
| - | 12. Binary | + | 12. Binary |
| - | Reading week: February 16-22. | + | 13. Binary Search Trees-Section 10.1 |
| - | 13. Midterm test (February 26) | + | 14. AVL Trees-Section 10.2 |
| - | 14. Binary search trees | + | 15. Heaps-Section 8.3 |
| + | |||
| + | 16. Heap Sort-Section 8.3.5 | ||
| + | |||
| + | 17. Hashing I-Section 9.2 | ||
| + | |||
| + | 18. Hashing II-Section 9.2 | ||
| + | |||
| + | 19. Introduction to Graphs-Sections 13.1 and 13.2 | ||
| + | |||
| + | 20. Breadth First Search-Section 13.3 | ||
| + | |||
| + | 21. Depth First Search-Section 13.3 | ||
| + | |||
| + | 22. Applications of BFS and DFS-Section 13.3 | ||
course_outline.1371753137.txt.gz · Last modified: 2013/06/20 18:32 by kargar