Implementation of Scheduling Algorithms- Priority

LAB PLAN LP-CS2257 Revision No: 01 Date: 31/12/2012 Sub code: CS2257 OPERATING SYSTEMS LAB Page 01 of 02 Branch: IT Semester: IV

Objective: Students acquire knowledge in shell programming, systems calls of UNIX operating system. They do programs to simulate UNIX commands. Students will also be able to write programs for processor scheduling and memory management schemes.

Session Exercise Exercises Time No No Allocation

1 1 Study of operating system and basic unix commands 150m

2 a Executing fork, exec, getpid, exit, wait system calls. 2 150m 2 b Executing close, stat, opendir, readdir system calls.

3 3 Executing open, read, write system calls 150 m

4 4 C programs to simulate UNIX commands like ls, grep 150 m

Implementation of Scheduling algorithms- FCFS 5a 150 m 5,6 Implementation of Scheduling algorithms- SJF 5b 150 m

6a Implementation of Scheduling algorithms- Priority 150m 7,8 Implementation of Scheduling algorithms- Round 6b 150m Robin Developing Application using Inter Process 9 7 communication (using shared memory, pipes 150 m or message queues) Implementation of Producer Consumer problem using 10 8 150m semaphores. LAB PLAN LP-CS2257 Revision No: 01 Date: 31/12/2012 Sub code: CS2257 OPERATING SYSTEMS LAB Page 01 of 02 Branch: IT,CS LAB PLAN LP-CS2257 Revision No: 01 Date: 31/12/2012 Sub code: CS2257 OPERATING SYSTEMS LAB Page 02 of 02 Branch: IT,CS Semester: IV

Implementation of memory management schemes 11 9 150m (Paging and Segmentation) Implementation of memory management schemes 12 10 150m (Allocation using First fit, Worst fit & Best Fit) Implement any file allocation technique (Linked, 13 11 150m Indexed or Contiguous)

14 Model practical exam 150m

Prepared by Approved by

Signature

A.Kala R.Saktheeswari Name U.Pooranima Prof. E.G.Govindan B.Lalithambigai

Designation AP-IT HOD-IT 31-12-2012 31-12-2012 Date