OS Lab Roadmap — 23CM4212

OS Lab (23CM4212) — Operating Systems Component Text: Silberschatz, Galvin & Gagne — OS Concepts, 10th Ed. | Platform: Linux (GCC + Bash) 📄 View Full Lab Syllabus

CO1 Shell Programming & System Calls

Wks 1–2

Exp 1 · Week 1 Basic Shell Commands

Exp 2 · Week 1 Shell Programming: Logic Programs

Exp 3 · Week 2 Process Creation using fork() & IPC

CO2 Scheduling, Sync & Deadlock

Wks 3–6

Exp 4 · Weeks 3–4 CPU Scheduling (FCFS, SJF)

Exp 5 · Week 4 Dining Philosophers using Semaphore

Exp 6 · Week 5 Producer-Consumer using Monitor

Exp 7 · Week 6 Deadlock Detection & Banker's Algorithm

CO3 Page Replacement & Virtual Memory

Wks 7–8

Exp 8 · Week 7 Page Replacement Algorithms (FIFO, Optimal, LRU)

Exp 9 · Week 8 Virtual Memory Simulation

CO4 Memory & File Management

Wks 9–11

Exp 10 · Week 9 First Fit & Best Fit Memory Allocation

Exp 11 · Week 10 Contiguous File Allocation Method

Exp 12 · Week 11 Bitmap for Memory Management

CO1 – Shell & System Calls

CO2 – Scheduling, Sync & Deadlock

CO3 – Virtual Memory & Page Replacement

CO4 – Memory & File Management

💡 Click any experiment box to view CO-PO mapping details

Weekly Teaching Plan — OS Lab (23CM4212)

OS handled by Mrs. N. Saketha Sri | CN handled by CN faculty (co-faculty slot) | Lab: Every Monday 1:00–3:30 PM

