Home / Study library / Operating System / Quiz 2 · Jan 2025 Operating System · Quiz 2 · Jan 2025
Operating System · Quiz 2 · Jan 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 / 17 published solutions
Q65 Q66 Q67 Q68 Q69 Q70 Q71 Q72 Q73 Q74 Q75 Q76 Q77 Q78 Q79 Q80 Q81 Question 65 MCQ · 4.0 marks 6406533939461. Process 1 and Process 2 will enter their critical sections simultaneously,
leading to race conditions.
6406533939462. Process 1 will always enter its critical section before Process 2.
6406533939463. Process 2 will always enter its critical section before Process 1.
6406533939464. 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 Q65
Question 66 MCQ · 2.0 marks Assume that two processes P1 and P2 are using a shared resource. If P1 and P2 are both waiting
indefinitely to enter their critical sections because each keeps waiting for the other to release the
resource, then which of the following conditions is not satisfied?
6406533939465. Mutual exclusion
6406533939467. Bounded waiting
6406533939468. None of these
A published solution is not available for this question yet.
Report a correction for Q66
Question 67 MCQ · 2.0 marks 6406533939475. 6406533939476. 6406533939477. 6406533939478. A published solution is not available for this question yet.
Report a correction for Q67
Question 68 MCQ · 2.0 marks A published solution is not available for this question yet.
Report a correction for Q68
Question 69 MCQ · 2.0 marks What is the correct sequence of tasks that takes place during hardware interrupt handling?
(i) Save the current CPU state
(ii) Identify the interrupt source
(iii) Execute the interrupt service routine (ISR)
(iv) Invoke the kernel scheduler if needed
(v) Restore the CPU state and resume execution
6406533939487. (ii) → (i) → (iii) → (iv) → (v)
6406533939488. (i) → (ii) → (iv) → (iii) → (v)
6406533939489. (ii) → (iii) → (i) → (iv) → (v)
6406533939490. (i) → (ii) → (iii) → (iv) → (v)
A published solution is not available for this question yet.
Report a correction for Q69
Question 70 MCQ · 2.0 marks Which of the following is a disadvantage of the Shortest Job First (SJF) scheduling algorithm?
6406533939491. It always leads to the highest average waiting time
6406533939492. It does not consider burst time while scheduling
6406533939493. It can cause starvation for longer processes
6406533939494. It executes processes in a strictly Round-Robin manner
A published solution is not available for this question yet.
Report a correction for Q70
Question 71 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.
A published solution is not available for this question yet.
Report a correction for Q71
Question 72 MCQ · 3.0 marks Given the hexadecimal view of the first few bytes of different files, identify the executable file (ELF
file) from the options below. (Hint: The ASCII value of ’E’ = 69, ’L’ = 76, and ’F’ = 70)
6406533939471. 7F 42 43 44 02 01 01 00
6406533939472. 7F 45 4D 50 02 01 01 00
6406533939473. 7F 45 4C 46 02 01 01 00
6406533939474. 7F 50 51 52 02 01 01 00
A published solution is not available for this question yet.
Report a correction for Q72
Question 73 MCQ · 3.0 marks 6406533939483. 0x800000000000000F
6406533939484. 0x000000000000000D
6406533939485. 0x000000000000000F
6406533939486. 0x8000000000000005
A published solution is not available for this question yet.
Report a correction for Q73
Question 74 MCQ · 3.0 marks Which scheduling algorithm is optimal in terms of minimizing the average waiting time?
6406533939495. First-Come, First-Served (FCFS)
6406533939496. Shortest Job First (SJF)
6406533939497. Round Robin (RR)
6406533939498. Priority Scheduling
A published solution is not available for this question yet.
Report a correction for Q74
Question 75 MCQ · 3.0 marks What is the main drawback of a priority-based scheduling algorithm?
6406533939499. High complexity
6406533939500. Inefficiency in CPU utilization
6406533939501. Average waiting is more for higher priority process
6406533939502. Starvation of low-priority processes
A published solution is not available for this question yet.
Report a correction for Q75
Question 76 MSQ · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q76
Question 77 MSQ · 3.0 marks Choose all the correct statements regarding compiling and linking multiple C source files using
gcc.
6406533939509. The command gcc file1.c file2.c -o output produces an executable named
output.
6406533939510. The command gcc -c file1.c file2.c -o output produces an executable named
output.
6406533939511. The command gcc -c file1.c file2.c produces file1.o and file2.o.
6406533939512. The command gcc file1.o file2.o -c -o output produces an executable named
output.
6406533939513. 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 Q77
Question 78 NAT · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q78
Question 79 NAT · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q79
Question 80 NAT · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q80
Question 81 NAT · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q81
