READ THIS AND KEEP IT HANDY! IT IS VERY IMPORTANT!
 |
School of Engineering and Applied
Science
Department of Computer Science CSci 133 -- Introduction to Software Development http://www.seas.gwu.edu/~csci133/spring03 Prof. Michael B. Feldman mfeldman@gwu.edu |
Lecture Times: Monday/Wednesday, 2:00-3:15 PM
Lab Times: Friday 11:00 AM - 12:45 PM and 1:00-2:45 PM
Required Textbook:
Michael Main, Data Structures and Other Objects using Java (2nd ed.) Addison-Wesley, 2003, ISBN 0-201-74093-1.Read eachassignment before coming to class that day!The book
discusses much more than I can cover in class, and I will cover things
not in the book. Other readings will be distributed in class and placed
on the course website.
You are responsible for reading all assigned
material before coming to class! BE PREPARED TO BE CALLED ON IN CLASS,
AND FOR QUIZZES!
| Date | Planned Lecture Topic | Read Before Lecture |
| Jan. 13
Jan. 15 |
Intro; Preconditions/Postconditions
Big "O" analysis |
Chap. 1 (p. 1-32) |
| Jan. 20
Jan. 22 |
MLK DAY - NO CLASS
Classes, Packages, Parameters |
Sect. 2.1-2.2 |
| Jan. 27
Jan. 29 |
"equals" methods, Clones
Array Review; the Bag ADT |
Sect. 2.3-2.4
Sect. 3.1-3.2 |
| Feb. 3
Feb. 5 |
the Sequence ADT
Introduction to Linked Lists |
Sect. 3.3-3.4
Sect. 4.1-4.2 |
| Feb. 10
Feb. 12 |
Manipulating Linked Lists
First Exam (Chaps. 1, 2, 3 4.1-4.3) |
Sect. 4.3
OPEN BOOK, covers everything so far |
| Feb. 17
Feb. 19 |
Presidents' Day - NO CLASS
Using Linked Lists |
Sections 4.4-4.6 |
| Feb. 24
Feb. 26 |
Java Objects and a Bag of Objects
Nodes and Iterators |
Section 5.1-5.2
Sections 5.3-5.6 |
| Mar. 3
Mar. 5 |
The Stack Class
Applications that Use Stacks |
Section 6.1-6.3
Section 6.4 |
| Mar. 10
Mar. 12 |
Queues and Priority Queues
Second Exam |
Chapter 7
OPEN BOOK, covers everything so far |
| Mar. 17
Mar. 19 |
SPRING RECESS - NO CLASS | PARTY ON! |
| Mar. 24
Mar. 26 |
Introduction to Recursion
Recursion, continued |
Section 8.1; handout |
| Mar. 31
Apr. 2 |
Trees and Traversals
Binary Search Trees |
Section 9.1-9.4
Section 9.5 |
| Apr. 7
Apr. 9 |
Expression Trees
Heaps and Priority Queues |
Handout
Sect. 10.1, 10.4 |
| Apr. 14
Apr. 16 |
Heapsort
Binary Search and Hashing |
Sect. 12.3
Chap. 11 |
| Apr. 21
Apr. 23 |
Quadratic Sorting
Mergesort |
Section 12.1
Pages 604-615 |
| Apr. 28
Apr. 30 |
Quicksort
REVIEW FOR FINAL EXAM |
Pages 615-623
COME PREPARED WITH QUESTIONS! |
| Mon. May 12 | FINAL EXAM | 1:30-3:30 PM (TENTATIVE!) |