Operating System (3140702)

Study Material
3140702 - Operating System

Study Material
Syllabus

e-Notes

All Units | Operating System (3140702) Updated on 06-04-2020

Presentations

Unit-1 | Introduction to Operating System Updated on 23-03-2021
Unit-2 | Process and Thread Management Updated on 26-03-2021
Unit-2 | Scheduling Algorithm Updated on 31-03-2021
Unit-3-4 | Concurrency and Interprocess Communication Updated on 06-05-2021
Unit-5 | Deadlock Updated on 06-05-2021
Unit-6 | Memory Management Updated on 19-05-2021
Unit-7 | I/O Management and Disk Scheduling Updated on 06-05-2021
Unit-8 | Security and Protection Updated on 06-05-2021
Unit-9 | Unix/Linux Operating System (Part-I) Updated on 07-03-2022
Unit-9 | Unix Commands and Shell Scripts (Part-II) Updated on 07-03-2022
Unit-10 | Virtualization Concepts Updated on 07-03-2022

Lab Manual

Operating System (3140702) | Unix Commands Updated on 08-05-2020

Video Lectures

1.01

Basics of Operating Systems

53K

333

1.02

Roles of an Operating System

23K

172

1.03

Task of Operating System

12K

1.04

Types of Operating System

19K

158

1.05

Basics of System Call

10K

1.06

Operating System Structure Part I

13K

1.07

Operating System Structure Part II

2.01

Basics of Process and Multiprogramming and Process Model

10K

2.02

Process Creation, Process Termination and Process Hierarchies

14K

115

2.03

Process State Diagram

2.04

Process Control Block (PCB)

2.05

Basic Concept of Threads

2.06

Threads v/s Process

2.07

Process Scheduling and it objectives

2.08

FCFS (First Come First Serve) Scheduling Algorithm

2.09

SJF (Shortest Job First) Scheduling Algorithm

2.10

SRTN (Shortest Remaining Time Next) Scheduling Algorithm

22K

196

2.11

RR (Round Robin) Scheduling Algorithm

2.12

Non Preemptive Priority Scheduling Algorithm

2.13

Preemptive Priority Scheduling Algorithm

3.01

Definitions of Race Condition and Critical Section

12K

103

3.02

Definitions of Mutual Exclusion and Critical Section

3.03

Disabling Interrupt

12K

118

3.04

Shared Lock Variable

3.05

TSL Test and Set Lock and_Exchange_Instruction

12K

117

3.06

Strict Alteration

107

3.07

Petersons Solution

14K

141

3.08

Sleep and Wakeup and Producer Consumer Problem

11K

152

3.09

Producer Consumer Problem using Sleep and Wakeup

3.10

Producer Consumer Problem using Semaphore

12K

162

3.11

Reader Writer Problem using Semaphore

10K

3.12

Mutex

3.13

Monitor

12K

3.14

Message Passing

3.15

Dining Philosoper Problem

4.01

Definition of Deadlock and four conditions that lead to deadlock

4.02

Deadlock Ignorance (Ostrich Algorithm)

16K

167

4.03

Deadlock Detection for single and multiple resources

20K

290

4.04

Deadlock Recovery

4.05

Safe State v/s Unsafe State

23K

356

4.06

Deadlock Avoidance (Bankers Algorithm for Single Resource)

18K

263

4.07

Deadlock Avoidance (Bankers Algorithm for Multiple Resource)

14K

187

4.08

Deadlock Prevention

5.01

Basic concept of memory

10K

5.02

Memory Abstraction

11K

5.03

Way to implement swapping

5.04

Relocation, Base and Limit Register

20K

222

5.05

Techniques for Managing Free Memory

5.06

Memory Allocation Algorithms

5.07

Concept of Virtual Memory

22K

255

5.08

Paging and Conversion of Logical Address to Physical Address

44K

348

5.09

Page Table Structure

5.10

Problems of Paging (Issues in Paging)

5.11

Optimal Page Replacement Algorithms and FIFO Page Replacement Algorithms

5.12

Second Chance Page Replacement Algorithms and Clock Page Replacement Algorithms

20K

117

5.13

LRU Page Replacement Algorithms and NRU Page Replacement Algorithms

14K

5.14

Segmentations and Difference between Paging and Segmentation

6.01

Components of IO Devices and Device Controller

22K

214

6.02

DMA (Direct Memory Access)

18K

170

6.03

Goals of IO Softwares

10K

100

6.04

Device Independent IO Software

6.05

RAID (Redundant Array of Independent Disk)

13K

6.06

Disk Arm Scheduling Algorithms

7.01

File Attributes and Operations Performed on File

7.02

File Types and File Access Methods

7.03

Directory Structure and Operations Performed on Directory

7.04

MBR (Master Boot Record) and File System

7.05

File Implementation

7.06

Directory Implementation

8.01

Design Principles of Security

8.02

Domain Protection Mechanism and Access Matrix

8.03

Types of Threats

9.01

UNIX/LINUX Commands (Part-I)

9.02

UNIX/LINUX Commands (Part-II)

9.03

UNIX/LINUX Commands (Part-III)

9.04

UNIX/LINUX Commands (Part-IV)

9.05

UNIX/LINUX Commands (Part-V)

10.01

Virtualization Concepts

10.02

Install Linux on Mac OS using VirtualBox

Teaching Scheme (in Hours)

Theory	Tutorial	Practical	Total
4	0	2	5

Subject Credit : 5

Examination Scheme (in Marks)

Theory ESE (E)	Theory PA (M)	Practical ESE Viva (V)	Practical PA (I)	Total
70	30	30	20	150

Syllabus Content

Course Outcome

Course Outcome

Analyze the structure of OS and basic architectural components involved in OS design - 10%
Compare and contrast various CPU scheduling algorithms. - 20%
Evaluate the requirements for the process synchronization and co-ordination in contemporary operating system. - 30%
Analyze various algorithms for memory management, I/O management and security aspects of operating system. - 30%
Write shell scripts in Unix/Linux O.S and write simple programs using kernel system calls. Also understand virtualization concept. - 10%

Who we are?

Darshan University - having the foundation of its first Institution laid in 2009, and later on, established and consolidated under Gujarat Private Universities (Second Amendment) Act of 2021. It is one of the leading institutes within Saurashtra that offers Diploma, UG, PG and Doctoral Courses.