B.Tech Mathematics

CS 343                              Operating Systems                              3-0-0-6

Syllabus: Process Management: process, thread, scheduling; Concurrency: mutual exclusion, synchronization, semaphores, implementing of synchronization objects (uniprocessor and multiprocessor), deadlocks; Memory management: allocation, protection, hardware support, paging, segmentation; Virtual memory: demand paging, allocation, replacement, swapping, segmentation, TLBs; File Management: naming, file operations and their implementation; File systems: allocation, free space management, directory management, mounting; I/O management: device drivers, disk scheduling; Basics of security.

Texts:

1. Silberschatz, P. B Galvin and G. Gagne, Operating System Concepts, 9^th Edition, Wiley, 2012.
2. Anderson and M. Dahlin, Operating Systems: Principles and Practice, 2^nd Edition, Recursive Books, 2014.

References:

1. W. Stalling, Operating Systems: Internals and Design Principles, 9^th Edition, Pearson, 2018.
2. A. S. Tanenbaum, Modern Operating System, 4^th Edition, Pearson, 2015.
3. R. Love, Linux Kernel Development, 2^nd Edition, Addison-Wesley Professional, 2010.
4. D. P. Bovet and M. Cesati, Understanding the Linux Kernel, 3^rd Edition, O'Reilly & Associates, 2008.
5. J. Corbet, A. Rubini and G. Kroah-Hartman, Linux Device Drivers, 3^rd Edition, O'Reilly & Associates,
        2005.