[Current] [News] [Glance] [Search] [Instructions] [Links] [Handouts] [Project] [Outlines] [Labs] [Homeworks] [Quizzes] [Exams] [Examples] [EIJ] [API]
This is an abbreviated course syllabus. Like everything else in this course, it is likely to change.
(01) Friday, August 25, 2000 Introduction to the Course |
|||
Week 1: Introduction to Java
Reading: Bailey, Chapter 0 (Introduction); Appendix A (A Sip of Java) | |||
(02) Monday, August 28, 2000 Introduction to Java Due: Intro Survey |
(03) Tuesday, August 29, 2000 Lab: Getting Started with Java |
(04) Wednesday, August 30, 2000 Lab: Objects and Methods |
(05) Friday, September 1, 2000 Lab: Objects and Methods, Continued |
Week 2: Object Basics
Reading: Bailey, Chapter 1 (The Object-Oriented Model) | |||
(06) Monday, September 4, 2000 Lab: Objects and Classes |
(07) Tuesday, September 5, 2000 Lab: Objects and Classes, Revisited Due: HW1: A Fraction Class |
(08) Wednesday, September 6, 2000 Object-Oriented Design |
(09) Friday, September 8, 2000 Reuse Through Inheritance and Polymorphism |
Week 3: Java Fundamentals
Reading: Bailey: Chapter 2 (Comments, Conditions, and Assertions) | |||
(10) Monday, September 11, 2000 Lab: Conditionals |
(11) Tuesday, September 12, 2000 Lab: Loops |
(12) Wednesday, September 13, 2000 Object-Oriented Design, Revisited |
(13) Friday, September 15, 2000 When Things Go Wrong |
Week 4: Building Graphical Programs | |||
(14) Monday, September 18, 2000 Equality Testing |
(15) Tuesday, September 19, 2000 Lab: Java's Abstract Windowing Toolkit |
(16) Wednesday, September 20, 2000 Lab: Java's AWT, Continued |
(17) Friday, September 22, 2000 Project Discussion Due: Exam 1: Java |
Week 5: Algorithms and Recursion
Reading: Bailey, Chapter 4 (Design Fundamentals) | |||
(18) Monday, September 25, 2000 Discussion of Exam 1; Javadoc |
(19) Tuesday, September 26, 2000 More Discussion of Exam 1 |
(20) Wednesday, September 27, 2000 Project Discussion |
(21) Friday, September 29, 2000 Arrays |
Week 6: Algorithms and Recursion
Reading: Bailey, Chapter 3 (Vectors) | |||
(22) Monday, October 2, 2000 GUIs, Revisited |
(23) Tuesday, October 3, 2000 Algorithm Analysis |
(24) Wednesday, October 4, 2000 Algorithm Analysis, Continued |
(25) Friday, October 6, 2000 Project Discussion |
Week 7: Sorting Algorithms
Reading: Bailey, Chapter 5 (Sorting) | |||
(26) Monday, October 9, 2000 Analyzing Recursive Algorithms |
(27) Tuesday, October 10, 2000 More Recursive Algorithms |
(28) Wednesday, October 11, 2000 Some Sorting Algorithms |
(29) Friday, October 13, 2000 More Efficient Sorting Algorithms Due: Exam 2: Algorithms |
Break | |||
Week 8: Lists
Reading: Bailey, Chapter 6 (Lists) | |||
(30) Monday, October 23, 2000 Quicksort |
(31) Tuesday, October 24, 2000 Introduction to Data Structures |
(32) Wednesday, October 25, 2000 Introduction to Lists |
(33) Friday, October 27, 2000 List Methods |
Week 9: Implementing Lists | |||
(34) Monday, October 30, 2000 Discussion of Exam 2 |
(35) Tuesday, October 31, 2000 Exam 2, Continued |
(36) Wednesday, November 1, 2000 Implementing Lists with Arrays |
(37) Friday, November 3, 2000 Detour: Applets |
Week 10: Linear Structures
Readings: Bailey, Chapter 7 (Linear Structures), Chapter 11 (Priority Queus) | |||
(38) Monday, November 6, 2000 Iterating Array-Based Lists |
(39) Tuesday, November 7, 2000 Linked Lists |
(40) Wednesday, November 8, 2000 Recover from Election |
(41) Friday, November 10, 2000 Linked Lists, Concluded |
Week 11: Linear Structures | |||
(42) Monday, November 13, 2000 Introduction to Linear Structures |
(43) Tuesday, November 14, 2000 Implementing Linear Structures |
(44) Wednesday, November 15, 2000 Priority Queues, Heaps, and Heap Sort |
(45) Friday, November 17, 2000 Automated Problem Solving with Linear Structures |
Week 12: Trees
Readings: Bailey, Chapter 10 (Trees), Chapter 12 (Search Trees) | |||
(46) Monday, November 20, 2000 Introduction to Trees |
(47) Tuesday, November 21, 2000 Trees, Continued |
(48) Wednesday, November 22, 2000 Group Lab: Implementing Trees Distributed : Exam 3: Data Structures |
Friday, November 24, 2000
Thanksgiving |
Week 13: Dictionaries
Reading: Bailey, Chapter 13 (Dictionaries) | |||
(49) Monday, November 27, 2000 Dictionaries |
(50) Tuesday, November 28, 2000 Binary Search Trees |
(51) Wednesday, November 29, 2000 Hash Tables Due: Exam 3: Data Structures |
(52) Friday, December 1, 2000 No Class |
Week 14: Graphs
Reading: Bailey, Chapter 14 (Graphs) | |||
(53) Monday, December 4, 2000 Introduction to Graphs |
(54) Tuesday, December 5, 2000 Shortest Path Problem |
(55) Wednesday, December 6, 2000 Graphs, Concluded |
(56) Friday, December 8, 2000 Course Summary and Evaluation Due: Course Evaluation |
Wednesday, 23 August 2000
Thursday, 24 August 2000
Tuesday, 14 November 2000
[Current] [News] [Glance] [Search] [Instructions] [Links] [Handouts] [Project] [Outlines] [Labs] [Homeworks] [Quizzes] [Exams] [Examples] [EIJ] [API]
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.cs.grinnell.edu/~rebelsky/Courses/CS152/2000F/Handouts/glance.html
Source text last modified Tue Nov 21 08:50:07 2000.
This page generated on Tue Nov 28 09:46:59 2000 by Siteweaver. Validate this page's HTML.
Contact our webmaster at rebelsky@grinnell.edu