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.
Topic-wise mock tests
- Calculate the average response time for these processes with nonpreemptive priority Scheduling algorithm? Priority of the process are as follows and consider that all the processes came at zero (0) time. (Note low numbe…
- Match List - I with List - II. (D) Priority Scheduling (IV) Select the process for execution with smallest next Burst time.
- Match List - I with List - II.
- What is the significance of the Banker's algorithm in terms of resource management?
- The order of steps of Address Translation in Linux Virtual Memory Scheme will be : A. register B. offset C. Page directory. D. Page table E. Page Middle directory Choose the correct answer from the options given below :
- Match List-I with List-II :
- Match List-I with List-II.
- Match List-I with List-II :
- Which of the following is not correct about the virtual memory segmentation ?
- In windows scheduling, which of the following option is correct ?
- Indexed/grouped allocation is useful as : (A) It supports both sequential and direct access. (B) Entire block is available for data. (C) It does not require lots of space for keeping pointers. (D) No external fragmentat…
- Match List - I with List - II.
- 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 co…
- 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
- 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 co…
- 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 pro…
- 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…
- 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 complet…
- 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. Bloc…
- 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.
- 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…
- How many page faults will be encountered?
- What is fault ratio of row major to column major arrangements ?
- What is the main memory hit ratio?
- Model of protection can be viewed as
- Process in memory also contain the heap section. What is the use of heap section?
- 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
- Degree of concurrency in thread can be arranged in the manner. > >
- 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
- Match List I with List II