Week	Date (2026)	Part	Experiment No. & Title	CO	PO Mapped	Tools
Wk 1 29 Jun	29-Jun-2026	OS	Exp 1: Basic Shell Commands — ls, pwd, cd, mkdir, rm, chmod, chown, man Exp 2: Shell Scripts — menu-driven (select), count vowels/chars/lines in file	CO1	PO1, PO2, PO3, PO9, PO10, PO12	Linux Terminal (Bash)
Wk 1 29 Jun	29-Jun-2026	CN	Study of network cables & connectors; Crimping tool practice	CO3	PO1–PO3, PO9	Crimping tool
Wk 2 06 Jul	06-Jul-2026	OS	Exp 3: Process Creation — fork(), getpid(), getppid(); Create P1 & P2; P1 sends string → P2 concatenates without string function → returns to P1	CO1	PO1, PO2, PO3, PO9, PO10, PO12	GCC / C on Linux
Wk 2 06 Jul	06-Jul-2026	CN	Networking commands (ping, ifconfig, netstat, traceroute)	CO3	PO1–PO3	Linux Terminal
Wk 3 13 Jul	13-Jul-2026	OS	Exp 4 (Part 1): CPU Scheduling — FCFS: washing machine example (P1–P4, AT:1,5,9,10 / BT:4,3,5,2). Calculate waiting time, TAT, CPU idle time	CO2	PO1, PO2, PO3, PO4, PO9, PO10, PO11, PO12	GCC / C on Linux
Wk 3 13 Jul	13-Jul-2026	CN	Packet Tracer — Peer-to-Peer network connection	CO3	PO1–PO5	Cisco Packet Tracer
Wk 4 20 Jul	20-Jul-2026	OS	Exp 4 (Part 2): SJF Scheduling — given process set, calculate average waiting/response/TAT time Exp 5: Dining Philosophers using Semaphore — synchronize 5 philosophers	CO2	PO1, PO2, PO3, PO4, PO9, PO10, PO11, PO12	GCC / C on Linux
Wk 4 20 Jul	20-Jul-2026	CN	Packet Tracer — Static routing configuration	CO3	PO1–PO5	Cisco Packet Tracer
Wk 5 27 Jul	27-Jul-2026	OS	Exp 6: Producer-Consumer problem using Monitor — synchronize producer and consumer processes	CO2	PO1, PO2, PO3, PO4, PO9, PO10, PO11, PO12	GCC / C on Linux
Wk 5 27 Jul	27-Jul-2026	CN	LAN topologies — bus, star, ring; IP addressing; basic connectivity	CO3	PO1–PO5	Cisco Packet Tracer
Wk 6 03 Aug	03-Aug-2026	OS	Exp 7: Deadlock — given allocation & max matrix: (i) Calculate Need matrix (ii) Check safe/unsafe state (iii) Detect deadlock (iv) Identify deadlocked processes	CO2	PO1, PO2, PO3, PO4, PO9, PO10, PO11, PO12	GCC / C on Linux
Wk 6 03 Aug	03-Aug-2026	CN	CRC Algorithm implementation in C	CO4	PO1–PO5	GCC / C
Wk 7 10 Aug	10-Aug-2026	OS	Exp 8: Page Replacement Algorithms — Reference string: 1,2,1,3,7,4,5,6,3,1,2,4,6,3,1 (3 frames). Simulate FIFO, Optimal, LRU. Find policy with least page faults.	CO3	PO1, PO2, PO3, PO4, PO5, PO7, PO8, PO9, PO10, PO11, PO12, PSO1, PSO2	GCC / C on Linux
Wk 7 10 Aug	10-Aug-2026	CN	RIP routing — 3-router topology (RouterA, B, C)	CO4	PO1–PO5	Cisco Packet Tracer
⚠️ MID-1 EXAM — 20 August 2026 \| Revise Exps 1–7 thoroughly before exam \| Lab record must be up to date
Wk 8 24 Aug	24-Aug-2026	OS	Exp 9: Virtual Memory Simulation — demand paging, page table management, frame allocation	CO3	PO1, PO2, PO3, PO4, PO5, PO7, PO8, PO9, PO10, PO11, PO12, PSO1, PSO2	GCC / C on Linux
Wk 8 24 Aug	24-Aug-2026	CN	OSPF routing — university campus multi-building topology	CO4	PO1–PO5	Cisco Packet Tracer
Wk 9 31 Aug	31-Aug-2026	OS	Exp 10: Memory Management — implement First Fit and Best Fit allocation algorithms. Show memory utilization and fragmentation.	CO4	PO1, PO2, PO3, PO4, PO5, PO7, PO8, PO9, PO10, PO11, PO12, PSO1, PSO2	GCC / C on Linux
Wk 9 31 Aug	31-Aug-2026	CN	DHCP server configuration — router as DHCP server for 3+ PCs	CO4	PO1–PO5	Cisco Packet Tracer
Wk 10 07 Sep	07-Sep-2026	OS	Exp 11: Contiguous File Allocation — simulate sequential, indexed, and linked file allocation. Show file block mapping.	CO4	PO1, PO2, PO3, PO4, PO5, PO7, PO8, PO9, PO10, PO11, PO12, PSO1, PSO2	GCC / C on Linux
Wk 10 07 Sep	07-Sep-2026	CN	TCP vs UDP analysis using Wireshark — capture & compare performance	CO4	PO1–PO5	Wireshark
Wk 11 14 Sep	14-Sep-2026	OS	Exp 12: Bitmap for Memory Management — 32-block memory, allocated blocks: 2,3,4,5,8,9,10,11,12. Display bitmap pattern and free block status.	CO4	PO1, PO2, PO3, PO4, PO5, PO7, PO8, PO9, PO10, PO11, PO12, PSO1, PSO2	GCC / C on Linux
Wk 11 14 Sep	14-Sep-2026	CN	CN Lab revision / additional exercises	CO4	—	—
⚠️ MID-2 EXAM — 15 October 2026 \| Revise all 12 OS experiments \| Prepare lab record & viva answers
Wk 12+ Sep–Oct	Sep–Oct 2026	OS	★ Lab Revision + Viva Preparation — Code walkthrough, common viva Q&A, output verification for all 12 experiments. Lab exam preparation.	CO1–CO4	PO1–PO5	All tools
🎯 LAB END EXAM — 29 October 2026 \| Duration: 3 Hours \| Marks: 50

CO-PO Mapping Matrix

Source: 23CM4212 Syllabus, R23 Regulation, ANITS | Scale: 3 = High 2 = Medium 1 = Low – = No Relation

CO	PO1	PO2	PO3	PO4	PO5	PO6	PO7	PO8	PO9	PO10	PO11	PO12	PSO1	PSO2	Avg
CO1	3	3	2	–	–	–	–	–	2	1	–	2	–	–	2.20
CO2	3	3	3	2	–	–	–	–	2	2	1	2	–	–	2.38
CO3	3	3	3	2	2	–	1	1	2	2	1	2	1	1	1.92
CO4	2	3	3	3	2	–	1	1	2	2	1	2	1	1	1.92
Avg	2.75	3.00	2.75	2.33	2.00	–	1.00	1.00	2.00	1.75	1.00	2.00	1.00	1.00

3 = High Correlation

2 = Medium Correlation

1 = Low Correlation

– = No Relation

Experiment → CO Mapping

