0% found this document useful (0 votes)
25 views3 pages

QuestionBank OS

The document contains questions about operating system concepts like paging, file allocation, page replacement algorithms, disk scheduling algorithms, IPC in Linux, protection mechanisms, and process management in Linux. It includes questions on topics such as logical to physical address translation, file system structures, page replacement policies, disk head movement calculations, Linux system architecture, and security vs protection.

Uploaded by

varundubeydubey
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
25 views3 pages

QuestionBank OS

The document contains questions about operating system concepts like paging, file allocation, page replacement algorithms, disk scheduling algorithms, IPC in Linux, protection mechanisms, and process management in Linux. It includes questions on topics such as logical to physical address translation, file system structures, page replacement policies, disk head movement calculations, Linux system architecture, and security vs protection.

Uploaded by

varundubeydubey
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

OS QUESTION BANK FOR IA-3

1. What is the principle behind paging? Explain its operation, clearly indicating how the logical addresses
are converted to physical addresses.
2. What is a file? Explain in detail different allocation methods.
3. Distinguish between Protection and Security.
4. A hypothetical main memory can store only 3 frames simultaneously. The sequence in which pages will be
required is given below:
7 , 0, 1, 2, 0, 3,0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1
Indicate the sequence in which the three frames will be filled in
i) FIFO ii) Optimal Page Replacement iii) Least Recently Used methods of Page Replacement. Indicate
number of page faults in each case.

5. Prove that Belady’s anomaly exists for the following reference string 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5 using
FIFO algorithm when number of frames used are 3 and 4.
6. Explain the need of page replacement algorithm.
7. Explain Segmentation with an example.
8. What is the cause of thrashing? How does the system detect thrashing?
9. What are directories? Write a brief note on mounting file systems.
10. How is free space managed? Explain
11. What are the different techniques with which a file can be shared among users?
12. Explain various file operations supported by Operating system, also list any five typical file attributes.

13. Given the following queue 95, 180, 34,119,11,123,62,64 with head initially at track 50 and ending at track
199 calculate the number of moves using FCFS, SSTF, Elevator and C- look algorithm.
14. Explain in brief, selection of a disk scheduling algorithm
15. Write a short note on Revocation of Access Rights.
16. What is boot block and bad block? Explain techniques used for handling bad blocks.
17. With diagram, explain components of Linux System.
18. Write a brief note on the design principles of Linux

19. How is IPC handled in Linux? Explain with suitable example.

20. What is Protection? Distinguish between mechanisms and policies. Explain briefly the access matrix with
domains as objects.

21. Write a note on : 1) Domain of Protection 2) Access Matrix

22. What are access matrices? Explain its implementation.

23. Explain the difference between protection and security? Describe the scheme of capability lists to
implement protection.

24. Explain in detail, the components that the kernel module support under Linux.

25. Explain how process in managed on Linux platform.

You might also like