Temporary Operating Systems

June 23, 2019

We have seen websites like GeeksforGeeks giving a lot advanced and detailed information from IEEE journals and PhD thesis for operating System.

Students tend to study out of course topics which will never be asked in placements and thus waste a lot of time.

On PrepInsta we have only covered the exact syllabus that for OS which is relevant for interviews so you don’t waste your time reading PhD level Operating System.

  1. Introduction
    1. What is Operating System
    2. Types of Operating System
      1. Batch operating system
      2. Distributed operating system
      3. Time Sharing System
      4. Multiprocessor Operating System
      5. Desktop System
      6. Clustered System
      7. Realtime Operating System (RTOS)
  2. CPU Scheduling :
    1. Process (Intro)
    2. Process Life Cycle
    3. Process Control Block PCB
    4. Process Scheduling
    5. Context Switching
    6. CPU Scheduling
    7. FCFS Scheduling
    8. Shortest Job First (or SJF) scheduling – non-preemptive
    9. Shortest Job First (or SJF) scheduling – preemptive (SRTF)
    10. Round Robin scheduling
    11. Priority Scheduling
    12. Convoy Effect
    13. Difference between Scheduler and Dispatcher
    14. Preemptive scheduling vs Non Preemptive scheduling
    15. Preemptive scheduling
    16. Non preemptive scheduling
  3. Process Synchronization :
    1. Process Synchronization
    2. Critical Section
    3. Inter-Process Communication
    4. UEFI(Unified Extensible Firmware Interface) and how is it different from BIOS
    5. Mutex
    6. Semaphore
    7. Mutex vs. Semaphore
    8. Atomic Operations in OS
    9. Peterson’s Algorithm for Mutual Exclusion (Only important for Cisco and Arista Networs)
      1. Java
      2. C
      3. Python
    10. Peterson’s Algorithm for Critical Section Problem (Only important for Cisco and Arista Networs)
    11. Readers-Writers Problem
  4. Deadlock :
    1. Deadlock Introduction
    2. Deadlock Detection And Recovery
    3. Deadlock detection Algorithm
    4. Deadlock Avoidance and Prevention
  5. Popular Algorithms
    1. Banker’s Algorithm
      1. bankers algorithm for deadlock avoidance in c (in above post itself)Resource Allocation Graph (RAG)
    2. Dining Philosopher’s Problem
    3. Bounded Buffer Problem / Producer Consumer Problem
  6. Processes & Threads:
    1. Threads
    2. User Level thread Vs Kernel Level thread
    3. Multithreading models
    4. Difference between program and process
  7. Memory Management :
    1. Memory Management Introduction
    2. Partition Allocation Method
      1. Create page
      2. First Fit
      3. Best fit
      4. Worst fit
      5. Next fit
      6. first fit best fit worst fit in OS Example
    3. Buddy- System Allocator.
    4. Paging (in Process)
      1. Types of Paging
    5. Fragmentation
      1. internal fragmentation
      2. external fragmentation
      3. internal fragmentation vs external fragmentation
    6. Mapping Virtual address to Physical Address.
    7. Virtual Memory 
    8. Demand Paging (Not Doing right now)
    9. Implementation of Demand paging and page fault (Not Doing Right now)
    10. Segmentation
    11. Page Replacement Algorithms
      1. LRU
      2. FIFO
      3. Optimal Page Replacement algorithm
    12. Thrashing
    13. Belady’s Anomaly
    14. Static vs Dynamic Loading
    15. Static vs Dynamic Linking
    16. Swapping
    17. Translational Look Aside Buffer
    18. Process Address Space
    19. Difference between Segmentation and Paging
  8. File and Disk Management :
    1. File Systems
    2. File Directories
    3. File Allocation Methods
    4. Disk Structure
    5. Disk Scheduling Algorithms