0

  NEC CSE 3-1 Operating Systems Video Tutorial for Important Topics by preparing these topics, you can get good marks in your exams. All the topics links are provided for better undertaking. Take brief notes, practice problems if any.

UNIT-I (Computer System and Operating System Overview)

1. Overview of Operating System - What operating systems do, User view, System view

2. Operating Systems functions  

3. Types of OS  

4. Structures of Operating System 

5. System Calls 

6. Operating systems generation

UNIT-II (Process Management)

1. Process Sate Diagram    OR  Link for 2nd Video

2. PCB (Process Control Block)

3. Scheduling Queues, Schedulers

4. Operations- Process Creation, Process termination  OR Link for 2nd Video

5.  Inter process communication- Shared-Memory Systems

6. Multi Thread programming models- Many to one, One to one, Many to Many model 

7. Process Scheduling - Scheduling Criteria  

8.  Preemptive and Non-Preemptive Scheduling

9. First Come First Serve

10. Shortest job first

11. Priority Scheduling

12. Round robin scheduling

UNIT-III (Concurrency)

1. Process Synchronization

2. The Critical-Section Problem-Peterson’s Solution 

3.  Synchronization Hardware

4. Semaphores- Usage, Implementation

5. Deadlock and Starvation

    5.1. Problems on Deadlock and Starvation

6. Classic Problems of Synchronization

     6.1.Bounded buffer problem

      6.2. Readers writers’ problem

      6.3. Dining-Philosophers problem

7. Monitors- Usage

8. Dining-Philosophers solution using monitors.

UNIT-III(Memory Management)

1.Memory Management

2. Non-contiguous Memory Management technique

3. Partitions Algorithms - First Fit, Best Fit, Worst Fit

4. Paging- Basic Method, Hardware Method, Protection, shared pages

  4.1. Paging Numerical Example 

5.  Multilevel Paging OR Hierarchical Paging

6. Structure of the Page table- Hashed Page Tables and Inverted Page Table

7. Segmentation- Basic Method

8. Segmentation-hardware

UNIT-IV (Virtual Memory Management)

1. Virtual Memory. Demand Paging 

2.  Page-Replacement Algorithms

        2.1. FIFO page replacement

              2.1.1 BELADY'S ANOMALY (FIFO PAGE REPLACEMENT ALGORITHM)

        2.2. optimal page replacement

        2.3. LRU page replacement

        2.4.LFU page replacement

3. Thrashing- Cause of Thrashing

4. Working set model

5. Page fault frequency

UNIT-IV (Principles of Deadlock)

1. Necessary Conditions of Deadlock

2. Deadlock Prevention- Mutual exclusion, Hold and wait, No preemption, Circular wait

3.  Deadlock Detection and Avoidance- Resource allocation Graph algorithm

4. Banker’s algorithm

5. Recovery Form Deadlock

UNIT - V (File System and Implementation) 

1. The Concept of a File

2. file attributes

3. file operations

4. file types

5. file structures

6. Access Methods

6. Directory Structure

7. File Sharing

8. Allocation Methods

9. Free-Space Management

10. Disk Scheduling- 

  10.1.FCFS scheduling

   10.2. SSTF scheduling

   10.3. SCAN scheduling

   10.4. C-SCAN scheduling

   10.5. LOOK scheduling

Post a Comment

 
Top