This set of MCQ(multiple choice questions) focuses on the NPTEL Operating System Fundamentals Week 6 Assignment Solutions.
You should practice these questions to improve Operating System Fundamentals needed for various interviews (like company interview, campus interview, walk-in interview), entrance exams, placements and other competitive exams. All the questions in this particular section are based on only “NPTEL Operating System Fundamentals Week 6 Assignment Solutions“.
Week 1: Introduction
Week 2: Processes and Threads – Part I
Week 3: Processes and Threads – Part II
Week 4: Inter-process Communication
Week 5: Concurrency and Synchronization – Part I
Week 6: Concurrency and Synchronization – Part II
Week 7: Deadlock
Week 8: CPU Scheduling
Week 9: Memory Management
Week 10: Virtual Memory – Part I
Week 11: Virtual Memory – Part II
Week 12: File System Processes and Threads – Part I
Operating System Fundamentals NPTEL 2022 Week 6 Assignment Solutions
Q1. An OS follows round-robin scheduling with time quanta of 4ms. Assuming that the CPU is free now and there are 20 processes waiting in the ready queue, the maximum amount of time that a process waits before getting into the CPU is
a) 80ms
b) 76ms
c) 84ms
d) None of the given options
Answer: b) 76ms
Q2. A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called:
a) data consistency
b) race condition
c) aging
d) starvation
Answer: b) race condition
Q3. Which of the following is incorrect?
a) Starvation problem is when low priority processes might never get executed
b) Aging is the solution to starvation problem where priority of a process is increased
c) In priority scheduling, higher the value of the integer, higher is the priority of the process
d) None of the above
Answer: c) In priority scheduling, higher the value of the integer, higher is the priority of the process
Q4. Which of the following statements are true?
I. Shortest remaining time first scheduling may cause starvation
II. Preemptive scheduling may cause starvation
III. Round robin is better than FCFS in terms of response time
a) I only
b) I and III only
c) II and III only
d) I, II and III
Answer: d) I, II and III
Q5. Which of the following is incorrect?
a) If the time quantum is extremely small, Round Robin can result in a large number of context switches.
b) The average turnaround time of a set of processes does not necessarily improve as the time-quantum size increases
c) the average turnaround time can be improved if most processes finish their next CPU burst in a single time quantum
d) none of the above
Answer: d) none of the above
Q6. Mutual exclusion implies that:
a) if a process is executing in its critical section, then all the resources of the system must be blocked until it finishes execution
b) if a process is executing in its critical section, then other processes must be executing in their critical sections
c) if a process is executing in its critical section, then no other process must be executing in their critical sections
d) none of these
Answer: c) if a process is executing in its critical section, then no other process must be executing in their critical sections
Q7. Which of the following is correct about the atomic action?
a) While execution of an atomic action, no other instruction is executed concurrently
b) Incrementing or decrementing the counter as an atomic can solve the race condition
c) Ability to execute actions atomically can provide solutions to several synchronization problem
d) All of the above
Answer: d) All of the above
Q8. Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter its critical section:
a) after a process has made a request to enter its critical section and before the request is granted
b) when another process is in its critical section
c) before a process has made a request to enter its critical section
d) None of the mentioned
Answer: a) after a process has made a request to enter its critical section and before the request is granted
Q9. In design protocol of critical section problem, each process must ask permission to enter critical section in ________ code; it than executes in the critical section; once it finishes executing in the critical section it enters the ________ code. The process then enters the ___________ code.
a) entry section, remainder section, exit section
b) entry section, exit section, remainder section
c) remainder section, entry section, exit section
d) remainder section, exit section, entry section
Answer: b) entry section, exit section, remainder section
Q10. Which of the following is adopted to tackle the critical-section problem?
a) If a process is in critical section, no other process is allowed to enter that critical section
b) If no process is executing in its critical section and there exist some processes that wish to enter their critical section, then the selection of the processes that will enter the critical section next cannot be postponed indefinitely
c) A bound must exist on the number of times that other processes are allowed to enter their critical sections after a process has made a request to enter its critical section and before that request is granted
d) All of the above
Answer: d) All of the above
Previous Course – Week 6 Assignment Solutions
Q1. Which scheduling algorithm is non-preemptive?
a. round robin scheduling
b. priority scheduling
c. shortest job first scheduling
d. first come first served scheduling
Ans. d
Q2. Among all the CPU Scheduling algorithm which is the most simplest one?
a. FCFS
b. SJF
c. RR
d. None of the above
Ans. a FCFS
Q3. The SJF algorithm can be?
a. Preemptive only
b. Non preemptive
c. Either preemptive or non-preemptive
d. None of the above
Ans. c
Q4. Which is the most optimal but difficult to implement CPU Scheduling Algorithm?
a. SJF
b. FCFS
c. RR
d. None of the above options
Ans. a
Q5. There are 6 processes in which the arrival order of the processes are like P1<P2<P3<P4<P5<P6 (which means P1 arrives first then P2, P3, P4, P5 and P6) and the CPU burst times are given as follows.
| Process | CPU Burst(msec) |
| P1 | 9 |
| P2 | 1 |
| P3 | 14 |
| P4 | 2 |
| P5 | 6 |
| P6 | 20 |
What is the average waiting time for FCFS policy?
a. 51.45(msec)
b. 101.12(msec)
c. 12.33(msec)
d. 16.83(msec)
Ans. d
Q6. Considering the following Table below
| Process | CPU Burst(msec) | Arrival Time(msec) |
| A1 | 5 | 0 |
| A2 | 7 | 2 |
| A3 | 3 | 3 |
Which is the correct completion order of the above three processes under the FCFS and RR(with CPU quantum of 2 time units)?
a. FCFS: A1, A3, A2 and RR: A1, A2, A3
b. FCFS: A1, A2, A3 and RR: A1, A3, A2
c. FCFS: A1, A2, A3 and RR: A1, A2, A3
d. FCFS: A1, A2, A3 and RR: A3, A2, A1
Ans. b
Q7. Consider the set of processes P1, P2, P3, P4, P5, P6 with their respective CPU burst time and priority of the processes are given below.
| Processes | CPU Burst Time (msec) | Priority |
| P1 | 20 | 3 |
| P2 | 3 | 5 |
| P3 | 7 | 4 |
| P4 | 8 | 6 |
| P5 | 1 | 2 |
| P6 | 6 | 1 |
What will the average waiting time?
a. 25(msec)
b. 18.5(msec)
c. 11(msec)
d. 9(msec)
Ans. b
Q8. In which of the following options below only one process at a time is allowed into its critical section, among all processes that have critical sections for the same resource.
a. Synchronization
b. Mutual Exclusion
c. Deadlock
d. None of the above options
Ans. b
Q9. Which of the following is the solution for critical section problem?
a. Mutual Exclusion
b. Progress
c. Bounded Waiting
d. All of the above
Ans. d
Q10. Mutual exclusion implies that:
a. if a process is executing in its critical section, then other processes must be executing in their critical sections
b. if a process is executing in its critical section, then all the resources of the system must be blocked until it finishes execution
c. if a process is executing in its critical section, then not other process must be executing in their critical sections
d. none of the mentioned
Ans. c)
<< Prev- Operating System Fundamentals Week 5 Assignment Solutions
>> Next- Operating System Fundamentals Week 10 Assignment Solutions
Java Programming: Coursera quiz answers
Online Web development Test for Hiring and Recruitment
The above question set contains all the correct answers. But in any case, you find any typographical, grammatical or any other error in our site then kindly inform us. Don’t forget to provide the appropriate URL along with error description. So that we can easily correct it.
Thanks in advance.
For discussion about any question, join the below comment section. And get the solution of your query. Also, try to share your thoughts about the topics covered in this particular quiz.