24308 CSC 3080A - 0 - Operating Systems Spring 2005 Tuesday, Thursday, 2:30 pm - 3:50 pm , Kramer Science Center KSC 102A Herbert J. Bernstein (yaya@dowling.edu) Syllabus

This web page is http://www.bernstein-plus-sons.com/.dowling/CSC3080S05/CSC3080_Syllabus.html
Copyright © 2002, 2003, 2005 Herbert J. Bernstein and other parties. All rights reserved. â

This is the syllabus for CSC 3080A for Spring 2005. As the course moves forward, students should return to this page frequently for updated material.

Catalog description:

This Spring 2005 section is:

Instructor:

• Name: Prof. Herbert J. Bernstein
• Office: KSC 121, Lab: KSC 020
• Phone: +1-631-244-3035
• Email: yaya@dowling.edu

Office Hours:

• by appointment; and
• Monday: 3:30 pm - 6:00 pm in KSC 020 at the Oakdale campus; and
  
• Tuesday 2:00 - 2:30 pm in KSC 020 at the Oakdale campus; and
  
• Wednesday: 2:00-2:30 pm in KSC 020 at the Dowling campus; and
  
• Thursday 2:00 - 2:30 pm in KSC 020 at the Oakdale campus.

Note that, in general, the instructor will be at the Oakdale campus on Monday, Tuesday, Wednesday and Thursday afternoons. If at all possible, please use email to schedule meetings in advance to avoid conflicts with other students and other obligations of the instructor.

For more information see http://www.bernstein-plus-sons.com/.dowling/HJB_Contact_Info.html.

Text:

• Andrew S. Tanenbaum, "Modern Operating Systems, 2/e", Prentice-Hall, Upper Saddle River, NJ, 2001, ISBN: 0130313580.
• Ross Anderson, "Security Engineering: A Guide to Building Dependable Distributed Systems", John Wiley & Sons, Inc., New York, NY, 2001, ISBN: 0471389226.

Recommended Reading:

• Donald Knuth, "The Art of Computer Programming", Vol 1-3, 2nd ed., Boxed set, Addison Wesley, 1998, 0-201-48541-9.
• Byron Gottfried, "Schaum's Outlines: Programming with C", 2nd ed.; McGraw-Hill, 1996, ISBN: 0-07-024035-3.

This three volume set by Knuth is an essential reference for any serious computer scientist. There will be no specific assignments from Knuth, but reading it may well help in understanding the required texts and the lectures.

The Gottfried book is an inexpensive C text and will help with the most important language used for modern operating systems.

Required Supplies:

A hard bound laboratory notebook. An inexpensive back-and-white covered composition book will suffice but it must be bound (not looseleaf).

Keeping clear written records is an important part of working in any scientific field. It is particularly important in Computer Science, where there are very complex, non-obvious decisions to make.

Students are expected to have their text books no later than the second week of class.

Attendance:

Attendance will be taken at all class meetings. All absences must be explained in writing (or via email). Students who miss 2 or more lectures must meet with the instructor to review their progress in the course. As per department policy students who miss more than 2 lectures before the midterm will be given a midterm warning and advised to withdraw. Grades will be reduced for unexcused absences (see grading policy, below).

Grading Policy:

• Classroom attendance and participation: 15%
• Notebook: 15%
• Graded assignments and daily quizzes: 15%
• Midterm: 15%
• Course project: 20%
• Comprehensive Final: 20%

All students will be required to actively particpate in classroom discussions and to work problems at the board in class. Many assignments will be given for drill. All completed assignments must be brought to class on the due date. Students will be required to turn in some of those assigments for grading. Students will be given daily brief quizzes related to, but not necessarily identical to, earlier assignments. Quizzes will often be based on the assigned readings, asking questions that have not yet been discussed in class. There will be no makeups for these quizzes.

Every student will be required to maintain a contemporaneous hardbound notebook recording all significant activities related to this course. The notebook should record the major topics discussed, questions about the subject matter of the course and the answers when they are found, and all activites related to the course project (see below). The instructor will borrow the notebooks several times during the year and grade them for thoroughness, clarity and relevance to the course. Only the portions of the notebook that are dated, written in the student's own hand and on the permanent pages of the notebook will be considered in the grading.

Students will be required to complete a systems-related programming project, which is to be done as a group programming effort. The "default" project is to create a "shell". An open-book midterm and an open-book, open computer/calculator final will be given. In general, no assignments will be accepted late and no makeups will be given for missed quizzes or examinations. Requests for exceptions to this policy will be considered only for the most pressing reasons (illness requiring hospitalization, death in the family, reserve call-up, etc.), must be submitted in writing in a timely manner, and will be granted only if the instructor has sound reason to believe that the student is highly likely to master the material of the course within the current semester.

Course Syllabus

The syllabus and the course objectives that follows are derived in part from the IEEE/ACM "Computing Curricula 2001 Computer Science" - Final Report - (December 15, 2001) by the Joint Task Force on Computing Curricula, IEEE Computer Society, Association for Computing Machinery.

