Cs 2254 Operating System
CS 2254 OPERATING SYSTEM M T P C (Common to CSE & IT) 3 0 0 three or more
To understand the various areas of operating systems such as process managing, Memory management and I/O management.
PRODUCT I PROCEDURES AND POSTS 9
Introduction to operating systems – review of pc organization – operating system structures – system calls – system courses – program structure – virtual machines.
Processes: Procedure concept – Process arranging – Functions on processes – Working together processes – Interprocess conversation – Interaction in client-server systems. Case study: IPC in Linux.
Posts: Multi-threading types – Threading issues.
Case Study: Pthreads catalogue
UNIT 2 PROCESS SCHEDULING AND SYNC 10
CENTRAL PROCESSING UNIT Scheduling: Scheduling criteria – Scheduling methods – Multiple-processor scheduling – Real time organizing – Formula Evaluation. Case study: Process booking in Linux.
Process Sync: The critical-section problem – Synchronization equipment – Semaphores – Traditional problems of synchronization – critical areas – Displays. Deadlock: System model – Deadlock characterization – Techniques for handling deadlocks – Deadlock prevention – Deadlock avoidance – Deadlock detection – Recovery from deadlock.
PRODUCT III STORAGE SPACE MANAGEMENT being unfaithful
Memory Administration: Background – Swapping – Contiguous memory space allocation – Paging – Segmentation – Segmentation with paging.
Electronic Memory: Qualifications – Require paging – Process creation – Web page replacement – Allocation of frames – Thrashing.
Case Study: Memory managing in Apache
UNIT IV FILE SYSTEMS 9
File-System Interface: Record concept – Access strategies – Directory site structure – File system increasing – Protection.
File-System Execution: Directory setup – Share methods – Free-space supervision – efficiency and performance – recovery – log-structured data file systems. Case studies: File-system in Linux – file system in Or windows 7.
UNIT V I/O SYSTEMS 8
I/O Systems – I/O Components – App I/O software – nucleus I/O subsystem – avenues – efficiency.
Mass-Storage Composition: Disk scheduling – Disk management – Swap-space administration – REZZOU – drive attachment – stable safe-keeping – tertiary storage.
Case study: I/O in Linux
TOTAL: forty five PERIODS
TEXT MESSAGE BOOK:
1 ) Silberschatz, Galvin, and Gagne, " Operating System Concepts”, 6th Edition, Wiley India Pvt Ltd, 2003.
1 . Andrew T. Tanenbaum, " Modern Working Systems”, Second Edition, Pearson Education, 2004.
2 . Gary Nutt, " Operating Systems”, Third Model, Pearson Education, 2004. 3. Harvey M. Deital, " Operating Systems”, Third Model, Pearson Education, 2004.
CS 2257 OPERATING SYSTEMS RESEARCH LABORATORY L Capital t P C (Common to CSE & IT) zero 0 three or more 2
(Implement the following in LINUX or other Unix like program. Use C for higher level language implementation)
1 . Compose programs making use of the following system calls of UNIX os: fork, professional, getpid, get out of, wait, close, stat, opendir, readdir
installment payments on your Write programs using the I/O system cell phone calls of UNIX operating system (open, read, write, etc) 3. Write C programs to simulate UNIX commands like ls, grep, etc . 5. Given record of procedures, their CENTRAL PROCESSING UNIT burst moments and arrival times, display/print the Gantt chart to get FCFS and SJF. For each and every of the arranging policies, compute and produce the average holding out time and typical turnaround period. (2 sessions)
5. Offered the list of processes, their CPU broken times and arrival moments, display/print the Gantt chart for Goal and Circular robin. For each of the organizing policies, calculate and print the average ready time and normal...
References: 1 . Andrew T. Tanenbaum, " Modern Operating Systems”, Second Edition, Pearson
2 . Whilst gary Nutt, " Operating Systems”, Third Edition, Pearson Education, 2004.
three or more. Harvey Meters. Deital, " Operating Systems”, Third Copy, Pearson Education, 2004.