Scribd
Upload
37 views2 pages

Question Bank 2022-23 CSE

1) The document contains a question bank for the Operating System subject with 25 questions ranging from short answer to longer explanations. 2) The questions cover topics such as process states, threads, critical sections, deadlocks, memory management techniques like paging and segmentation, and scheduling algorithms. 3) Example questions include explaining the producer-consumer problem, page replacement algorithms, and the Bankers' algorithm for deadlock avoidance.

Uploaded by

varshneysachit75
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
37 views2 pages

Question Bank 2022-23 CSE

1) The document contains a question bank for the Operating System subject with 25 questions ranging from short answer to longer explanations. 2) The questions cover topics such as process states, threads, critical sections, deadlocks, memory management techniques like paging and segmentation, and scheduling algorithms. 3) Example questions include explaining the producer-consumer problem, page replacement algorithms, and the Bankers' algorithm for deadlock avoidance.

Uploaded by

varshneysachit75
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
You are on page 1/ 2

Subject Code : Operating System (CS350) A.Y.

: 2022-23

Charotar University of Science and Technology [CHARUSAT]


Chandubhai S. Patel Institute of Technology [CSPIT]
Department of Computer Science & Engineering
Question Bank
Subject code : CS350 Semester : 5 Academic Year : 2022-23
Subject name : Operating System

1. Define a process. Explain the process state transition with a neat diagram. 5

2. What is thread and what are the differences between user-level threads and 5
kernel supported threads?
3. Explain the Problem of Critical Section (CSP) through Producer Consumer 5
Problem.
4. Write short note: 1) Semaphores 2) Monitors 5

5. What is Deadlock? List the conditions that lead to deadlock. How Deadlock 5
can be prevented?
6. Write short note: 1) Direct memory access (DMA) 2) Device controllers 5
7. What is fragmentation? What is the need of fragmentation? Explain the 5
difference between internal and external fragmentation.
8. Explain the following allocation algorithms: 1) First-fit 2) Best-fit 3) Worst- 5
fit
9. What is Operating System? explain any one types of operating system 3

10. Explain the features of time sharing system 3


11. Explain Round Robin algorithm with proper example. 5
12. Explain context switching. 3
13. Explain SJF process scheduling algorithm with example 5
14. Define the following term. 3
1) Critical Section 2) Waiting Time 3) Race condition
15. What are system calls? What is application programming interface? 3
16. Briefly describe SCAN 3
17. Which three are Page Replacement Algorithms? Discuss it in terms of page 3
faults.
18. What is called segmentation? How it differs from paging? 3
19. What is Paging? What is Page Table? Explain the conversion of Virtual 5
Address to Physical Address in Paging with example.
20. Explain Unix Commands: cat, sort, grep. 3
21. What is scheduler? Explain queuing diagram representation of process 5
scheduler with figure
22. Consider the following reference string. Calculate the page fault rates for 5
below page replacement algorithm. Assume the memory size is 4 page
frame.

U & P U. Patel Department of Computer Engineering, CSPIT, CHARUSAT Page | 1


Subject Code : Operating System (CS350) A.Y. : 2022-23

1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,5,4,2
1. FIFO
2. OPTIMAL
23. Consider the following reference string. Calculate the page fault rates for 5
below page replacement algorithm. Assume the memory size is 4 page
frame.
1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,5,4,2
1. FIFO
2. OPTIMAL
24. Explain Bankers’ algorithm to avoid deadlock with any example. 5
25. Explain the structure of a page table entry. If a machine has 48 bit virtual 5
addresses and 32-bit physical addresses and pages are of 8 KB, how many
entries are needed for the page table?

Prepared By: Hemang Thakar & Bela Shah Date: 16/11/2022

U & P U. Patel Department of Computer Engineering, CSPIT, CHARUSAT Page | 2

You might also like