Fall Semester 2000                                                                                                     1:30 M W F
                                                                                                                                      2:30 M W F
Instructor:    Arlan DeKock MCS 314
                    341-4496
                    adekock@cs.umr.edu

Scheduled Help:

TAs:

• Lance Stack
• Chad Cole
• Ozer Ozdemir
• Andrew Avenoso

Texts:    Applied Operating System Concepts, Silberschatz / Galvin/ Gagne
             An Introduction to Unix, Wang

Goals: Having successfully completed this class you should be able to:

1. Use Unix commands and filters with good facility
2. Understand in details the major components of Unix
3. Discuss the major attributes of an operating system
4. Discuss the interaction between operating system demands and hardware features

• Exam 1 20%
• Exam 2 20%
• Exam 3 20%
• Project 20%
• Homework 20%

Exams: - Closed book, closed notes, no crib sheet

• A complete question pool will be distributed prior to each exam
• There will be approx. 25 questions on each exam
• Items will be true/false, fill in the blank, short answer or short essay

Programs must
 

1. Contain a program overview. This may be at the beginning of the program. It must contain a complete description of the program with an absolute minimum of technical jargon!!
2. Execute correctly: a program that doesn't execute correctly is not a program - it's a novel!
3. Be thoroughly tested: it isn't correct unless you can prove it
4. A program is considered guilty unless proven innocent. It is assumed that your program will do every bad thing possible unless the 'test input' demonstrates that this is a well behaved program.
5. Be well documented: (some, but not all of the requirements)
1. Program Header Who wrote this
2. Which assignment is it
3. Variables Well named
4. Defined
5. Functions Define PRE / POST conditions
6. Define what it does in ONE declarative statement
7. Define HOW it is done
8. Define the INPUTS
9. Define the OUTPUTS
10. Output Neat / Understandable
11. Comments Stated in APPLICATION terms - not C++

NO GRADE LESS THAN C IS ACCEPTABLE.  ANY EXAM THAT RESULTS IN A D OR F WILL REQUIRE ONE OF TWO ACTIONS:

1. YOU MAY SCHEDULE A RE-EXAM  WITHIN ONE WEEK TO DEMONSTRATE YOUR UNDERSTANDING OF THE MATERIAL OR
2. YOU MAY DROP THE CLASS

ANY PROGRAM THAT RESULTS IN A SCORE OF < 70 MUST BE RESUBMITTED.

Late programs will be penalized as follows:

1^st day -5
2^nd day -10
3^rd day -15
4^th day -20
5^th day - No longer accepted

Submitted programs must include

• the source program
• the complete output
• a copy of the input data file or a SCRIPT of keyboard entries