Princeton University |
Computer Science 111 |
|
Click on the lab name in the schedule below to reach the lab assignment for the week. Students must complete each lab in the week it is assigned unless there are extraordinary circumstances and/or prior arrangements.
Click here to see which lab section you are in.
Click on the problem set number in the schedule below to reach the problem set due that week. Problem sets are due by 5 PM sharp on Tuesdays. No credit will be given for late assignments, unless there are extraordinary circumstances and/or prior arrangements. Problem sets should be submitted by putting them in the collection box near the mailboxes in the lobby of the second floor of the Computer Science building. If you wish to submit a problem set early, you may bring it to lecture.
| lab | prob. set due | date | Topics | Readings in Brookshear |
|---|---|---|---|---|
| - | - | Fri 9/15 | Digital information | Preface |
| - | - | Mon 9/18 | Hardware and software | Chapter 0 |
| 9/20 | Introduction to algorithms | - | ||
| Part I: Representing Information | ||||
| 9/22 | Representations in Bits | Sections 1.4, 1.5 | ||
| 1 | 1 | Mon 9/25 | Binary arithmetic | Section 1.6 |
| 9/27 | Boolean logic and applications | Section 1.1 | ||
| 9/29 | Error correction | Section 1.9 | ||
| 2 | 2 | Mon 10/2 | Compression | Section 1.8 |
| Part II: How Computers Work | ||||
| 10/4 | Machine organization | |||
| 10/6 | Machine instructions | Sections 2.2, 2.4, pp. 226-229, Appendix C | ||
| 3 | 3 | Mon 10/9 | Program execution | Section 2.3 |
| 10/11 | Input/output and peripherals | Sections 1.3, 2.5 | ||
| 10/13 | Operating systems | Sections 3.1, 3.2 | ||
| 4 | 4 | Mon 10/16 | Guest lecture: The politics of search engines | - |
| 10/18 | TBA | - | ||
| 10/20 | Graphical user interfaces | - | ||
| - | - | Mon 10/23 | Security | Section 3.7 |
| 10/25 | Guest lecture: Computer graphics | - | ||
| 10/27 | First in-class exam | |||
| Fall Break | ||||
| 5 | - | Mon 11/6 | Networks | |
| 11/8 | ||||
| 11/10 | ||||
| 6 | - | Part III: Problem Solving with Algorithms | ||
| Mon 11/13 | Searching | Section 4.4 | ||
| 11/15 | Sorting | |||
| 11/17 | Efficiency and correctness | Sections 4.6, 11.5 to pg. 518 | ||
| - | 5 | Mon 11/20 | Recursion | Section 4.5 |
| 11/22 | (no class) | - | ||
| Thanksgiving break | ||||
| 7 | 6 | Mon 11/27 | Hardware show and tell | - |
| 11/29 | Programming languages | Sections 5.1, 5.2, 5.3 | ||
| 12/1 | ||||
| - | - | Mon 12/4 | Second in-class exam | |
| Part IV: The Theory and Practice of Hard Problems | ||||
| 12/6 | Computable (and noncomputable) functions | Sections 11.1, 11.2, 11.3, 11.4 | ||
| 12/8 | Intractable problems | Sections 11.5, 11.6, 10.1 | ||
| 8 | - | Mon 12/11 | Cryptography | - | 12/13 | Artificial intelligence | Sections 10.1, 10.2, 10.3, 10.6 |
| 12/15 | Final remarks | - | ||
| - | 7 | Friday Jan. 12 at 5 p.m -- final problem set due. | ||
| Final Exam: Thursday, January 25, 8:30-11:30am, E-quad C305. | ||||