Principles Of Operating Systems by Dr. Kowsigan Mohan

[OneDDL]

Free Download Principles Of Operating Systems by Dr. Kowsigan Mohan
Published 6/2024
MP4 | Video: h264, 1920x1080 | Audio: AAC, 44.1 KHz
Language: English | Size: 2.34 GB | Duration: 4h 43m
Core Concepts, Threads and Process

What you'll learn
Introduce the key role of an Operating System
Insist the Process Management functions of an Operating System
Emphasize the importance of Memory Management concepts of an Operating system
Realize the significance of Device Management part of an Operating system
Requirements
No programming Experience required
Description
The operating system acts as an Interface between the user and computer hardware, OS is designed in such a way, that it is convenient to use in an efficient manner. Tasks performed by Operating System are It manages computer hardware, It controls and coordinates the computer H/W and specifies, how various resources like hardware and software can be used in an efficient manner. Users want ease of use and good performance & highly convenience. Users can share the terminals, connected to mainframe or minicomputer. Individual Users with dedicate systems such as workstations use shared resources from servers or Printers. In case of hand held devices, the operating system is designed for individual usability. Example: OS on iPhone, or any Android phone. OS is a resource allocatorManages all resourcesConflicting requests between resources are managed for efficient use◦OS is a control programControls execution of programs to prevent errors and improper use of the computerObjectives of Operating systemConvenienceEfficiencyAbility to evolveIt specifies how resources are convenient to use in an efficient manner.OS as a service routine1.Program development.Ex: Editors & Debuggers1.Program Execution2.Access I/O devices and controlling access to I/O devices3.Error detection & response4.Performance maintenance
Overview
Section 1: Introduction
Lecture 1 Introduction
Section 2: Tasks performed by Operating System
Lecture 2 Tasks performed by Operating System
Section 3: Role of Operating System
Lecture 3 Role of Operating System
Section 4: The Evolution of Operating System
Lecture 4 The Evolution of Operating System
Section 5: Simple Batch Systems
Lecture 5 Simple Batch Systems
Section 6: Time-Sharing Systems
Lecture 6 Time-Sharing Systems
Section 7: MAJOR ACHIEVEMENTS
Lecture 7 MAJOR ACHIEVEMENTS
Section 8: Process
Lecture 8 Process
Section 9: Process Scheduling
Lecture 9 Process Scheduling
Section 10: Process Creation & Termination
Lecture 10 Process Creation & Termination
Section 11: Interprocess Communication
Lecture 11 Interprocess Communication
Section 12: Pipes
Lecture 12 Pipes
Section 13: Process Synchronization & Race Condition & Critical Section
Lecture 13 Process Synchronization & Race Condition & Critical Section
Section 14: Types of solutions to CS problem
Lecture 14 Types of solutions to CS problem
Section 15: Semaphores
Lecture 15 Semaphores
Section 16: Bounded-Buffer Producer/Consumer Problem
Lecture 16 Bounded-Buffer Producer/Consumer Problem
Section 17: Dining-Philosophers Problem & Monitors
Lecture 17 Dining-Philosophers Problem & Monitors
Section 18: CPU Scheduling Criteria
Lecture 18 CPU Scheduling Criteria
Section 19: FIFO (First In and First Out) or FCFS
Lecture 19 FIFO (First In and First Out) or FCFS
Section 20: Shortest-Job-First (SJF) Scheduling
Lecture 20 Shortest-Job-First (SJF) Scheduling
Section 21: Priority Scheduling
Lecture 21 Priority Scheduling
Section 22: Round Robin (RR) Scheduling, Multi-level Queue Scheduling & Multilevel Feedback
Lecture 22 Round Robin (RR) Scheduling, Multi-level Queue Scheduling & Multilevel Feedback
Section 23: Deadlocks & Resource-Allocation Graph
Lecture 23 Deadlocks & Resource-Allocation Graph
Section 24: Deadlock Prevention & Avoidance
Lecture 24 Deadlock Prevention & Avoidance
Section 25: Banker's Algorithm
Lecture 25 Banker's Algorithm
Section 26: Deadlock Detection & Prevention Algorithm
Lecture 26 Deadlock Detection & Prevention Algorithm
Section 27: Basics of Memory Management
Lecture 27 Basics of Memory Management
Section 28: Logical vs Physical Address Space
Lecture 28 Logical vs Physical Address Space
Section 29: CONTIGUOUS MEMORY ALLOCATION
Lecture 29 CONTIGUOUS MEMORY ALLOCATION
Section 30: Internal Fragmentation
Lecture 30 Internal Fragmentation
Section 31: Partition Allocation Algorithm
Lecture 31 Partition Allocation Algorithm
Section 32: External Fragmentation
Lecture 32 External Fragmentation
Section 33: Non Contiguous Allocation Paging
Lecture 33 Non Contiguous Allocation Paging
Section 34: Page Fault
Lecture 34 Page Fault
Section 35: STRUCTURE OF A PAGE TABLE
Lecture 35 STRUCTURE OF A PAGE TABLE
Section 36: Segmentation
Lecture 36 Segmentation
Section 37: Virtual Memory
Lecture 37 Virtual Memory
Section 38: Demand Paging
Lecture 38 Demand Paging
Section 39: Copy-on-Write
Lecture 39 Copy-on-Write
Section 40: FIFO Page replacement algorithms
Lecture 40 FIFO Page replacement algorithms
Section 41: Optimal and LRU Page replacement algorithms
Lecture 41 Optimal and LRU Page replacement algorithms
Section 42: COUNTING AND PAGE BUFFERING ALGORITHMS
Lecture 42 COUNTING AND PAGE BUFFERING ALGORITHMS
Section 43: Allocation of Frames
Lecture 43 Allocation of Frames
Section 44: Thrashing
Lecture 44 Thrashing
Beginners in Computer Science
Homepage

[To see links please register or login]

Recommend Download Link Hight Speed | Please Say Thanks Keep Topic Live

[To see links please register or login]

No Password - Links are Interchangeable