# CSCE310: Class schedule

Check often, at least three times per week.
Handouts:
2. Introduction:  Handout 1 (PS), (PDF)
3. Asymptotic notations (PS), (PDF)
4. Elementary data structures I (PS), (PDF)
5. Elementary data structures II (PS), (PDF)
6. Recursion (PS), (PDF)
7. Recurrence (PS), (PDF)
8. Graphs (PS, PS4), (PDF,PDF4)
9. Trees (PS, PS4), (PDF, PDF4)
10. Heapsort I (PS, PS4), (PDF, PDF4)
11. Heapsort II (PS, PS4), (PDF, PDF4)
12. Homework1.doc  and solutions.doc
13. Quicksort (PS, PS4), (PDF, PDF4)
14. Sorting in linear time ( PS, PS4), (PDF, PDF4)
15. Hash tables I (PS, PS4), (PDF, PDF4)
16. Homework2.doc and solutions.doc
17. Homework3.doc
18. Hash tables (II) (PS, PS4, PDF, PDF4)
19. Hash tabkes (III) (PS, PS4, PDF, PDF4)
20. Homework4.doc
21. Binary Search Tree (PS, PS4, PDF, PDF4)
22. Dynamic Programming (PS, PS4, PDF, PDF4)
23. Homework5doc
24. Greedy Algorithms (PS, PS4, PDF, PDF4)
25. Homework4-solutions.doc
26. Elementary graph algorithms (PS, PS4, PDF, PDF4)
27. Homework5-solutions.doc
Cool animations: Material you are expected to know:  Sections 3.1, 3.2, 5.1, 5.3, 6.1, 6.2, 6.6.1.