Scribd
Upload
87 views2 pages

Operating Systems Assignment Questions

The document outlines 19 questions related to operating systems topics for a class assignment. The questions cover a range of difficulties from easy to difficult and cover topics such as deadlocks, virtual memory, paging, file systems, page replacement algorithms, memory allocation schemes, and resource allocation. Students are asked to explain concepts, differentiate between terms, provide diagrams, calculate values, and apply algorithms to example problems. The assignment aims to test students' understanding of key operating systems principles through a variety of question types.

Uploaded by

Dev
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
87 views2 pages

Operating Systems Assignment Questions

The document outlines 19 questions related to operating systems topics for a class assignment. The questions cover a range of difficulties from easy to difficult and cover topics such as deadlocks, virtual memory, paging, file systems, page replacement algorithms, memory allocation schemes, and resource allocation. Students are asked to explain concepts, differentiate between terms, provide diagrams, calculate values, and apply algorithms to example problems. The assignment aims to test students' understanding of key operating systems principles through a variety of question types.

Uploaded by

Dev
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Swami Keshvanand Institute of Technology, Management & Gramothan,

Jaipur
II-ASSIGNMENT QUESTIONS

Semester: V Branch: CS / AI / IT
Subject: Operating Systems Subject Code: 5CS4-03/ 5CAI4-03/5IT4-03
Maximum Marks: 10
Last Date of Submission:
All Questions are Compulsory
PART – A (EASY)

1. What is a Deadlock?

2. Define Thrashing.

3. Differentiate between Pager and Swapper.

4. Compare Virtual Memory with Physical Memory

5. What is a File System?

6. Explain the function of TLB.

7. What is Starvation? How is it handled?

8. Briefly explain different Directory Structures.


PART – B (MEDIUM)

9. Explain the four conditions for the deadlock to occur.

10. Explain Paging with the help of a suitable diagram.

11. Explain the features of a Mobile Operating System.

12. Compare the different methods for accessing a file.

13. What are Page-Faults? Why do Page faults occur? How are Page faults serviced by the OS. Use a suitable diagram
to support your answer.
PART –C (DIFFICULT)

14. Find the number of page faults for the following input string using FIFO and LRU page replacement algorithms:
1,2,3,2,1,5,2,1,6,2,5,6,3,1,3,6,1,2,4,3. Consider frame size = 3

15. Find the seek time for the given sequence: 73, 87, 34, 43, 173, 65, 58, 4, 201. The disk head is at 36 and is moving
downward. Total cylinders are 210.

a) SCAN b) SSTF c) LOOK


16. Consider the following snapshot of the system. The given jobs are of memory sizes 13 KB, 5 KB only.

Address Size of Free Space


005 2
070 28
105 12
279 82
395 15
Compare best fit, worst fit and first fit memory allocation schemes. Show the allocated addresses and free spaces
after every job for all 3 schemes.

17. Apply detection algorithm for the following data and show the results. Given 3 processes and 4 resources.

Available = [2, 1, 0, 0]

[ ]

[ ]

18. Consider the following Segment Table. Calculate the Physical Address for following Logical address.

SEGMENT BASE LENGTH

0 219 600

1 2300 14

2 90 100

3 1327 580

4 1952 96

19. Write and explain Banker’s algorithm for Deadlock Avoidance.

****

You might also like