• Administrative matters.
• Introduction to Professional Issues: Ethical issues; fiduciary responsibility; systems mindset; service mentality; proactive approach; Murphy's Law; KISS.
• Introduction to Systems Programming: Software engineering in the context of operating systems; understanding how devices are managed.
• Overview of Operating Systems: Role and purpose of operating systems; history of operating system development; functionality of a typical operating system; design issues (efficiency, robustness, flexibility, portability, security, compatibility); hardware implications; drawing the line between applications and systems programming.
• Introduction to two Modern Operating Systems: Linux; MS Windows.
• Basics: Conceptual frameworks of operating systems design processes, and resources; design of application programming interfaces (APIs); device organization; interrupts; user/system state transitions.

For the introductory material, see the text and see CSC3080_Introduction.html

• Concurrency: The idea of concurrent execution; states and state diagrams; deadlock prevention; dispatching and context switching; interrupt handling in a concurrent environment.
• Distributed systems: Data communications concepts; network issues; the distinction between concurrency and autonomy; trust and management of errors; synchronization.
• Scheduling: Preemptive and nonpreemptive scheduling; scheduling policies; processes and threads; real-time issues.

For concurrency and deadlocks see the text and CSC3080_Concurrency.html and CSC3080_Deadlocks.html

• Memory management: Review of physical memory and memory management hardware; overlays, swapping, and partitions; paging and segmentation; page placement and replacement policies; working sets and thrashing; caching.

  See CSC3080_Memory_Management.html

• Device management: Characteristics of serial and parallel devices; abstracting device differences; buffering strategies; direct memory access; recovery from failures.
• File systems: Fundamental concepts (data, metadata, operations, organization, buffering, sequential vs. nonsequential files); content and structure of directories; file system techniques (partitioning, mounting and unmounting, virtual file systems); memory-mapped files; special-purpose file systems; naming, searching, and access; backup strategies.

  For devices and files, see the text and CSC3080_Devices_Files.html.

• Security and protection: Overview of system security; policy/mechanism separation; security methods and devices; protection, access, and authentication; models of protection; memory protection; encryption; recovery management.

For security, see the text and CSC3080_Security.html.

• More on Linux and Windows.
• More on Professional Issues.
• Review of projects.

Course Objectives

• To understand the purpose of modern operating systems.
• To understand the craft of systems programming.
• To understand how operating systems have evolved over time from primitive batch systems to sophisticated multiuser systems.
• To understand the tradeoffs inherent in operating system design.
• To understand the functions of a contemporary operating system with respect to convenience, efficiency, and the ability to evolve.
• To gain a preliminary understanding of networked, client-server, distributed operating systems and how they differ from single user operating systems.
• To understand potential threats to operating systems and the security features designed to guard against them.
• To understand the mindset and discipline required for systems programming.
• To understand issues such as how open source software and the increased use of the Internet are influencing operating system design.

Projects

Each student will be expected to display a solid grasp of systems programming by working on a suitable project. Students are encouraged to work in groups. Each member of each group will be required to explain to the class some major aspect of the group project, and to respond to questions from the class and from the instructor on the project. Students may propose their own project no later than the 4th week of class. If no project is proposed, the instructor will assign a project involving the design and creation of a useful shell under Linux or Windows.

Some students may not have an adequate preparation in programming to undertake the homework assignments and the course project. In general systems programming is most comfortably done in C or some other language with explicit access to pointers and with manually controlled garbage collection. However, a good knowledge of, say, java, should be enough for most students to adapt to the demands of the course. For those students who have difficulty in breaking free of the strictures and conventions of java, it may help to consult:

http://www.cs.cornell.edu/Courses/cs414/2002SP/tutorials/cforjava.htm

from the Cornell University CS414 Operating Systems course by Emin Gün Sirer. Our thanks to Gueorgui Kitchoukov for pointing out this useful resource.

Assigments

Please consult the course assigments page frequently.

Programming Examples

• bankers_C.html. A mixed C++ and C programming example.

  Demonstration implementation of the "Banker's Algorithm" as described A. S. Tanenbaum, "Modern Operating Systems", 2nd ed., Prentice Hall, Upper Saddle River, NJ, 2001.

  Demonstrates use of malloc for memory allocation.

  Demonstrates crude use of command line.

  The original design of the Banker's Algorithm is due to Dijkstra (1965)

  The purpose of this code is to demonstrate a common "systems" programming style using a mixture of C and C++. The code is intentionally non-modular, something simply "dashed off" while transcribing an idea from a book directly into code. Final code would be extensively reworked and modularized.

• reverse_c.html. A pure C programming example.

  Reverses a file byte by byte. Demonstrates use of getopt to process the command line, use of a temporary file, file manipulations.

Review of Java

Secure Remote Access with GUI

Using VNC via SSH: vnc.html

Dowling Computer Club

If you're interested in joining with your fellow students in developing and maintaining a web site, or pursuing your exploration of computer hardware or software, you might want to consider joining the Dowling Computer Club. Just follow the link for further details:

Dowling College Computer Club Web Site