Paper 2 CS · UNIT 05 · MOCK TEST

System Software and Operating System — Mock Test 10

25 questions · about 30 minutes. Press End Mock any time to see your score and the correct answers.

0 / 25 answered 00:00

Q1. Given below are two statements:
Statement (I): A thread is a dispatchable unit of work that does not execute sequentially and is not interruptible.
Statement (II): It is not possible to alter the behaviour of a thread by altering its context when the thread is suspended.
In light of the above statements, choose the most appropriate answer.

ABoth Statement I and Statement II are correct BBoth Statement I and Statement II are incorrect CStatement I is correct but Statement II is incorrect DStatement I is incorrect but Statement II is correct

Q2. Given below are an Assertion (A) and a Reason (R):
Assertion (A): I/O protection is ensured by a hardware trap.
Reason (R): I/O interrupts are caused by conditions such as I/O completion and device malfunction occurring within I/O devices.
In light of the above, choose the correct answer.

ABoth A and R are true and R is the correct explanation of A BBoth A and R are true but R is NOT the correct explanation of A CA is true but R is false DA is false but R is true

Q3. Given below are two statements:
Assertion A: A process involves a library function to create a thread.
Reason R: The threads make system calls to convey their resource and I/O requirements to the Kernel.

ABoth A and R are true and R is the correct explanation of A BBoth A and R are true but R is NOT the correct explanation of A CA is true but R is false DA is false but R is true

Q4. In a multi-user operating system, requests for a particular resource arrive at an average rate of 20 per hour (a Poisson arrival process). What is the probability that no request is made in a 45-minute interval?

Ae^(-15) Be^(-5) C1 - e^(-5) D1 - e^(-10)

Q5. In Linux Operating system, when ________ is invoked, it is passed a set of flags that determine how much sharing is to take place between the parent and child tasks.

Afork() Bclone() Cpthread() Dthread()

Q6. User level threads are threads that are visible to the programmer and are unknown to the kernel. The operating system kernel supports and manages kernel level threads. Three different models relate user and kernel level threads:
Statement (A): (i) The many-to-one model maps many user threads to one kernel thread. (ii) The one-to-one model maps one user thread to one kernel thread. (iii) The many-to-many model maps many user threads to a smaller or equal number of kernel threads.
Statement (B): (i) The many-to-one model maps many kernel threads to one user thread. (ii) The one-to-one model maps one kernel thread to one user thread. (iii) The many-to-many model maps many kernel threads to a smaller or equal number of user threads.
Which of the following is true?

A(A) is true; (B) is false B(A) is false; (B) is true CBoth (A) and (B) are true DBoth (A) and (B) are false

Q7. One of the disadvantages of user-level threads compared to kernel-level threads is:

AIf a user-level thread executes a system call, all threads in that process are blocked. BScheduling is application dependent. CThread switching doesn't require kernel mode privileges. DLibrary procedures for thread management are local procedures.

Q8. Match List I with List II regarding operating system I/O management.
List I: (a) Device controller (b) Device driver (c) Interrupt handler (d) Kernel I/O subsystem
List II: (i) Extracts information from the controller's registers and stores it in a data buffer (ii) Performs I/O scheduling (iii) Performs the actual data transfer between the device and memory (iv) Processes/initiates the I/O request
Choose the correct answer from the options given below.

A(a)-(iii), (b)-(iv), (c)-(i), (d)-(ii) B(a)-(ii), (b)-(i), (c)-(iv), (d)-(iii) C(a)-(iv), (b)-(i), (c)-(ii), (d)-(iii) D(a)-(i), (b)-(iii), (c)-(iv), (d)-(ii)

Q9.

Match List I with List II

Choose the correct answer from the options given below:

AA → III, B → IV , C → II, D → I BA → III, B → I, C → IV , D → II CA → II, B → III, C → I, D → IV DA → IV , B → III, C → II, D → I

Q10.

Match List I with List II

Choose the correct answer from the options given below:

AA → IV , B → III, C → I, D → II BA → III, B → IV , C → I, D → II CA → I, B → III, C → IV , D → II DA → II, B → IV , C → I, D → III

Q11.

Consider the following table about processes, their burst time and arrival time

Now which of the process shall finish second last as per the respective GANTT charts for the nonpreemptive SJF and Round Robin (time quantum =10 ) scheduling methods.

ASJF: P4; RR: P4 BSJF: P5; RR: P4 CSJF: P4; RR: P3 DSJF: P5; RR: P5

