The description of the contract is:
This (8/4 credit contract) will work through the initial chapters of the textbook "Data Structures, Algorithms, and Applications in Java" by Sartaj Sahni. We intend to cover the first 3-4 data structures chapters (actually ch 1,5,6,7) in detail. This work will allow the students to do substantial Java programming, debugging, and algorithm analysis and will support them in preparing for SOS.
The student will meet weekly with the sponsor for problem solving sessions. Credit will be awarded based on submission of the programming assignments and exercises.
There will be no class lectures: instead we will work on a loose syllabus, focusing on mastering the skills and concepts in the early chapters. We will go for depth rather than breadth.
Week of July 25: class on Mon from 10-11:30
NEW LOCATION! Sem 2D, lecture hall on first floor
OUR FIRST MEETING will be Monday, June 20, at 10:30 in the ACC.
REGULAR MEETINGS on Wednesdays, from 10:30 to 12:30.
| Week | Topic | Reading | Assignment |
|---|---|---|---|
| 1 | Review of Java | Chapter 1 | (P 29) 8, 9, 10, (P 33) 13, 14, (P 46) 18, 19, 20 |
| 2 | Java review | Sections through 1.13 lecture notes and solutions |
|
| 3 | Recursive methods | Section 1.15 lecture notes and solutions generics tutorial |
P 54, Section 1.15 exercises: 23, 24, 26, 27, 29 |
| 4 | Linear list with array rep | Chap 5 (see above lecture notes from last week) | P. 171: Exercises: 3, 4, 5, 6, 7, 14 |
| 5 | Chain rep | Chap 6 chain representation |
P. 205: Ex 2,3,4,5,7,8,11, 15 |