Assignments refer to either Reading Assignment or Homework Assignments.
They will track our teaching schedule listed below.
WEEK: | Homework Assignment | Comments |
---|---|---|
Sep 2 | Read Chapter 1 | Do this leisurely. It is partly review. Pay attention to Section 1.7 (Big-O Analysis) |
Sep 4 | Install JDK 1.8 (which includes Java 8) and Eclipse Standard 4.4 | Create your first project "Hello" as described in the Eclipse page. |
Sep 9 | hw1 due on Sep 10 | Review of Java, Intro to Make |
Sep 16 | hw2 due on Sep 19 | ADT, Java interface, Random numbers |
Sep 23 | hw3 due on Sep 30 | List ADT, String pattern matching |
Oct 7 | hw4 due Oct 14 | Recursion, more Lists |
Oct 15 | hw5 due Oct 22 | Recursion, Stacks |
Oct 21 | Midterm Review | Midterm on Thur Oct 23 |
Nov 3 | hw6 due Nov 10 | Start on key topic: Binary Search Trees |
Nov 13 | hw7 due Nov 21 | Finish our lectures on BST. LargeInts: Karatsuba's algorithm |
Dec 1 | hw8 due Dec 8 | Last homework. Larger hw includes sorting. |
Teaching Schedule + Reading Assignments
- Big HINT
- Always read ahead of the lecture
-- read as much as you can
(doesn't matter how far you get, and you don't have understand everything).
No. | Week of | Chapter:Topic | Reading Assignment, Comments |
---|---|---|---|
1. | Sep 1 | Chap1: Introduction | First Class Tue Sep 2 |
2. | Sep 8 | Chap1: Java Review | Focus: Strings, random numbers, files |
3. | Sep 15 | Chap2: ADT | ArrayList, LinkedLists |
4. | Sep 22 | Chap3: Stacks | Generic interfaces and classes, well-formed expressions |
5. | Sep 29 | Chap4: Recursion | Recursive List Methods, Tower of Hanoi, Sect.6 How recursion works. Skip Sect.4.4 (Blobs) |
6. | Oct 6 | Chap5: Queues | |
7. | Oct 13 | Chap6: Lists | Oct 13-14: NYU Fall Break |
8. | Oct 20 | Chap7: MoreLists | Midterm Oct 23 |
9. | Oct 27 | Chap7: MoreLists | Midterm Grades out; Read the whole chapter, including the Big Integer Application. |
10. | Nov 3 | Chap8: BST | Concept of trees, binary trees, BST, search, add, traversals. Skip Sects.8.3, 8.10. |
11. | Nov 10 | Chap8: BST | Hand simulations, analysis of BST, remove, successor, predecessor |
12. | Nov 17 | Chap9: Priority Queues | Heap data structure. Skip Sect.9.3 on Graphs. |
13. | Nov 24 | Chap10: Sorting | Thanksgiving Break: Nov 27-Nov 30. |
14. | Dec 1 | Chap10: Sorting | Focus on Quicksort, Mergesort, Heapsort. Skip Hashing Sect.10.6. |
15. | Dec 8 | Review | Dec13: last class, Dec11: Mon Sched |
16. | Dec 15 | Reading+FinalExam | Dec14-15: reading days |
17. | Dec 22 | Final Exam | Exam Week: Dec 16-20 |