Scribd
Upload
142 views

Cs 2257 Operating Systems Lab Syllabus

This document outlines 10 programming assignments for an operating systems lab course. The assignments involve writing programs using Unix system calls like fork, exec, getpid, and wait. Students will simulate Unix commands like ls and grep. They will analyze process scheduling algorithms like FCFS, SJF, priority, and round robin by generating Gantt charts and calculating metrics. Other assignments involve inter-process communication using shared memory, pipes, message queues, and semaphores. Students will also implement memory management schemes and a file allocation technique.

Uploaded by

saranyarajkumar
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
142 views

Cs 2257 Operating Systems Lab Syllabus

This document outlines 10 programming assignments for an operating systems lab course. The assignments involve writing programs using Unix system calls like fork, exec, getpid, and wait. Students will simulate Unix commands like ls and grep. They will analyze process scheduling algorithms like FCFS, SJF, priority, and round robin by generating Gantt charts and calculating metrics. Other assignments involve inter-process communication using shared memory, pipes, message queues, and semaphores. Students will also implement memory management schemes and a file allocation technique.

Uploaded by

saranyarajkumar
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

CS 2257 OPERATING SYSTEMS LAB (Common to CSE & IT)

(Implement the following on LINUX or other Unix like platform. Use C for high level language implementation) 1. Write programs using the following system calls of UNIX operating system: fork, exec, getpid, exit, wait, close, stat, opendir, readdir 2. Write programs using the I/O system calls of UNIX operating system (open, read, write, etc) 3. Write C programs to simulate UNIX commands like ls, grep, etc. 4. Given the list of processes, their CPU burst times and arrival times, display/print the Gantt chart for FCFS and SJF. For each of the scheduling policies, compute and print the average waiting time and average turnaround time. (2 sessions) 5. Given the list of processes, their CPU burst times and arrival times, display/print the Gantt chart for Priority and Round robin. For each of the scheduling policies, compute and print the average waiting time and average turnaround time. (2 sessions) 6. Developing Application using Inter Process communication (using shared memory, pipes or message queues) 7. Implement the Producer Consumer problem using semaphores (using UNIX system calls). 8. Implement some memory management schemes I 9. Implement some memory management schemes II 10. Implement any file allocation technique (Linked, Indexed or Contiguous) Linux could be loaded in individual PCs.

You might also like