Careertail
About UsCoursesCareer PathsBlogOpportunities
Log In
Courses>Operating Systems & Servers>Operating System Crash Course For Beginners - IGNOU Part - 1
IT & SoftwareOperating System Crash Course For Beginners - IGNOU Part - 1
Price:Free
Length:2 hours
Content type:video
level:beginner
Updated:19 February 2024
Published:21 August 2022
Similar courses
Opportunities
Courses>Operating Systems & Servers>Operating System Crash Course For Beginners - IGNOU Part - 1
Operating System Crash Course For Beginners - IGNOU Part - 1
4.4 (1.8k)
2 hours
1846 students
What you will learn
1Basics, History, Types and Functions of Operating System
2Process States, Context Switching, Thread, Process Scheduling, Scheduling Algorithms, Preemptive, Non-preemptive, FCFS, SJF, SRTN, Round Robin Algorthims
3Interprocess Communication and Synchronization, Shared-Memory, Message-Passing, Critical Section, Mutex, Bakery’s Algorithm, Locks, Deadlocks
4Memory Management - Overlay, Swapping, Virtual Memory, Demand Paging, Thrashing, Working Set Model, Page Fault Rate, RAID, Security Model
Target audiences
1Beginner Students who want to learn basics of Operating System
2IGNOU PGDCA_NEW Aspirants
3Mature Students who have a busy schedule
4Students preparing for competitive exams, such as GATES
Requirements
1Basic Understanding Of a Computer.
FAQ
You can view and review the lecture materials indefinitely, like an on-demand channel.
Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don't have an internet connection, some instructors also let their students download course lectures. That's up to the instructor though, so make sure you get on their good side!
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.

Syllabus
Intro

  1. What is an Operating System? ( Example: DOS, Unix, Windows, Macintosh )

  2. Generations of Operating Systems.

  3. Types Of Operating Systems

    1. Multiprogramming Operating System

    2. Multiprocessing System

    3. Networking Operating System

    4. Distributed Operating System

  4. Functions Of Operating Systems

    1. Process Management

    2. Memory Management

    3. File Management

  1. Processes

    1. Process States

    2. Implementation Of Processes

      1. Context Switching

      2. Threads

    3. Process Scheduling

      1. What is a scheduler?

      2. Process Life-Cycle

      3. Types of Schedulers

        1. Long Term Scheduler

        2. Short Term Scheduler

        3. Medium Term Scheduler.

    4. Scheduling Algorithms ( * Solving problems )

      1. Preemptive scheduling

      2. Non–Preemptive scheduling

      3. First Come First Serve (FCFS)

      4. Shortest Job First (SJF)

      5. Round Robin (RR)

      6. Shortest Remaining Time Next (SRTN)

      7. Priority Based Scheduling or Event-Driven (ED) Scheduling

  2. Interprocess Communication and Synchronization

    1. Interprocess Communication

      1. Shared-Memory System

      2. Message-Passing System

    2. Interprocess Synchronization

      1. Critical Sections: The Mutex Solution

        1. Mutexes: Mutual Exclusion

        2. Bakery’s Algorithm

  3. Classical Problems in Concurrent Programming

    1. Producers/Consumers Problem

  4. Locks

  5. DeadLocks

    1. Characterization of a Deadlock

      1. Mutual Exclusion Condition

      2. Hold and Wait Condition

      3. No-Preemptive Condition

      4. Circular Wait Condition

  6. Memory Management

    1. Memory Management Techniques

      1. Overlays

      2. Swapping

    2. Paging

    3. Virtual Memory

      1. What is a virtual memory

      2. Demand Paging

      3. Page Replacement Policies ( * Solve Problems )

        1. First In First Out (FIFO)

        2. Least Recently Used (LRU)

        3. Optimal Algorithm (OPT)

      4. Thrashing

        1. What is thrashing

        2. Ways to avoid thrashing

          1. Working-Set Model

          2. Page-Fault Rate

    4. I/O File management

      1. RAID

    5. Security and Protection

      1. Security Models

        1. Bell and La-padula model



