Operating System Crash Course For Beginners - IGNOU Part - 1

Operating System Basics For Beginners
What you'll learn
Basics, History, Types and Functions of Operating System
Process States, Context Switching, Thread, Process Scheduling, Scheduling Algorithms, Preemptive, Non-preemptive, FCFS, SJF, SRTN, Round Robin Algorthims
Interprocess Communication and Synchronization, Shared-Memory, Message-Passing, Critical Section, Mutex, Bakery’s Algorithm, Locks, Deadlocks
Memory Management - Overlay, Swapping, Virtual Memory, Demand Paging, Thrashing, Working Set Model, Page Fault Rate, RAID, Security Model
Requirements
Basic Understanding Of a Computer.
Description
This course is designed for:
Students from Universities such as IGNOU
People who are interested in learning the basics of Operating System Concepts.
The Course prepares especially those mature students who do not have enough time for studies because of their work schedule. The tutorial covers the important topics, concepts and questions asked in the previous few  IGNOU term-end examination papers.
SyllabusIntro
What is an Operating System? ( Example: DOS, Unix, Windows, Macintosh )
Generations of Operating Systems.
Types Of Operating Systems
Multiprogramming Operating System
Multiprocessing System
Networking Operating System
Distributed Operating System
Functions Of Operating Systems
Process Management
Memory Management
File Management
Processes
Process States
Implementation Of Processes
Context Switching
Threads
Process Scheduling
What is a scheduler?
Process Life-Cycle
Types of Schedulers
Long Term Scheduler
Short Term Scheduler
Medium Term Scheduler.
Scheduling Algorithms ( * Solving problems )
Preemptive scheduling
Non–Preemptive scheduling
First Come First Serve (FCFS)
Shortest Job First (SJF)
Round Robin (RR)
Shortest Remaining Time Next (SRTN)
Priority Based Scheduling or Event-Driven (ED) Scheduling
Interprocess Communication and Synchronization
Interprocess Communication
Shared-Memory System
Message-Passing System
Interprocess Synchronization
Critical Sections: The Mutex Solution
Mutexes: Mutual Exclusion
Bakery’s Algorithm
Classical Problems in Concurrent Programming
Producers/Consumers Problem
Locks
DeadLocks
Characterization of a Deadlock
Mutual Exclusion Condition
Hold and Wait Condition
No-Preemptive Condition
Circular Wait Condition
Memory Management
Memory Management Techniques
Overlays
Swapping
Paging
Virtual Memory
What is a virtual memory
Demand Paging
Page Replacement Policies ( * Solve Problems )
First In First Out (FIFO)
Least Recently Used (LRU)
Optimal Algorithm (OPT)
Thrashing
What is thrashing
Ways to avoid thrashing
Working-Set Model
Page-Fault Rate
I/O File management
RAID
Security and Protection
Security Models
Bell and La-padula model



Who this course is for:
Beginner Students who want to learn basics of Operating System
IGNOU PGDCA_NEW Aspirants
Mature Students who have a busy schedule
Students preparing for competitive exams, such as GATES

More Info