CSCE 310: Data Structures and Algorithms

Spring 2009, MWF 9:30-10:20am

Room 110, Avery Hall

Name Office Office Hours

Instructor Prof. Ying Lu 106 Schorr Center WF 2:30-4:00pm and by appointment

TA Raghunath Tewari 123C Avery Hall M 1:00-2:00pm Student Resource Centre (13A Avery) M 2:00-3:30pm 123C Avery Hall T 3:30-4:30pm Student Resource Centre (13A Avery)

Announcements:

· Final: 10:00 to 12:00 noon, Monday, May 4.

Syllabus

Class Roster

Lecture Notes	Reading List
1.  Administrivia
2.  Introduction	Chap 1
3. Algorithm Analysis	Chap 2.1
4. Asymptotic Notations	Chap 2.2
5. Analysis of Nonrecursive Algorithms	Chap 2.3, Appendix A
6. Analysis of Recursive Algorithms	Chap 2.4, 2.5, Appendix B
7.  Brute Force Algorithms	Chap 3
8.  Divide and Conquer1: MergeSort and QuickSort	Chap 4.1, 4.2
9. Divide and Conquer2: Binary Search and Multiplication	Chap 4.3, 4.5
10. Divide and Conquer3: Closest Pair and Convex Hull	Chap 4.6
11. Decrease and Conquer1	Chap 5.2, 5.3, 5.4
12. Decrease and Conquer2	Chap 5.5, 5.6
13. AVL and 2-3 Trees	Chap 6.3
14. Heap and HeapSort	Chap 6.4
15. Space and Time Tradeoff	Chap 7.1, 7.2
16. Hashing	Chap 7.3
17. Warshall’s and Floyd’s Algorithms	Chap 8.2
18. 0-1 Knapsack Problem	Chap 8.4
19. Greedy Algorithms MST	Chap 9.1, 9.2
20. Huffman Code	Chap 9.4
21. P, NP & NP-Complete	Chap 11.3

Homework

Homework1: Pretest (pdf) (tex) (word)

Homework2: (pdf) (tex) (word)

Homework3: (pdf) (tex) (word)

Homework4: (pdf) (tex) (word)

Homework5: (pdf) (tex) (word)