Scribd
Upload
98 views5 pages

Operating Systems

This document provides information about an undergraduate course on operating systems. The 4 credit course includes 3 hours of lectures and 2 hours of practical sessions per week. The course objectives are to provide an understanding of general purpose computers, challenges in real world computer use, memory management in different operating systems, and how files and processes are managed. The course covers topics like introduction to operating systems, process management, memory management, device management, and file systems and security. Assessment includes a final exam worth 60% and continuous assessment worth 40%. Labs involve simulations of operating system concepts and algorithms.

Uploaded by

neegaah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
98 views5 pages

Operating Systems

This document provides information about an undergraduate course on operating systems. The 4 credit course includes 3 hours of lectures and 2 hours of practical sessions per week. The course objectives are to provide an understanding of general purpose computers, challenges in real world computer use, memory management in different operating systems, and how files and processes are managed. The course covers topics like introduction to operating systems, process management, memory management, device management, and file systems and security. Assessment includes a final exam worth 60% and continuous assessment worth 40%. Labs involve simulations of operating system concepts and algorithms.

Uploaded by

neegaah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Course Title: Operating Systems

Credit Units: 04 Course Level: UG


Course Code: CSE202
L T P/ SW/F TOTAL
S W CREDIT
UNITS
3 - 2 0 4

Course Objectives:
After successfully completing the course, students will be able to Provides insight to Operating general purpose computers, Overcome
challenges 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: Basic Knowledge of Introduction to Computer and Programming in C.

Course Contents/Syllabus:
Weightage (%)
Module I: Introduction to operating system: 15
Operating system and function, Evolution of operating system, Batch, Interactive, multiprogramming, Time Sharing
and Real Time System, multiprocessor system, Distributed system, System protection. Operating System structure,
Operating System Services, System Program and calls.
Module II: Process Management

Process concept, State model, process scheduling, job and process synchronization, structure of process 25
management, Threads.
Interprocess Communication and Synchronization: Principle of Concurrency, Producer Consumer Problem,
Critical Section problem, Semaphores, Hardware Synchronization, Critical Regions, Conditional critical region,
Monitor, Inter Process Communication.
CPU Scheduling: Job scheduling functions, Process 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.

Module III :Memory Management 25


Single Contiguous Allocation: H/W support, S/W support, Advantages and disadvantages, Fragmentation, Paging,
Segmentation, Virtual memory concept, Demand paging, Performance, Paged replaced algorithm, Allocation of
frames, Thrashing, Cache memory, Swapping, Overlays

Module IV : Device management 15


Principles of I/O hardware, Device controller, Device Drivers, Memory mapped I/O, Direct Access Memory,
Interrupts, Interrupt Handlers, Application I/O interface, I/O Scheduling, Buffering, Caching, Spooling,

Module V: File System and Protection and security 20


File Concept, File Organization and Access Mechanism, File Directories, Basic file system, File Sharing,
Allocation method, Free space management. Policy Mechanism, Authentication, Internal excess Authorization.
Course Learning Outcomes: After completion of this course student will be able to

 learn basic concepts and responsibilities of operating system


 Design, and implement various CPU scheduling, deadlocks and synchronization algorithm.
 Discuss, restate, and apply concepts of memory management
 Analyze and evaluate various I/O component of computing system
 Identify and demonstrate different storage management techniques and protection policies

Pedagogy for Course Delivery:


 The class will be taught using online teaching covering theory and case based method. In addition to assigning the case studies, the
course 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.

LAB

.
1. Use of Basic UNIX Shell Commands/Linux Commands.
2. Commands related to inode, I/O redirection and piping, process control commands, mails
3. Shell Programming: Shell script exercises based on following:
(i) Interactive shell scripts
(ii) (ii) Positional parameters
(iii) Arithmetic
(iv) if-then-fi, if-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 Open-Ended Program


1. Write a script which will shows all running process on your linux system boots up.
2. WAP to generate maximum number of child process in your system and with the help of program explain what are Zombie process.
3. WAP for your own Signal Handler which will execute when you type CTRL+D

Assessment/ Examination Scheme:

Theory L/T (%) Lab/Practical/Studio (%) Total

75 25 100

B.Tech Theory Assessment (L&T):

Continuous Assessment/Internal Assessment 40% End Term Examination


60%
Components (Drop down) Attendance Class Test Assignment Quiz EE
Weightage (%) 5 15 10 10 60

Lab/ Practical/ Studio Assessment:

Continuous Assessment/Internal Assessment 40% End Term Examination 60%


Components (Drop down Performance Lab Record Viva Attendance Practical viva
Weightage (%) 10 15 10 5 30 30

Text & References:


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

You might also like