Describe how multithreading improves performance over a single-threaded solution.
Marks: 5Chapter: Unit 2: Process Management (10 Hrs.)
Chapter Study
Bsc CSIT Semester 4 – Operating System – Unit 2: Process Management (10 Hrs.)
Comprehensive questions and detailed answers for Unit 2: Process Management (10 Hrs.). Perfect for exam preparation and concept clarity.
20
Questions
130
Marks
Describe how multithreading improves performance over a single-threaded solution.
MediumTHEORY5 marks2070(TU Final)
“Using Semaphore is very critical for programmer.”
Do you support this statement? If yes, prove the statement with some logical facts.
If not, present your view with logical facts against the statement.
MediumTHEORY5 marks2070(TU Final)
How thread based execution minimizes the context switching problem of process based execution? Explain the different multithreading model.
HardTHEORY10 marks2071(TU Final)
For each of the following transitions between the processes states, indicate whether the transition is possible. If it
is possible, give an example of one thing that would cause it.
a) Running -> Ready
b) Running -> Blocked
c) Blocked -> Running
MediumTHEORY5 marks2071(TU Final)
What is race condition? Calculate Average Waiting and Average Turnaround time of the given set of processes in table below using SJF and RR scheduling algorithm. [Note: Quantum time for RR = 3]
| Process id | Arrival Time | Execution Time |
|---|---|---|
| A | 0 | 8 |
| B | 2 | 14 |
| C | 9 | 19 |
| D | 19 | 7 |
| E | 25 | 15 |
MediumTHEORY10 marks2072(TU Final)
How does process differ from program? Explain process state with the help of block diagram.
MediumTHEORY5 marks2072(TU Final)
Explain how multithreading improve performance over a single threaded solution.
MediumTHEORY5 marks2072(TU Final)
Describe how Peterson’s solution preserve mutual exclusion in process CR execution.
MediumTHEORY5 marks2072(TU Final)
Defined interactive system goals? List various interactive scheduling algorithms. Consider following process data and compute average waiting time and average turnaround time for RR(quantum 10) and priority scheduling algorithms.
| PID | Burst Time | Arrival Time | Priority |
|---|---|---|---|
| A | 16 | 0 | 1 |
| B | 37 | 12 | 2 |
| C | 25 | 7 | 3 |
HardTHEORY10 marks2076(TU Final)
When threads are better than processes? Explain the concept of user level threads in detail.
MediumTHEORY5 marks2076(TU Final)
What is problem associated with semaphores? Explain the concept of monitors in brief.
MediumTHEORY5 marks2076(TU Final)
What kind of problem arises with sleep and wakeup mechanism of achieving mutual exclusion? Explain with suitable code snippet.
HardTHEORY10 marks2078(TU Final)
What is lock variable? Discuss its working and problems associated with it in detail.
MediumTHEORY5 marks2078(TU Final)
Discuss the concept of SJF and SRTN scheduling algorithms with suitable example.
MediumTHEORY5 marks2078(TU Final)
Why do we need to schedule process? Find the average waiting time and average turnaround time for the following set of processes using and shortest remaining time next.
| Process | CPU brust time | Arrival time |
|---|---|---|
| P1 | 20 | 0 |
| P2 | 25 | 15 |
| P3 | 10 | 30 |
| P4 | 15 | 45 |
HardTHEORY10 marks2080(TU Final)
What is system call ? Describe the transition between different states of process.
MediumTHEORY5 marks2080(TU Final)
How lock variable is used in achieving mutual exclusion? Describe.
MediumTHEORY5 marks2080(TU Final)
Explain the Sleeping Barber problem. Illustrate on how it can be solved.
HardTHEORY10 marks2081(TU Final)
Explain how semaphore solves the problem of critical section.
MediumTHEORY5 marks2081(TU Final)
Calculate the average waiting time and turnaround time using priority algorithm (Priority 1 being the highest) for the given scenario:
| PID | Brust Time | Arrival Time | Priority |
|---|---|---|---|
| A | 3 | 0 | 3 |
| B | 2 | 2 | 3 |
| C | 4 | 3 | 2 |
| D | 2 | 3 | 1 |
MediumTHEORY5 marks2081(TU Final)
Showing 20 questions (more available)
Sample Questions
“Using Semaphore is very critical for programmer.” Do you support this statement? If yes, prove the statement with some logical facts. If not, present your view with logical facts against th
Marks: 5Chapter: Unit 2: Process Management (10 Hrs.)
How thread based execution minimizes the context switching problem of process based execution? Explain the different multithreading model.
Marks: 10Chapter: Unit 2: Process Management (10 Hrs.)
For each of the following transitions between the processes states, indicate whether the transition is possible. If it is possible, give an example of one thing that would cause it.\ a) Running -> Rea
Marks: 5Chapter: Unit 2: Process Management (10 Hrs.)
What is race condition? Calculate Average Waiting and Average Turnaround time of the given set of processes in table below using SJF and RR scheduling algorithm. [Note: Quantum time for RR = 3] Proces
Marks: 10Chapter: Unit 2: Process Management (10 Hrs.)
And more questions available on this page.