Differences

This shows you the differences between two versions of the page.

--- course_outline [2013/06/20 18:30] – kargar
+++ course_outline [2013/07/31 22:09] (current) – kargar
@@ Line 1: / Line 1: @@
 ====== Course Outline ======
-. Course info - Introduction to data structures
+. Course Information
-. Algorithm analysis (1)
+. Algorithm Analysis Part 1-Chapter 4
-. Algorithm analysis (2)
+. Algorithm Analysis Part 2-Chapter 4
-. Recursion and logarithms
+. Recursion-Section 3.5
-. Merge sort - Solving recurrences
+. Merge sort-Section 11.1
-. Quick sort
+. Quick sort-Section 11.2
-. Arrays - Linked lists
+. Arrays and Linked Lists-Sections 3.1,3.2,3.3
-. Stacks
+. Stacks-Section 5.1
-. Queues
+. Queues-Section 5.2
-. Double-ended queues - Extendable arrays
+. Double-Ended Queues/Extendable Arrays-Section 5.3
-. Trees
+. Trees-Sections 7.1 and 7.2
-. Binary trees
+. Binary Trees-Section 7.3
-Reading week: February 16-22.
+. Binary Search Trees-Section 10.1
-. Midterm test (February 26)
+. AVL Trees-Section 10.2
-. Binary search trees
+. Heaps-Section 8.3
+. Heap Sort-Section 8.3.5
+. Hashing I-Section 9.2
+. Hashing II-Section 9.2
+. Introduction to Graphs-Sections 13.1 and 13.2
+. Breadth First Search-Section 13.3
+. Depth First Search-Section 13.3
+. Applications of BFS and DFS-Section 13.3