ANNA UNIVERSITY: CHENNAI 600 025

B.E/B.Tech DEGREE EXAMINATIONS, APRIL/MAY 2013

Regulations 2008
Fourth Semester
Common to B.E (CSE) / B.Tech(IT)
CS2257 Operating System Lab
Time: 3Hours Maximum Marks: 100


1. a. Write and execute a programs using system calls fork and pid and execute an ls
command with proper exception handling mechanisms using other necessary process
system calls (70)
b. Write a program to retrieve and print file attributes using stat (30)


2. Write a program using I/O System calls to copy contents from one file to other (100)


3. Write a C program to simulate UNIX commands
a. sed (sed i s/old/new file.txt) (70)
b. ls (30)


4. Write a C program to simulate UNIX commands
a. grep (grep this file.txt) (50)
b. cat (50)


5. Take a list of processes, their CPU burst times and arrival times and display the Gantt
chart for SJ F scheduling. Also compute and print the average waiting time and
average turn-around time (100)
6. Take a list of processes, their CPU burst times and arrival times and display the Gantt
chart for Priority based Scheduling. Also compute and print the average waiting time
and average turn-around time. (100)


7. Using semaphores implement Producer- Consumer problem (100)


8. Develop an application and demonstrate how Message queue is used in Inter process
communication (100)


9. Illustrate with a program how memory management is done using LRU page
replacement algorithm. (100)


10. Write a C program to implement Linked File allocation technique. (100)


11. Receive number of segments, size and memory requirement then perform Best fit
memory management and display the contents. (100)


12. Develop an application and demonstrate how Shared Memory Inter process
communication is done (100)


13. Write a C program to implement Contiguous File allocation technique. (100)


14. Receive number of segments, size and memory requirement then perform First fit
memory management and display the contents. (100)


15. Take a list of processes, their CPU burst times and arrival times and display the Gantt
chart for FCFS scheduling. Also compute and print the average waiting time and
average turn-around time (100)


16. Take a list of processes, their CPU burst times and arrival times and display the Gantt
chart for Round robin scheduling. Also compute and print the average waiting time
and average turn-around time (100)


17. Illustrate with a program how memory management is done using FIFO page
replacement algorithm. (100)


18. a. Write and execute a programs using system calls fork and pid and execute an who
command with proper exception handling mechanisms using other necessary process
system calls (70)
b. Write a program to Open and Read directory and display using appropriate system
calls (30)


19. Develop an application which does file read and write using Inter process
communication using pipes (100)


20. Write a program using System calls to receive a string and file name and create a
copy of the file eliminating the string given as input (100)