BASAVESHWAR ENGINEERING COLLEGE, BAGALKOTE- 587 103

DEPARTMENT OF ARTIFICIAL INTELLIGENCE &

MACHINE LEARNING

B. V. V. S’s

OPERATING SYSTEMS Semester 3

Course Code 22UAI309C CIE Marks 50

Teaching Hours/Week (L:T:P: S) 3:0:2:0 SEE Marks 50

Total Hours of Pedagogy 40 hours Theory + 20 hours Total Marks 100

practical’s

Credits 04 Exam Hours 03

Examination type (SEE) Theory

Course objectives:

● To demonstrate the need for OS and different types of OS

● To discuss suitable techniques for management of different resources

● To demonstrate different APIs/Commands related to processor, memory, storage and file

system management.

Teaching-Learning Process (General Instructions)

Teachers can use the following strategies to accelerate the attainment of the various course
outcomes.

1. Lecturer methods (L) need not to be only traditional lecture method, but alternative
effective teaching methods could be adopted to attain the outcomes.

2. Use of Video/Animation to explain functioning of various concepts.

3. Encourage collaborative (Group Learning) Learning in the class.

4. Adopt Problem Based Learning (PBL), which fosters students’ Analytical skills, develop
design thinking skills such as the ability to design, evaluate, generalize, and analyze
information rather than simply recall it.

5. Role play for process scheduling.

6. Demonstrate the installation of any one Linux OS on VMware/Virtual Box

 BASAVESHWAR ENGINEERING COLLEGE, BAGALKOTE- 587 103
DEPARTMENT OF ARTIFICIAL INTELLIGENCE &
MACHINE LEARNING

B. V. V. S’s

MODULE-1 08 Hrs
Introduction to operating systems, System structures: What operating systems do; Computer System
organization; Computer System architecture; Operating System structure; Operating System operations;
Process management; Memory management; Storage management; Protection and Security; Distributed
system; Special-purpose systems; Computing environments.

Operating System Services: User - Operating System interface; System calls; Types of system calls;
System programs; Operating system design and implementation; Operating System structure; Virtual
machines; Operating System debugging, Operating System generation; System boot.

Textbook 1: Chapter – 1 (1.1-1.12), 2 (2.2-2.11)

MODULE-2 08 Hrs
Process Management: Process concept; Process scheduling; Operations on processes; Inter process
communication

Multi-threaded Programming: Overview; Multithreading models; Thread Libraries; Threading issues.

Process Scheduling: Basic concepts; Scheduling Criteria; Scheduling Algorithms; Thread scheduling;
Multiple-processor scheduling

Textbook 1: Chapter – 3 (3.1-3.4), 4 (4.1-4.4), 5 (5.1 -5.5)

MODULE-3 08 Hrs
Process Synchronization: Synchronization: The critical section problem; Peterson’s solution;
Synchronization hardware; Semaphores; Classical problems of synchronization;

Deadlocks: System model; Deadlock characterization; Methods for handling deadlocks; Deadlock
prevention; Deadlock avoidance; Deadlock detection and recovery from deadlock.

Textbook 1: Chapter – 6 (6.1-6.6), 7 (7.1 -7.7)

MODULE-4 08 Hrs
Memory Management: Memory management strategies: Background; Swapping; Contiguous memory
allocation; Paging; Structure of page table; Segmentation.

Virtual Memory Management: Background; Demand paging; Copy-on-write; Page replacement;

Allocation of frames; Thrashing.

Textbook 1: Chapter -8 (8.1-8.6), 9 (9.1-9.6)

MODULE-5 08 Hrs
File System, Implementation of File System: File system: File concept; Access methods; Directory and
Disk structure; File system mounting; File sharing; Implementing File system: File system structure; File
system implementation; Directory implementation; Allocation methods; Free space management.
 BASAVESHWAR ENGINEERING COLLEGE, BAGALKOTE- 587 103
DEPARTMENT OF ARTIFICIAL INTELLIGENCE &
MACHINE LEARNING

B. V. V. S’s

Secondary Storage Structure, Protection: Mass storage structures; Disk structure; Disk attachment;
Disk scheduling; Disk management; Protection: Goals of protection, Principles of protection, Domain of
protection, Access matrix.

Textbook 1: Chapter – 10 (10.1-10.5) ,11 (11.1-11.5),12 (12.1-12.5), 14 (14.1-14.4)

Suggested Learning Resources:

Textbooks 1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, Operating System Principles 8th
edition, Wiley-India, 2015

Reference Books

1. Ann McHoes Ida M Fylnn, Understanding Operating System, Cengage Learning, 6th Edition
2. D.M Dhamdhere, Operating Systems: A Concept Based Approach 3rd Ed, McGraw- Hill, 2013.
3. P.C.P. Bhatt, An Introduction to Operating Systems: Concepts and Practice 4th Edition, PHI(EEE),
2014.
4. William Stallings Operating Systems: Internals and Design Principles, 6th Edition, Pearson.
Web links and Video Lectures (e-Resources):

