1. Chapters 3 and 5 Possible questions
Tracing a given program involving fork, exec, semaphores, and shared memory
Writing a simple program using fork, exec, semaphores, and shared memory
Critical section (synchronization) problem.
Solving a synchronization problem using semaphores or monitors.

2. Chapter 7: Deadlocks Necessary Conditions for deadlock
Modeling deadlock using Resource allocation graph
Methods for handling deadlock
Deadlock prevention
Methods for preventing deadlocks (preventing hold and wait, preventing no preemption, preventing circular wait) -- Section 7.4
Deadlock avoidance
Methods for avoiding deadlocks (Resouce allocation graph algorithm, Banker’s algorithm) -- Section 7.5
Deadlock detection and resolution
Methods for detecting deadlocks (Single instance resource type, several instance resource type) -- Section 7.6

3. Chapter 8 – Main Memory Physical and logical address space Swapping
Memory allocation for processes
Contiguous allocation – advantages and disadvantages – external and internal fragmentation
Paged allocation
Logical to Physical Address translation under paged allocation
Page table implementation (using page table base register and page table length register)
Associative registers, Translation look aside buffers
Effective access time calculation
Two level paging scheme
Inverted page table architecture
Sharing pages between processes
Segmentation-based allocation
Address translation under segmentation based allocation

4. Chapter 9: Virtual Memory
What is virtual memory?
Demand paging (an implementation of virtual memory)
Page faults, effective access time calculation
Page replacement algorithms
FIFO, Optimal algorithm, LRU, Additional reference bit algorithm, Second chance algorithm – comparison of these algorithms
Counting algorithms
LFU (least frequently used )
MFU (most frequently used)
Allocation of frames
Issues that need to be taken into consideration for
Different allocation schemes
Fixed, priority-based, equal, proportionate
Thrashing
What is thrashing? Causes for thrashing
Working set model to solve the problem of thrashing
How can program structure contribute to thrashing?

5. Chapter 10: Mass-Storage Structure
Disk Structure
Cylinders, tracks, sectors(blocks)
Disk Scheduling
Goal of a good scheduling algorithm
Various scheduling algorithms
FCFS, SSTF, SCAN, C-SCAN, C-LOOK
Performance of these algorithms
Reliability
RAID. Different RAID levels (levels 0 to 5)
Tertiary storage
Removable disks, WORM disks, Tapes,
Hierarchical storage management

6. Chapter 11: File System Interface
File structures
File attributes, operation, types, access methods
Device directory
Different directory structures
Single level
Two level
Tree Structured
Acyclic graph structured
General graph structured
File access protection

7. Chapter 12: File System Implementation
Disk space allocation
Contiguous, linked, indexed, indexed-linked, two-level indexing
Mapping under each allocation
Advantages and disadvantages of these allocation methods with respect to supporting file growth, random access, and sequential access
UNIX allocation scheme
Free Space management
Bit vector, linked list approach, grouping, counting

8. Chapter 14 and 15: Protection and Security
Domain of protection (14.3)
Access Matrix (14.4 )
Implementation of access matrix ( to )
The security problem (15.1)
Program threats: Trojan horse, Trap door, logic bomb, stack and buffer overflow , viruses(15.2)
System and network threats: worms (15.3.1)
Cryptography: Asymmetric (public) key cryptosystem, Symmetric key cryptosystem (class notes and section 15.4)
RSA cryptography – public key cryptosystem
Widely used; not efficient for bulk data encryption. But useful for authentication, digital signature and exchanging a symmetric key securely among communicating parties.
AES (Advanced Encryption Standard) – a symmetric key cryptosystem
Widely used by US government and others.

9. Point distribution Approximate distribution of points for final exam
Chapters 3 and 5: processes, synchronization points
Chapter 7 : Deadlocks points
Chapter 8,9: Main memory, virtual memory : 25 points
Chapter 10,11, 12: File system, storage: 15 points
Chapter Security, protection : 20 points
(You are allowed to bring in a cheat sheet of size 8 ½ X 11 in.)

10. Expected Learning Outcome
Upon successful completion of the course, one would
Have understood the various components of the Operating system
Understood memory management
Understood process management
Understood basic mechanisms for protecting computer resources
Understood file system management
Understood and applied some OS interfaces for application development.