Aim & Program Results Viva-Voce Record Total

Procedure/Algorithm (30) (30) (10) (10) (100)

(20)

1. a. Illustrate the following UNIX Commands: create a directory, create a file and view it.
b. Develop a Shell program to find the factorial of a number.
c. For the following table, find the average waiting time and turnaround time using FCFS
CPU scheduling
Process Arrival Time Burst Time
P0 0 5
P1 1 3
P2 2 8
P3 3 6

2. a. Illustrate the following UNIX Commands: Word Count in a File, List the Directory
b. Develop a Shell program to find whether given number is even or odd.
c. Implement IPC strategy using C.

3. a. Illustrate the following System Calls: Fork()

b. Develop a Shell program to find sum of n numbers.
c. Implement Banker’s Algorithm using C.

4. a. Illustrate the following UNIX Commands: Remove a directory, Remove a file.

b. Develop a Shell program to find whether given number is Prime.
c. Implement Paging using C.

5. a. Illustrate the following UNIX Commands: list the files and directories
b. Develop a Shell program to find area and circumference of a circle.
c. Write a C Program to implement First Fit Allocation Method for the following:

Bloc
Process Size Size
k
P0 90 B1 20
P1 50 B2 100
P2 30 B3 40
P3 40 B4 200
B5 10
6. a. Illustrate the following System Calls: Getpid().
b. Develop a Shell program to calculate simple interest.
c. Implement Threading using C.

7. a. Illustrate the following UNIX Commands: date, cal, cat.

b. Develop a Shell program to find Area of a Triangle.
c. Implement Deadlock Detection algorithm using C.

8. a. Write a shell program to find Factorial of a number.

b. Consider the reference string 6, 1, 1, 2, 0, 3, 4, 6, 0, 2, 1, 2, 1, 2, 0, 3, 2, 1, 2, 0 for a memory
with three frames and calculate number of page faults by using FIFO in C.

9. a. Write a Unix command to display date with time.

b. Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 41, 122, 14,
124, 65, 67. The FCFS scheduling algorithm is used. The head is initially at cylinder
number 53. The cylinders are numbered from 0 to 199. Find the total head movement (in
number of cylinders) incurred while servicing these requests using C.

10. a. Develop a Shell program to perform arithmetic operations. (50)

b. For the following table, find the average waiting time and turnaround time using SJF
CPU scheduling: (50)

Process Arrival Time Burst Time

P0 0 8
P1 1 2
P2 2 3
P3 3 4

11. a. Develop a Shell program to find whether given number is odd or even.
b. Implement Semaphore using C.

12. a. Develop a Shell program to find sum of n numbers.

b. Consider the reference string 6, 1, 1, 2, 0, 3, 4, 6, 0, 2, 1, 2, 1, 2, 0, 3, 2, 1, 4, 0 for a memory
with three frames and calculate number of page faults by using OPTIMAL Page
replacement algorithms in C.

13. a. Develop a Shell program to find area and circumference of a circle.

b. Write a C Program to implement Best Fit Allocation Method for the following:
 Bloc
Process Size Size
k
P0 40 B1 100
P1 10 B2 50
P2 30 B3 30
P3 60 B4 120
B5 35

14. a. Write a shell program to find the area of rectangle by getting length and breadth from
user.
b. Consider a disk queue with requests for I/O to blocks on cylinders 4, 34, 10, 7, 19, 73,
2, 15, 6, 20. The SSTF scheduling algorithm is used. The head is initially at cylinder number
50. The cylinders are numbered from 0 to 100. Find the total head movement (in number
of cylinders) incurred while servicing these requests using C.

15. a. Write a shell program to find greatest of three numbers.

b. Develop a C program to implement Sequential File Allocation Method

16. Implement Banker’s Algorithm using C.

17. a. Illustrate the following UNIX Commands: Display date in dd/mm/yyyy

b. Develop a Shell program to generate factorial of 5 numbers.
c. For the following table, find the average waiting time and turnaround time using Priority
CPU scheduling:

Process Arrival Time Burst Time Priority

P0 0 4 2
P1 1 2 3
P2 2 7 4
P3 3 3 1

18. a. Illustrate the following UNIX Commands: Create and list the content in a file
b. Develop a Shell program to find Area of a Square.
c. Implement Semaphore using C.

19. a. Illustrate the following System Calls: Getpid()

b. Develop a Shell program to find whether given number is odd or even
c. Implement Banker’s Algorithm using C.

20. a. Illustrate the following UNIX Commands: calendar of a year

b. Develop a Shell program to find whether given number is prime.
c. Implement Threading using C.
21. a. Illustrate the following UNIX Commands: cat, date
b. Develop a Shell program to find circumference of a circle.
c. Write a C Program to implement Worst Fit Allocation Method for the following:

Process Size Block Size

P0 40 B1 100
P1 10 B2 50
P2 30 B3 30
P3 60 B4 120
B5 35

22. a. Illustrate the following System Calls: Fork() (10)

b. Develop a Shell program to find factorial of a given number (40)
c. Implement IPC using C. (50)

23. a. Illustrate the following UNIX Commands: ls with attributes (10)

b. Develop a Shell program to find Area of a Triangle. (40)
c. Implement Deadlock Detection algorithm using C. (50)

24. a. Write a shell program to find Factorial of a number.

b. Consider the reference string 6, 1, 1, 2, 0, 3, 4, 6, 0, 2, 1, 2, 1, 2, 0, 3, 2, 1, 2, 0 for a memory
with three frames and calculate number of page faults by using LRU in C.

25. a. Write a shell program to display date with time.

b. Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 41, 122, 14,
124, 65, 67. The FCFS scheduling algorithm is used. The head is initially at cylinder
number 53. The cylinders are numbered from 0 to 199. Find the total head movement (in
number of cylinders) incurred while servicing these requests using C.

26. a. Develop a Shell program to calculate simple interest.

b. For the following table, find the average waiting time and turnaround time using SJF
CPU scheduling:

Process Arrival Time Burst Time

P0 0 8
P1 1 2
P2 2 3
P3 3 4

27. a. Develop a Shell program to find whether given number is odd or even.
b. Implement Semaphore using C.
28. a. Develop a Shell program to find the greatest of three numbers.
b. Consider the reference string 6, 1, 1, 2, 0, 3, 4, 6, 0, 2, 1, 2, 1, 2, 0, 3, 2, 1, 2, 0 for a memory
with three frames and calculate number of page faults by using Least Recently Used (LRU)
Page replacement algorithms in C.

29. a. Write a shell program to find the area of triangle by getting base and height from user.
b. Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 41, 122, 14,
124, 65, 67. The SSTF scheduling algorithm is used. The head is initially at cylinder
number 53 moving towards larger cylinder numbers on its servicing pass. The cylinders
are numbered from 0 to 199. Find the total head movement (in number of cylinders)
incurred while servicing these requests using C.

30. a. Develop a Shell program to find area and circumference of a circle.

b. Given five memory partitions of 100Kb, 500Kb, 200Kb, 300Kb, 600Kb (in order), how
would the first-fit algorithm place processes of 212 Kb, 417 Kb, 112 Kb, and 426 Kb (in
order)? Implement it using C.

31. Develop a C program to implement Banker’s Algorithm

32. Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 41, 122, 14,
124, 65, 67. The LOOK scheduling algorithm is used. The head is initially at cylinder
number 53 moving towards larger cylinder numbers on its servicing pass. The cylinders
are numbered from 0 to 199. Find the total head movement (in number of cylinders)
incurred while servicing these requests using C.