Unit-wise lecture navigation
Use the search box to filter lecture titles instantly. Click a unit heading to collapse or expand its lectures.
Showing all lectures
- L1 OS basics: definition, goals, functions Explain the basic definition of an operating system and its primary goals and functions.
- L2 OS services: user view vs system view Differentiate between the user perspective and system perspective of operating system services.
- L3 Classification: Batch & Interactive systems Describe batch and interactive operating systems with examples.
- L4 Time‑sharing systems Understand how time‑sharing operating systems provide concurrent interactive use of a computer.
- L5 Real‑time systems: hard vs soft Explain the difference between hard and soft real‑time systems and give examples.
- L6 Multiprocessor & multiuser systems Summarise the characteristics of multiprocessor and multiuser operating systems.
- L7 Multiprocess vs multithreaded systems Contrast multiprocess and multithreaded systems and discuss their use cases.
- L8 OS structure: layers & components Identify the common layers and major components used in operating systems. Understand how design choices (monolithic /…
- L9 Kernel designs: monolithic vs microkernel Explain the differences between monolithic kernels and microkernels and their design trade‑offs.
- L1 Process concept & creation Define a process and differentiate it from a program. Explain what information the OS maintains to manage a process (PI…
- L2 Principle of concurrency & race conditions Explain the principle of concurrency and distinguish it from parallelism. Define a race condition and explain why it oc…
- L3 Mutual exclusion & critical section problem Define mutual exclusion and explain why it is required in concurrent systems. Identify a critical section in a process…
- L4 Dekker’s solution Explain why Dekker’s algorithm is an early correct software-only solution for two processes. Use want[2] (flags) and tu…
- L5 Peterson’s solution Describe Peterson’s algorithm for mutual exclusion and reason about its correctness.
- L6 Semaphores Define a semaphore and explain why its operations must be atomic. Differentiate binary and counting semaphores with cor…
- L7 Test-and-Set, Spinlocks, and Mutex Locks Explain why hardware support is needed for synchronization in modern computer systems. Define atomic operations and des…
- L8 Classical problems: Producer–Consumer Solve the producer–consumer problem using appropriate synchronisation tools.
- L9 Dining philosopher, sleeping barber & IPC models Apply synchronisation techniques to the dining philosophers and sleeping barber problems and outline common IPC mechani…
- L1 Scheduling concepts & performance criteria Describe common scheduling concepts and performance metrics used to evaluate scheduling algorithms.
- L2 Process states & transition diagram Explain the different process states and illustrate them using a state transition diagram.
- L3 Schedulers & PCB Differentiate between long‑, medium‑ and short‑term schedulers and describe the contents of a process control block.
- L4 Process address space & identification Describe a process’s address space layout and the information used to identify processes.
- L5 Threads: concepts & types Explain the concept of threads, their benefits and the difference between user and kernel threads.
- L6 Thread management & models Summarise various models for thread management and mapping user threads to kernel threads.
- L7 Scheduling algorithms Evaluate first‑come first‑serve, shortest job first, priority, round robin and multilevel queue scheduling algorithms.
- L8 Multiprocessor scheduling Discuss the challenges and strategies for scheduling on multiprocessor systems.
- L9 Deadlocks: prevention, avoidance, detection & recovery Describe deadlock conditions and compare deadlock prevention, avoidance, detection and recovery techniques.
- L1 Bare machine & resident monitor Explain the concept of a bare machine and the need for a resident monitor.
- L2 Multiprogramming with fixed partitions Describe fixed partitioning and its limitations.
- L3 Multiprogramming with variable partitions Explain variable partitioning and the issues of external fragmentation.
- L4 Protection schemes Outline memory protection mechanisms such as base/limit registers and access control.
- L5 Paging & address translation Describe the paging mechanism and how virtual addresses are translated to physical addresses.
- L6 Segmentation & paged segmentation Explain segmentation and the reasons to combine paging and segmentation.
- L7 Virtual memory & demand paging Discuss the concept of virtual memory and how demand paging works.
- L8 Page replacement & thrashing Evaluate page replacement algorithms and explain the phenomenon of thrashing.
- L9 Cache organisation & locality of reference Describe cache memory organisation and the principle of locality of reference.
- L1 I/O devices & subsystems Summarise the basic types of I/O devices and the structure of I/O subsystems.
- L2 I/O buffering & caching Explain why buffering and caching are used in I/O management.
- L3 Disk storage basics Describe the geometry of disks and how logical block addresses are mapped to physical locations.
- L4 Disk scheduling algorithms Compare disk scheduling algorithms such as FCFS, SSTF, SCAN and LOOK.
- L5 RAID fundamentals Understand the motivation for RAID and describe common RAID levels.
- L6 File concept, attributes & operations Explain what files are, list common file attributes and operations.
- L7 File organisation & access mechanisms Describe different file organisation techniques and access methods.
- L8 Directories & file sharing Explain directory structures and mechanisms for file sharing.
- L9 File system implementation & protection Discuss file system implementation issues and describe file protection mechanisms.