Differences

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

--- course_outline [2007/07/31 19:53] – external edit 127.0.0.1
+++ course_outline [2013/07/31 22:09] (current) – kargar
@@ Line 1: / Line 1: @@
 ====== Course Outline ======
-The course outline is a guideline to topics that will be discussed in the course, and when they will be discussed:
+. Course Information
-===== Week 1 =====
+. Algorithm Analysis Part 1-Chapter 4
-Your notes here.
+. Algorithm Analysis Part 2-Chapter 4
-===== Week 2 =====
+. Recursion-Section 3.5
-===== Midterm =====
+. Merge sort-Section 11.1
-===== Drop Deadline =====
+. Quick sort-Section 11.2
-===== Week 13 =====
+. Arrays and Linked Lists-Sections 3.1,3.2,3.3
-===== Final Exam =====
+. Stacks-Section 5.1
+. Queues-Section 5.2
+. Double-Ended Queues/Extendable Arrays-Section 5.3
+. Trees-Sections 7.1 and 7.2
+. Binary Trees-Section 7.3
+. Binary Search Trees-Section 10.1
+. AVL Trees-Section 10.2
+. 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