Exp	Experiment Title	Week	CO	POs Addressed	Theory Unit Link	Difficulty
1	Basic Shell Commands	Wk 1	CO1	PO1, PO2, PO3, PO9, PO10, PO12	OS Unit 1 – Intro	⭐
2	Shell Programming: Logic Programs	Wk 1	CO1	PO1, PO2, PO3, PO9, PO10, PO12	OS Unit 1 – Shell	⭐⭐
3	Process Creation – fork() & IPC	Wk 2	CO1	PO1, PO2, PO3, PO9, PO10, PO12	OS Unit 1 – Processes	⭐⭐
4	CPU Scheduling (FCFS, SJF)	Wks 3–4	CO2	PO1–PO4, PO9, PO10, PO11, PO12	OS Unit 2 – CPU Sched	⭐⭐⭐
5	Dining Philosophers using Semaphore	Wk 4	CO2	PO1–PO4, PO9, PO10, PO11, PO12	OS Unit 3 – Sync	⭐⭐⭐
6	Producer-Consumer using Monitor	Wk 5	CO2	PO1–PO4, PO9, PO10, PO11, PO12	OS Unit 3 – Sync	⭐⭐⭐
7	Deadlock – Banker's Algorithm	Wk 6	CO2	PO1–PO4, PO9, PO10, PO11, PO12	OS Unit 3 – Deadlock	⭐⭐⭐
8	Page Replacement Algorithms	Wk 7	CO3	PO1–PO5, PO7–PO12, PSO1, PSO2	OS Unit 4 – Virtual Mem	⭐⭐⭐
9	Virtual Memory Simulation	Wk 8	CO3	PO1–PO5, PO7–PO12, PSO1, PSO2	OS Unit 4 – Virtual Mem	⭐⭐⭐
10	First Fit & Best Fit Allocation	Wk 9	CO4	PO1–PO5, PO7–PO12, PSO1, PSO2	OS Unit 4 – Mem Mgmt	⭐⭐⭐
11	Contiguous File Allocation	Wk 10	CO4	PO1–PO5, PO7–PO12, PSO1, PSO2	OS Unit 5 – File Systems	⭐⭐⭐
12	Bitmap for Memory Management	Wk 11	CO4	PO1–PO5, PO7–PO12, PSO1, PSO2	OS Unit 4 – Mem Mgmt	⭐⭐

Course Outcomes (COs)

CO1 — Shell Programming & System Calls

Execute the UNIX shell programming on the given system configuration and acquire skills in the various devices provided by the system calls.

Exps 1, 2, 3 · Weeks 1–2

CO2 — Scheduling, Sync & Deadlock

Simulate the process scheduling, process synchronization, deadlock avoidance and detection algorithms and simulate memory management techniques and file handling.

Exps 4, 5, 6, 7 · Weeks 3–6

CO3 — Page Replacement & Virtual Memory

Simulate and analyze page replacement algorithms (FIFO, Optimal, LRU) and virtual memory management to understand demand paging concepts.

Exps 8, 9 · Weeks 7–8

CO4 — Memory & File Management

Simulate and implement memory allocation strategies (First Fit, Best Fit), file allocation methods (Contiguous), and memory bitmap management.

Exps 10, 11, 12 · Weeks 9–11

Program Outcomes (POs) — NBA Graduate Attributes

PO1 — Engineering Knowledge

Apply knowledge of maths, science and CS fundamentals to solve OS-related problems.

PO2 — Problem Analysis

Identify, formulate and analyze complex OS problems using scientific principles.

PO3 — Design / Development

Design and develop simulation programs for OS algorithms satisfying specified needs.

PO4 — Investigation

Conduct experiments, analyze results (scheduling/memory algorithms) to reach valid conclusions.

PO5 — Modern Tool Usage

Use Linux, GCC, Bash and simulation tools for complex OS lab activities.

PO6 — Engineer & Society

Assess societal impact of OS design choices in engineering practice.

PO7 — Environment & Sustainability

Understand the environmental impact of computing resource management.

PO8 — Ethics

Apply ethical principles in system software development and data handling.

PO9 — Individual & Team Work

Function effectively as individual and team member in lab exercises.

PO10 — Communication

Communicate findings through lab records, viva and written reports effectively.

PO11 — Project Management

Apply time and resource management in completing lab experiments systematically.

PO12 — Life-long Learning

Recognise the need for continuous learning in evolving OS and system programming domains.

Program Specific Outcomes (PSOs)

PSO1 — Computing Applications

Apply fundamental and emerging computing concepts to analyse, design and develop software solutions — including OS-level programs.

PSO2 — Industry-Ready Skills

Use modern tools and programming languages (C, Linux) to deliver industry-standard solutions for real-world OS and systems problems.