DOC/LP/01/28.02.02 LP- IT2251 LAB PLAN LP Rev. No: 02 Date: 03.01.2014 Sub Code & Name : CS2257 & Operating Systems Laboratory 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 Executing fork, exec, sleep, getpid, exit, signal 2 a handling and wait system calls. 150m 2 2 b Executing close, stat, opendir, readdir system calls. 3 3 Executing create, open, read and write system calls 150 m 4 4 C programs to simulate UNIX commands like ls, grep 150 m 5a Implementation of Scheduling algorithms- FCFS 150 m 5,6 5b Implementation of Scheduling algorithms- SJF 150 m 6a Implementation of Scheduling algorithms- Priority 150m 7,8 6b Implementation of Scheduling algorithms- Robin 150m Developing Application using Inter Process 9 7 communication (using shared memory, pipes or 150 m message queues) Implementation of Producer Consumer problem using 10 8 150m semaphores. DOC/LP/01/28.02.02
DOC/LP/01/28.02.02 LAB PLAN LP- IT2251 LP Rev. No: 02 Date: 03.01.2014 Page 01 of 02 Sub Code & Name : CS2257 & Operating Systems Laboratory 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 No Exercise No Exercises Time Allocation 1 1 Study of operating system and basic unix commands 150m 2 2 a Executing fork, exec, sleep, getpid, exit, signal handling and wait system calls. 150m 2 b Executing close, stat, opendir, readdir system calls. 3 3 Executing create, open, read and write system calls 150 m 4 4 C programs to simulate UNIX commands like ls, grep 150 m 5,6 5a Implementation of Scheduling algorithms- FCFS 150 m 5b Implementation of Scheduling algorithms- SJF 150 m 7,8 6a Implementation of Scheduling algorithms- Priority 150m 6b Implementation of Scheduling algorithms- Robin 150m 9 7 Developing Application using Inter Process communication (using shared memory, pipes or message queues) 150 m 10 8 Implementation of Producer Consumer problem using semaphores. 150m DOC/LP/01/28.02.02