| Syllabus | Links | Schedule | Grades |
This is the schedule for CSCI1321 during Spring 2010. The table below lists what we will be discussing in each class meeting as well as the required readings and the due dates for assignments, quiz dates, and test dates. Some of the readings are for specific classes or packages, in which case you should read the API at the Sun website.
| Date | Topics | Readings | Due Dates |
| 1-12 | Introduction to Class, Eclipse, and OO | Ch. 17-18 | |
| 1-14 | Classes and Scala | Ch. 19 | |
| 1-17 | MLK Day | ||
| 1-19 | Show Your Code and Inheritance and Subtyping | Ch. 20.1-20.2 | IcP #1 |
| 1-21 | Inheritance and Subtyping | Ch. 20.3 | |
| 1-24 | Parametric Types | Ch. 20.4 | Quiz #1 |
| 1-26 | Multithreading | Ch. 21.? | |
| 1-28 | Show Your Code and Concurrency Library | Ch. 21.? | IcP #2 |
| 1-31 | I/O Streams | Ch. 22.? | |
| 2-2 | Streams and Networking | Ch. 22.?-23.? | Quiz #2 (Answers) |
| 2-4 | Snow Day | ||
| 2-7 | Show Your Code and Finish Networking | Ch. 23.? | IcP #3 |
| 2-9 | Array Based Stacks and Queues | Ch. 24.? | |
| 2-11 | Finishing Stack and Queues | Ch. 24.? | |
| 2-14 | Linked Lists | Ch. 25.? | Assignment #1 |
| 2-16 | Linked List Alternatives | Ch. 25.? | Quiz #3 |
| 2-18 | Finishing Linked Lists | Ch. 25.? | |
| 2-21 | Show Your Code and List Based Stacks, Queues, and Priority Queues | Ch. 26.? | IcP #4 |
| 2-23 | Refactoring | Ch. 27.? | |
| 2-25 | Test (Review Sheet) | ||
| 2-28 | Recursion 1 | Ch. 28.? | |
| 3-2 | Show Your Code and Recursion 2 | Ch. 28.? | IcP #5 |
| 3-4 | Trees | Ch. 29.? | |
| 3-7 | Binary Trees | Ch. 29.? | |
| 3-9 | Finish Binary Trees | Ch. 29.? | Assignment #2 |
| 3-11 | SIGCSE (No Class) | ||
| 3-14 | Spring Break | ||
| 3-16 | Spring Break | ||
| 3-18 | Spring Break | ||
| 3-21 | Grammars | Ch. 30.? | |
| 3-23 | Show Your Code and RegEx | Ch. 30.? | IcP #6 |
| 3-25 | RegEx and Parsers | Ch. 30.? | Quiz #4 (Answers) |
| 3-28 | Parser Output | Ch. 30.? | |
| 3-30 | Show Your Code and Start Spatial Trees | Ch. 31.? | IcP #7 |
| 4-1 | Spatial Trees | Ch. 31.? | |
| 4-4 | Finish Spatial Trees | Ch. 31.? | |
| 4-6 | Show Your Code and Binary Heaps | Ch. 32.? | IcP #8 |
| 4-8 | Finish Binary Heaps | Ch. 32.? | Quiz #5 |
| 4-11 | No Class (DDA) | Ch. 33.? | |
| 4-13 | No Class (DDA) | Ch. 33.? | |
| 4-15 | Binary Files | Ch. 33.? | |
| 4-18 | Start Actors | Ch. 34.? | Assignment #3 |
| 4-20 | Show Your Code and Actors | Ch. 34.? | IcP #9 |
| 4-22 | Good Friday | ||
| 4-25 | No class | Ch. 34.? | Quiz #6 |
| 4-27 | AVL Trees | Ch. 35.? | |
| 4-29 | Show Your Code and Conclusions | Ch. 36.? | IcP #10 |
| Final | (Final Review Sheet) | Assignment #4 |