Computer Science 103, Fall 2001

Introduction to Computing


 Announcements


Homework

  1. Homework 1, due Friday 9/14 in class. Solutions              
  2. Homework 2, due Friday 9/21 in class. Solutions
  3. Homework 3, due Friday 9/28 in class. Solutions
  4. Homework 4, due Friday 10/5 in class. Solutions
  5. Homework 5, due Wednesday 10/17 in class. Solutions
  6. Homework 6, due Friday 10/26 in class. Solutions
  7. Homework 7, due Friday 11/2 in class. Solutions
  8. Homework 8, due Friday 11/9 in class. Solutions
  9. Homework 9, due Tuesday 11/20 in lab.
  10. Homework 10, due Wednesday 12/5 in class.

Labs

  1. 9/11    Lab 1
  2. 9/18    Lab 2
  3. 9/25    Lab 3
  4. 10/2    Lab 4
  5. 10/9    Midterm 1 in lab
  6. 10/23   Lab 6
  7. 10/30   Lab 7
  8. 11/6     Lab 8
  9. 11/13   Midterm 2 in lab
  10. 11/20   Multimedia projects


 Lectures and Readings

  1. Mon 9/10 - Course introduction (Ch 1)
  2. Wed 9/12 - HTML, Emmys, algorithms (Ch 1)
  3. Fri 9/14 - HTML: tables, Algorithms, abstraction (Ch 1)
  4. Mon 9/17 - Abstraction, history of computing (online reading)
  5. Wed 9/19 - History of computers, binary numbers (online reading, Ch 5.3, Ch 4.1-4.2)
  6. Fri 9/21 - Modems, networks (Ch 12)
  7. Mon 9/24 - Networks, algorithms, info flow, growth chart, traffic on Superbowl Sunday (Ch 12, 2)
  8. Wed 9/26 - Algorithms, searching (Ch 2)
  9. Fri 9/28 - Searching, sorting, sorting animation: xSortLab, Smith (Ch 3)
  10. Mon 10/1  - Merge sort, quick sort, efficiency (Ch 3)
  11. Wed 10/3  - Algorithm efficiency, sorting efficiency (Ch 3)
  12. Fri 10/5  - Efficiency classes, Towers of Hanoi, Hanoi applet (Ch 3)
  13. Mon 10/8  - Course review for exam 1
  14. Wed 10/10 - Computer Organization, von Neumann machine (Ch 5)
  15. Fri 10/12 - Midterms returned; more computer organization, instruction cycle, registers (Ch 5)
  16. Mon 10/15 - Signed binary numbers, two's complement (Ch 4.3)
  17. Wed 10/17 - Boolean gates and circuits (Ch 4.3-4)
  18. Mon 10/22 - Boolean circuits, adder circuit (Ch 4.3-4)
  19. Wed 10/24 - Adder circuit, NIM game, chip design
  20. Fri 10/26 - Intro to Java programming Example1.java (Ch 7)
  21. Mon 10/29 - More Java fundamentals: if-then-else, while CircleWorld.java (Ch 7)
  22. Wed 10/31 - Java examples: Savings.java, LeapYear.java, HiLo.java (Ch 7)
  23. Fri 11/2 - Java functions, Stars1.java, Stars2.java, Stars3.java, Functions.java (Ch 7.7)
  24. Mon 11/5 - Java graphics API, Face1.java, Face2.java, Face3.java, Face4.java, Cat.java (Ch 7.9)
  25. Wed 11/7 - Java graphics, arrays, Clicklines.java, Avg1.java, Avg2.java, Avg3.java (Ch 7)
  26. Fri 11/9 - Java arrays and functions MaxArray.java, SortArray.java
  27. Mon 11/12 - Course review for exam 2
  28. Wed 11/14 - Operating Systems (Ch 6)
  29. Fri 11/16 - Process scheduling (Ch 6.4)
  30. Mon 11/19 - Final project info, Computers and Privacy
  31. Mon 11/26 - Programming languages, examples (Ch 8)
  32. Wed 11/28 - Prolog, examples, Robotics (demo in lab)
  33. Fri 11/30 - Robotics: motion planning, navigation, images in popular films
  34. Mon 12/3 - Quiz, Robotics: current technologies
  35. Wed 12/5 - Student PowerPoint presentations
  36. Fri 12/7 - Student PowerPoint presentations, course summary