Operating System

Explore the seven states a process traverses from creation to completion—new, ready, execution, completion, termination, blocked, and suspended—and how memory and secondary storage shape transitions.

Understand how long-term, short-term, and medium-term schedulers govern process flow, from new to ready to run, including context switching, dispatching decisions, and swapping between main and secondary memory.

Explore cpu scheduling basics, distinguishing long-term and short-term schedulers, the ready-to-run state, context switching, and various scheduling algorithms that decide which process runs next.

Analyze the shortest job first scheduling algorithm, its min-heap data structure and time complexity. Note high throughput and minimum average waiting and turnaround times, plus starvation and unpredictable burst times.

Explore static and dynamic burst time prediction techniques, using process size or process data as barometers, and distinguish system versus user, interactive, foreground, and background processes.

Explore the round robin scheduling example, focusing on time quantum, ready queue dynamics, process completion, and calculating average turnaround and waiting times.

Explore the longest job first scheduling algorithm, opposite of shortest job first, with a multi-process example showing completion, turnaround, and average waiting times.

Explain preemptive priority scheduling, where a running process yields after one time unit to the highest priority ready process. Compare this with shortest remaining time strategies under preemption.

Examine how interrupt disabling enforces mutual exclusion in a critical section, and analyze its effects on progress, bounded waiting, and architectural neutrality within an operating system.

Compare the interested variable and the turn variable for mutual exclusion, showing the interested variable provides both mutual exclusion and progress, with bounded waiting and architecture neutrality.

Identify the four necessary conditions for deadlock—mutual exclusion, hold and wait, no pre-emption, and circular wait—and explain how they cause resource contention.

The lecture distinguishes single and multi-instance resources, shows how the operating system allocates resources to processes, and analyzes the minimum resource units needed to prevent deadlock.

explains deadlock prevention by disabling at least one of the necessary conditions, such as mutual exclusion and no preemption, and notes that this approach is not a very good method.

Explore deadlock detection and recovery in operating systems, covering single-instance and multiple-instance cases, bankers algorithm detection, and recovery methods like preemption, rollback, or killing processes.

Explore fixed partitioning in contiguous memory allocation, learn how memory is divided into fixed spaces, and examine internal and external fragmentation and size limitations.