Introduction to Operating Systems Week 6 NPTEL Assignment Answers 2025
Need help with this week’s assignment? Get detailed and trusted solutions for Introduction to Operating Systems Week 6 NPTEL Assignment Answers. Our expert-curated answers help you solve your assignments faster while deepening your conceptual clarity.
✅ Subject: Introduction to Operating Systems
📅 Week: 6
🎯 Session: NPTEL 2025 July-October
🔗 Course Link: Click Here
🔍 Reliability: Verified and expert-reviewed answers
📌 Trusted By: 5000+ Students
For complete and in-depth solutions to all weekly assignments, check out 👉 NPTEL Introduction to Operating Systems Week 6 NPTEL Assignment Answers
🚀 Stay ahead in your NPTEL journey with fresh, updated solutions every week!
NPTEL Introduction to Operating Systems Week 6 Assignment Answers 2025
1. Consider the following statements:
i) if(count==0)
ii) add %eax,%ebx- i is atomic , ii is non-atomic
- i is non-atomic , ii is non-atomic
- i is non-atomic , ii is atomic
- Both are atomic
Answer : See Answers
2. Which of the following condition could occur due to lack of synchronization?
- Inconsistency
- Loss of data
- Deadlock
- All of these
Answer :
3. Return value of xchg instruction is_____________
- Old value
- New value
- 1 if operation succeeds and 0 if operation fails
- None of the above
Answer :
4. By using intel hardware xchg instruction, ensures that
a. The critical section is deadlock free b. Solution is starvation free c. Process enters CS in FIFO order d. More than one process enters critical section at same time
Which of the above statement is TRUE?
- a only
- a and b
- b and c
- d only
Answer :
5. Your friend wants to design synchronization primitives and tells you that he would be better off by strictly ensuring that the processes alternate the critical section. Your response would be:
- That might not satisfy the “progress” requirement
- That might not satisfy the “mutual exclusion” requirement
- That might not satisfy the “bounded wait” requirement
- I guess that would suffice
Answer :
6. State True/False
Bakery algorithm ensures that no process is starved.- True
- False
Answer : See Answers
7. State True/ False
Message passing is slow compared to shared memory and more error prone.- True
- False
Answer :
8. Inter process communication with message passing, the shared memory is in
- User space
- Kernel space
- Virtual memory
- None of these
Answer :
9. In a certain application, the initial value of a counting semaphore s is 10. The following operations were completed on the semaphore in the given order 5P, 20P, 2V, 18P, 5V, 10P, 1V. The new value of counting semaphore is ______________ ?
Answer :
10. If the value of a counting semaphore s = 4, then the maximum number of requests for the critical section before it blocks is ________________ ?
- 0
- 1
- 2
- 4
Answer :
11. State True/False
It is possible to share the messages even without attaching the shared memory with the address space of calling process.- True
- False
Answer :
12. he variable turn can have values 0 or 1
Void Process (i)
{
while(1)
{
//Non-critical section
While (turn!=i);
// Critical section
turn = j;
}
}The above code does not provide
- Mutual exclusion
- Progress
- Bounded wait
- None of these
Answer :
13. Test and Set instruction, which provides hardware synchronization does not guarantee ____________.
- Mutual exclusion
- Progress
- Bounded wait
- None of these
Answer :
14. Peterson’s solution is a synchronization mechanism for maximum of ________________ processes.
Answer :
15. Atomic operations like test&set ensure that
- They are executed in a single cycle
- They can be executed in multiple cycles,no other memory instruction is executed while this instruction is executing
- They can be executed in multiple cycles,but no other memory instruction to the same variable is executed while this instruction is executing
- No other instructions execute in the background while this instruction is being executed
Answer : See Answers
