Operating System
Operating System is semester 4 subject of final year of computer engineering at Mumbai University. Prerequisite for studying this subject are Data structures and Computer architecture.
An operating system (OS) is system software that manages computer hardware, software resources, and provides common services for computer programs. Time-sharing operating systems schedule tasks for efficient use of the system and may also include accounting software for cost allocation of processor time, mass storage, printing, and other resources. For hardware functions such as input and output and memory allocation, the operating system acts as an intermediary between programs and the computer hardware, although the application code is usually executed directly by the hardware and frequently makes system calls to an OS function or is interrupted by it. Operating systems are found on many devices that contain a computer – from cellular phones and video game consoles to web servers and supercomputers. Early computers were built to perform a series of single tasks, like a calculator. Basic operating system features were developed in the 1950s, such as resident monitor functions that could automatically run different programs in succession to speed up processing. Operating systems did not exist in their modern and more complex forms until the early 1960s. Hardware features were added, that enabled use of runtime libraries, interrupts, and parallel processing. When personal computers became popular in the 1980s, operating systems were made for them similar in concept to those used on larger computers.
Course Objectives for Operating System is to introduce basic concepts and functions of operating systems. To understand the concept of process, thread and resource management. To understand the concepts of process synchronization and deadlock. To understand various Memory, I/O and File management techniques. Course Outcome for Operating System is to understand the objectives, functions and structure of OS Analyze the concept of process management and evaluate performance of process scheduling algorithms. Understand and apply the concepts of synchronization and deadlocks. Evaluate performance of Memory allocation and replacement policies. Understand the concepts of file management. Apply concepts of I/O management and analyze techniques of disk scheduling.
Module Operating system Overview consists of the following subtopics Introduction, Objectives, Functions and Evolution of Operating System consists of the following subtopics Operating system structures: Layered, Monolithic and Microkernel. Linux Kernel, Shell and System Calls. Process and Module Process Scheduling consists of the following subtopics Concept of a Process, Process States, Process Description, Process Control Block. Uniprocessor Scheduling-Types: Preemptive and Non-preemptive scheduling algorithms (FCFS, SJF, SRTN, Priority, RR) Threads: Definition and Types, Concept of Multithreading. Module Process Synchronization and Deadlocks Concurrency: consists of the following subtopics Principles of Concurrency, Inter-Process Communication, Process Synchronization. Mutual Exclusion: Requirements, Hardware Support (TSL), Operating System Support (Semaphores), Producer and Consumer problem. Principles of Deadlock: Conditions and Resource, Allocation Graphs, Deadlock Prevention, Deadlock Avoidance: Banker‟s Algorithm, Deadlock Detection and Recovery, Dining Philosophers Problem. Module Memory Management consists of the following subtopics Memory Management Requirements, Memory Partitioning: Fixed, Partitioning, Dynamic Partitioning, Memory Allocation Strategies: Best-Fit, First Fit, Worst Fit, Paging and Segmentation, TLB ,Virtual Memory: Demand Paging, Page Replacement Strategies: FIFO, Optimal, LRU, Thrashing. Module File Management consists of the following subtopics Overview, File Organization and Access, File Directories, File Sharing I/O management I/O devices, Organization of the I/O Function, Disk Organization, I/O Management and Disk Scheduling: FCFS, SSTF, SCAN, CSCAN, LOOK, C-LOOK.
Suggested Reference books for subject Operating System from Mumbai university are as follows Achyut Godbole and Atul Kahate, Operating Systems, McGraw Hill Education, 3rdEdition Andrew Tannenbaum, Operating System Design and Implementation, Pearson, 3rdEdition. Maurice J. Bach, “Design of UNIX Operating System”, PHI . Sumitabha Das, “UNIX: Concepts and Applications”, McGraw Hill, 4thEdition. Suggested Texts books for subject Operating System from Mumbai university are as follows William Stallings, Operating System: Internals and Design Principles, Prentice-Hall, 8thEdition, 2014, ISBN-10: 0133805913.ISBN-13: 9780133805918. Abraham Silberschatz, Peter Baer Galvin, and Greg Gagne, Operating System Concepts, John Wiley &Sons, Inc., 9 traditions, 2016, ISBN 978-81-265-5427-0.
Prepare For Your Placements: https://lastmomenttuitions.com/courses/placement-preparation/
/ Youtube Channel: https://www.youtube.com/channel/UCGFNZxMqKLsqWERX_N2f08Q
Follow For Latest Updates, Study Tips & More Content!
Course Features
- Lectures 42
- Quiz 0
- Duration 50 hours
- Skill level All levels
- Language Hindi
- Students 3466
- Assessments Yes
Curriculum
- 7 Sections
- 42 Lessons
- 24 Weeks
Expand all sectionsCollapse all sections
- About The Course/*! CSS Used from: Embedded */ *, ::after, ::before { box-sizing: border-box; border-width: 0; border-style: solid; border-color: #e5e7eb; } ::after, ::before { --tw-content: ''; } h2 { font-size: inherit; font-weight: inherit; } a { color: inherit; text-decoration: inherit; } h2, p { margin: 0; } :disabled { cursor: default; } *, ::before, ::after { --tw-border-spacing-x: 0; --tw-border-spacing-y: 0; --tw-translate-x: 0; --tw-translate-y: 0; --tw-rotate: 0; --tw-skew-x: 0; --tw-skew-y: 0; --tw-scale-x: 1; --tw-scale-y: 1; --tw-scroll-snap-strictness: proximity; --tw-ring-offset-width: 0px; --tw-ring-offset-color: #fff; --tw-ring-color: rgb(59 130 246 / 0.5); --tw-ring-offset-shadow: 0 0 #0000; --tw-ring-shadow: 0 0 #0000; --tw-shadow: 0 0 #0000; --tw-shadow-colored: 0 0 #0000; } .mx-auto { margin-left: auto; margin-right: auto; } .mb-2 { margin-bottom: 0.5rem; } .mb-4 { margin-bottom: 1rem; } .mb-6 { margin-bottom: 1.5rem; } .mr-2 { margin-right: 0.5rem; } .max-w-screen-sm { max-width: 640px; } .max-w-screen-xl { max-width: 1280px; } .rounded-lg { border-radius: 0.5rem; } .bg-primary-700 { --tw-bg-opacity: 1; background-color: rgb(29 78 216 / var(--tw-bg-opacity)); } .bg-white { --tw-bg-opacity: 1; background-color: rgb(255 255 255 / var(--tw-bg-opacity)); } .px-4 { padding-left: 1rem; padding-right: 1rem; } .px-5 { padding-left: 1.25rem; padding-right: 1.25rem; } .py-2.5 { padding-top: 0.625rem; padding-bottom: 0.625rem; } .py-8 { padding-top: 2rem; padding-bottom: 2rem; } .text-center { text-align: center; } .text-4xl { font-size: 3rem; line-height: 2.5rem; } .text-sm { font-size: 0.875rem; line-height: 1.25rem; } .font-extrabold { font-weight: 800; } .font-light { font-weight: 300; } .font-medium { font-weight: 500; } .leading-tight { line-height: 1.25; } .tracking-tight { letter-spacing: -0.025em; } .text-gray-500 { --tw-text-opacity: 1; color: rgb(107 114 128 / var(--tw-text-opacity)); } .text-gray-900 { --tw-text-opacity: 1; color: rgb(17 24 39 / var(--tw-text-opacity)); } .text-white { --tw-text-opacity: 1; color: rgb(255 255 255 / var(--tw-text-opacity)); } .hover:bg-primary-800:hover { --tw-bg-opacity: 1; background-color: rgb(30 64 175 / var(--tw-bg-opacity)); } .focus:outline-none:focus { outline: 2px solid transparent; outline-offset: 2px; } .focus:ring-4:focus { --tw-ring-offset-shadow: var(--tw-ring-inset) 0 0 0 var(--tw-ring-offset-width) var(--tw-ring-offset-color); --tw-ring-shadow: var(--tw-ring-inset) 0 0 0 calc(4px + var(--tw-ring-offset-width)) var(--tw-ring-color); box-shadow: var(--tw-ring-offset-shadow), var(--tw-ring-shadow), var(--tw-shadow, 0 0 #0000); } .focus:ring-primary-300:focus { --tw-ring-opacity: 1; --tw-ring-color: rgb(147 197 253 / var(--tw-ring-opacity)); } @media (min-width: 640px) { .sm:py-16 { padding-top: 4rem; padding-bottom: 4rem; } } @media (min-width: 768px) { .md:text-lg { font-size: 1.5rem; line-height: 1.75rem; } } @media (min-width: 1024px) { .lg:px-6 { padding-left: 1.5rem; padding-right: 1.5rem; } } .imgdata { width: 35% } @media (max-width: 767px) { .imgdata { width: 40% } } .course-payment { display: none !important; } .thim-course-landing-button { display: none !important; }
This Course is Only Available On Our App
Dive-in and start learning! Get offline access to all the course contents!
0 - Operating System Overview4
- Process and Process Scheduling10
- 3.1PCB ( Process Control Block )5 Minutes
- 3.2Process State Transition Diagram11 Minutes
- 3.3SJF (non preemptive ) with solved example | CPU Scheduling5 Minutes
- 3.4FCFS ( First come first serve ) | CPU Scheduling14 Minutes
- 3.5ROUND ROBIN SCHEDULING ALGORITHM with solved example | CPU Scheduling10 Minutes
- 3.6Preemptive Priority Scheduling with solved example | CPU Scheduling16 Minutes
- 3.7SJF Preemptive with solved example | Cpu Scheduling10 Minutes
- 3.8SJF 2 Preemptive with solved example21 Minutes
- 3.9Process Scheduling Module 2 Numericals
- 3.10IMP Module 2 Solution
- Process Synchronization and Deadlocks10
- 4.1Producer Consumer Problem8 Minutes
- 4.2Critical Section Problem7 Minutes
- 4.3Dead Lock with Necessary and Sufficient Condition for Deadlock4 Minutes
- 4.4Deadlock Prevention4 Minutes
- 4.5Bankers algorithm with Solve Example Part 113 Minutes
- 4.6Bankers (Resource Request algorithm) with Solve Example Part 29 Minutes
- 4.7Dead Lock Recovery5 Minutes
- 4.8Dining philosopher Problem8 Minutes
- 4.9Bankers algorithm Module 3 Numericals
- 4.10IMP Module 3 Solution
- Memory Management8
- 5.1Introduction to Memory in Operating system8 Minutes
- 5.2Memory management |Part 1 |8 Minutes
- 5.3Memory management |Part 2 |5 Minutes
- 5.4Memory management |Part 3 |8 Minutes
- 5.5Loading and Linking4 Minutes
- 5.6FIFO,LRU AND OPTIMAL PAGE REPLACEMENT ALGORITHMS20 Minutes
- 5.7IMP Module 4 Solution
- 5.8Page Replacement Numericals Module 4
- Input /Output Management9
- 6.1Disk scheduling Algorithm6 Minutes
- 6.2FCFS Disk Scheduling Algorithm9 Minutes
- 6.3SSTF Disk Scheduling Algorithm7 Minutes
- 6.4SCAN Disk Scheduling Algorithm6 Minutes
- 6.5C SCAN Disk Scheduling Algorithm5 Minutes
- 6.6Look Disk Scheduling Algorithm4 Minutes
- 6.7C Look Disk Scheduling Algorithm4 Minutes
- 6.8FCFS SSTF SCAN CSCAN LOOK CLOOK Overview | Disk Scheduling Sums | All in One8 Minutes
- 6.9IMP Module 5 Solution
- Operating System [Module 6]:- I/O Management1
![First Year Sem 2 MU NEP [ Comps – IT – AIML Branch ]](https://www.informaltuitions.in/wp-content/uploads/2020/02/WhatsApp-Image-2020-06-26-at-12.15.44-PM-400x250.jpeg)
![Engineering Maths- 4 [All Branches] ( Videos + Handmade Notes ) AKTU](https://www.informaltuitions.in/wp-content/uploads/2020/01/WhatsApp-Image-2020-06-26-at-12.15.45-PM-400x250.jpeg)
