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 5

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

0 / 25 answered 00:00
Q1.
Which of the following statements about the cron daemon in a UNIX operating system is NOT correct?
Q2.
In UNIX, which single command creates the directory "PIS" together with its two subdirectories "progs" and "data" (i.e. PIS/progs and PIS/data), all newly created in one invocation?
Q3. Match List - I with List - II.
List - IList - II
A. LatencyI. number of tasks completed in a given time period
B. DelayII. causes the current activity to be deferred
C. ThroughputIII. time elapsed before next activity starts
D. InterruptIV. time to complete a single task
Choose the correct answer from the options given below:
Q4. In Rate Monotonic scheduling, if a task has a period of 80 ms and an execution time of 55 ms, then its processor utilization and task rate will be
Q5. Match the LIST-I with LIST-II.
LIST-ILIST-II
A. Disk SchedulingI. Round Robin
B. Batch ProcessingII. SCAN
C. Time SharingIII. LIFO
D. Interrupt ProcessingIV. FIFO
Choose the correct answer from the options given below:
Q6. For the reference string: (given that number of frames is 3)
7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1
for the optimal page replacement algorithm, which of the following will represent the hit ratio?
Q7. Which of the following is not an interprocessor communication mechanism in UNIX?
Q8. In disk scheduling example, suppose the disk tracks are numbered from 0 to 49. Head is presently positioned at track 15 and requests for tracks 4, 40, 11, 35, 7 and 14 have arrived (in that order). It takes 1 ms to travel from one track to the next adjacent track. Following disk scheduling algorithms are to be executed and total time traversed is to be recorded (in ms) in ascending order (assume arm-movement toward high numbered request first, wherever needed):
A. FCFS
B. LOOK
C. SSTF
D. SCAN
Choose the correct answer from the options given below:
Q9. Following is not the feature/characteristic of Linked-List allocation of Files in a File system:
Q10. Match List - I with List - II.
List - IList - II
A. MacrosI. Converts high level code to object (Machine) code
B. AssemblerII. Used for code Expansion
C. LoaderIII. Used to translate assembly language code to object code
D. CompilerIV. Used to allocate memory and relocate program in memory
Choose the correct answer from the options given below:
Q11. Once the process is allocated CPU and executing, which of the following events could NOT occur?
A. The process could issue an I/O request and then be placed in the Ready Queue
B. The process could create new subprocesses & wait for the termination of the subprocesses
C. The time slice of the process expires and it may join the waiting queue
D. The process is forcibly removed from the CPU and is put in the Waiting queue due to arrival of an interrupt
Choose the correct answer from the options given below:
Q12. What shall be the average waiting time per process if we know that 10 processes (on average) arrive every second and there are normally 20 processes in the queue?
Q13. Which of the following shows the correct hierarchy of a layered file system in an operating system?
A. Logical File System
B. File Organization Module
C. Basic File System
D. I/O Control
E. Application Programs
Choose the correct answer from the options given below:
Q14. Consider the following interrupt protection levels in Linux, and arrange them in the increasing order of their priorities.
A. User-Mode Programs (Preemptible)
B. Bottom Half Interrupt Handlers
C. Top Half Interrupt Handlers
D. Kernel System Service Routines (Preemptible)
Choose the correct answer from the options given below:
Q15. Match List I with List II
List IList II
A. Clustered Page TableI. Generally considered inappropriate for 64 bit architectures.
B. Hierarchical Page TableII. Has only one entry for each real page (or frame) of memory.
C. SegmentationIII. Useful for sparse address spaces.
D. Inverted Page TableIV. Supports a user view of the system.
Q16. Identify the correct statement(s) from the following with respect to Spinlock Semaphores
A. The name refers to busy waiting semaphores.
B. They are not useful when the locks are to be held for a short duration of time.
C. It may require multiple context switches when a process waits on a lock.
D. They are often employed on Uniprocessor systems.
Choose the correct answer from the options given below:
Q17. What is the total swap time (swap in + swap out) in a system for a 15 MB process with a transfer rate of 30 MBps? Given that there is an average latency of 12 ms, however no head seeks are involved.
Q18. Match List I with List II
List IList II
A. RAID Level 2I. Block interleaved distributed parity
B. RAID Level 3II. Also known as P+Q redundancy scheme
C. RAID Level 5III. Bit interleaved parity
D. RAID Level 6IV. Also known as memory style error correcting code organization
Q19. Consider the following table about processes, their burst time and arrival time. Which process shall finish second last as per the respective Gantt charts for non-preemptive SJF and Round Robin (time quantum = 10) scheduling methods?
ProcessBurst TimeArrival Time
P190
P2300
P340
P482
P5116
Q20. Which of the following statements is correct for Pthreads?

Directions (Q96–100): Consider the following disk queue with requests for I/O to blocks on cylinders:
45, 81, 185, 33, 175, 99, 150, 77
(Consider that the head starts from location 58.)

Q21. What shall be the 2nd request processed by the C-LOOK (Right) disk scheduling technique for the given request queue?

Directions (Q96–100): Consider the following disk queue with requests for I/O to blocks on cylinders:
45, 81, 185, 33, 175, 99, 150, 77
(Consider that the head starts from location 58.)

Q22. What shall be the total head movement of cylinders for the C-SCAN disk scheduling technique if the head starts moving in the right direction from the initial position? (Assume cylinders 0–199)

Directions (Q96–100): Consider the following disk queue with requests for I/O to blocks on cylinders:
45, 81, 185, 33, 175, 99, 150, 77
(Consider that the head starts from location 58.)

Q23. What shall be the 2nd request processed by the SCAN (Left) disk scheduling technique for the given request queue?

Directions (Q96–100): Consider the following disk queue with requests for I/O to blocks on cylinders:
45, 81, 185, 33, 175, 99, 150, 77
(Consider that the head starts from location 58.)

Q24. What will be the total head movement of cylinders for the SSTF disk scheduling technique?

Directions (Q96–100): Consider the following disk queue with requests for I/O to blocks on cylinders:
45, 81, 185, 33, 175, 99, 150, 77
(Consider that the head starts from location 58.)

Q25. What shall be the total head movement of cylinders if the FCFS disk scheduling method is used?