Q12.

Which of the following statement is correct for Pthreads?

AIt refers to POSIX standard (IEEE 1002.1c) BThis standard defines API for thread creation only CThis is a specification only for thread behavior and not its implementation DOperating systems like Solaris, Linux Mac OS X, except Tru64 UNIX, implement Pthreads

Q13.

Consider the following Graph of disk scheduling and identify the disk scheduling algorithm representing by this graph. Queue 84, 125, 11, 36, 170, 20, 172, 45

ASSTF BSCAN CC-SCAN DC-LOOK

Q14.

Match the LIST-I with LIST-II

RAID ECC

D. IV. level 4 organization

AA-II, B-I, C-IV, D-III BA-II, B-IV, C-I, D-III CA-III, B-IV, C-I, D-II DA-IV, B-III, C-II, D-I

Q15.

Given the following processes with their times and priority (lower number indicates higher priority)

Which of the following is a value of average waiting time using priority scheduling algorithm?

A9.2 B6.8 C7.6 D8.2

Directions (Q96–100): Processes with arrival time and CPU burst (ms): P1 (arrival 0, burst 5), P2 (2, 3), P3 (2, 2), P4 (5, 3), P5 (6, 1).

Q16.

Calculate the average response time for these processes with nonpreemptive priority Scheduling algorithm? Priority of the process are as follows and consider that all the processes came at zero (0) time. (Note low numbers represent high priority).

A5.6 ms B5.2 ms C4.7 ms D3.8 ms

Q17.

Match List - I with List - II.

(D) Priority Scheduling (IV) Select the process for execution with smallest next Burst time.

A(A)-(II), (B)-(III), (C)-(IV), (D)-(I) B(A)-(II), (B)-(IV), (C)-(III), (D)-(I) C(A)-(III), (B)-(IV), (C)-(II), (D)-(I) D(A)-(III), (B)-(IV), (C)-(I), (D)-(II)

Q18.

Match List - I with List - II.

A(A)-(III), (B)-(IV), (C)-(I), (D)-(II) B(A)-(III), (B)-(I), (C)-(IV), (D)-(II) C(A)-(I), (B)-(III), (C)-(IV), (D)-(II) D(A)-(I), (B)-(IV), (C)-(III), (D)-(II)

Directions (Q96–100): The Banker's Algorithm is a deadlock-avoidance method in operating systems. It maintains information about the maximum resources each process may require, the resources currently allocated and the resources available. Each process must declare its maximum demand for each resource type before it starts. When a process requests additional resources, the algorithm checks whether granting the request leaves the system in a safe state — one in which there is a sequence that lets all processes complete. If so, the resources are allocated; otherwise the process must wait until its request can be safely fulfilled.

Q19.

What is the significance of the Banker's algorithm in terms of resource management?

AIt enures that all processes can finish their execution without deadlock. BIt eliminates the need for processes to request resources. CIt accelerates the execution of critical sections in processes. DIt minimizes the number of context switches between processes.

Q20.

The order of steps of Address Translation in Linux Virtual Memory Scheme will be :

A. register

B. offset

C. Page directory.

D. Page table

E. Page Middle directory

Choose the correct answer from the options given below :

AB, A, D, E, C BA, C, E, D, B CD, C, A, B, E DC, A, D, E, B If f(n) = 5f(n/2) + 3 and f(1) = 7

Q21.

Match List-I with List-II :

AA-III, B-II, C-IV, D-I BA-III, B-IV, C-II, D-I CA-I, B-III, C-IV, D-II DA-II, B-I, C-IV, D-III

Q22.

Match List-I with List-II.

AA-I, B-III, C-IV, D-II BA-II, B-IV, C-I, D-III CA-IV, B-I, C-II, D-III DA-II, B-III, C-IV, D-I

Q23.

Match List-I with List-II :

AA-I, B-III, C-IV, D-II BA-IV, B-III, C-II, D-I CA-IV, B-III, C-I, D-II DA-II, B-I, C-IV, D-III

Q24.

Which of the following is not correct about the virtual memory segmentation ?

AIt is not necessary to load all of the segments of a process. BIt has no internal fragmentation. CIt has large virtual address space. DIt provides lower degree of multiprogramming.

Q25.

In windows scheduling, which of the following option is correct ?

A4 non-real-time priorities B8 non-real-time priorities C12 non-real-time priorities D16 non-real-time priorities