Operating Systems(OS)

Learn Operating Systems(OS) the exam way—clear concepts, worked examples, and 75 focused lessons in computer science core.

Instructor: DAKALA SREENIVASULU

Last updated Aug 2026 en

22 learners enrolled

all-levels

This course includes

— on-demand video
Access on mobile & desktop
Full lifetime access
Certificate of completion

Course content

8 sections · 75 lectures

Lec-1 Introduction to OS Preview
Lec-2 Serial Processing System
Lec-3 Simple Batch System
Lec-4 Multiprogramming Batch System
Lec-5 Parallel Systems
Lec-6 Distributed System
Lec-7 Parallel system Vs Distributed system
Lec-8 Time sharing system
Lec-9 Personal computing system
Lec-10 Realtime Operating system
Lec-11 Memory Hierarchy
Lec-12 Memory Organization

Lec-13 Memory Management Preview
Lec-14 Contigous Vs Non Contiguous | Memory Management
Lec-15 Fixed partitioning | Contiguous Memory Management
Lec-16 Dynamic Partitioning | Contiguous Memory Management
Lec-17 Fragmentation | Internal & External memory
Lec-18 Memory Swapping

Lec-19 Paging - 1| Memory Organization Preview
Lec-20 Paging - 2| Memory Organization
Lec-21 Virtual Memory
Lec-22 Demand Paging
Lec-23 Demand paging Performance
Lec-24 Page Fault | How to handle
Lec-25 Page replacement | Introduction
Lec-26 FIFO | Page Replacement Algorithms - 1
Lec-27 LRU | Page Replacement Algorithms - 2
Lec-28 Optimal | Page Replacement Algorithms - 3
Lec-29 Segmentation | Introduction
Lec-30 Segmentation Architecture
Lec-31 Segmentation | Hardware & with Paging
Lec-32 Logical Vs Physical address space
Lec-33 Memory Management unit
Lec-34 Thrashing | Introduction

Lec-35 Process in Operating System Preview
Lec-36 Process State in Operating System
Lec-37 Process Control Block
Lec-38 Inter Process Communication | Introduction
Lec-39 Inter Process Communication | Models & Mechanisms
Lec-40 What is a thread | Process Vs Thread
Lec-41 Thread life cycle | States
Lec-42 Single threading & Multithreading
Lec-43 User level thread | Thread types
Lec-44 Kernel level thread | Thread types
Lec-45 Threading model | Many to One & One to One
Lec-46 Threading model | Many to Many

Lec-47 :CPU Scheduling Preview
Lec-48 : Scheduling Criteria
Lec-49: FCFS scheduling Algorithm
Lec-50 : SJF Scheduling Algorithm
Lec-51 : Priority scheduling Algorithm
Lec-52 : Round Robin scheduling Algorithm
Lec-53 : Hardware Synchronisation

Lec-54 : Critical Section Problem | Process synchronization Preview
Lec-55 : Critical Section Problem Solution | Process synchronization
Lec-56 : Semaphore | Counting & Binary
Lec-57 : Semaphore Implementation
Lec-58 : Bounded buffer problem | Semaphore
Lec-59 : Reader & Writer problem | Semaphore
Lec-60 : Dinning Philosopher Problem - 1
Lec-61 : Dinning Philosopher Problem - 2
Lec-62 : Sleeping Barber Problem

Lec-63 : What is DeadLock | Necessary Conditions Preview
Lec-64 : Deadlock Ignorance | Deadlock handling
Lec-65 : Deadlock Prevention | Deadlock handling
Lec-66 : Deadlock Avoidance | Deadlock handling
Lec-67 : Resource Allocation graph example
Lec-68 : Resource allocation Graph with & without Deadlock

Lec-69 : Disk management Preview
Lec-70: Disk Scheduling | Introduction
Lec-71: FCFS | Disk Scheduling Algorithm
Lec-72: SSTF | Disk Scheduling Algorithm
Lec-73: SCAN | Disk Scheduling Algorithm
Lec-74: CSCAN | Disk Scheduling Algorithm
Lec-75: LOOK & CLOOK | Disk Scheduling Algorithm

Explore related topics

Computer Science all-levels

Description

Operating Systems(OS) is an exam-focused computer science core programme designed for B.Tech / MCA learners and anyone revising CS subjects for semester exams (all levels). Lessons are paced for semester revision and competitive practice, with clear explanations you can replay anytime.

You will connect definitions to exam-style problems in Operating Systems(OS), so you can write clearer answers, dry-run code mentally, and revise units in order. Syllabus highlights include Introduction, Memory Management, Paging & Page Replacement, Inter process communication & Threading, Scheduling, and Semaphores. Across 75 lessons, you will move from foundations to problem-solving patterns that show up in university papers and placement tests.

Taught by DAKALA SREENIVASULU, this course keeps theory short and practice heavy—so you can revise faster, spot examiner cues, and build confidence before mocks and finals.