Meeting 1: Introduction; number systems. Read §2.1–2.2.
Meeting 2: Binary numbers. Read §3.1–3.2.
Meeting 3: Text encoding. Read §3.3.
Meeting 4: Multimedia encoding. Read §3.4–3.6. Assignment 1 due in class.
Meeting 5: Boolean logic. Read §4.1–4.2. Quiz 1.
Meeting 6: von Neumann architecture. Read §5.1–5.3.
Meeting 7: Algorithms and pseudo-code. Read §6.1–6.3.
Meeting 8: Algorithms and design. Read §6.4, 6.6. Quiz 2. Assignment 2 due in class.
Meeting 9: More on algorithms.
Meeting 10: High-level languages.
Meeting 11: Imperative programming in Python. Read §8.3. Quiz 3.
Meeting 12: More on programming. Assignment 3 due in class.
Meeting 13: Programming in other paradigms.
Meeting 14: Review session.
Midterm exam.
Meeting 16: Sorting and searching. Read §9.1, 9.4, 9.5.
Meeting 17: Operating systems. Read §10.1–10.4.
Meeting 18: File systems. Read §11.1–11.3. Assignment 4 due in class.
Meeting 19: Databases. Read §12.1, 12.3. Quiz 4.
Meeting 20: More on databases.
Meeting 21: Artificial intelligence. Read §13.1–13.2.
Meeting 22: Expert systems and decision trees. Read §13.3. Quiz 5. Assignment 5 due in class.
Meeting 23: Networks. Read §15.1–15.3.
Meeting 24: Technologies of the web. Read §16.1–16.4.
Meeting 25: Computer security. Read §12.5–12.6. Quiz 6.
Meeting 26: Computer security. Assignment 6 due in class.
Meeting 27: Wild card!
Meeting 28: Review session. Assignment 7 due in class.
Final exam: 3:40–5:40pm in the usual lab.
©2012 Christopher League · some rights reserved · CC by-sa