Operating System Fundamentals Week 6 NPTEL Assignment Answers 2025

Need help with this week’s assignment? Get detailed and trusted solutions for Operating System Fundamentals Week 6 NPTEL Assignment Answers. Our expert-curated answers help you solve your assignments faster while deepening your conceptual clarity.

✅ Subject: Operating System Fundamentals
📅 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 Operating System Fundamentals Week 6 NPTEL Assignment Answers

🚀 Stay ahead in your NPTEL journey with fresh, updated solutions every week!

NPTEL Operating System Fundamentals Week 6 Assignment Answers 2025

1.

Answer : See Answers

2.

Answer :

3. Which of the following statements is/are true?

(A) The performance of the Round Robin scheduling algorithm depends on the size of the time quantum.
(B) If the time quantum is extremely small, Round Robin algorithm for scheduling can result in a large number of context switches.
(C) A large time quantum can make Round Robin behave more like First-Come, First-Served (FCFS).
(D) All of the above statements

Answer :

4.

Answer :

5. Consider a round-robin scheduling algorithm with a time quantum of 5 milliseconds. The ready queue contains four processes in the order P1, P2, P3, P4. The burst times for these processes are as follows:

P1: 12 ms
P2: 3 ms
P3: 8 ms
P4: 6 ms

What is the average waiting time for these processes?

(A) 14.0
(B) 15.25
116 0
(D) 16.5

Answer :

6. Which of the following is not a parameter in case of multilevel-feedback-queue scheduler?

(A) Number of queues
(B) Scheduling algorithms for each queue
(C) A method to determine which queue a process will enter when that process needs service
(D) None of the above

Answer : See Answers

7. Which of the following statements is false for Round Robin (RR) process scheduling?

(A)RR is suitable for a time-sharing system
(B) RR is a preemptive scheduling algorithm
(C) Its turnaround time does not depend on the time quantum
(D) In case of RR algorithm, the priority of all the processes are same

Answer :

8. Which of the following can be used to avoid starvation problem in a priority-based scheduler?

(A) Termination of the processes waiting for a long time
(B) Reassign priorities to the processes randomly
(C) Gradually increase the priorities of the processes that have been waiting for a long time
D) None of the above

Answer :

9. Which of the following is a potential problem if proper synchronization is not implemented in the producer-consumer problem?

(A) Deadlock
(B) Starvation
(C) Data inconsistency
(D) All of the above

Answer :

10. Which of the following statement is false for Critical Section Problem?

(A) If a process is executing in its critical section, another process is allowed to enter into the critical section provided it has higher priority over the earlier executing process.
(B) Multiple processes share the same data.
(C) A bound must exist on the number of times other processes are allowed to enter the critical section.
(D) Concurrent access to shared data may result in data inconsistency

Answer :  See Answers