Information Technology (Semester 5)
Total marks: 70
Total time: 2 Hours 30 min
INSTRUCTIONS
(1) Attempts questions Q.1 or Q.2, Q.3 or Q.4 , Q.5 or Q,6 and Q.7 or Q.8 .
(2) Neat diagrams must be drawn whenever necessary.
(3) Assume suitable data , if necessary.
1.a.
What is a virtual machine? Explain the concept of virtualization.
(5 marks)
00
1.b.
Write a shell program to check if a given string is palindrome or not.
(5 marks)
00
OR
2.a.
State and explain multiprocessor thread scheduling approaches.
(5 marks)
00
2.b.
How PCB helps in process state management? Explain the structure of PCB.
(5 marks)
00
3.a.
Explain with definition, the concept of general and binary semaphore.
(5 marks)
00
3.b.
Write a semaphore solution for dinning philosophers’ problem.
(5 marks)
00
4.a.
Explain the following functions (along with parameters passed) with reference to semaphore programming in ‘C’
i. sem_post()
ii. sem_wait()
(5 marks)
00
4.b.
List the requirements of mutual exclusion.
(5 marks)
00
5.a.
What are the common techniques for structuring the page table? Explain at least three of the techniques.
(10 marks)
00
5.b.
For the following reference string.
1,2,3,4,2,1,5,6,2,1,2,3,3,6
Count the number of page faults that occur with 3 frames using FIFO and LRU page replacement methods. Discuss the result.
(8 marks)
00
6.a.
Explain with the help of a neat diagram how TLB can be used to improve effective access time?
(10 marks)
00
6.b.
Write a short note on:
i. Buddy system
ii. Compaction
(8 marks)
00
7.a.
A disk drive has 200 cylinders, numbered 0-199. The drive is currently serving the request at cylinder 53. The queue of pending requests in FIFO order is 98, 183, 37, 122, 14, 124, 65, 67. Starting from the current head position what is the total distance that disk arm moves to satisfy all the pending requests for the following disk scheduling algorithms.
i. FCFS
ii. SCAN
iii. C-LOOK
iv. SSTF
(12 marks)
00
7.b.
Explain in brief different I/O buffering techniques.
(4 marks)
00
OR
8.a.
List and explain in brief I/O performing techniques (at least three).
(12 marks)
00
8.b.
Define the following terms
i. Seek time
ii. Rotational latency
(4 marks)
00
9.a.
Describe the steps for adding new system call in the Linux Kernel.
(8 marks)
00
9.b.
List and explain different inter-process communication mechanisms in Linux operating system.
(8 marks)
00
OR
Write short note on following:
10.a.
Memory management in Linux
(4 marks)
00
10.b.
Linux file system
(4 marks)
00
10.c.
Linux IPC mechanisms
(4 marks)
00
10.d.
Process management in Linux
(4 marks)
00