CS1321 Spring 2003 Tentative Lecture Schedule

(This schedule is subject to change.)

GT First Day of Classes (Friday 1/3/2003)

HtDP: Section I: Processing Simple Forms of Data

Lecture 1: 1/7/2003

1. Course Syllabus Overview (HtDP: Ch 1)(updated Jan 7 10:01am)
2. Numbers and Simple Functions (HtDP: Ch 2-3)(updated Jan 8 6pm)

Lecture 2: 1/9/2003

3. Design Recipe Introduction (HtDP: Ch 2.5)(updated Jan 8 6pm)
4. Conditionals and Cond Statement (HtDP: Ch 4-5)

Lecture 3: 1/14/2003

6. Compound Data - Structures (HtDP: Ch 6)
5. WebWork

Lecture 4: 1/16/2003

7. Lists, cons cells, and recursion intro (HtDP: Ch 9)

Official School Holiday (Monday 1/20/2003)

HtDP: Section II: Processing Arbitrarily Large Data

Lecture 5: 1/21/2003

8. Numeric Recursion (HtDP: Ch 11.4)

Lecture 6: 1/23/2003

9. Producing Lists (HtDP: Ch 10)
Quiz 1 Prep

Lecture 7: 1/28/2003

9. Producing Lists (cont) (HtDP: Ch 10)

Lecture 8: 1/30/2003

10. Insertion Sort (HtDP: Ch 12.2)

HtDP: Section III, How to Design Programs

Lecture 9: 2/4/2003

11. Ancestral Trees (HtDP: Ch 14)
12. Binary Search Trees (HtDP: Ch 14.2)

Lecture 10: 2/6/2003

12. Binary Search Trees (cont) (HtDP: Ch 14.2)

Lecture 11: 2/11/2003

13. Lists in Lists (HtDP: Ch 14.3; slides include flatten)

Lecture 12: 2/13/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)

Course Drop Date (Friday 2/14/2003)

Lecture 13: 2/18/2003

16. Processing Two Lists (cont) (HtDP: Ch 17; slides include merge for mergesort)
17b. Indexing into a List: "pick-list" function (HtDP: Ch 17; Design a template for processing two arbitrary complex types.)

Lecture 14: 2/20/2003

Directory.scm - great example of mutual recursion and use of dir.ss teachpack
17c. Processing Two Lists: Testing for Equality (HtDP: Ch 17.8)
18. Function Local and Lexical Scope (HtDP: Ch 18)

HtDP: Section IV, How to Design Programs

Lecture 15: 2/25/2003

19. Recognizing Similary among Functions (HtDP: Ch 19)
20. Generalizing Functions (HtDP: Ch 20)

Lecture 16: 2/27/2003

21. Lambda Bodies (HtDP: Ch 21)

Official School Holiday - Spring Break (Monday 3/3/2003-Friday 3/7/2003)

HtDP: Section V: Generative Recursion

Lecture 17: 3/11/2003

Lecture 18: 3/13/2003

School Withdrawal Date (Friday 3/14/2003)

Lecture 19: 3/18/2003

HtDP: Section VI: Accumulating Knowledge

25. Intro to Tail Recursion (HtDP: Ch 30)
26. Intro to Graphs (HtDP: Ch 28)

Lecture 20: 3/20/2003

27. Intro to Depth First Search(DFS) and Breadth First Search(BFS) v5 (HtDP: N/A)
28. Depth First Search(DFS) and Breadth First Search(BFS) of Graphs (HtDP: N/A)

Lecture 21: 3/25/2003

HtDP: Section VII: Changing the State of Variables

29. Breaking the Functional Paradigm - Let, Set!, Begin (HtDP: Ch 35-37)
30. Looping for Repetition (HtDP: N/A)

Lecture 22: 3/27/2003

Lecture 23: 4/1/2003

31. Vectors (HtDP: Ch 29)

Lecture 24: 4/3/2003

32. Multi-Dimensional Vectors (HtDP: N/A)

Lecture 25: 4/8/2003

33. Big O (HtDP: Ch 29)
34. Vector Problem (HtDP: Ch 29)
stats.scm

HtDP: Section VIII: Changing Compound Values

Lecture 26: 4/10/2003

35. Encapsulation (HtDP: Ch 39)
36. Encapsulation & Object Oriented Programming (HtDP: Ch 39)

Lecture 27: 4/15/2003

37. Object Oriented Terminology (HtDP: N/A)
38. Coke Machine (HtDP: N/A)

Lecture 28: 4/17/2003

39. Queue Class (HtDP: N/A)
Dan's Repository of Code - great Stack & Queue ADTs
40. Inheritance (HtDP: N/A)
41. Inheritance with Coke Example (HtDP: N/A)
inheritance.scm

Lecture 29: 4/22/2003

42. Polymorphism (HtDP: N/A)
43. Computability (optional) (HtDP: N/A)

Lecture 30: 4/24/2003

Review

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

Finals (April 25-May 2)