List of students writing OS test on 9/12/24 (Monday) at 2 to 3.30 PM.
If anybody remains absent for
the test, they will be detained from the OS IA2. Prepare for the below-mentioned questions and
bring A4 sheets. (all the questions are mandatory)
Sl. No. USN STUDENT NAME
1 1JS23IS065 KESHAV KANDOI
2 1JS23IS066 KHUSHI SINGH
3 1JS23IS070 KRUTIKA MANJAPPA GIRTHIMALLI
4 1JS23IS078 LIKHITH KUMAR H E
5 1JS23IS079 M GUNAVARDHAN
6 1JS23IS083 MANJUNATH SAJJAN B S
7 1JS23IS098 NADEEM ABBAS
8 1JS23IS103 NISHANTH M B
9 1JS23IS104 NITIN KUMAR
10 1JS23IS106 PARAS SHARMA
11 1JS23IS107 PARIKSHITH V
12 1JS23IS110 POORVITH R
13 1JS23IS111 PRAJWAL B
14 1JS23IS117 PRATHIK RAJ
15 1JS23IS125 RAHUL KUMAR PATRA
16 1JS23IS126 RAKSHITH GIRIYAPPA TULASIGERI
17 1JS23IS128 RATHAN K C
18 DIP 6 KIRAN KUMAR S
19 DIP 7 NAGANAND GANESH PRABHU
20 DIP 8 PUNITH KUMAR D
21 DIP 9 ROHAN C RAVI
22 DIP 10 SUDARSHANA C H
Questions:
1. Explain the critical-section problem along with the requirements that
it must satisfy. Explain Peterson's solution for it.
2. Solve the Reader’s-Writer’s problem using semaphores for the
reader’s priority problem.
3. What are semaphores? Identify the difference between binary
semaphores and counting semaphores.
4. Explain classical problems of synchronisation (Bounded buffer
problem, Dining philosopher problem, readers-writers problem)
5. Explain with examples the first fit, best fit and worst fit strategies
adopted for contiguous memory allocation by OS.
6. Explain internal and external fragmentation with neat diagrams.
7. With a neat diagram, explain paging hardware. And explain paging
hardware with TLB.
8. What is segmentation? Explain its hardware structure.
9. Explain swapping with a neat diagram.
10.Explain demand paging. Steps in handling page fault with a neat
digram.
11.Explain thrashing with a neat diagram.
12.Explain various types of directory structures.
13.Discuss various file and disk allocation methods.
14.List different operations performed on a directory.
15.Explain various file access methods.
16.Explain file operations.
17.Explain access matrix.
18.Explain FIFO, SSTF, LOOK, CLOOK, SCAN and C-SCAN disk
scheduling with suitable example.
