1

Operating System Fundamentals. Instructor: Prof. Santanu Chattopadhyay, Department of Computer Science and Engineering, IIT Kharagpur.

FREE
This course includes
Hours of videos

1666 years, 6 months

Units & Quizzes

60

Unlimited Lifetime access
Access on mobile app
Certificate of Completion

Operating System is a computer software that manages the hardware components. It acts as an intermediary between the users and the hardware. It is responsible for managing the system resources and providing a smooth working environment for the users. As a subject, it is an amalgamation of the fields like computer architecture, algorithms, data structure and so on. A course on fundamentals of operating systems is essential to equip the students for taking up the challenges in understanding and designing of computer systems. This course will address all the fundamental points, starting from the foundations to the architectural issues to correlation with existing commercial operating systems. (from nptel.ac.in)

Course Currilcum

  • Lecture 01 – Introduction Unlimited
  • Lecture 02 – Introduction: User View, System View, Defining Operating System Unlimited
  • Lecture 03 – Introduction: Computer-System Organization and Operation Unlimited
  • Lecture 04 – Introduction: Storage, I/O Structure Unlimited
  • Lecture 05 – Introduction: Computer-System Architecture Unlimited
  • Lecture 06 – Introduction: Process, Memory and Storage Management, Caching Unlimited
  • Lecture 07 – Operating System Structures Unlimited
  • Lecture 08 – Operating System Structures: Command Interpreters, System Calls Unlimited
  • Lecture 09 – Operating System Structures: System Calls (cont.), System Programs Unlimited
  • Lecture 10 – Operating System Structures: System Programs (cont.), Operating System Structure Unlimited
  • Lecture 11 – Operating System Structures: Microkernel System Structure Unlimited
  • Lecture 12 – Processes Unlimited
  • Lecture 13 – Processes: Process Control Block, Threads, Process Scheduling Unlimited
  • Lecture 14 – Processes: Schedulers, Multitasking in Mobile Systems, Process Creation Unlimited
  • Lecture 15 – Processes: Process Creation (cont.) Unlimited
  • Lecture 16 – Processes: Process Termination, Interprocess Communication Unlimited
  • Lecture 17 – Processes: Synchronization, Direct and Indirect Communication Unlimited
  • Lecture 18 – Processes: Pipes, Sockets, Remote Procedure Calls Unlimited
  • Lecture 19 – Threads Unlimited
  • Lecture 20 – Threads: Single and Multithreaded Processes, Multicore Programming Unlimited
  • Lecture 21 – Threads: Concurrency vs Parallelism, User and Kernel Threads Unlimited
  • Lecture 22 – Threads: Pthreads, Threading Issues Unlimited
  • Lecture 23 – Threads (cont.), CPU Scheduling Unlimited
  • Lecture 24 – Scheduling: CPU Scheduler, Preemptive Scheduling Unlimited
  • Lecture 25 – Scheduling: Scheduling Criteria, Scheduling Algorithm Unlimited
  • Lecture 26 – Scheduling: Determining Length of Next CPU Burst Unlimited
  • Lecture 27 – Scheduling: Round Robin, Priority Scheduling Unlimited
  • Lecture 28 – Scheduling: Multilevel Queue Scheduling Unlimited
  • Lecture 29 – Process Synchronization Unlimited
  • Lecture 30 – Process Synchronization: Critical Section Problem Unlimited
  • Lecture 31 – Process Synchronization: Solution to Critical Section Problem Unlimited
  • Lecture 32 – Process Synchronization: Mutex Locks, Semaphores Unlimited
  • Lecture 33 – Process Synchronization: Deadlock and Starvation, Problems with Semaphores, Monitors Unlimited
  • Lecture 34 – Process Synchronization: Monitor with Next Semaphore Unlimited
  • Lecture 35 – Synchronization Examples Unlimited
  • Lecture 36 – Synchronization Examples (cont.), Deadlock Unlimited
  • Lecture 37 – Deadlock: Resource-Allocation Graph, Methods for Handling Deadlocks Unlimited
  • Lecture 38 – Deadlock: Deadlock Avoidance, Banker’s Algorithm Unlimited
  • Lecture 39 – Deadlock: Banker’s Algorithm (cont.), Safety Algorithm Unlimited
  • Lecture 40 – Deadlock: Detection Algorithm Unlimited
  • Lecture 41 – Memory Management Unlimited
  • Lecture 42 – Memory Management: Logical vs Physical Address Space, Memory-Management Unit Unlimited
  • Lecture 43 – Memory Management: Contiguous Allocation, Multiple-Partition Allocation Unlimited
  • Lecture 44 – Memory Management: Fragmentation, Logical and Physical Memory Unlimited
  • Lecture 45 – Memory Management: Paging Unlimited
  • Lecture 46 – Memory Management: Allocating Frames to a New Process, Associative Memory Unlimited
  • Lecture 47 – Memory Management: Paging Example, Structure of the Page Table Unlimited
  • Lecture 48 – Memory Management: Inverted Page Table Unlimited
  • Lecture 49 – Virtual Memory Unlimited
  • Lecture 50 – Virtual Memory: Page Fault Unlimited
  • Lecture 51 – Virtual Memory: Demand Paging Unlimited
  • Lecture 52 – Virtual Memory: Page Replacement Unlimited
  • Lecture 53 – Virtual Memory: Least Recently Used (LRU) Algorithm Unlimited
  • Lecture 54 – Virtual Memory: Page Buffering Algorithms, Allocation Unlimited
  • Lecture 55 – Virtual Memory: Thrashing Unlimited
  • Lecture 56 – Virtual Memory: Improving Page Faults Rates Unlimited
  • Lecture 57 – File System and Secondary Storage: Mass-Storage Systems, Storage Hierarchy Unlimited
  • Lecture 58 – File System and Secondary Storage: Disk Scheduling Unlimited
  • Lecture 59 – File System and Secondary Storage: File Organization Unlimited
  • Lecture 60 – File System and Secondary Storage: File Access and Protection Unlimited