Similar courses
Opportunities
Make the most out of your online education
Careertail
Copyright © 2021 Careertail.
All rights reserved
Quick Links
Get StartedLog InAbout UsCourses
Company
BlogContactsPrivacy PolicyCookie PolicyTerms and Conditions
Stay up to date
Trustpilot
Careertail
Courses>Operating Systems & Servers>Operating System Crash Course For Beginners - IGNOU Part - 1
IT & SoftwareOperating System Crash Course For Beginners - IGNOU Part - 1
Price:Free
Length:2 hours
Content type:video
level:beginner
Updated:19 February 2024
Published:21 August 2022
Similar courses
Opportunities
Courses>Operating Systems & Servers>Operating System Crash Course For Beginners - IGNOU Part - 1
Operating System Crash Course For Beginners - IGNOU Part - 1
4.4 (1.8k)
2 hours
1846 students
What you will learn
1Basics, History, Types and Functions of Operating System
2Process States, Context Switching, Thread, Process Scheduling, Scheduling Algorithms, Preemptive, Non-preemptive, FCFS, SJF, SRTN, Round Robin Algorthims
3Interprocess Communication and Synchronization, Shared-Memory, Message-Passing, Critical Section, Mutex, Bakery’s Algorithm, Locks, Deadlocks
4Memory Management - Overlay, Swapping, Virtual Memory, Demand Paging, Thrashing, Working Set Model, Page Fault Rate, RAID, Security Model
Target audiences
1Beginner Students who want to learn basics of Operating System
2IGNOU PGDCA_NEW Aspirants
3Mature Students who have a busy schedule
4Students preparing for competitive exams, such as GATES
Requirements
1Basic Understanding Of a Computer.
FAQ
You can view and review the lecture materials indefinitely, like an on-demand channel.
Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don't have an internet connection, some instructors also let their students download course lectures. That's up to the instructor though, so make sure you get on their good side!
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.

Syllabus
Intro

  1. What is an Operating System? ( Example: DOS, Unix, Windows, Macintosh )

  2. Generations of Operating Systems.

  3. Types Of Operating Systems

    1. Multiprogramming Operating System

    2. Multiprocessing System

    3. Networking Operating System

    4. Distributed Operating System

  4. Functions Of Operating Systems

    1. Process Management

    2. Memory Management

    3. File Management

  1. Processes

    1. Process States

    2. Implementation Of Processes

      1. Context Switching

      2. Threads

    3. Process Scheduling

      1. What is a scheduler?

      2. Process Life-Cycle

      3. Types of Schedulers

        1. Long Term Scheduler

        2. Short Term Scheduler

        3. Medium Term Scheduler.

    4. Scheduling Algorithms ( * Solving problems )

      1. Preemptive scheduling

      2. Non–Preemptive scheduling

      3. First Come First Serve (FCFS)

      4. Shortest Job First (SJF)

      5. Round Robin (RR)

      6. Shortest Remaining Time Next (SRTN)

      7. Priority Based Scheduling or Event-Driven (ED) Scheduling

  2. Interprocess Communication and Synchronization

    1. Interprocess Communication

      1. Shared-Memory System

      2. Message-Passing System

    2. Interprocess Synchronization

      1. Critical Sections: The Mutex Solution

        1. Mutexes: Mutual Exclusion

        2. Bakery’s Algorithm

  3. Classical Problems in Concurrent Programming

    1. Producers/Consumers Problem

  4. Locks

  5. DeadLocks

    1. Characterization of a Deadlock

      1. Mutual Exclusion Condition

      2. Hold and Wait Condition

      3. No-Preemptive Condition

      4. Circular Wait Condition

  6. Memory Management

    1. Memory Management Techniques

      1. Overlays

      2. Swapping

    2. Paging

    3. Virtual Memory

      1. What is a virtual memory

      2. Demand Paging

      3. Page Replacement Policies ( * Solve Problems )

        1. First In First Out (FIFO)

        2. Least Recently Used (LRU)

        3. Optimal Algorithm (OPT)

      4. Thrashing

        1. What is thrashing

        2. Ways to avoid thrashing

          1. Working-Set Model

          2. Page-Fault Rate

    4. I/O File management

      1. RAID

    5. Security and Protection

      1. Security Models

        1. Bell and La-padula model



Similar courses
Opportunities
Make the most out of your online education
Careertail
Copyright © 2021 Careertail.
All rights reserved
Quick Links
Get StartedLog InAbout UsCourses
Company
BlogContactsPrivacy PolicyCookie PolicyTerms and Conditions
Stay up to date
Trustpilot