ICS 143B -- FQ 09  

---

---

General Course Information

Office Hours:

• Instructor: Lubomir F. Bic, bic@ics.uci.edu

Office Hours: Mo/We after class, Bren Hall 3224

• Teaching Assistant: Caitie Lustig, c.lustig@gmail.com

Office Hours: We 11-12, CS 406B

• Prerequisites:

CS 143A (old ICS 143), basic knowledge of C or C++

Textbook:

• L. Bic, A. Shaw, Operating Systems Principles, Prentice-Hall, 2003 (ISBN: 0130266116)
• Click to order on line

Course Objective:

The main objective is to apply the principles of operating systems studied in CS 143A in practice. We will design and implement several important components of a simple operating system.

Course Structure:

• There will be a set of projects to complete, each dealing with a different part of the operating system. These will be discussed in class. On the due date, you have to turn in your deliverables (design documentation, commented code, report, depending on project). The functionality of some projects must also be demonstrated by running them with a given set of test data.
• You may work individually or in teams of two students (for some projects). Individuals and teams will carry out the same projects but the assigned workload is increased for teams.

Schedule and Grading:

The grade will be based entirely on the course projects; no exams will be given.
Final grade is determined as follows:

• 85-100%: A+-
• 70-84%:   B+-
• 50-69%:   C+-

(Each + or - corresponds to approximately 1/3 of a grade.)

			Due dates		Percent of final grade
#	Project	Presentation  starts	Preliminary document	Final document + demo/report	Preliminary document	Final document	Demo/ report	Total
1	Process and Resource Management	Fr 9/25	Fr 10/9	Fr 10/16	10%	5%	demo 15%	30%
2	Main Memory Management	Mo 10/19	Fr 10/30	Fr 11/6	10%	5%	report 15%	30%
3	Page Replacement Algorithms	Mo 11/9	Mo 11/23	Fr 12/4	10%	5%	report 25%	40%

Preliminary Document
A written document consisting of:

· A high-level design description: main data structures, functions, system architecture (calling hierarchy, which functions access which data structures);

· Pseudo code for entire project.

· Sample outline of design document

Final Document
A written document consisting of:

· A high-level design description (an extended/final version of preliminary document), test cases/results

· Executable code with extensive comments

Demo
On or before due date, submit your executable code to EEE. Schedule a meeting with TA to demonstrate functionality.

Report
Present and analyze results of simulation experiments. The specific requirements/expectations will be discussed in class. Sample report

Late work
Late work will be accepted, however, a penalty of 5% per day will be imposed (after the weekend).

Plagiarism

You are not allowed to reuse in your projects any portion of a design or code developed by another person or group (during this quarter or any previous quarters). Any violation of this rule will result in a final grade of F for this course.

Grades

Grades are posted periodically via the Electronic Education Environment website: http://e3.uci.edu

---

Project-Specific Information

Process and Resource Management

• Textbook, pages 482-491
• Lecture Notes (PowerPoint)
• Shell Specification
• Sample test case: If your program reads the following input file, it should produce a file that looks something like this: output
• On due date, submit to EEE (how to submit to EEE):
1. Preliminary document
2. Final document:
• high-level description
• commented executable code; this code will be tested (demonstrated to TA)

Main Memory Management

• Textbook, pages 492-495
• Lecture Notes (PowerPoint)
• C/C++: code for Gaussian function
• Java: Use the nextGaussian() method in the Java class Java.util.Random to generate a normally distributed variable x with mean 0 and standard deviation 1. Then return the value d*x+a, where a and d are the mean and standard deviation, respectively.
• Java code to pack/unpack an integer to/from a byte array
• On due date, submit:

• Preliminary document
• Final document:

· high-level description + project report

· commented executable code; this code will not be tested

Page Replacement Algorithms

• Textbook, pages 496-500
• Lecture Notes (PowerPoint)
• On due date, submit:

• Preliminary document
• Final document:

· high-level description + project report

· commented executable code; this code will not be tested

---