CS 330, Exam 1

advertisement
CS 450, midterm
Fall 2009
Preliminary Review sheet
Style and format of exam: (100 pts total):
1) Matching: You will be given a list of terms to match to their associated
definition. (definitely 100%)
2) Multiple Choice: (maybe 50%)
3) SHORT ANSWER & Short Essay: written definitions of important concepts,
what if, why, discussion type questions. (DEFINITELY 100%)
Chapters from your text_book:
1. Chapter 1: entire chapter: all sections. What is an operating system. What are
the primary responsibilities of an OS.: supporting convenient use and controlling
sharing of resources, User interface, process management, job and session
management, device management, time management, memory management, file
management, error handling, reliability and security, monitoring and accounting,
system management.
Review Questions to consider:
1 – 5, Assignment #3
2. Chapter 2: History of Operating systems: all sections. You should understand
the major types of operating systems, how operating systems evolved, why they
evolved, features of the different CATAGORIES of operating systems. How did
punched cards, magnetic tapes, JCL, magnetic disks, and professional operators
revolutionize computing, and how did they help lead to the evolution of operating
systems. Know the importance of the “resident loader” (resident monitor).
Understand the concepts of multiprogramming, spooling, and multitasking. What
is meant by BATCH computing? What is a batch operating system. Important
operating systems to know: OS/360, Input/Output system by GM, Master Control
program (burroughs), Multics, UNIX, CP/M, MS/DOS, MVS, VMS
Questions to consider:
1-10, Assignment questions: 3,
3. Chapter 4: process management: entire chapter!!! - very important chapter-You must understand what is a process, and what are the different types of processes
and what are their characteristics. It is important to understand what it means to
execute processes in an interleaved fashion. What is the role of the PCB? What is
the context of a process? Understand what a process state is. What are the different
process states? What causes a transition from one state to another.. focus on diagram
4-4. Be able to draw a state chart and explain it!!! Be able to discuss the various
operations that can be performed on processes, and what they involve (especially
creation and termination).
Questions to consider:
1, 3, 4, 5, 7, 8, 10
Assignment #2, #6 (think about it)
4. Chapter 5: Process scheduling: !!!! entire chapter, very important!!!!! --- Know
the 3 types of scheduling that can be performed and what each type of scheduling
accomplishes. (long-term, short-term, medium-term), know the types of scheduling
which must occur in the 3 major types of operating systems (real-time, batch, and
interactive). Know the scheduling objectives that are often used in the evaluation of
scheduling algorithms. Why is calculating the average waiting time important in
assessing an algorithm. Understand the concept of aging!!! Understand what it
means for a process to be CPU bound .vs. I/O bound. BE ABLE TO EXPLAIN,
EACH OF THE FOLLOWING SCHEDULING ALGORITHMS. Also be able
to estimate the average waiting time for a set of processes.. FIFO, shortest job
next, shortest time remaining next, classic round robin (fifo), priority round
robin, feed back queues, selfish scheduling, fair-share scheduling,
Review Questions to consider:
1-9
Instructors notes & slides:
Power point slides on Interrupts.
Project manual:
Some terms will be taken from chapters I-2, R1 and R2 SOME TEST QUESTIONS
WILL COME FROM THESE CHAPTERS.
Instructors lecture notes from web page:
1. Overview of operating systems: corresponds fairly closely to your text book’s
chapter 1.
2. Chapter 2: History of Operating systems: Additional information and terms have
been added from other sources, with a slightly different organization. Understand the
different stages of operating system development and the impetus for those changes.
What was programming like before operating systems.
3. Chapter 4: Notes on Process Management: Additional information and terms have
been added from other sources, with a slightly different organization . Understand
that a program is a passive entity, and a process is an active entity. Know the various
process states, and what causes a process to transition from one state to another.
WHAT MUST HAPPEN TO PERFORM A CONTEXT SWITCH!!!!!!!!! Understand
the operations on processes, the concepts of a process HIERARCHY and the
associated relationships between processes. Understand how unix handles child
processes
4. chapter 5: Notes on Process scheduling: Additional information and terms have
been added from other sources . This source adds additional information on I/o vs
cpu bound processes, as well as additional objectives of scheduling algorithms
5. chapter 5: Notes on scheduling algorithms: Additional information and terms have
been added from other sources This contains additional details about the various
scheduling algorithms, and gives examples of calculating the average waiting time of
processes.
Keywords:
Operating System
Physical Resource
User interface
Process management
Process scheduling
Punched cards
Batch processing systems
Spooling
Multi-tasking (timesharing)
Graphical user interface
Sequential process
Thread
Context
Batch processes
Preemption
Job
Static process management
Long-term scheduling
Active set
Static priority algorithm
Processor time quantum
Priorities
Application Program
Systems Program
logical resource
kernel
program interface (API)
Process
interleaved execution
multiprogramming
device management
interrupts
resident monitor/loader
JCL
batch serial operation
batch multiprogramming
interactive computing
time quantum/time slicing
device driver
command line interface
command language
command handler (shell)
concurrent sequential processes
process control block (PCB)
processor state
context switching
interactive processes
real-time processes
fork
ready queue
SCHEDULING
scheduler
Dynamic process management
medium term scheduling short term scheduling
swapping
dispatcher
dynamic priority algorithm starvation
storage time quantum
AGING
overhead
Download