Messiah College COSC 416 Operating Systems and Computer Architecture, Spring 2007


Useful links

Tentative Schedule
  1. Mon., Feb. 5: Chapter 1 slide set [pdf] [ppt]
  2. Wed., Feb. 7: Graffiti board of concepts to identify. Read rest of Chapter 1.
  3. Fri., Feb. 9: Finishing up Chapter 1 and graffiti board overview.
  4. Mon., Feb. 12: Answering questions about Chapters 10, 11 readings. Starting Chapter 2, through p. 69. Full slide set [ppt], or just those slides used [ppt]. Assignment for next class was already made above.
  5. Fri., Feb. 16: Operating System as Resource Manager. Design philosophy of operating systems. Comparison of Linux and WinXP at the functional block diagram level. [Feb. 14 was snow day, no class.]
  6. Mon., Feb. 19: Student presentations of file systems. See q:\StudentFiles for materials.
  7. Wed., Feb. 21: Continuation of Day 6.
  8. Fri., Feb. 23: Processes, overview. [pdf] [ppt]
  9. Mon., Feb. 26: Linux processes, Lab #1, Frey 366. [pdf]
  10. Wed., Feb. 28: Finish Chapter 3;
  11. Fri., Mar. 2: Read Chapter 4 through p. 147.
  12. Mon., Mar. 5: Read Chapter 4 through p. 150 top.
  13. Wed., Mar. 7: Linux Lab is due. Read Java threads handouts. Chapter 4, Threads. [ppt]
  14. Fri., Mar. 9: Exam 1, covering through assigned readings and Linux lab.
  15. Mon., Mar. 12: Chapater 5: Process Scheduling. [ppt] [pdf]
  16. Wed., Mar. 14: Finish Chapter 5. See list server for sections to read.
  17. Fri., March 16: Chapter 6: Synchronization; hardware and software solutions [ppt]
  18. Mon., March 26: Chapter 6: Classic problems of synchronization; Java implementations
  19. Wed., March 28: Chapter 7: Deadlocks [ppt]
  20. Fri., March 30: No class.
  21. Mon., April 2: Exam 2, covering through assigned readings of Chapters 5 & 6.
  22. Wed., April 4: Deadlocks continued.
  23. Fri., April 6: Easter Recess
  24. Mon., April 9: Easter Recess
  25. Wed., April 11: Deadlocks concluded.
  26. Fri., April 13: Paging and Segmentation on Intel hardware in Linux and Windows [ppt]
  27. Mon., April 16: Paging--what is it?--continued.
  28. Wed., April 18: Paging concluded. Synchronization lab [Candy Factory pdf] due.
  29. Fri., April 20: Windows Stress Lab.
  30. Mon., April 23: Paging algorithms. Working set versus page-fault frequency models. [ppt] Also, Exam 2 postmortem is here: [pdf]
  31. Wed., April 25: Paging algorithms, continued.
  32. Fri., April 27: Attend School of MEB Scholarship Day!
  33. Mon., April 30: Paging, continued. Postmortem for Candy Factory problem is here: [pdf]
  34. Wed., May 2: Paging, concluded. Read for Friday pp. 494-500 (i.e. Section 12.4) on disk scheduling algorithms, for a reading quiz. There are two links to simulators on the web if you would like to try one. This one is rather plain vanilla, but is easy to use and understand. The one found on this page under Disk Head Scheduling on the other hand is very complete. Professor Stephen Robbins has done a great job of writing a whole bunch of good simulators.
  35. Fri., May 4: Chapter 13: ports, interrupts, and plug and play. [ppt] Also, course evaluation questionnaire and last short quiz.
  36. Mon., May 7: Overview of Chapters 15 and 14 on security: access control matrix, including the WindowsXP idea of permissions as objects, of subjects ("domains" in your textbook's language) as objects, and objects as objects. Slicing the access control matrix horizontally to get capabilities; slicing it the other way to get access control lists. The idea of public key cryptography like RSA (this is not in the text, and the math not required for exam). The idea of a message digest via a specific hashing function, like MD5 or SHA-1) as a way to make sure that a message has not changed.
  37. Thurs., May 10: Exam 3. The postmortem for the Windows Stress lab is here: [pdf]

Devotional Links