ANNA UNIVERSITY: CHENNAI 600 025

B.E/B.Tech DEGREE EXAMINATIONS, OCTOBER - 2016

Regulations 2013
Fourth Semester
(B.E Computer Science and Engineering)
SUBJECT CODE: CS6413
SUBJECT NAME: OPERATING SYSTEM LAB
YEAR/SEM/ BRANCH: II/IV/ CSE
DATE/SESSION: 24.10.16/ AN

MARK ALLOTMENT

INTERNAL EXAMINER

Aim & Algorithm

: 20

Program

: 40

Output & Result

: 30

Viva voce

: 10

Total

: 100

EXTERNAL EXAMINER

ANNA UNIVERSITY: CHENNAI 600 025

B.E/B.Tech DEGREE EXAMINATIONS, OCTOBER - 2016

Regulations 2013
Fourth Semester
(B.E Computer Science and Engineering)
CS6413 Operating Systems Lab
Time: 3Hours

Maximum Marks: 100

1. Write a UNIX command and Shell program for the following and perform the suitable
operations:
a. List the files and directory.
b. Find the user of the system
c. Display the Date and Calender
d. Write the Shell program for arithmetic operations
e. Write the shell script for multiplication table
(100)
2. Write a UNIX to create a menu with the following and perform the operations.
a. Count the number of alphabets in a string.
b. Display the names of all ordinary files from the current directory and all its
subdirectories whose names end in sing.
c. Search the key element in a list of numbers.
(100)
3. Write a shell script to perform the following using a menu:
a. Create a file detail which contains the names of those files in the current
directory which begin with cat.
b. Locate the ordinary files that have been created exactly one day before and
whose names begin with c and copy them to the user directory
c. Check if the given input string is odd or even not.
(100)
4. Write a C program to implement First Come First Serve CPU scheduling algorithm
where processes arrive at different timings. Display the following
results in a table
format.
a. Arrival time and Burst time of every process.
b. Waiting time and turnaround time of every process.
c. Average waiting time and turnaround time.
(100)

5. Write a C program to implement Round Robin CPU scheduling algorithm with

quantum time 5 time units. Processes do not arrive at the same time. Display the
following results in a table format.
a. Arrival time and Burst time of every process.
b. Waiting time and turnaround time of every process.
c. Average waiting time and turnaround time.
(100)
6. Write a C program to implement Shortest Job First CPU scheduling algorithm where
Processes do not arrive at the same time. Display the following results in a table
format.
a.
b.
c.
d.

Arrival time and Burst time of every process.

Waiting time and turnaround time of every process.
Average waiting time and turnaround time.
Total idle time of the processor.
(100)

7. Write a C program to implement Priority CPU scheduling algorithm where

Processes do not arrive at the same time. Display the following results in a table
format.
a.
b.
c.
d.

Arrival time and Burst time of every process.

Waiting time and turnaround time of every process.
Average waiting time and turnaround time.
Total idle time of the processor
(100)

8.Implement a program using system calls to demonstrate Producer- Consumer

problem using Mutex
.
(100)
9. Develop an application and demonstrate how Message queue is used in Inter process
Communication

(100)

10. Illustrate with a program how memory management is done using LRU page
replacement algorithm.

11. Illustrate with a program how memory management is done using LFU page

(100)

replacement algorithm.
(100)
12. Write a C program to implement an Algorithm for Dead Lock Detection
(100)
13. Write a C program to implement an Algorithm for Dead Lock Detection

(100)

14. Write a C program to implement Linked File allocation technique.

(100)

15. Write a C program to implement Sequential allocation technique.

(100)

16. Write a C program to implement Indexed File allocation technique.

(100)

17. Write a C program to implement Paging Technique of memory management

(100)

18. Write a C program to implement Threading & Synchronization Applications

(100)

19.Write a C program to implement Single level directory structure

(100)

20.Write a C program to implement Two level directory structure

(100)

INTERNAL EXAMINER

EXTERNAL EXAMINER