Operating System Concepts By Zahra Golrizkhatami

CPU Scheduling, Memory Management and Deadlocks

What you’ll learn
You will become familiar with the core concepts of Operating Systems
Understand how Operating Systems work
Understand how a process is created
Understand the various scheduling algorithms we have in Operating Systems
Understand memory allocation strategies used by operating systems

Requirements
You will Learn everything you need to know.

Description
This course teaches the students standard operating systems structures. The students are exposed to topics such as concurrency and real-time considerations. The course discusses how common operating systems such as Unix and Windows are designed and implemented. This course spans the following topics: processes, threads, inter-process communication, synchronization (critical regions, semaphores, mutex, deadlocks), scheduling, memory management, i/o systems, and file systems.This course covers the following topics in detail: Operating system definition, simple batch systems, multiprogramming, time-sharing, personal computer systems, parallel systems, introduction to process, process scheduling, operations on processes, cooperating processes, interprocess communications, interrupts, process synchronization, critical-section problem, atomic instructions, semaphores, synchronization problems, CPU scheduling, scheduling criteria and algorithms, multiple processes and real-time scheduling, algorithm evaluation, deadlocks, characterization and handling of deadlocks, deadlock prevention avoidance and detection, deadlock recovery, memory management and virtual memory, address spaces, swapping, memory allocation, paging, segmentation.After completing this course, the studentBe able to explain what an operating system and the role is it different parts of the system play.Be able to explain the structure of operating systems, applications, and the relationship between them.Be able to explain and make use of the services provided by operating systemsExposure to details of major OS conceptsWrite programs (Implement) various parts of operating systems.

Overview
Section 1: Introduction

Lecture 1 Introduction to Operating Systems

Section 2: Fundamental of Computers and Operating Systems

Lecture 2 Computer System Structures

Lecture 3 Operating System Structures

Section 3: Processes and CPU Scheduling

Lecture 4 Processes

Lecture 5 Processes – long and short schedulers, context switch, process creation and term

Lecture 6 Round Robin Algorithm with Examples

Lecture 7 Cooperative Processes

Lecture 8 CPU Scheduling

Lecture 9 First Come First Served (FCFS) and Shortest Job First (SJF)

Lecture 10 Round Robin CPU Scheduling

Lecture 11 Round Robin Examples

Lecture 12 Priority Scheduling

Lecture 13 Priority Scheduling Examples

Section 4: Process Synchronization

Lecture 14 Process Synchronization – Peterson and Bakery Algorithms

Lecture 15 Synchronization Hardware

Lecture 16 Semaphores

Lecture 17 Classical problems of synchronization

Section 5: Memory Managment

Lecture 18 Memory Management Part1

Lecture 19 Swappig

Lecture 20 Memory Management – Paging

Lecture 21 Page Replacement Algorithms

Section 6: Deadlocks

Lecture 22 Deadlocks – Resource Allocation Graph

Lecture 23 Deadlocks Avoidance Algorithms

Lecture 24 Safety Algorithm Example

Lecture 25 Deadlock Detection Algorithm Example

Lecture 26 Deadlock-Quiz-solution

Computer Engineering and Computer Science Students,Anybody who wants to pursue a career in Computer Science,If you are preparing for exams like GATE , PGEE , BITS HD , ISRO ,..etc