System Software and Operating System – Previous Year Questions
336 questions from past UGC NET Paper 2 – Computer Science papers, each with the correct answer. Open any question for its explanation.
- 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 rea…
- 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 ma…
- 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?
- Which of the statement is not true in regards to virtual memory?
- 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 critica…
- 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 int…
- 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)…
- 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…
- 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…
- 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 lin…
- 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 p…
- 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 wha…
- 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"…
- 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 answ…
- 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?