Computer Science Fundamentals (CS153 2003S)

[Skip to Body]
Primary: [Front Door] [Current] [Glance] - [EC] [Honesty] [Instructions] [Links] [Search] [Syllabus]
Groupings: [EBoards] [Examples] [Exams] [Handouts] [Homework] [Labs] [Lab Writeups] [Outlines] [Readings] [Reference]
ECA: [About] [Grades] [Quizzes] [Submit Work] [Change Password] [Reset Password]
Misc: [Experiments in Java] [Scheme Reference] [Scheme Report] [CS153 2002S (Walker)] [CS151 2003S (Rebelsky)] [CS152 2000F (Rebelsky)] [SamR]

Outlines

Class 56: Wrapup (Friday, 9 May 2003)
Class 55: Evaluation (Wednesday, 7 May 2003)
Class 54: Algorithm Design, Revisited (Tuesday, 6 May 2003)
Class 53: Implementing Dictionaries with Binary Search Trees (Monday, 5 May 2003)

Class 52: Implementing Dictionaries with Hash Tables (Friday, 2 May 2003)
Class 51: Implementing Dictionaries with Lists (Wednesday, 30 April 2003)
Class 50: The Dictionary ADT (Tuesday, 29 April 2003)
Class 49: Priority Queues, Heaps, and Heap Sort (Monday, 28 April 2003)

Class 48: LInear Structures (Friday, 25 April 2003)
Class 47: Implementing Lists with Nodes (Wednesday, 23 April 2003)
Class 46: Implementing Lists with Arrays (Tuesday, 22 April 2003)
Class 45: Sorting Out Sorting (Monday, 21 April 2003)

Class 44: List ADT Design, Continued (Friday, 18 April 2003)
Class 43: Some List ADTs (Wednesday, 16 April 2003)
Class 42: Introduction to Abstract Data Types and Data Structures (Tuesday, 15 April 2003)
Class 41: Polymorphism Example (Monday, 14 April 2003)

Class 40: Polymorphism (Friday, 11 April 2003)
Class 39: Inheritance (Wednesday, 9 April 2003)
Class 38: Designing Objects (Tuesday, 8 April 2003)
Class 37: Exam 2 (Monday, 7 April 2003)

Class 36: Arrays (Friday, 4 April 2003)
Class 35: When Things Go Wrong (Wednesday, 2 April 2003)
Class 34: Loops (Tuesday, 1 April 2003)
Class 33: Conditionals (Monday, 31 March 2003)

Class 32: Objects, Methods, and Classes (Friday, 14 March 2003)
Class 31: Java Lab (Wednesday, 12 March 2003)
Class 30: Getting Started with Java (Tuesday, 11 March 2003)
Class 29: Getting Started with Object-Oriented Programming (Monday, 10 March 2003)

Class 28: Files (Friday, 7 March 2003)
Class 27: Program Input (Wednesday, 5 March 2003)
Class 26: Randomness and Simulation (Tuesday, 4 March 2003)
Class 25: Sorting Laboratory (Monday, 3 March 2003)

Class 24: Fast Sorting Algorithms (Friday, 28 February 2003)
Class 23: Sorting (Wednesday, 26 February 2003)
Class 22: Searching (Tuesday, 25 February 2003)
Class 21: Tail Recursion (Monday, 24 February 2003)

Class 20: More Algorithm Analysis (Friday, 21 February 2003)
Class 19: Algorithm Analysis (Wednesday, 19 February 2003)
Class 18: More Higher-Order Procedures (Tuesday, 18 February 2003)
Class 17: Higher-Order Procedures (Monday, 17 February 2003)

Class 16: Vectors (Friday, 14 February 2003)
Class 15: Pairs and Pair Structures (Wednesday, 12 February 2003)
Class 14: CGI Scripting (Tuesday, 11 February 2003)
Class 13: Strings (Monday, 10 February 2003)

Class 12: Variable-Arity Procedures (Friday, 7 February 2003)
Class 11: Local Procedures (Wednesday, 5 February 2003)
Class 10: Preconditions and Postconditions (Tuesday, 4 February 2003)
Class 9: Local Bindings (Monday, 3 February 2003)

Class 8: Recursion with Numbers (Friday, 31 January 2003)
Class 7: Recursion with Lists (Wednesday, 29 January 2003)
Class 6: Conditionals Lab (Tuesday, 28 January 2003)
Class 5: Conditionals (Monday, 27 January 2003)

Class 4: Procedures (Friday, 24 January 2003)
Class 3: Basic Types: Symbols, Lists, and Numbers (Wednesday, 22 January 2003)
Class 2: Starting Scheme (Tuesday, 21 January 2003)
Class 1: Introduction to The Course (Monday, 20 January 2003)

History

Since this document serves primarily as a list of documents, I will not update the history for simple additions to the list.

Wednesday, 15 January 2003 [Samuel A. Rebelsky]

Created as an empty document.

Tuesday, 21 January 2003 [Samuel A. Rebelsky]

Added links to the first two outlines.

[Skip to Body]
Primary: [Front Door] [Current] [Glance] - [EC] [Honesty] [Instructions] [Links] [Search] [Syllabus]
Groupings: [EBoards] [Examples] [Exams] [Handouts] [Homework] [Labs] [Lab Writeups] [Outlines] [Readings] [Reference]
ECA: [About] [Grades] [Quizzes] [Submit Work] [Change Password] [Reset Password]
Misc: [Experiments in Java] [Scheme Reference] [Scheme Report] [CS153 2002S (Walker)] [CS151 2003S (Rebelsky)] [CS152 2000F (Rebelsky)] [SamR]

Disclaimer: I usually create these pages on the fly, which means that I rarely proofread them and they may contain bad grammar and incorrect details. It also means that I tend to update them regularly (see the history for more details). Feel free to contact me with any suggestions for changes.

This document was generated by Siteweaver on Fri May 9 09:31:03 2003.
The source to the document was last modified on Fri May 9 09:27:21 2003.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS153/2003S/Outlines/index.html.

You may wish to validate this document's HTML ; ; Check with Bobby

Samuel A. Rebelsky, rebelsky@grinnell.edu