Paper 2 CS · UNIT 05 · MOCK TEST

System Software and Operating System — Mock Test 11

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

0 / 25 answered 00:00

Q1.

Indexed/grouped allocation is useful as :

(A) It supports both sequential and direct access.

(B) Entire block is available for data.

(D) No external fragmentation.

A(A) Only B(B) and (C) Only C(B) Only D(A), (B) and (D) Only

Q2.

Match List - I with List - II.

A(a)-(I), (b)-(III), (c)-(IV), (d)--(II) B(a)-(II), (b)--(I), (c)-(IV), (d)-(III) C(a)-(III), (b)-(II), (c)--(I), (d)-(IV) D(a)-(IV), (b)-(II), (c)-(III), (d)-(I)

Q3.

Given below are two statements: one is labelled as Assertion A and the other is labelled as

Reason R.

Assertion A: I/O protection is ensured by a hardware trap

Reason R: I/O interrupt caused by the condition like I/O completion and device malfunction occuring within the I/O devices In the light of the above statements, choose the correct answer from the options given below.

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.

Consider the following statements:

S1: LRU page replacement algorithm suffers from the belady's anomaly

S2: Shortest remaining time first scheduling may cause starvations

S3: Stack is shared by all threads in a process

AS1 S2 and S3 are true BS1, S3 false and S2 is true CS1, S2 are false and S3 is true DS1,S2 and S3 are false

Q5.

Given below are two statements: one is labelled as Assertion A and the other is labelled as

Reason R .

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 requirement to the Kernel. In the light of the above statements, choose the correct answer from the options given below.

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

Q6.

Given below are two statements: Which of the following statement/s is/are correct with respect to virtual memory

Statement I: Address translation is performed for every logical address used during the execution of a program

Statement II: A program can execute only when all of its components are loaded in the memory In the light of the above statements, choose the most appropriate answer from the options given below.

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

Q7.

Given below are two statements: one is labelled as Assertion A and the other is labelled as

Reason R . A virtual memory system uses first-in first-out page replacement policy and allocates a fixed number of frames to a process

Assertion A: Increasing number of page frames allocated to a process sometimes increases the page fault rate.

Reason R: Some programs do not exhibit locality of reference. In the light of the above statements, choose the correct answer from the options given below.

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

Q8.

Consider three processes: P0 (arrival 0 ms, burst 7 ms), P1 (arrival 1 ms, burst 3 ms), P2 (arrival 2 ms, burst 7 ms). Pre-emptive shortest job first scheduling is used, and scheduling happens only at arrival or completion of a process. What is the average waiting time?

A3 ms B3.67 ms C4.47 ms D4 ms

Q9.

Match List I with List II. List I: A. RAID level 2, B. RAID level 4, C. RAID level 5, D. RAID level 3. List II: I. Bit-interleaved parity, II. Block-interleaved distributed parity, III. Error-correcting parity, IV. Block-interleaved parity.

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

Q10.

Match List I with List II. List I: A. Critical region, B. Wait/signal, C. Working set, D. Deadlock. List II: I. Hoare's monitor, II. Mutual exclusion, III. Principle of locality, IV. Circular wait.

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

Q11.

Consider a disk system with cylinders. The request to access the cylinders occurs in the following sequence: 4, 34, 10, 7, 19, 73, 2, 15, 6, 20 Assuming that the head is currently at cylinder 50 , what is the time taken to satisfy all requests if it takes 1 ms to move from one cylinder to adjacent one and shortest seek time first policy is used?

A119 ms B120 ms C142 ms D146 ms

Directions (Q91–95): A program computes the average of each column of a table T with 17 rows and 1024 columns:
for j = 0 … 1023 {
temp = 0;
for i = 0 … 16
temp = temp + T[i][j];
print(temp / 17.0);
}
T[i][j] and temp are 32-bit floating-point values, memory is word addressable, and temp is kept in a register. Main memory is paged and holds 16 pages of 1024 words; page replacement is LRU. Unless stated otherwise, T is stored in row-major order.

Q12.

How many page faults will be encountered?

A16,402 B17,408 C18,208 D18,608

Q13.

What is fault ratio of row major to column major arrangements ?

A1024: 1 B1301: 1 C1240: 1 D9107: 8

Q14.

What is the main memory hit ratio?

A0 B1 C2 D3 Directions (96-100) Read the following passage and answer the given questions. IP datagram has arrived with following partial information in the header (in hexadecimal ) 45000054000300002006....

Q15.

Model of protection can be viewed as

AOwner matrix BDomain matrix CAccess Matrix DGlobal matrix

Q16.

Process in memory also contain the heap section. What is the use of heap section?

AContains temporary data BDynamically allocate the memory during process run time CContains Process priority and pointers to scheduling queues DContains amount of CPU and real time use

Q17.

How many page faults occur for optimal algorithm for the following reference string, with four frames? 1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8

A8 B7 C6 D5

Q18.

Degree of concurrency in thread can be arranged in the manner. > >

Aone-to-one many-to-one many-to-many > > Bone-to-one many-to-many many-to-one > Cmany-to-many > many-to-one one-to-one DNone of the above

Q19.

Consider processes A (arrival 0, burst 6), B (3, 2), C (5, 4), D (7, 6), E (10, 3), times in ms. Using shortest remaining time first scheduling, the average turnaround time is

A7.2 B8.2 C6 D9

Q20.

Match List I with List II

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

Q21.

A disk has 300 cylinders ( 0 to 299 ). If the initial position of the read-write head is at cylinder 101 , moving towards the higher end of the disk, calculate the total head movement following C_LOOK policy for the read request sequence: 123, 45, 197, 87, 250, 198, 280

A456 B450 C458 D445

Q22.

Given below are the two statements:

Statement I: The main objective for using virtual memory is to increase the effective capacity of the memory system

Statement II : The size of virtual memory can be larger than the main memory In the light of the above statements, choose the correct answer from the options given below

ABoth Statement I and Statement II are true. BBoth Statement I and Statement II are false. CStatement I is true but Statement II is false. DStatement I is false but Statement II is true.

Q23.

For processes P1 (burst 8), P2 (15), P3 (10) and P4 (7), arriving in that order and scheduled FCFS, what is the average waiting time?

A8 B16 C32 D48 Q

Q24.

Which of the statement is not true in regards to virtual memory?

AThe main objective for using virtual memory is to increase the effective capacity of the memory system BSize of the program can be as large as the size of the secondary memory Q CProgram and data are stored in the secondary memory DNone of these

Q25.

In the design protocol of the critical section problem, each process must ask permission to enter the critical section in _______ code; it then executes in the critical section; once it finishes executing in the critical section it enters the _____ code. The process then enters the _____ code.

Aentry section, remainder section, exit section Q Bentry section, exit section, remainder section Cremainder section, entry section, exit section Dremainder section, exit section, entry section