Syllabus B Tech Computer Science Fourth Semester Operating Systems CS405
The concepts developed in this course will aid in quantification of several concepts in Computer Science Engineering that have been introduced at the Engineering courses. Technology is being increasingly based on the latest Syllabus B Tech Computer Science Fourth Semester Operating Systems CS405 is given here.
The objective of this course “Syllabus B Tech Computer Science Fourth Semester Operating Systems CS405“ is to develop ability and gain insight into the process of problem-solving, with emphasis on thermodynamics. Specially in following manner: Apply conservation principles (mass and energy) to evaluate the performance of simple engineering systems and cycles. Evaluate thermodynamic properties of simple homogeneous substances. Analyze processes and cycles using the second law of thermodynamics to determine maximum efficiency and performance. Discuss the physical relevance of the numerical values for the solutions to specific engineering problems and the physical relevance of the problems in general and Critically evaluate the validity of the numerical solutions for specific engineering problems. More precisely, the objectives are:
- To enable young technocrats to acquire mathematical knowledge to understand Laplace transformation, Inverse Laplace transformation and Fourier Transform which are used in various branches of engineering.
- To introduce effective mathematical tools for the Numerical Solutions algebraic and transcendental equations.
- To acquaint the student with mathematical tools available in Statistics needed in various field of science and engineering.
CS 405 – Operating Systems
Memory Management: Different Memory Management Techniques – Partitioning, Swapping, Segmentation, Paging, Paged Segmentation, Comparison of these techniques, Techniques for supporting the execution of large programs: Overlay, Dynamic Linking and Loading, Virtual Memory – Concept, Implementation by Demand Paging etc..
Concurrent Processes : Real and Virtual Concurrency, Mutual Exclusion, Synchronization, Inter- Process Communication, Critical Section Problem, Solution to Critical Section Problem : Semaphores – Binary and Counting Semaphores, WAIT & SIGNAL Operations and their implementation. Deadlocks: Deadlock Problems, Characterization, Prevention, Avoidance, Recovery..
Practical List
1. Write a program to implement FCFS CPU scheduling algorithm.
2. Write a program to implement SJF CPU scheduling algorithm.
3. Write a program to implement Priority CPU Scheduling algorithm.
4. Write a program to implement Round Robin CPU scheduling algorithm.
5. Write a program to compare various CPU Scheduling Algorithms over different Scheduling Criteria.
6. Write a program to implement classical inter process communication problem(producer consumer).
7. Write a program to implement classical inter process communication problem(Reader Writers).
8. Write a program to implement classical inter process communication roblem(Dining_Philosophers).
9. Write a program to implement & Compare various page replacement algorithm.
10. Write a program to implement & Compare various Disk & Drum scheduling Algorithms
11. Write a program to implement Banker’s algorithms.
12. Write a program to implement Remote Proccedure Call(RPC).
13. Write a Devices Drivers for any Device or pheriperal.
Books Recommended
1. Silberschatz, Galvin, Gagne, “Operating System Concepts’’, Wiley, 9/E
2. William Stalling, “Operating Systems”, Pearson Education.
