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

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 Programming 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 Sample Code
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-A
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-A
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 posix threads: Develop a multithreaded C program using POSIX threads (pthreads) to validate a 12-digit Aadhaar number. The validation must be divided among three independent threads. Write a Unix C program that accepts an Aadhaar number as input and creates three POSIX threads. Each thread performs one stage of validation. Thread 1 will check whether the input contains exactly 12 characters. Thread 2 will check whether all characters are digits (0–9). Thread 3 will run Verhoeff Checksum Validation Apply the Verhoeff checksum algorithm to determine whether the Aadhaar number is valid. The main thread must wait for all three threads using pthread_join() 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 Smart Traffic Light Control Using UNIX FIFO: Develop a UNIX-based Smart Traffic Light Control System using named pipes (FIFO) for inter-process communication. The system consists of two independent processes: a Traffic Sensor Process and a Traffic Controller Process. The Traffic Sensor Process simulates sensors installed at a road crossing and periodically generates the number of vehicles waiting on each road (North, South, East, and West). The sensor process sends this information to the Traffic Controller Process through a named FIFO. The Traffic Controller Process reads the traffic information from the FIFO and determines which direction should receive the green signal based on the traffic density. The controller should display the selected direction and the corresponding green-light duration. 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 Shortest Job First (SJF) CPU Scheduling Algorithm : Your program should: Accept the number of processes from the user. Accept Process ID, Arrival Time (AT), and Burst Time (BT). Select the shortest available process for execution. Implement non-preemptive SJF scheduling. Calculate: Completion Time (CT) Turnaround Time (TAT) Waiting Time (WT) Calculate and display the average Waiting Time and average Turnaround Time. Handle CPU idle time when no process is available. If two or more processes have the same Burst Time, use earlier Arrival Time as the tie-breaking criterion. Test the program using at least two different sets of process inputs. For each assignment, students should submit: C source code Sample input Sample output Calculation of average WT and TAT
Published on : 2026-09-18, Last date of submission : 2026-09-18
5 Producer–Consumer with mutex and semaphore: Design and implement a multithreaded Producer–Consumer system using POSIX threads, mutexes, and semaphores. The system has a shared buffer of size 5. There are 2 Producer threads, 2 Consumer threads and 1 shared circular buffer. Each producer generates integers continuously and inserts them into the buffer. Each consumer removes and processes an item. Your program must use pthread_create() for thread creation, A mutex to protect access to the shared circular buffer, A semaphore empty to represent the number of empty slots, A semaphore full to represent the number of filled slots
Published on : 2026-10-09, Last date of submission : 2026-10-09

Comments

  • intersting

  • Write Your Feedback on this Course