MauryaHub PYQ Practice

Operating System · Quiz 2 · Sep 2025

Operating System · Quiz 2 · Sep 2025

← Course papers · Start practice / exam

Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.

0 / 16 published solutions

Question 6 MCQ · 4.0 marks

Source diagram or notation
6406535953734.
Process 1 and Process 2 will enter their critical sections simultaneously, leading to race conditions.
6406535953735.
Process 1 will always enter its critical section before Process 2.
6406535953736.
Process 2 will always enter its critical section before Process 1.
6406535953737.
Deadlock can occur if both processes try to enter their critical sections simultaneously.

A published solution is not available for this question yet.

Report a correction for Q6

Question 7 MCQ · 3.0 marks

Source diagram or notation
6406535953738.
Mutual exclusion
6406535953739.
Progress
6406535953740.
Bounded waiting
6406535953741.
None of these

A published solution is not available for this question yet.

Report a correction for Q7

Question 8 MCQ · 3.0 marks

Source diagram or notation
6406535953744.
7F 42 43 44 02 01 01 00
6406535953745.
7F 45 4D 50 02 01 01 00
6406535953746.
7F 45 4C 46 02 01 01 00
6406535953747.
7F 50 51 52 02 01 01 00

A published solution is not available for this question yet.

Report a correction for Q8

Question 9 MCQ · 3.0 marks

Source diagram or notation
6406535953756.
0x800000000000000F
6406535953757.
0x000000000000000D
6406535953758.
0x000000000000000F
6406535953759.
0x8000000000000005

A published solution is not available for this question yet.

Report a correction for Q9

Question 10 MCQ · 1.0 marks

State True or False: In inter-process communication (IPC) using shared memory, the commonly used system calls are send and receive.
6406535953742.
TRUE
6406535953743.
FALSE

A published solution is not available for this question yet.

Report a correction for Q10

Question 11 MCQ · 2.0 marks

Source diagram or notation
6406535953748.Source diagram or notation
6406535953749.Source diagram or notation
6406535953750.Source diagram or notation
6406535953751.Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q11

Question 12 MCQ · 2.0 marks

Source diagram or notation
6406535953752.
execl
6406535953753.
execvp
6406535953754.
execlp
6406535953755.
exec

A published solution is not available for this question yet.

Report a correction for Q12

Question 13 MCQ · 2.0 marks

Source diagram or notation
6406535953760.
a - 1, b - 2, c - 3
6406535953761.
a - 2, b - 1, c - 3
6406535953762.
a - 2, b - 3, c - 1
6406535953763.
a - 1, b - 3, c - 2

A published solution is not available for this question yet.

Report a correction for Q13

Question 14 MCQ · 2.0 marks

What is a disadvantage associated with the Shortest Job First (SJF) scheduling algorithm in operating systems?
6406535953764.
Inefficiency for short jobs
6406535953765.
Starvation
6406535953766.
Lack of flexibility
6406535953767.
None of these

A published solution is not available for this question yet.

Report a correction for Q14

Question 15 MCQ · 2.0 marks

In the context of response time, which of the following statements is correct for the First-Come- First-Serve (FCFS) and Round Robin scheduling algorithms?
6406535953768.
Round Robin provides the same or a lower response time compared to FCFS.
6406535953769.
FCFS provides a lower response time compared to Round Robin.
6406535953770.
Both FCFS and Round Robin give the same response time to each process.
6406535953771.
None of these

A published solution is not available for this question yet.

Report a correction for Q15

Question 16 MSQ · 3.0 marks

Select all the correct statements
6406535953772.
Mutexes use busy wait while trying to acquire the lock.
6406535953773.
Mutexes can be also implemented with spinlocks
6406535953774.
A blocking semaphore with S initialized to 1 is similar to a mutex.
6406535953775.
The Thundering herd problem of the mutexes can be solved using a queue.

A published solution is not available for this question yet.

Report a correction for Q16

Question 17 MSQ · 3.0 marks

Choose all the correct statements regarding compiling and linking multiple C source files using gcc.
6406535953782.
The command gcc file1.c file2.c -o output produces an executable named output.
6406535953783.
The command gcc -c file1.c file2.c -o output produces an executable named output.
6406535953784.
The command gcc -c file1.c file2.c produces file1.o and file2.o.
6406535953785.
The command gcc file1.o file2.o -c -o output produces an executable named output.
6406535953786.
The command gcc file1.o file2.o -o output links the object files into an executable named output.

A published solution is not available for this question yet.

Report a correction for Q17

Question 18 MSQ · 4.0 marks

Source diagram or notation
6406535953776.
70
6406535953777.
80
6406535953778.
90
6406535953779.
100
6406535953780.
110
6406535953781.
120

A published solution is not available for this question yet.

Report a correction for Q18

Question 19 NAT · 4.0 marks

Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q19

Question 20 NAT · 4.0 marks

Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q20

Question 21 NAT · 4.0 marks

Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q21