Fall Term, 2004
Course Materials Index |
Course
Description & Regulations |
Instructor Contact Information |
The approximate dates on which the various topics of the course will be presented, along with an indication of which pages or sections of the textbook are to be read in connection with each topic, are given in the following table. Students should read the indicated sections of the textbook prior to each class or lab session.
Lab assignments are due by midnight on the dates indicated below.
| DATES | TOPIC | READING | |
|---|---|---|---|
| Sept. 10 | Introduction | ||
| 13 | Video: Giant Brains | Chap. 0 | |
| 15 | Video: Inventing the Future | ||
| LAB L1: Researching the History of Computing | |||
| 17 | Bits and Their Storage | §1.1-1.3 | |
| 20 | Binary Representation | §1.4-1.5 | |
| 22 | Two's Complement and Floating-Point Representation | §1.6-1.7 | |
| LAB L2: Gates and Circuits using
Logisim L1 DUE |
tutorial | ||
| 24 | Data Compression; Error Detection and Correction | §1.8-1.9 | |
| 27 | Machine Language and Program Execution | §2.1-2.3 | |
| 29 | Arithmetic and Logic Instructions | §2.4 | |
| LAB L3: Arithmetic Circuits L2 DUE |
Appendix B | ||
| Oct. 1 | Data Communication, Pipelining, and Multiprocessing | §2.5-2.6 | |
| 4 | Operating Systems | Chap. 3 | |
| 6 | Networks and Protocols | §4.1-4.2, 4.4 | |
| LAB L4: Simulating a Machine Architecture with
SimpSim L3 DUE |
Appendix C | ||
| 8 | The World Wide Web | §4.3, 4.5 | |
| 11 | THANKSGIVING DAY HOLIDAY | ||
| 13 | MID-TERM EXAM I | ||
| LAB L5: Assembly Language Programming | |||
| 15 | NO CLASS SESSION: Battle River Career Fair L4 DUE |
||
| 18 | Algorithms | §5.1-5.3 | |
| 20 | Iterative Structures; Sequential Search and Sorting | §5.4 | |
| LAB L6: Creating a Web Page in HTML | |||
| 22 | Recursive Structures; Binary Search | §5.5-5.6 | |
| 25 - 27 | NO CLASS SESSIONS: Attending OOPSLA conference | ||
| 26 | LAB: Continuation of Lab L6 L5 DUE |
||
| 28 - 29 | FALL BREAK | ||
| Nov. 1 | Introduction to Programming | §6.1-6.2 | |
| 3 | Introduction to Programming Using Java | ||
| LAB L7: Programming in Java L6 DUE |
|||
| 5 | Procedures and Functions | §6.3 | |
| 8 | Parsing | §6.4 | |
| 10 | Object-Oriented Programming | §6.5-6.6 | |
| LAB L8: Procedures in Java L7 DUE |
|||
| 12 | Software Engineering | Chap. 7 | |
| 15 | Data Structures | §8.1-8.3 | |
| 17 | Abstract Data Types, Classes and Objects | §8.4-8.5 | |
| LAB L9: Arrays in Java L8 DUE |
|||
| 19 | Pointers | §8.6 | |
| 22 | Theory of Computation: Turing Machines and Universality | §11.1-11.3 | |
| 24 | Programming in BareBones; review of Java | LAB L10: Programming in Bare Bones | |
| 26 | MID-TERM EXAM II | ||
| 29 | Noncomputable Functions and Complexity | §11.4-11.5 | |
| Dec. 1 | Public Key Cryptography | §11.6 | |
| LAB: Help session. L9 DUE |
|||
| 3 | Artificial Intelligence and the Turing Test | §10.1-10.3 | |
| 6 | Neural Networks and Genetic Algorithms | §10.4-10.7 | |
| 8 | Video: The Thinking Machine | ||
| LAB: Help session. L10 DUE |
|||
| 10 | Review | ||
| Thursday, Dec. 16 | FINAL EXAM (9:00 a.m. - 12:00 m., Gymnasium) | ||
Course Materials Index |
Top of this Document |
Instructor Contact Information |