System Software and Operating System — Mock Test 12

Match List I with List II

An OS follows round-robin scheduling with time quantum of 4 ms. Assuming that the CPU is free now and there are 20 processes waiting in the ready queue, the maximum amount of time that a process waits before getting into the CPU is _____.

What is called journalling in the Linux operating system?

Match List I with List II. List I: (A) Least frequently used, (B) Critical section, (C) Loosely coupled multiprocessor system, (D) Distributed operating system. List II: (I) Memory is distributed among processors, (II) Page-replacement policy in cache memory, (III) Program section that, once begun, must complete before another processor accesses the same shared resource, (IV) OS routines are distributed among available processors.

Match List I with List II. List I: (A) Firmware, (B) Batch file, (C) Packing, (D) Banker's algorithm. List II: (I) Number of logical records into physical blocks, (II) ASCII format, (III) Resource allocation, (IV) ROM.

Match List I with List II. List I: (A) Stack algorithm, (B) Elevator algorithm, (C) Priority scheduling algorithm, (D) Havender's algorithm. List II: (I) Deadlock, (II) Disk scheduling, (III) Page replacement, (IV) CPU scheduling.

In a file allocation system, the following allocation schemes are used:

A. Contiguous

B. Indexed

C. Linked allocation Which of the allocation scheme(s) given above will not suffer from external fragmentation?

Choose the correct answer from the options given below:

Given below are three statements related to

interrupt handling mechanism

A. Interrupt handler routine is not stored at a fixed address in the memory.

B. CPU hardware has a dedicated wire called the

interrupt request line used for handling
interrupts
C. Interrupt vector contains the memory

addresses for speciaized interrupt handlers. In the context of above statements, choose the correct answer from the options given below:

Match List I (system calls) with List II (description). List I: A. fork(), B. exec(), C. kill(), D. exit(). List II: I. Sends a signal from one process to a particular process, II. Indicates termination of the current process, III. Loads the specified program in memory, IV. Creates a child process.

Consider processes P1 (arrival 0, burst 8), P2 (1, 4), P3 (2, 9), times in ms. What is the average waiting time with preemptive shortest job first scheduling?

The number of bits reserved for the frame offset is:

Find number of pages required for the given virtual address space

What is the minimum number of bits needed for the physical address?

What is the size of page table for handling the given virtual address space, given that 2 bytes each page table entry is of size ?

If a process of size 34 KB is to be executed on this machine, what will be the size of internal fragmentation for this process?

A machine has 3 page frames and 5 virtual pages. The reference string is A, B, C, D, A, B, E, A, B, C, D, E, B, A, B. If P and Q are the page faults with FIFO and LRU respectively, then (P, Q) =

Consider a single-level page table system, with the page table stored in the memory. If the hit 80% rate to TLB is , and it takes 15 nanoseconds to search the TLB, and 150 nanoseconds to access the main memory, then what is the effective memory access time, in nanoseconds?

Assuming fork() never fails, consider: P1: int main() { fork(); fork(); fork(); printf("Happy\n"); } and P2: int main() { fork(); printf("Happy\n"); fork(); fork(); printf("Happy\n"); }. Statement I: P1 displays "Happy" 8 times. Statement II: P2 displays "Happy" 12 times.

If T is the capacity of a track in bytes, and S is the capacity of each surface in bytes, then (T, S)= _____

What is the capacity of the disk, in bytes?

Given below are two statements:

Statement I: The disk has a total number of 2000 cylinders.

Statement II: 51200 bytes is not a valid block size for the disk. In the light of the above statements, choose the correct answer from the options given below:

If the disk platters rotate at 5400 rpm (revolutions per minute), then approximately what is the maximum rotational delay?

If one track of data can be transferred per revolution, then what is the data transfer rate?

A counting semaphore is initialized to 8. 3 wait ( ) operations and 4 signal () operations are applied. Find the current value of the semaphore variable.

Which of the following CPU scheduling algorithms is/are supported by LINUX operating system?