Fundamentals of Computer Science II (CSC-152 99F)


Course Syllabus

This is a highly approximate syllabus. Expect topics, assignments, ordering, and almost everything else to change.

Week One: Introduction

Class 01 Introduction (Thursday, August 26, 1999)

Class 02 Introduction to Java (Friday, August 27, 1999)

Week Two: Objects and Classes

Class 03 Introduction to Java, continued (Monday, August 30, 1999)

Class 04 Laboratory: Getting Started With Java (Wednesday, September 1, 1999)

Class 05 Introduction to Object-Oriented Design (Thursday, September 2, 1999)

Class 06 Classes and Objects (Friday, September 3, 1999)

Week Three: Some Core Concepts

Class 07 More Classes and Objects (Monday, September 6, 1999)

Class 08 Even More Classes and Objects (Wednesday, September 8, 1999)

Class 09 Subclassing, Inheritance, and Polymorphism (Thursday, September 9, 1999)

Class 10 Conditionals (Friday, September 10, 1999)

Week Four: More Core Concepts

Class 11 Loops (Monday, September 13, 1999)

Class 12 When Things Go Wrong (Wednesday, September 15, 1999)

Class 13 Exceptions, Continued (Thursday, September 16, 1999)

Class 14 Project Discussion (Friday, September 17, 1999)

Week Five: Building Graphical Programs

Class 15 Arrays and Sequences (Monday, September 20, 1999)

Class 16 Building Graphical Programs (Wednesday, September 22, 1999)

Class 17 Java's Abstract Windowing Toolkit (Thursday, September 23, 1999)

Class 18 Java's AWT, Continued (Friday, September 24, 1999)

Week Six: Algorithms and Recursion

Class 19 Discussion of Exam 1 and Project (Monday, September 27, 1999)

Class 20 Algorithm Analysis (Wednesday, September 29, 1999)

Class 21 Recursion (Thursday, September 30, 1999)

Class 22 Analyzing Recursive Algorithms (Friday, October 1, 1999)

Week Seven: Algorithms, Classic and Otherwise

Class 23 Project Discussion (Monday, October 4, 1999)

Class 24 Binary Search (Wednesday, October 6, 1999)

Class 25 Sorting Algorithms (Thursday, October 7, 1999)

Class 26 More Efficient Sorting Algorithms (Friday, October 8, 1999)

Week Eight: Lists

Class 27 Sorting Indexed Collections (Monday, October 11, 1999)

Class 28 Project Discussion (Wednesday, October 13, 1999)

Class 29 Data Structures (Thursday, October 14, 1999)

Class 30 The Design of Lists (Friday, October 15, 1999)

Fall Break

Fall break runs from 5 p.m. on Friday, October 15, 1999 to 8 a.m. on Monday, October 25, 1999.

Have fun! Work on your projects if you can :-)

Week Nine: Lists, Continued

Class 31 Discussion of Exam 2 (Monday, October 25, 1999)

Class 32 Implementations of Lists (Wednesday, October 27, 1999)

Class 33 Vectors (Thursday, October 28, 1999)

Class 34 Project Discussion (Friday, October 29, 1999)

Week Ten: Linear Structures

Class 35 Lists, Concluded (Monday, November 1, 1999)

Class 36 Introduction to Linear Structures (Wednesday, November 3, 1999)

Class 37 Heaps and Heap Sort (Thursday, November 4, 1999)

Class 38 Linear Structures for Solving Puzzles (Friday, November 5, 1999)

Week Eleven: Dictionaries

Class 39 Stack Lab (Monday, November 8, 1999)

Class 40 Dictionaries (Wednesday, November 10, 1999)

Class 41 Search Trees (Thursday, November 11, 1999)

Class 42 Hash Tables (Friday, November 12, 1999)

Week Twelve: Trees

Class 43 Introduction to Trees (Monday, November 15, 1999)

Class 44 Project Discussion (Wednesday, November 17, 1999)

Class 45 Cancelled (Thursday, November 18, 1999)

Class 46 Project Testing (Friday, November 19, 1999)

Week Thirteen: Trees, Continued

Class 47 Project Presentations (Monday, November 22, 1999)

Class 48 Trees, Continued (Wednesday, November 24, 1999)

Week Fourteen: Graphs

Class 49 Traversing Trees (Monday, November 29, 1999)

Class 50 Introduction to Graphs (Wednesday, December 1, 1999)

Class 51 Simple Graph Algorithms (Thursday, December 2, 1999)

Class 52 Shortest Path (Friday, December 3, 1999)

Week Fifteen: Wrapup

Class 53 Graphs, Concluded (Monday, December 6, 1999)

Class 54 Comparing Lists (Wednesday, December 8, 1999)

Class 55 A History of Computer Science (Thursday, December 9, 1999)

Class 56 Wrapup: What is Computer Science? Revisited (Friday, December 10, 1999)

Finals Week

The optional final is due this week.

History

Not all changes to the syllabus will be reflected in this history, since much of the syllabus is automatically generated from other files.

Tuesday, 10 August 1999

Wednesday, 25 August 1999

Tuesday, 31 August 1999

Wednesday, 1 September 1999


Disclaimer Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.

This page may be found at http://www.math.grin.edu/~rebelsky/Courses/CS152/99F/Handouts/syllabus.html

Source text last modified Wed Sep 1 09:10:03 1999.

This page generated on Mon Jan 3 11:36:30 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu