CS1321 Summer 2003 Lecture Schedule

WEEK OF 5/13/2003

GT First Day of Classes (Monday 5/12/2003)

1. Course Syllabus Overview (HtDP: Ch 1) 
2. Numbers and Simple Functions (HtDP: Ch 2-3) 
3. Design Recipe Introduction (HtDP: Ch 2.5) 
4. Conditionals and Cond Statement (HtDP: Ch 4-5) 

Homework 1 - Basics
--------------------------------------------------------------------------------

WEEK OF 5/20/2003
6. Compound Data - Structures (HtDP: Ch 6) 
7. Lists, cons cells, and recursion intro (HtDP: Ch 9)
 
Homework 2 - Structures

--------------------------------------------------------------------------------

WEEK OF 5/27/2003
8. Numeric Recursion (HtDP: Ch 11.4) 
9. Producing Lists (HtDP: Ch 10) 

Homework 3 - Lists

--------------------------------------------------------------------------------

WEEK OF 6/3/2003
10. Insertion Sort (HtDP: Ch 12.2) 

Intermediate Student Scheme
 
11. Ancestral Trees (HtDP: Ch 14) 
12. Binary Search Trees (HtDP: Ch 14.2) 
13. Lists in Lists (HtDP: Ch 14.3; slides include flatten) 

Quiz 1 - Structures and Lists

--------------------------------------------------------------------------------

WEEK OF 6/10/2003
14. Mutually Referential Data Definitions (HtDP: Ch 15) 
15. Iterative Refinement Design Process (HtDP: Ch 16) 
16. Processing Two Lists (HtDP: Ch 17; slides include merge for mergesort) 
17. Indexing into a List: "pick-list" function (HtDP: Ch 17; Design a template for processing two arbitrary complex types.) 
17c. Processing Two Lists: Testing for Equality (HtDP: Ch 17.8) 
18. Function Local and Lexical Scope (HtDP: Ch 18)
 
Homework 4 - Compound Lists & Trees

Course Drop Date (Friday 6/13/2003)

--------------------------------------------------------------------------------

WEEK OF 6/17/2003
19. Recognizing Similary among Functions (HtDP: Ch 19) 
20. Generalizing Functions (HtDP: Ch 20) 
21. Lambda Bodies (HtDP: Ch 21) 
Homework 5 - More Compound Data, Functions as Parameters

--------------------------------------------------------------------------------

WEEK OF 6/24/2003
22. Generative Recursion (HtDP: Ch 25) 
23. Quicksort (HtDP: Ch 25) 
24. Fractals! (HtDP: Ch 25) 
25. Intro to Tail Recursion (HtDP: Ch 30) 

Quiz 2 - Compound Lists & Trees, Functions as Parameters

School Withdrawal Date (Sunday 6/29/2003)

--------------------------------------------------------------------------------

WEEK OF 7/1/2003
26. Intro to Graphs (HtDP: Ch 28) 
27. Intro to Depth First Search(DFS) and Breadth First Search(BFS)  
28. Depth First Search(DFS) and Breadth First Search(BFS) of Graphs  
29. Breaking the Functional Paradigm - Let, Set!, Begin (HtDP: Ch 35-37) 
30. Looping for Repetition 
Homework 6 - Sorting, Graphs

--------------------------------------------------------------------------------

WEEK OF 7/8/2003
31. Vectors (HtDP: Ch 29) 
32. Multi-Dimensional Vectors  
33. Big O (HtDP: Ch 29) 
34. Vector Problem (HtDP: Ch 29)
 
Homework 7 - Vectors & Iteration

--------------------------------------------------------------------------------

WEEK OF 7/15/2003

Advanced Student Scheme

35. Encapsulation (HtDP: Ch 39) 
36. Encapsulation & Object Oriented Programming (HtDP: Ch 39) 
37. Object Oriented Terminology  
39. Queue Class 
40. Inheritance  
42. Polymorphism 
 
Quiz 3 - Vectors & Iteration

--------------------------------------------------------------------------------

WEEK OF 7/22/2003
43. Computability (optional) 
Review 

GT Last Day of Classes (Thursday 7/24/2003)

--------------------------------------------------------------------------------

WEEK OF 7/29/2003

Finals (July 28-31)