Fall 2001, MCS4663 Sec 02
Operating Systems
Department of Math. and Computer Science, Lawrence Tech University
Day/Time: TuTh 7:10pm-8:25pm
Credit Hours: 3
Prerequisite: MCS3663 (Computer
Architecture and Assembly Programming) and Data Structures (at least CS2)
Class Room: E207
Lab: M215
Instructor: ChanJin Chung, Ph.D.
- Office Room: S112
- Phone: (248) 204-3504
- Fax: (248) 204-3518 (this fax number is for
the whole building and senders
should be sure to place instructor's name on the fax)
- Dept. Secretary: (248) 204-3560
- Math/CS Drop Box: in front of S120 door.
Please put instructor's name and time of submission on your work.
- Email:
CHUNG@ltu.edu
- LTU
webpage at http://www3.ltu.edu/~chung (syllabus, announcements, lecture notes, etc.)
- LTU BlackBoard
- Office Hours
Required Text :
Applied Operating System Concepts by (Abraham Silberschatz, Bell Laboratories
Peter Baer Galvin, Corporate Technologies
Greg Gagne, Westminster College), ISBN:
0-471-36508-4; 2000
Recommended Texts
- Operating Systems Concepts Fifth Edition by Abraham Silberschatz,
Peter Baer Galvin, Addison-Wesley, ISBN: 0-201-59113-8
- Any Java Programming Books with Threads and Networking chapters
- Any Linux/UNIX Programming books such as: UNIX System Programming by K. Haviland and
Ben Salama (Addison-Wesley), Beginning Linux Programming by N. Matthew and R. Stones
(WROX Press)
- Any Linux Books such as: Red Hat Linux by Pitts and
Ball (SAMS pub.)
Internet Resources
Class Topics & Tentative Schedule (Total 30 lectures)
| Week |
Topic |
| 1 |
Overview: Introduction, Computer-System Structures, OS
Structures
Introduction to Java |
| 2-3 |
Java Primer
Processes;
Threads
|
| 4-5 |
CPU Scheduling
Java
Primer
|
| 6-7 |
Process
Synchronization
Java
Pimer
|
| 8 |
Deadlocks |
| 9 |
Memory
Management |
| 10 |
Virtual Memory |
| 11 |
File
Systems |
| 12 |
I/O Systems
Java
I/O |
| 13-14 |
Network/Distributed
System Structures
Java
Networking, RMI, CORBA |
| 15 |
Protection and Security
Case Studies: Red Hat Linux and
TinyVM for Lego RCX if time permits |
Class Format: Total 200 points
- Homework exercises from the textbook and Homework programming assignments (or project) - 80 points
- 1 Quiz (30 ~ 40 minutes in length at the end of class) - 30 points
- 1 Midterm - 40 points
- 1 Final (everything covered in class) - 50 points
Important Dates and Grading
- Tue. 10-2-00: Quiz #1
- Thu. 11-6-00: Midterm
-
Tue. 11-20-00: Last day to withdraw
- Tue. 12-18-00, Final, 19:30-21:20 (Updated on Sep. 18)
This score will be translated into a letter grade based
upon the percentages given below.
| A |
90-100% |
C |
70-74% |
| A- |
89% |
C- |
69% |
| B+ |
85-88% |
D+ |
65-68% |
| B |
80-84% |
D |
60-64% |
| B- |
79% |
D- |
59% |
| C+ |
75-78% |
F |
00-58% |
Class Policies
- Attendance is essential to doing well in the course. The exams
will focus primarily (but not exclusively) on material presented in the
lectures and labs.
- If you are unable to attend a meeting, it is your
responsibility to obtain the material from other students or instructor.
Exam. Policies
- There will be no makeup exams will be given.
- Closed books, closed notes, and closed neighbors
Homework Policies
- Homework assignments must be done individually.
- Please read the instruction carefully.
- Homework programming assignments must be done individually, too. Do not start from someone else's file. The following cases, as examples,
will be regarded as copies:
- Just changing variable names of someone else's
source code
- Just changing the order of statements
- Just changing the output design
- Must be submitted at the beginning of the class on the due date.
- Late submission penalty is 30%.
- No submission will be accepted beyond a week after the due date.
Policy on Academic Misconduct
- Plagiarism is a serious academic offense. DO NOT COPY THE WORK OF
OTHERS. Failure to observe this will result in zero point for the
assignment.
- Cheating during exams is also a very serious academic
offense and will be handled in accordance with University Policy.
9/4/01