MauryaHub PYQ Practice

cs4022_2025T3_Q2_NA.pdf

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.

Question 6 MCQ · 4.0 marks

[[IMAGE:911932260507311a_2_0]]
Source diagram or notation
  1. Process 1 and Process 2 will enter their critical sections simultaneously, leading to race conditions.
  2. Process 1 will always enter its critical section before Process 2.
  3. Process 2 will always enter its critical section before Process 1.
  4. Deadlock can occur if both processes try to enter their critical sections simultaneously.

A published solution is not available for this question yet.

Question 7 MCQ · 3.0 marks

[[IMAGE:911932260507311a_3_1]]
Source diagram or notation
  1. Mutual exclusion
  2. Progress
  3. Bounded waiting
  4. None of these

A published solution is not available for this question yet.

Question 8 MCQ · 3.0 marks

[[IMAGE:911932260507311a_3_2]]
Source diagram or notation
  1. 7F 42 43 44 02 01 01 00
  2. 7F 45 4D 50 02 01 01 00
  3. 7F 45 4C 46 02 01 01 00
  4. 7F 50 51 52 02 01 01 00

A published solution is not available for this question yet.

Question 9 MCQ · 3.0 marks

[[IMAGE:911932260507311a_4_3]]
Source diagram or notation
  1. 0x800000000000000F
  2. 0x000000000000000D
  3. 0x000000000000000F
  4. 0x8000000000000005

A published solution is not available for this question yet.

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.
  1. TRUE
  2. FALSE

A published solution is not available for this question yet.

Question 11 MCQ · 2.0 marks

[[IMAGE:911932260507311a_5_4]]
Source diagram or notation
  1. [[IMAGE:911932260507311a_5_5]]
    Source diagram or notation
  2. [[IMAGE:911932260507311a_5_6]]
    Source diagram or notation
  3. [[IMAGE:911932260507311a_5_7]]
    Source diagram or notation
  4. [[IMAGE:911932260507311a_5_8]]
    Source diagram or notation

A published solution is not available for this question yet.

Question 12 MCQ · 2.0 marks

[[IMAGE:911932260507311a_5_9]]
Source diagram or notation
  1. execl
  2. execvp
  3. execlp
  4. exec

A published solution is not available for this question yet.

Question 13 MCQ · 2.0 marks

[[IMAGE:911932260507311a_6_10]]
Source diagram or notation
  1. a - 1, b - 2, c - 3
  2. a - 2, b - 1, c - 3
  3. a - 2, b - 3, c - 1
  4. a - 1, b - 3, c - 2

A published solution is not available for this question yet.

Question 14 MCQ · 2.0 marks

What is a disadvantage associated with the Shortest Job First (SJF) scheduling algorithm in operating systems?
  1. Inefficiency for short jobs
  2. Starvation
  3. Lack of flexibility
  4. None of these

A published solution is not available for this question yet.

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?
  1. Round Robin provides the same or a lower response time compared to FCFS.
  2. FCFS provides a lower response time compared to Round Robin.
  3. Both FCFS and Round Robin give the same response time to each process.
  4. None of these

A published solution is not available for this question yet.

Question 16 MSQ · 3.0 marks

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

A published solution is not available for this question yet.

Question 17 MSQ · 3.0 marks

Choose all the correct statements regarding compiling and linking multiple C source files using gcc.
  1. The command gcc file1.c file2.c -o output produces an executable named output.
  2. The command gcc -c file1.c file2.c -o output produces an executable named output.
  3. The command gcc -c file1.c file2.c produces file1.o and file2.o.
  4. The command gcc file1.o file2.o -c -o output produces an executable named output.
  5. 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.

Question 18 MSQ · 4.0 marks

[[IMAGE:911932260507311a_7_11]]
Source diagram or notation
  1. 70
  2. 80
  3. 90
  4. 100
  5. 110
  6. 120

A published solution is not available for this question yet.

Question 19 NAT · 4.0 marks

[[IMAGE:911932260507311a_8_12]]
Source diagram or notation

    A published solution is not available for this question yet.

    Question 20 NAT · 4.0 marks

    [[IMAGE:911932260507311a_9_13]]
    Source diagram or notation

      A published solution is not available for this question yet.

      Question 21 NAT · 4.0 marks

      [[IMAGE:911932260507311a_9_14]]
      Source diagram or notation

        A published solution is not available for this question yet.