| No. | Date | Lecture Topic | Readings | Lab | Lab Topic | Programmimg Assignments | Due
| | | Week_1 | | | | | |
|
| 1 | 3-Jun | Introduction to Software Development | Ch 1 | | | |
|
| 2 | 4-Jun | Java Classes | 2.1-2.2 | 1 | Pre-Quiz; Introduction | P1: |
|
| 3 | 5-Jun | Packages and Parameters | 2.3-2.4 | | | |
|
| 4 | 6-Jun | Java Arrays | 3.1 | 2 | Statistician | |
|
| | Week_2 | | | | | |
|
| 5 | 10-Jun | Bag and Sequence Classes | 3.2-3.3 | | | | P1
|
| 6 | 11-Jun | J Frames | | 3 | Sequence Classes | |
|
| 7 | 12-Jun | Linked Lists | 4.1-4.2 | | | |
|
| 8 | 13-Jun | Manipulating Linked Lists | 4.3-4.6 | 4 | Linked Lists | |
|
| | Week_3 | | | | | |
|
| 9 | 17-Jun | Java Objects | 5.1-5.2 | | | | P2
|
| 10 | 18-Jun | The JCL and Iterators | 5.3-5.4 | 5 | Iterators | |
|
| 11 | 19-Jun | Test1 | | | | |
|
| 12 | 20-Jun | Stacks | 6.1-6.3 | 6 | Stacks | |
|
| | Week_4 | | | | | |
|
| 13 | 24-Jun | WF day; Stack Applications | 6.4 | | | | P3
|
| 14 | 25-Jun | Queues | 7.1-7.3 | 7 | Queues | |
|
| 15 | 26-Jun | Priority Queues | 7.4 | | | |
|
| 16 | 27-Jun | Recursion | 8.1 | 8 | Recursion | |
|
| | Week_5 | | | | | |
|
| 17 | 1-Jul | Studies of Recursion | 8.2-8.3 | | | | P4
|
| 18 | 2-Jul | Trees | 9.1-9.4 | 9 | Tree traversals | |
|
| 19 | 3-Jul | Binary Search Trees | 9.5 | | | |
|
| | 4-Jul | No Class | | | | |
|
| | Week_6 | | | | | |
|
| 20 | 8-Jul | Heaps | 10.1 | | | | P5
|
| 21 | 9-Jul | B-Trees | 10.2 | 10 | Search Trees | |
|
| 22 | 10-Jul | Time Analysis for Trees | 10.3 | | | |
|
| 23 | 11-Jul | Test 2 | | 11 | Time Analysis for Trees | |
|
| | Week_7 | | | | | |
|
| 24 | 15-Jul | Binary Searching | 11.1 | | | | P6
|
| 25 | 16-Jul | Hashing | 11.2 | 12 | Hashing | |
|
| 26 | 17-Jul | Chained Hashing | 11.3-11.4 | | | |
|
| 27 | 18-Jul | Quadratic Sorting Methods | 12.1 | 13 | Sorting | |
|
| | Week_8 | | | | | |
|
| 28 | 22-Jul | Heapsort | 12.3 | | | | P7
|
| 29 | 23-Jul | | | 14 | Lab Test | |
|
| 30 | 24-Jul | Exam | | | | |
|
|
|