Course Learning Outcomes:

1. Describe and analyze scheduling algorithms. Describe criteria for evaluating scheduling algorithms.
2. Describe process synchronization techniques. Describe the requirements of synchronization and synchronization primitives used modern languages and libraries.
3. Recognize and describe invasive techniques to exploit a system, types and levels of security and security defenses. Exploit a simple security vulnerability. 
4. Define deadlocks and the four criteria that lead to deadlock. Able to draw Resource allocation graphs, and identify prevention, avoidance, and detection.
5. Write shell scripts and system programming. Prepare non-trivial shell scripts and system programs using standard Linux utilities, temporary files and pipes to meet a requirement.
6. Describe the use of Process Control Blocks to contain information about processes. Describe the operating systems concepts of process and thread, explain the various states a process or  thread may be in at any instant of time, and explain the transitions between these states and the reasons why those transitions occur.
7. Describe the organization of secondary storage, file systems, and error recovery.
8. Explain how a program’s logical address space is bound to physical memory addresses, the concept of virtual memory, and various memory allocation and paging techniques.