1. https://youtu.be/mXw9ruZaxzQ
2. https://youtu.be/vBURTt97EkA
3. https://www.youtube.com/watch?v=783KABtuE4&list=PLIemF3uozcAKTgsCIj82voMK3TMR0YE_f
4. https://www.youtube.com/watch?v=3-
ITLMMeeXY&list=PL3pGy4HtqwD0n7bQfHjPnsWzkeRn6mkO
Activity Based Learning (Suggested Activities in Class)/ Practical Based learning

● Assessment Methods
o Case Study on Unix Based Systems (10 Marks)
o Lab Assessment (25 Marks)
 BASAVESHWAR ENGINEERING COLLEGE, BAGALKOTE- 587 103
DEPARTMENT OF ARTIFICIAL INTELLIGENCE &
MACHINE LEARNING

B. V. V. S’s

PRACTICAL COMPONENT OF IPCC

Sl. No. Experiments

1 Develop a c program to implement the Process system calls (fork (), exec(), wait(), create
process, terminate process)

2 Simulate the following CPU scheduling algorithms to find turnaround time and waiting
time a) FCFS b) SJF c) Round Robin d) Priority.

3 Develop a C program to simulate producer-consumer problem using semaphores.

4 Develop a C program which demonstrates interprocess communication between a reader

process and a writer process. Use mkfifo, open, read, write and close APIs in your
program.

5 Develop a C program to simulate Bankers Algorithm for DeadLock Avoidance.

6 Develop a C program to simulate the following contiguous memory allocation

Techniques: a) Worst fit b) Best fit c) First fit.

7 Develop a C program to simulate page replacement algorithms: a) FIFO b) LRU

8 Simulate following File Organization Techniques a) Single level directory b) Two level
directory

9 Develop a C program to simulate the Linked file allocation strategies.

10 Develop a C program to simulate SCAN disk scheduling algorithm.

 BASAVESHWAR ENGINEERING COLLEGE, BAGALKOTE- 587 103
DEPARTMENT OF ARTIFICIAL INTELLIGENCE &
MACHINE LEARNING

B. V. V. S’s

Assessment Details (both CIE and SEE)

The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE)
is 50%. The minimum passing mark for the CIE is 40% of the maximum marks (20 marks out of
50) and for the SEE minimum passing mark is 35% of the maximum marks (18 out of 50 marks). A
student shall be deemed to have satisfied the academic requirements and earned the credits allotted
to each subject/ course if the student secures a minimum of 40% (40 marks out of 100) in the sum
total of the CIE (Continuous Internal Evaluation) and SEE (Semester End Examination) taken
together.

CIE for the theory component of the IPCC (maximum marks 50)
● IPCC means practical portion integrated with the theory of the course.
● CIE marks for the theory component are 25 marks and that for the practical component is
25 marks.
● 25 marks for the theory component are split into 15 marks for two Internal Assessment
Tests (Two Tests, each of 15 Marks with 01-hour duration, are to be conducted) and 10
marks for other assessment methods mentioned in 22OB4.2. The first test at the end of 40-
50% coverage of the syllabus and the second test after covering 85-90% of the syllabus.
● Scaled-down marks of the sum of two tests and other assessment methods will be CIE
marks for the theory component of IPCC (that is for 25 marks)
● The student has to secure 40% of 25 marks to qualify in the CIE of the theory component
of IPCC.
CIE for the practical component of the IPCC
● 15 marks for the conduction of the experiment and preparation of laboratory record, and
10 marks for the test to be conducted after the completion of all the laboratory sessions.
● On completion of every experiment/program in the laboratory, the students shall be
evaluated including viva-voce and marks shall be awarded on the same day.
 BASAVESHWAR ENGINEERING COLLEGE, BAGALKOTE- 587 103
DEPARTMENT OF ARTIFICIAL INTELLIGENCE &
MACHINE LEARNING

B. V. V. S’s

● The CIE marks awarded in the case of the Practical component shall be based on the
continuous evaluation of the laboratory report. Each experiment report can be evaluated for
10 marks. Marks of all experiments’ write-ups are added and scaled down to 15 marks.
● The laboratory test (duration 02/03 hours) after completion of all the experiments shall
be conducted for 50 marks and scaled down to 10 marks.
● Scaled-down marks of write-up evaluations and tests added will be CIE marks for the
laboratory component of IPCC for 25 marks.
● The student has to secure 40% of 25 marks to qualify in the CIE of the practical
component of the IPCC.
SEE for IPCC
Theory SEE will be conducted by University as per the scheduled timetable, with common question
papers for the course (duration 03 hours)
1. The question paper will have ten questions. Each question is set for 20 marks.
2. There will be 2 questions from each module. Each of the two questions under a module
(with a maximum of 3 sub-questions), should have a mix of topics under that module.
3. The students have to answer 5 full questions, selecting one full question from each
module.
4. Marks scored by the student shall be proportionally scaled down to 50 Marks

The theory portion of the IPCC shall be for both CIE and SEE, whereas the practical portion
will have a CIE component only. Questions mentioned in the SEE paper may include
questions from the practical component.