Skip to content
Sabaqاردو

Operating Systems (Neso Academy)

By Neso Academy

Course audio
Course audio: English
Level
Intermediate
Length
76 lessons · 16.9 hours

What you'll be able to do

  • Explain OS services, system calls and OS structures
  • Describe processes, threads and inter-process communication
  • Solve CPU scheduling problems
  • Apply semaphores to synchronization problems and explain paging

About this course

Neso Academy's operating systems course, 76 lectures and about 17 hours, following the standard textbook chapters with clear slides and solved problems. It covers OS basics and I/O structure, OS services, system calls and OS structures, processes and threads, process scheduling, creation and termination, inter-process communication with shared memory, message passing and sockets, threads and threading issues such as fork and exec. CPU scheduling is taught through FCFS, SJF, priority and round robin with solved problems, followed by process synchronization, Peterson's solution, semaphores, classic problems such as dining philosophers, deadlocks, main memory, paging, virtual memory and file system implementation. It suits BS Computer Science students in Pakistan studying OS.

Before you start: Basic programming and computer organization.

Syllabus

76 lessons · 16:52:39 in total

  1. 1Introduction to Operating Systems16:45
  2. 2Basics of OS (Computer System Operation)18:09
  3. 3Basics of OS (Storage Structure)10:03
  4. 4Basics of OS (I/O Structure)12:45
  5. 5Computer System Architecture13:54
  6. 6Operating System Structure12:17
  7. 7Operating System Services13:17
  8. 8User Operating System Interface13:34
  9. 9System Calls12:39
  10. 10Types of System Calls11:23
  11. 11System Programs12:11
  12. 12Operating System Design & Implementation13:16
  13. 13Structures of Operating System19:27
  14. 14Virtual Machines11:23
  15. 15Operating System Generation and System Boot12:11
  16. 16Process Management (Processes and Threads)7:32
  17. 17Process State8:53
  18. 18Process Control Block7:02
  19. 19Process Scheduling11:19
  20. 20Context Switch10:34
  21. 21Operation on Processes – Process Creation12:15
  22. 22Operation on Processes – Process Termination9:16
  23. 23Interprocess Communication12:49
  24. 24Shared Memory Systems14:30
  25. 25Message Passing Systems (Part 1)10:40
  26. 26Message Passing Systems (Part 2)23:00
  27. 27Message Passing Systems (Part 3)14:00
  28. 28Sockets in Operating System11:31
  29. 29Remote Procedure Calls (RPC)14:32
  30. 30Issues in RPC & How They're Resolved18:49
Show all 76 lessons
  1. 31Introduction to Threads14:06
  2. 32Multithreading Models & Hyperthreading17:57
  3. 33fork() and exec() System Calls20:34
  4. 34Threading Issues [fork() & exec() System Calls]10:01
  5. 35Threading Issues (Thread Cancellation)10:33
  6. 36Introduction to CPU Scheduling10:14
  7. 37CPU and I/O Burst Cycles8:16
  8. 38Preemptive and Non-Preemptive Scheduling18:57
  9. 39Scheduling Criteria13:35
  10. 40Scheduling Algorithms - First Come First Served (FCFS)17:00
  11. 41First Come First Served Scheduling (Solved Problem 1)18:50
  12. 42First Come First Served Scheduling (Solved Problem 2)9:58
  13. 43Scheduling Algorithms - Shortest Job First (SJF)28:47
  14. 44Shortest Job First Scheduling (Solved Problem 1)11:59
  15. 45Shortest Job First Scheduling (Solved Problem 2)11:38
  16. 46Scheduling Algorithms - Priority Scheduling17:11
  17. 47Priority Scheduling (Solved Problem 1)15:58
  18. 48Priority Scheduling (Solved Problem 2)13:57
  19. 49Scheduling Algorithms - Round Robin Scheduling15:16
  20. 50Round Robin Scheduling (Turnaround Time & Waiting Time)19:28
  21. 51Round Robin Scheduling - Solved Problem (Part 1)19:54
  22. 52Round Robin Scheduling - Solved Problem (Part 2)6:51
  23. 53Multilevel Queue Scheduling Algorithm14:36
  24. 54Multilevel Feedback-Queue Scheduling Algorithm14:13
  25. 55Scheduling Algorithms – Solved Problems21:59
  26. 56Process Synchronization21:26
  27. 57The Critical-Section Problem13:50
  28. 58Peterson’s Solution21:31
  29. 59Test and Set Lock19:01
  30. 60Semaphores22:51
  31. 61Disadvantages of Semaphores11:05
  32. 62The Bounded Buffer Problem15:48
  33. 63The Readers Writers Problem15:32
  34. 64The Dining Philosophers Problem20:16
  35. 65Monitors13:46
  36. 66Dining Philosophers Solution using Monitors15:04
  37. 67Process Synchronization - Problem 19:57
  38. 68Process Synchronization - Problem 213:28
  39. 69Process Synchronization - Problem 38:18
  40. 70Process Synchronization - Problem 49:19
  41. 71Process Synchronization - Problem 54:03
  42. 72Deadlocks | Chapter-7 | Operating System | nesoacademy.org1:01
  43. 73Main Memory | Chapter-8 | Operating System | nesoacademy.org1:10
  44. 74Virtual Memory | Chapter-9 | Operating System | nesoacademy.org1:19
  45. 75File Systems | Chapter-10 | Operating System | nesoacademy.org0:51
  46. 76Mass Storage Structure | Chapter-12 | Operating System | nesoacademy.org1:19

What to take next

Related courses

Videos by Neso Academy, played from their official YouTube channel. Subscribe on YouTube

Official upload by the teacher or institution on their own channel, shown with YouTube's embedded player.

Lessons listed from the official YouTube playlist. Full playlist on YouTube

Lessons last checked Oct 2026. Course summary and lesson structure by Sabaq.

Report a problem or a rights request