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

OSs were no longer just for engineers—they became intuitive and widely accessible. The story of the OS is a story of evolution — from machines that needed exact commands to smart systems that run everything from supercomputers to smartphones.
Profile

  Course Registration Expired

                                                                       
Lec No. Topic Materials
1 Introduction to Operating System 10 July, Thursday, 2025 PPT Syllabus
2 Single-Processor Systems, Multiprocessor Systems, Clustered Systems, Multiprogramming and Multitasking 11 July, Friday, 2025 Ref
3 Operating-System Operations, Dual-Mode and Multimode Operation 14 July, Monday, 2025 Galvin Ch1.
4 Introduction to Unix System Programming 15 July, Tuesday, 2025 PPT
5 System Calls, System Services, Linkers and Loaders 17 July, Thursday, 2025 Galvin Ch2.
6 Process, Thread, Process Scheduling 18 July, Friday, 2025 Ref
7 Context Switch, Operations of Process 21 July, Monday, 2025 PPT Zombie, Orphan
8 Unix Basic Commands 22 July, Tuesday, 2025 PPT
9 Process Creation (fork) & Wait 24 July, Thursday, 2025 PPT Sample Codes
10 Process Creation (fork) & Wait cont.. 25 July, Friday, 2025
11 Process Creation (fork) & Wait cont.. 28 July, Monday, 2025
12 Using the Shell & Meta Characters 29 July, Tuesday, 2025 PPT
13 Introduction to Thread 31 July, Thursday, 2025 PPT Sample Codes
14 Thread and Process on local and shared Variables 01 August, Friday, 2025 PPT Sample Codes
15 Multicore Programming: Programming Challenges, Amdahl’s Law, Types of Parallelism, Multithreading Models 04 August, Monday, 2025 Galvin Ch4.
16 Process, fork (upto slide 47) 05 August, Tuesday, 2025 PPT
17 Thread Issues 07 August, Thursday, 2025 PPT
18 CPU Scheduling 08 August, Friday, 2025 PPT Galvin Ch5.
19 Scheduling Criteria, Scheduling algorithm, FCFS, SJF 11 August, Monday, 2025 Galvin Ch5.
20 Round Robin Scheduling 14 August, Thursday, 2025 Galvin Ch5.
21 Priority Scheduling, Multilevel Queue Scheduling 18 August, Monday, 2025 Galvin Ch5.
22 Child & Parent Process with wait 19 August, Tuesday, 2025 PPT
23 Priority Scheduling, Multilevel Queue Schedulingicon 21 August, Thursday, 2025 Galvin Ch5.
24 Multilevel Feedback Queue Scheduling 22 August, Friday, 2025 Ref
25 Multi Processor Scheduling 25 August, Monday, 2025 PPT Galvin Ch5.
26 POSIX Thread 26 August, Tuesday, 2025 PPT
27 Realtime Scheduling 28 August, Thursday, 2025 PPT Galvin Ch5.
28 Realtime Scheduling (Cont) 29 August, Friday, 2025
29 Unix IO 02 September, Tuesday, 2025 PPT
30 Synchronization tools: Critical Section, Peterson Solution, Hardware Support for Synchronization, Mutex 04 September, Thursday, 2025 PPT Galvin Ch6.
31 Hardware Support for Synchronization, Atomic variable 05 September, Friday, 2025 Galvin Ch6.
31e Mid Sem 15 September, Monday, 2025
32 More About Mutex 18 September, Thursday, 2025 PPT
33 Semaphore 19 September, Friday, 2025 PPT
34 Dining Philospher Problem 22 September, Monday, 2025 PPT
35 Practice Program with mutex & Dead lock 23 September, Tuesday, 2025 PPT
36 Semaphore Example Program 25 September, Thursday, 2025
37 Critical Section & Semaphore 07 October, Tuesday, 2025 PPT Sample Codes
38 Deadlocks: System model - Deadlock characterization 09 October, Thursday, 2025 Ref
39 Mid Sem Answer Script discussion and Distribution 10 October, Friday, 2025
40 Deadlock Prevention, Avoidance & Reover 13 October, Monday, 2025 PPT
41 Investigate 3 programs dead_lock.c, live_lock1.c and live_lock2.cicon 14 October, Tuesday, 2025 PPT
42 Inter Process Communication 16 October, Thursday, 2025 PPT
43 Monitor & Dining Philospher Problem 17 October, Friday, 2025 PPT
45 Posix IPC 21 October, Tuesday, 2025 PPT
Reference Books of OS2025-2026
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 OS2025-2026
1 Basic Unix command and Shell: Please download the PDF and follow the instructions carefully. 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 : 2025-07-29, Last date of submission : 2025-07-29
2 Multiprocess and therad on digital signature:: In this task, you will create a text file containing your registration number, generate an RSA 2048-bit key pair, and sign the file with SHA-256 using your private key. The signature will be converted to Base64 format. You will also write a C program that uses process creation (fork + exec) and thread creation (pthread_create) to process the generated signature file (e.g., counting vowels in file.sig.b64). This exercise combines cryptography concepts with concurrent programming in Linux. Please find the attachment for further details.
Published on : 2025-08-19, Last date of submission : 2025-08-19
3 Thread-safe Shared Counter and File Logger using Mutexes: In this assignment, you will build a multithreaded C program that demonstrates how mutexes (mutual exclusion locks) prevent race conditions when multiple threads access shared data or resources. You will implement a shared counter updated by several worker threads and a common log file to which each thread writes its progress. You will run the program with and without mutex protection to observe the difference.
Published on : 2025-09-23, Last date of submission : 2025-09-23

Comments

  • Very interesting sessions every time you take ! Keep it up Sir !!

  • Course is fine only but ...

  • How to remove comments ?

  • Write Your Feedback on this Course

     

    • rourab

    rourab paul

    Elementum purus morbi
    • Kolkata, West Bengal, India
    • +91-7980185683
    • rourabpaul@gmail.com
    rourab social network

      Carl Sagan

      We are the representatives of the cosmos; we are an example of what hydrogen atoms can do, given 15 billion years of cosmic evolution.

    • Carl Sagan

      Extraordinary claims require extraordinary evidence