Course Curriculam

Course Code: CSE202 Credit Units L T P/S SW AS/DS FW No. of PSDA Total Credit Unit
Course Level UG 3 0 2 0 0 0 0 4
Course Title Operating System

Course
Description :

Course Objectives :

SN
Objectives
.
After successfully completing the course, students will be able to Provides insight to Operating general purpose computers, Overcome challenges
1 they face in real world use of computers. Understand how memory is managed. In different Operating Systems,Understands the characteristics on
which choice of Operating Systems depends, Understand how files and processes are managed on a computer.

Pre-Requisites : General

SN. Course Code Course Name

Course Contents / Syllabus :

SN. Module Descriptors / Topics Weightage

Introduction Operating system and function, Evolution of operating system, Batch, Interactive, multiprogramming, Time Sharing
1 to operating and Real Time System, multiprocessor system, Distributed system, System protection. Operating System structure, 15.00
system Operating System Services, System Program and calls.
Process concept, State model, process scheduling, job and process synchronization, structure of process
management, Threads. Interprocess Communication and Synchronization: Principle of Concurrency, Producer
Process Consumer Problem, Critical Section problem, Semaphores, Hardware Synchronization, Critical Regions, Conditional
2 Managemen critical region, Monitor, Inter Process Communication. CPU Scheduling: Job scheduling functions, Process 25.00
t scheduling, Scheduling Algorithms, Non Preemptive and preemptive Strategies, Algorithm Evaluation, Multiprocessor
Scheduling. Deadlock: System Deadlock Model, Deadlock Characterization, Methods for handling deadlock,
Prevention strategies, Avoidance and Detection, Recovery from deadlock combined approach.
Memory Single Contiguous Allocation: H/W support, S/W support, Advantages and disadvantages, Fragmentation, Paging,
3 Managemen Segmentation, Virtual memory concept, Demand paging, Performance, Paged replaced algorithm, Allocation of 25.00
t frames, Thrashing, Cache memory, Swapping, Overlays
Device
Principles of I/O hardware, Device controller, Device Drivers, Memory mapped I/O, Direct Access Memory, Interrupts,
4 managemen 15.00
Interrupt Handlers, Application I/O interface, I/O Scheduling, Buffering, Caching, Spooling,
t
File System
and File Concept, File Organization and Access Mechanism, File Directories, Basic file system, File Sharing, Allocation
5 20.00
Protection method, Free space management.Policy Mechanism, Authentication, Internal excess Authorization.
and security

Course Learning Outcomes :

SN. Course Learning Outcomes

1 • learn basic concepts and responsibilities of operating system
2 • Design, and implement various CPU scheduling, deadlocks and synchronization algorithm.
3 Discuss, restate, and apply concepts of memory management
4 Analyze and evaluate various I/O component of computing system
5 Identify and demonstrate different storage management techniques and protection policies

Pedagogy for Course Delivery :

SN. Pedagogy Methods

• The class will be taught using online teaching covering theory and case based method. In addition to assigning the case studies, the course
1 instructor will spend considerable time in understanding the concept of innovation through the eyes of the consumer. The instructor will cover the
ways to think innovatively liberally using thinking techniques.

Theory /VAC / Architecture Assessment (L,T & Self Work): 75.00 Max : 100

Attendance+CE+EE : 5+35+60

SN. Type Component Name Marks

1 Attendance 5.00
2 End Term Examination (OMR) 60.00
3 Internal CLASS TEST 15.00
4 Internal CLASS QUIZ 10.00
5 Internal HOME ASSIGNMENT 10.00

Lab/ Practical/ Studio/Arch. Studio/ Field Work Assessment : 25.00 Max : 100

Attendance+CE+EE : 5+35+60

SN. Type Component Name Marks

1 Attendance 5.00
2 External VIVA VOCE 30.00
3 External PRACTICAL 30.00
4 Internal VIVA VOCE 10.00
5 Internal PRACTICAL / LAB RECORDS 15.00
6 Internal PERFORMANCE 10.00

Lab/ Practical details, if applicable :

SN
Lab / Practical Details
.
1 Use of Basic UNIX Shell Commands/Linux Commands.
2 Commands related to inode, I/O redirection and piping, process control commands, mails
Shell Programming: Shell script exercises based on following: (i) Interactive shell scripts (ii) (ii) Positional parameters (iii) Arithmetic (iv) if-then-fi, if-
3
then- else-fi, nested if-else (v) Logical operators (vi) else + if equals elif, case structure (vii) while, until, for loops, use of break
4 Write a shell script that accept a file name starting and ending line numbers as arguments and display all the lines between given line no.
5 Write a shell script that delete all lines containing a specified word.
6 Write a shell script that displays a list of all the files in the current directory
7 Simulation of Unix commands using C.
8 Implement the following CPU Scheduling Algorithms. i) FCFS ii) Shortest Job First.
9 Implement the following CPU Scheduling Algorithms. i) Round Robin ii) priority based

List of Professional skill development activities :

No.of PSDA : 0
SN. PSDA Point

Text & References :

SN. Type Title/Name Description ISBN/ URL

1. Milenekovic, “Operating System
1 Book
Concepts”, McGraw Hill
2. A. Silberschatz, P.B. Galvin “Operating
2 Book
System Concepts”, John Willey & son
2. Tannenbaum, “Operating system design
3 Book
and implementation”, PHI
8. YashwantKantikar, “Shell Programming”,
4 Book
PBP Publication.
5. B. W. Kernighan & R. Pike, “The UNIX
5 Book Programming Environment” Prentice Hall of
India, 2000
Willam Stalling “ Operating system”
6 Book
Pearson Education
Sumitabha Das “ Your UNIX The ultimate
7 Book
guide” Tata Mcgraw Hill