Course Syllabus

This is an approximate syllabus and it is likely to change.

Week One: Introduction

Class 1: Introduction (Monday, January 19, 1998)

• Course overview
• Introduction to data structures
• Introduction to object-oriented programming
• Reading: Bailey, Sections 1.1-1.3
• Scan: Bailey, Chapter 1
• Assignment: Introductory survey.

Class 2: Introduction to Java (Tuesday, January 20, 1998)

Class 3: More Java Basics (Wednesday, January 21, 1998)

• About procedural programming
• Classes
• Constructors

Class 4: Describing Classes (Friday, January 23, 1998)

Week Two: More Java

Class 5: More on Objects and Classes (Monday, January 26, 1998)

• Objects and Variables
• Constructors

Class 6: Lab: Building Classes (Tuesday, January 27, 1998)

• Standard Methods

Class 7: Control and Inheritance (Wednesday, January 28, 1998)

• Loop structures: for, while, and do.
• Inheritance
• Interfaces

Class 8: Interfaces and More (Friday, January 30, 1998)

Week Three: Even More Java

Class 9: Building Graphical Programs (Monday, February 2, 1998)

• Graphical User Interfaces
• The AWT
• The switch statement.
• Random number generation.

Class 10: Error Handling (Tuesday, February 3, 1998)

• Exceptions

Class 11: Documenting Your Java Programs (Wednesday, February 4, 1998)

• Reading: Bailey, Chapter 2
• Documentation
• Pre- and post-conditions

Class 12: Javadoc and Java Wrapup (Friday, February 6, 1998)

Week Four: Introduction to Structures

Class 13: The Vector (Monday, February 9, 1998)

• Reading: Bailey, Chapter 3

Class 14: Vectors, Continued (Tuesday, February 10, 1998)

Class 15: Vectors and Dictionaries (Wednesday, February 11, 1998)

• Reading: Bailey, Section 13.1

Class 16: Experimenting with Vectors and Dictionaries (Friday, February 13, 1998)

Week Five: Algorithm Analysis

Class 17: Comparable Objects (Monday, February 16, 1998)

• Reading: Bailey, Section 9.1

Class 18: Introduction to Algorithm Analysis (Tuesday, February 17, 1998)

• Reading: Bailey, Chapter 4

Class 19: Algorithm Analysis, Continued (Wednesday, February 18, 1998)

Class 20: Recursion (Friday, February 20, 1998)

Weeks Six and Seven: Recursion and Sorting

Class 21: Design (Monday, February 23, 1998)

Class 22: Recursion, Revisited (Tuesday, February 24, 1998)

Wednesday, February 25, 1998: Exam

Friday, February 27, 1998: No class, SamR at SIGCSE

Class 23: Recursion Repeated (Monday, March 2, 1998)

Class 24: Introduction to Sorting (Tuesday, March 3, 1998)

• Dynamic Programming
• Reading: Bailey, Sections 5.1-5.5

Class 25: More Sorting Techniques (Wednesday, March 4, 1998)

• Insertion sort
• Merge sort
• Quick sort

Class 26: Sorting Without Swapping (Friday, March 6, 1998)

• Alternative sorting techniques
• Sorting, wrapup
• Reading: Bailey, Sections 5.6-5.8
• More on Quicksort

Week Eight: Lists

Class 27: Introduction to Lists (Monday, March 9, 1998)

• Singly-linked Lists
• Reading: Bailey, Section 6.1-6.2
• Reading: Bailey, Section 6.3

Class 28: Sorting Lists (Tuesday, March 10, 1998)

Class 29: Sorting Lists, Revisited (Wednesday, March 11, 1998)

Class 30: Balloon Races (Friday, March 13, 1998)

Spring break, March 14-29

Week Nine: Miscellaneous

Class 31: Lists Concluded; Doubly-Linked Lists (Monday, March 30, 1998)

• Reading: Bailey, Section 6.4

Class 32: Doubly-Linked Lists, Continued (Tuesday, March 31, 1998)

Class 33: Fun with Applets and Graphics (Wednesday, April 1, 1998)

Class 34: Introduction to Machine Representation (Friday, April 3, 1998)

• Fundamental types
• Nonnegative Integers

Week Ten: Linear Structures

Class 35: More Binary Representation (Monday, April 6, 1998)

• Characters
• Real numbers
• The IEEE Standard
• Reading:
• IEEE standard representation of reals

Class 36: Other Machine-Level Issues (Tuesday, April 7, 1998)

Class 37: Stacks and Queues (Wednesday, April 8, 1998)

• Reading: Bailey, Sections 7.1-7.2

Class 38: Iterators and Puzzles (Friday, April 10, 1998)

• Reading: Bailey, Chapter 8

Week Eleven: Trees

Class 39: Introduction to Trees (Monday, April 13, 1998)

• Reading: Bailey, Sections 10.1-10.3

Class 40: Implementing Trees with Nodes (Tuesday, April 14, 1998)

• Reading: Bailey, Section 10.4

Class 41: Iterating Trees (Wednesday, April 15, 1998)

• Reading: Bailey, Section 10.5

Class 42: History of Computing I (Friday, April 17, 1998)

Week Twelve: Miscellaneous Topics

Class 43: History of Computing II (Monday, April 20, 1998)

Class 44: Electronic Imaging (Tuesday, April 21, 1998)

Class 45: Priority Queues and Heaps (Wednesday, April 22, 1998)

• Reading: Bailey, Chapter 11

Class 46: Dictionaries and Hash Tables (Friday, April 24, 1998)

• Reading: Bailey, Chapter 14

Week Thirteen: Dictionaries and Graphs

Class 47: Dictionaries and Hash Tables, Continued (Monday, April 27, 1998)

Tuesday, April 28, 1998: Exam

Class 48: Introduction to Graphs (Wednesday, April 29, 1998)

• Reading: Bailey, Chapter 14

Class 49: Reachability and Shortest Path Algorithms (Friday, May 1, 1998)

Week Fourteen: Wrapup

Class 50: Dijkstra's Shortest Path Algorithm (Monday, May 4, 1998)

Class 51: Graphs, Concluded (Tuesday, May 5, 1998)

Class 52: Reachability, Revisited (Wednesday, May 6, 1998)

Class 53: An Overview of CS (Friday, May 8, 1998)

Thursday, May 14, 1998: Final Examination