Operating System (OS), 2026-2027
Shiv Nadar University, Chennai, India, Section-AI-DS-B

Operating Systems: Understanding how software manages hardware resources, executes programs, and provides essential services for modern computing.
Profile

  Course Registration Expired

                               
Lec No. Topic Materials
1 Introduction to Operating System 13 July, Monday, 2026 PPT Syllabus
2 Introduction to Operating System 13 July, Monday, 2026
3 Introduction to Unix System Programing 17 July, Friday, 2026 PPT
4 Single-Processor Systems, Multiprocessor Systems, Clustered Systems, Multiprogramming and Multitasking 20 July, Monday, 2026 PPT
5 Operating-System Operations, Dual-Mode and Multimode Operation 20 July, Monday, 2026 PPT
6 Unix Basic Commands 24 July, Friday, 2026 PPT
7 System Calls, System Services, Linkers and Loaders 27 July, Monday, 2026 PPT
8 Process, Thread, Process Scheduling 27 July, Monday, 2026 PPT
9 Process Creation (fork) & Wait 31 July, Friday, 2026 PPT
10 Process Control Block and Schedular 03 August, Monday, 2026 PPT
11 Introduction to Thread 03 August, Monday, 2026 PPT Sample Code
12 Zombie Process and Orphan Process 07 August, Friday, 2026 PPT
13 Chain and Fan of Process Examaples 10 August, Monday, 2026 PPT
14 Wait & Waitpid 10 August, Monday, 2026 PPT Sample Codes with wait
15 Practice multi process and multi thread programs with global & local variables 14 August, Friday, 2026
16 Unix IPC 17 August, Monday, 2026 PPT Sample Codes
17 CPU Scheduling 17 August, Monday, 2026 PPT
18 Practice Pipe and FIFO Sample codes 21 August, Friday, 2026
19 Scheduling Criteria, Scheduling algorithm, FCFS, SJF 24 August, Monday, 2026 PPT
20 Quiz 1 24 August, Monday, 2026
21 Child and Parent Process with wait() 28 August, Friday, 2026 PPT
22 Round Robin, Priority, Multilevel Queue Scheduling and Multilevel Feedback Queue Scheduling Scheduling 31 August, Monday, 2026 PPT
23 Round Robin, Priority, Multilevel Queue Scheduling and Multilevel Feedback Queue Scheduling Scheduling 31 August, Monday, 2026
24 Implementation of Scheduling Algorithms 18 September, Friday, 2026
25 Synchronization tools: Critical Section, Peterson Solution, Hardware Support for Synchronization, Mutex 21 September, Monday, 2026 PPT
26 Mutex, Priority Inversion 21 September, Monday, 2026 PPT
27 More About Mutex 22 September, Tuesday, 2026 Sample Code
28 Semaphore 22 September, Tuesday, 2026 PPT
29 Dining Philosophers Problem 28 September, Monday, 2026 PPT
30 Deadlock Prevention, Avoidance & Recover 28 September, Monday, 2026 PPT
31 Main Memory, logical & Physical Memory, Contiguous Memory Alocation, Fragmentation, Paging 05 October, Monday, 2026 PPT
32 Page, Page-Table Base Register (PTBR), Translation Look-Aside Buffer (TLB), Shared Page, Hierarchical Paging, Swaping 05 October, Monday, 2026 PPT
33 Practice Semaphore and Mutex Codes shared in theroy classes 09 October, Friday, 2026
Total Theory Hours:20 Hours 0 Minutes, No. of Theory Classes: 24
Total Lab hours :15 Hours 0 Minutes, No. of Lab Classes: 9
Reference Books of OS-2026-2027 AI-DS-B
Silberschatz, A., Galvin, P. B., & Gagne, G. (2023). Operating system concepts (10th ed.). Wiley.
Kay A. Robbins, & Steve Robbins, UnixTM Systems Programming, Communications, concurrency, and Treads, Pearson Education

Assignments OS-2026-2027 AI-DS-B
1 Familization with Unix environment and basic shell: Please download the PDF and follow the instructions carefully. Open a fresh terminal. All commands used in Parts A, B, C and D, along with their outputs, must be pasted on the website or included in a PDF and uploaded to the LMS, depending on your instructor's instructions.
Published on : 2026-08-07, Last date of submission : 2026-08-07
2 Aadhaar number validation with parallel process: Develop a multithreaded C program using processes to validate a 12-digit Aadhaar number. The validation must be divided among three child processes. Write a Unix C program that accepts an Aadhaar number as input and creates three processes. Each process performs one stage of validation. Process 1 will check whether the input contains exactly 12 characters. Process 2 will check whether all characters are digits (0–9). Process 3 will run the Verhoeff checksum algorithm to determine whether the Aadhaar number is valid. The main parent process must wait for all three child processes using waitpid system call and then print the final result. Please find the Verhoeff checksum in the attachment
Published on : 2026-08-14, Last date of submission : 2026-08-14
3 Hospital Patient Monitoring System Using UNIX FIFO: Develop a UNIX-based Hospital Patient Monitoring System using named pipes (FIFO) for inter-process communication. The system consists of two independent processes: a Patient Monitoring Process and a Central Monitoring Process. The Patient Monitoring Process simulates patient-monitoring sensors and periodically generates patient information such as Patient ID, heart rate, oxygen saturation (SpO?), and body temperature. The monitoring process sends this information to the Central Monitoring Process through a named FIFO. The Central Monitoring Process reads the patient information from the FIFO and analyzes the patient's condition. If any parameter exceeds a predefined safe limit, the central monitor should generate an appropriate warning/alert message. The program should continue monitoring multiple patients and terminate gracefully when an appropriate termination message is received. The implementation must use UNIX system calls such as mkfifo(), open(), read(), write(), and close() for communication between the processes.
Published on : 2026-08-21, Last date of submission : 2026-08-21
4 Implement the First-Come, First-Served (FCFS) CPU Scheduling Alg: Your program should: Accept the number of processes from the user. Accept Process ID, Arrival Time (AT), and Burst Time (BT) for each process. Schedule processes according to FCFS. Calculate: Completion Time (CT) Turnaround Time (TAT) Waiting Time (WT) Display the Gantt Chart. Calculate and display the average Waiting Time and average Turnaround Time. Properly handle the situation where the CPU remains idle because no process has arrived. Test the program using at least two different sets of process inputs.
Published on : 2026-09-18, Last date of submission : 2026-09-18
5 Bank Account with Limited Service Counters: Develop a multithreaded Bank Customer Service System using mutexes and semaphores. A bank has 3 service counters, 10 customer threads, a shared bank account database, a maximum of 3 customers can be served simultaneously Each customer performs the following operations: 1. Deposits money. 2. Withdraws money. 3. Checks account balance. 4. Leaves the bank. The shared account balance must be protected from simultaneous updates. Your program must use a counting semaphore initialized to 3 to represent the three available service counters and a mutex to protect the shared account balance. Create 10 customer threads. Each customer performs at least 3 transactions. At most 3 customers should be inside the service area simultaneously. The account balance must never become inconsistent because of concurrent access. Display messages such as:
Customer 4 waiting for service...
Customer 4 acquired service counter 2
Customer 4 deposited 500Rs
Customer 4 withdrew 200Rs
Customer 4 released service counter

Published on : 2026-10-09, Last date of submission : 2026-10-09

Comments

  • Awesome course

  • Write Your Feedback on this Course