This is a highly approximate syllabus. Expect
topics, assignments, ordering, and almost everything else to change.
Class 01
(Friday, 27 August 2004)
About the Course
Overview:
- About the course.
- Grounding ourselves.
- Some basic administrative issues.
- Programming paradigms.
- An introduction to data structures and algorithms.
Class 02
(Monday, 30 August 2004)
An Introduction to Object-Oriented Programming
Assignments
- Nightly assignment: Find at least one definition of object-oriented programming and be prepared to compare it to the one I gave in class.
Overview:
- Programming Paradigms
- Object-Oriented Programming
- ADTs and Data Structures
Class 03
(Tuesday, 31 August 2004)
An Introduction to Java (1)
Related Pages:
Overview:
- Your first Java program.
- Configuring the MathLAN computers to run Java.
Class 04
(Wednesday, 1 September 2004)
An Introduction to Java (2)
Related Pages:
Overview:
- Your first Java program, revisited.
- String-based input in Java.
- Reading numbers.
Class 05
(Friday, 3 September 2004)
Object Basics
Related Pages:
Class 06
(Monday, 6 September 2004)
Objects and Classes
Related Pages:
Overview:
- Review.
- Using objects in our class.
- Other methods for our class.
- Constructors.
- Design question: Mutability.
Class 07
(Tuesday, 7 September 2004)
Pause For Breath
Class 08
(Wednesday, 8 September 2004)
Java Basics, Revisited
Assignments
Class 09
(Friday, 10 September 2004)
Cancelled
Class 10
(Monday, 13 September 2004)
Rethinking Vectors in Two Space
Related Pages:
Class 11
(Tuesday, 14 September 2004)
Separating Interface from Implementation
Assignments
Related Pages:
Overview:
- The TwoDimVector Example, continued.
- An alternative implementation.
- Reconciling the two implementations with an interface.
- Building a generic tester.
Class 12
(Wednesday, 15 September 2004)
Conditionals
Assignments
Related Pages:
Overview:
- Boolean expressions in Java.
- Basic conditionals: the
if statement.
- Other conditionals: the
switch statement.
Class 13
(Friday, 17 September 2004)
Loops
Due
Assignments
Related Pages:
Overview:
- Iterative Repetition.
- While Loops.
- Do Loops.
- For Loops.
- Lab (J5.1 and J5.3).
Class 14
(Monday, 20 September 2004)
Laboratory: Java Basics, Revisited
Due
Assignments
Class 15
(Tuesday, 21 September 2004)
Laboratory: Java Basics, Continued
Assignments
Related Pages:
Class 16
(Wednesday, 22 September 2004)
Standard Object Methods
Due
Assignments
Related Pages:
Overview:
- Why have standard methods?
- The toString method.
- The equals method.
- The compareTo method.
- The clone method.
- The hashCode method.
Class 17
(Friday, 24 September 2004)
Reuse through Inheritance
Due
Assignments
Related Pages:
Overview:
- Reuse.
- Inheritance.
- Inheritance in Java.
- Special issue: Constructors.
- Example.
Class 18
(Monday, 27 September 2004)
Exceptions (1)
Assignments
- Assignment 19: Interfaces vs. Inheritance
Related Pages:
Overview:
- Problems in Programs.
- Techniques for Handling Errors.
- Exceptions: Java's Primary Error-Handling Technique.
- Dealing with Procedures that Throw Exceptions.
Class 19
(Tuesday, 28 September 2004)
Exceptions (2)
Due
Assignments
Overview:
- Optionally-Catchable Exceptions.
- Throwing Exceptions.
- Defining Exceptions.
Class 20
(Wednesday, 29 September 2004)
Project Discussion
Related Pages:
Overview:
- Background: About the class, revisited
- Background: About the project
- Project selection
Class 21
(Friday, 1 October 2004)
Arrays
Due
Assignments
Related Pages:
Overview:
- Introduction to Arrays.
- Arrays in Java.
- An Application: Fibonacci Numbers.
- An Application: Box Packing.
Class 22
(Monday, 4 October 2004)
Documentation and JavaDoc
Due
Assignments
Related Pages:
Overview:
- Why document?
- Kinds of documentation.
- Javadoc basics.
Class 23
(Tuesday, 5 October 2004)
Project Discussion
Related Pages:
Overview:
- Questions and answers.
- Project components.
- Selecting teams.
Class 24
(Wednesday, 6 October 2004)
Algorithm Analysis (1)
Assignments
Related Pages:
Overview:
- An Example.
- Comparing Algorithms.
Class 25
(Friday, 8 October 2004)
Algorithm Analysis (2)
Related Pages:
Overview:
- Example, revisited.
- Asymptotic Analysis.
- Asymptotic Analysis in Practice.
Class 26
(Monday, 11 October 2004)
Algorithm Analysis (3)
Related Pages:
Overview:
- Review
- The role of experimentation
- Using the notation: Eliminating constants
- Using the notation: Simplifying running times
- Analyzing recursive procedures
Class 27
(Tuesday, 12 October 2004)
Project Discussion
Due
Assignments
Related Pages:
Overview:
- Presentation by UI group.
- Presentation by AI group.
- Presentation by EE group.
- Presentation by last group.
Class 28
(Wednesday, 13 October 2004)
Class Cancelled
Class 29
(Friday, 15 October 2004)
Class Cancelled
Class 30
(Monday, 25 October 2004)
Stacks and Their Implementation
Assignments
Related Pages:
Overview:
- Collections.
- Linear structures.
- The Stack ADT.
- Implementing stacks.
Class 31
(Tuesday, 26 October 2004)
Project Discussion
Assignments
Related Pages:
Overview:
- Action methods
- Parameter types
- Core methods
- Simultaneous users
Class 32
(Wednesday, 27 October 2004)
Queues and Their Implementation
Assignments
Related Pages:
Overview:
- Review of homework.
- Queues, revisited.
- Problems with the array-based implementation.
- Implementing queues with nodes.
- Priority queues.
Break runs from 5:00 p.m. on Friday, March 17, 1998 to
8:00 a.m. on Monday, April 3.
Class 33
(Friday, 29 October 2004)
Preparation for Exam 2
Assignments
Related Pages:
Overview:
- Discussion of exam 2.
- Sample code.
Class 34
(Monday, 1 November 2004)
Priority Queues
Assignments
Related Pages:
Overview:
- Priority queue basics.
- Java Detour: Abstract classes.
- Implementing priorty queues.
- Efficiency.
- Looking ahead: Lists.
Class 35
(Tuesday, 2 November 2004)
Project Discussion
Related Pages:
Overview:
- Short presentation by network group.
- CRC card discussion.
Class 36
(Wednesday, 3 November 2004)
Heaps and Heap Sort
Assignments
Related Pages:
Overview:
- Trees.
- Tree Terminology.
- Heaps.
- Implementing Heaps.
Class 37
(Friday, 5 November 2004)
Dictionaries (1)
Related Pages:
Overview:
- Introduction to dictionaries
- Applications of dictionaries
- A Dictionary ADT
- Comparing dictionaries and databases
- Implementing dictionaries with arrays
Class 38
(Monday, 8 November 2004)
Dictionaries (2): Binary Search Trees
Related Pages:
Overview:
- An ADT for binary search.
- Implementing that ADT with arrays.
- Binary search trees.
- BSTs and dictionaries.
Class 39
(Tuesday, 9 November 2004)
Project Discussion
Assignments
Related Pages:
Overview:
- Planning
- Questions
- Verbs
- Setup and Takedown
Class 40
(Wednesday, 10 November 2004)
Dictionaries (3): Hash Tables
Related Pages:
Overview:
- The Idea of Hashing.
- Hash Functions.
- Hashing in Java.
- Handling Hashing Conflicts.
Class 41
(Friday, 12 November 2004)
Discussion of Exam 2
Assignments
Related Pages:
Overview:
- Problem 1: Documenting Binary Search
- Problem 2: Queues, Revisited
- Problems 3 and 4: Making Change
Class 42
(Monday, 15 November 2004)
Vectors
Related Pages:
Overview:
- Vector philosophy
- Vector methods
- Detour: Static methods
- Detour: Improving testing
- Vector applications
Class 43
(Tuesday, 16 November 2004)
Project Discussion
Assignments
Related Pages:
Overview:
- UI Demo
- Questions
- AI People
Class 44
(Wednesday, 17 November 2004)
An Introduction to Sorting
Assignments
Related Pages:
Overview:
- The problem of sorting
- Carefully specifying that problem
- Testing a sorting method
Class 45
(Friday, 19 November 2004)
Quadratic Sorts
Assignments
Related Pages:
Overview:
- Testing sorting, continued
- Selection sort
- Insertion sort
Class 46
(Monday, 22 November 2004)
O(nlogn) Sorts
Related Pages:
Overview:
- Review
- Divide and conquer sorting
- Merge sort
- Iterative merge sort
- Asymptotic analysis
- Quick sort
- Asymptotic analysis
Class 47
(Tuesday, 23 November 2004)
Project Discussion
Related Pages:
Overview:
- Copying code
- Attempt to integrate
- Questions and answers
Class 48
(Wednesday, 24 November 2004)
Project Discussion
Related Pages:
Overview:
- Copying code
- Attempt to integrate
- Questions and answers
Class 49
(Monday, 29 November 2004)
List ADTs
Related Pages:
Overview:
- What else is a list?
- Two ways to iterate lists: Cursors and Positions
- Three kinds of lists: Simple, Ordered, and Sorted
Class 50
(Tuesday, 30 November 2004)
Pause for Breath
Assignments
Related Pages:
Overview:
- Integration.
- List design, revisited.
- Iterating lists.
Class 51
(Wednesday, 1 December 2004)
Weekly Project Discussion
Assignments
Related Pages:
Overview:
- Integrate UI and RealWorld
- Add People
- Add network
Class 52
(Friday, 3 December 2004)
Implementing Lists with Arrays (1)
Related Pages:
Overview:
- SimpleList and SimpleCursor ADTs
- Using arrays to implement simple lists
Attendance is particularly important this week.
Class 53
(Monday, 6 December 2004)
Implementing Lists with Arrays (2)
Related Pages:
Overview:
- Deleting elements from a SimpleList
- Invalidiating Cursors
- Improving Cursors
- Designing an OrderedList ADT
- Sketch of array-based implementation
Class 54
(Tuesday, 7 December 2004)
Linked Lists (1)
Related Pages:
Overview:
- An OrderedList ADT
- Implementing lists with nodes
- Iterating linked lists
- Adding elements
- Deleting elements
Class 55
(Wednesday, 8 December 2004)
An Overview of Computer Science
Related Pages:
Overview:
- What is computer science? Revisited
- Key subfields of computer science
- The Grinnell curriculum
Class 56
(Friday, 10 December 2004)
Evaluation and Wrapup
The history will not include small changes to the summaries of
individual classes or perhaps even on the arrangement of courses.
You can find more information on such changes
in the individual outlines.
Friday, 12 January 2001 [Samuel A. rebelsky]
- First generic version, based on syllabi of years past.
Tuesday, 7 January 2003 [Samuel A> Rebelsky]
- Slight changes to generic format.
;
Check with Bobby