CSC405: Operating System Syllabus for CS 4th Sem 2017 Pattern Mumbai University

Operating System detailed syllabus scheme for Computer Engineering (CS), 2017 regulation has been taken from the University of Mumbai official website and presented for the Bachelor of Engineering students. For Course Code, Course Title, Test 1, Test 2, Avg, End Sem Exam, Team Work, Practical, Oral, Total, and other information, do visit full semester subjects post given below.

For all other Mumbai University Computer Engineering 4th Sem Syllabus 2017 Pattern, do visit CS 4th Sem 2017 Pattern Scheme. The detailed syllabus scheme for operating system is as follows.

Operating System Syllabus for Computer Engineering SE 4th Sem 2017 Pattern Mumbai University

Course Objectives:

For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.
.

Course Outcomes:

At the end of the course student should be able to

1. Understand role of Operating System in terms of process, memory, file and I/O management.
2. Apply and analyse the concept of a process, thread, mutual exclusion and deadlock.
3. Evaluate performance of process scheduling algorithms and IPC.
4. Apply and analyse the concepts of memory management techniques.
5. Evaluate the performance of memory allocation and replacement techniques.
6. Apply and analyze different techniques of file and I/O management.

Prerequisites:

Computer Organization & Architecture

Module 1

Operating System Overview Operating System Objectives and Functions, The Evolution of Operating Systems, OS Design Considerations for Multiprocessor and Multicore architectures, Operating system structures, System Calls, Linux Kernel and Shell. 8 hrs

Module 2

For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.
.

Module 3

Synchronization and Deadlocks Concurrency: Principles of Concurrency, InterProcess Communication, Process/Thread Synchronization. Mutual Exclusion: Requirements, Hardware Support, Operating System Support (Semaphores and Mutex), Programming Language Support (Monitors), Classical synchronization problems: Readers/Writers Problem, Producer and Consumer problem. Principles of Deadlock: Conditions and Resource Allocation Graphs, Deadlock Prevention, Deadlock Avoidance: Bankers Algorithm for Single & Multiple Resources, Deadlock Detection and Recovery. Dining Philosophers Problem. 12 hrs

Module 4

Memory Management Memory Management: Memory Management Requirements, Memory Partitioning: Fixed Partitioning, Dynamic Partitioning, Memory Allocation Strategies: Best-Fit, First Fit, Worst Fit, Next Fit, Buddy System, Relocation. Paging, Segmentation. Virtual Memory: Hardware and Control Structures, Demand Paging, Structure of Page Tables, Copy on Write, Page Replacement Strategies: FIFO, Optimal, LRU, LFU, Approximation, Counting Based. Allocation of frames, Thrashing. 8 hrs

Module 5

File Management File Management: Overview, File Organization and Access, File Directories, File Sharing, Secondary Storage Management, Linux Virtual File System. 6 hrs

Module 6

For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.
.

Text Books:

1. William Stallings, Operating System: Internals and Design Principles, Prentice Hall, 8th Edition, 2014, ISBN-10: 0133805913ISBN-13: 9780133805918 .
2. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, Operating System Concepts, John Wiley & Sons , Inc., 9th Edition, 2016, ISBN 978-81-265-5427-0
3. Andrew Tannenbaum, Operating System Design and Implementation, Pearson, 3rd Edition.
4. D.M Dhamdhere, Operating Systems: A Concept Based Approach, Mc-Graw Hill

Reference Books:

1. Maurice J. Bach, Design of UNIX Operating System, PHI
2. Achyut Godbole and Atul Kahate, Operating Systems, Mc Graw Hill Education, 3rd Edition
3. The Linux Kernel Book, Remy Card, Eric Dumas, Frank Mevel, Wiley Publications.

Assessment:

Internal Assessment Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when approx. 40% syllabus is completed and second class test when additional 40% syllabus is completed. Duration of each test shall be one hour. End Semester Theory Examination:

1. Question paper will comprise of 6 questions, each carrying 20 marks.
2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules.

For detail syllabus of all other subjects of Computer Engineering (CS) 4th Sem 2017 regulation, visit CS 4th Sem Subjects syllabus for 2017 regulation.