The Binary BrothersTwo Mentors, One Mission – Your Selection
All mock tests are FREE till 31 December — register to save your progress
Paper 2 CS · UNIT 05 · MOCK TEST

System Software and Operating System — Mock Test 3

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 (of disk blocks to a file) is useful because:
(A) It supports both sequential and direct access.
(B) The entire data block is available for data (no pointers embedded in it).
(C) It does not require a lot of space for keeping pointers.
(D) It has no external fragmentation.
Q2.
A moving-head disk has 200 tracks, numbered 0 to 199. The head has just finished a request at track 125 and is currently at track 143 (so it is moving in the direction of increasing track numbers). The pending request queue, in FIFO arrival order, is: 86, 147, 91, 177, 94, 150, 102, 175, 130. What is the total head movement (in cylinders) to service all these requests using the SCAN algorithm?
Q3.
A disk head is currently at cylinder 50. The pending requests, in the order they arrived, are for cylinders: 4, 34, 10, 7, 19, 73, 2, 15, 6, 20. Using the Shortest-Seek-Time-First (SSTF) disk scheduling policy, and given that it takes 1 ms to move the head between two adjacent cylinders, what is the total time needed to service all the requests?
Q4.
Consider an operating system capable of loading and executing a single sequential user process at a time. The disk head scheduling algorithm used is first come first served (FCFS). If FCFS is replaced by shortest seek time first (SSTF) and the vendor claims 50% better benchmark results, what is the expected improvement in the I/O performance of user programs?
Q5.
What is called journaling in a Linux operating system?
Q6.
In a file allocation system, the following allocation schemes are used: (A) Contiguous allocation, (B) Indexed allocation, (C) Linked allocation. Which allocation scheme(s) will NOT suffer from external fragmentation?
Q7.
Suppose a Linux file system has a block size of 2K bytes, a disk address is 32 bits, and an i-node contains the disk addresses of the first 12 direct blocks of a file, one single-indirect block, and one double-indirect block. Approximately, what is the largest file that can be represented by an i-node?
Q8.
Consider a disk system having 60 cylinders. Disk requests are received by the disk drive for cylinders 10, 22, 20, 2, 40, 6, and 38, in that order. Assuming the disk head is currently at cylinder 20, what is the time taken to satisfy all the requests if it takes 2 milliseconds to move from one cylinder to an adjacent one and the Shortest Seek Time First (SSTF) algorithm is used?
Q9.
A disk queue has requests for I/O on cylinders 98, 183, 37, 122, 14, 124, 65, 67, with the disk head currently at cylinder 53. Using the shortest seek time first (SSTF) disk scheduling algorithm, what is the total head movement (in cylinders) needed to service all requests?
Q10.
Consider the following statements about UNIX file permissions:
(A) UNIX provides three permission types — Read, Write and Execute.
(B) UNIX provides three permission sets — Owner, Group and Others.
Which of the above statement(s) is/are true?
Q11.
In the ________ disk scheduling algorithm, the disk head moves from one end of the disk to the other, servicing requests along the way. When it reaches the other end, it immediately returns to the beginning of the disk without servicing any requests on the return trip.
Q12.
Suppose there are six files F1, F2, F3, F4, F5, F6 with corresponding sizes 150 KB, 225 KB, 75 KB, 60 KB, 275 KB and 65 KB respectively. The files are to be stored on a sequential device in such a way that optimizes (average) access time. In what order should the files be stored?
Q13.
Match the following for the UNIX file system:
List I: (A) Boot block (B) Super block (C) Inode block (D) Data block
List II: (I) Contains information about the file system — free block list, free inode list, etc. (II) Contains the operating system files as well as program and data files created by users. (III) Contains the boot program and partition table. (IV) Contains a table entry for every file in the file system, storing file attributes.
Q14.
Which of the following statements about the UNIX file system is NOT correct?
Q15.
In UNIX, files are protected using a 9-bit permission mode ("rights bits"). Consider the statements: (I) A mode of 641 (octal) means the owner can read and write the file, other members of the owner's group can only read it, and all other users can only execute it. (II) A mode of 100 (octal) allows the owner to execute the file, but prohibits all other access. Which of the following is correct?
Q16.
A disk head is initially positioned at track 32. The disk I/O request queue, in arrival order, is: 98, 37, 14, 124, 65, 67. Using the FCFS disk-scheduling algorithm, find the total number of head movements (in tracks) required to service all requests.
Q17.
Arrange the following levels of interrupt protection within the Linux Kernel in order of increasing priority:
(A) user mode programs
(B) bottom half interrupt handlers
(C) kernel system service routines
(D) top half interrupt handlers
Q18.
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.
Q19.
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.
Q20.
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.
Q21.
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?
Q22.
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.
Q23.
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.
Q24.
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?
Q25.
One of the disadvantages of user-level threads compared to kernel-level threads is: