Operating Systems Course Code: 3330701
Operating Systems Course Code: 3330701
Course Curriculum
OPERATING SYSTEMS
(Code: 3330701)
1. RATIONALE
An operating system is the core software of any computer system. This is the basic software or
platform on which other software work. Every student of computer science and IT must therefore
understand basic structure of an operating system. After learning this subject student will be able to
discriminate between various types of operating systems, its processor, processes, and memory and
file management. The subject also emphasis on Linux utilities and scripting.
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P - Practical; C - Credit; ESE - End
Semester Examination; PA - Progressive Assessment
4. COURSE DETAILS
Major Learning Topics and Sub-topics
Outcomes (Course
Unit Outcomes in Cognitive
Domain according to
NBA terminology)
Unit – I 1a. Explain different 1.1 Need of operating system
Operating operating system 1.2 Evolution of operating system
System 1b. Explain types of 1.3 Operating systems
Concepts operating system i. Batch
ii. Multi programming
iii. Time Sharing
iv. Real Time
v. Multitasking
vi. Multithreading
1.4 Operating System Services
1.5 Case study
i. Linux
ii. Windows 7
Unit – II 2a. Describe process Process and Process management
Processor & model i. Process model overview
Process 2b. Describe process ii. Programmers view of process
Management state iii. Process states
2c. Compare processor 2.2 Process and Processor Scheduling
scheduling algorithm. i Scheduling Criteria
ii First Come First Serve
iii Round Robin
iv SJF
v SRTN
2d. Compare different 2.3 Schedulers
scheduler i Inter Process communication &
2e. Describe race a. synchronization
condition & mutual ii Race condition
exclusion iii Mutual Exclusion
iv Monitors
2f. Identify Deadlocks 2.4 Dead lock
2g. Apply Deadlock i Prevention
recovery procedure ii Avoidance
iii Detection and recovery
Unit – III 3a. Describe memory 3.1 Memory management
Memory management
Management 3b. Differentiate 3.2 Contiguous allocation
Contiguous and Non- i Partitioned memory allocation
contiguous memory ii Fixed & variable partitioning
3c. Differentiate physical iii Swapping
and virtual primary iv Relocation
memory v Protection and Sharing
3.3 Non contiguous allocation
i Page allocation
ii Segmentation
iii Virtual Memory
Legends: R = Remember; U = Understand; A = Apply and above levels (Bloom’s revised taxonomy)
Note: This specification table shall be treated as a general guideline for students and teachers.
The actual distribution of marks in the question paper may vary slightly from above table.
PowerPoint Presentation
Seminar based Presentation
Case study
8. SPECIAL INSTRUCTIONAL STRATEGY (If Any)
Concepts should be explained thoroughly in theory sessions and should be implemented in
laboratory appropriately along with the problem solving. Concept should be developed by
giving problems to students as assignments and in tutorials.