Operating System NTA UGC NET Question Analysis Part-1
| Q.1➡ | UGC NET DEC 2023 Which of the following statements are CORRECT ? (A) A process always check state of currently executing process to enter critical schema. (B) Spin locks uses busy waiting. (C) Periodically testing a variable until some value appear is known as busy waiting. (D) Critical region is a part of program, where shared memory is kept. (E) Printer daemon, continuously checks to see if there are any file to be printed. Choose the correct answer from the options given below : |
| i ➥ (A) and (B) Only |
| ii ➥ (B) and (C) Only |
| iii ➥ (B) and (D) Only |
| iv ➥ (B) and (E) Only |
| Best Explanation: Answer: (III) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.2➡ | UGC NET DEC 2023 Arrange the following levels of interrupt protection within the Linux Kernel, in the order of increasing priority. (A) user mode programs (B) bottom half interrupt handlers (C) kernel system service routines (D) top half interrupt handlers Choose the correct answer from the options given below : |
| i ➥ (A), (B), (D), (C) |
| ii ➥ (A), (C), (B), (D) |
| iii ➥ (A), (C), (D), (B) |
| iv ➥ (D), (A), (C), (B) |
| Best Explanation: Answer: (II) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.3➡ | UGC NET DEC 2023 Match List – I with List – II. List – I (A) LRU (B) Demand cleaning (C) Long term scheduling (D) Medium term scheduling List – II (I) A page is written to secondary memory only when it has been selected for replacement (II) A page that has not been referenced for the longest time is replaced (III) The decision to add to the number of processes that are partially or fully in main memory (IV) The decision to add to the pool of processes to be executed Choose the correct answer from the options given below: |
| i ➥ (A)-(1), (B)-(III), (C)-(IV), (D)-(II) |
| ii ➥ (A)-(II), (B)-(I), (C)-(IV), (D)-(III) |
| iii ➥ (А)-(III), (B)-(II), (C)-(1), (D)-(IV) |
| iv ➥ (A)-(IV), (B)-(II), (C)-(II), (D)-(I) |
| Best Explanation: Answer: (II) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.4➡ | UGC NET DEC 2023 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 fragmentation. Choose the correct answer from the options given below : |
| i ➥ (A) Only |
| ii ➥ (B) and (C) Only |
| iii ➥ (B) Only |
| iv ➥ (A), (B) and (D) Only |
| Best Explanation: Answer: (IV) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.5➡ | UGC NET DEC 2023 Given as 4 GB (≈ 4.3 × 109 bytes) of virtual space and typical page size of 4 KB and each page table entry is 5 bytes. How many virtual pages would this imply? What is the size of whole page table? |
| i ➥ 107500 and 20480 bytes |
| ii ➥ 215000 and 40960 bytes |
| iii ➥ 10750 and 10240 bytes |
| iv ➥ 43000 and 1024 bytes |
| Best Explanation: Answer: (I) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.6➡ | UGC NET DEC 2023 The head of a moving head disk with 200 tracks, numbered 0 to 199, has just finished a request at track 125, and currently serving a request at track 143. The queue of requests is given in the FIFO order as 86, 147, 91, 177, 94, 150, 102, 175, 130. What will be the total number of head movements required to satisfy these requests for SCAN algorithm? |
| i ➥ 259 cylinders |
| ii ➥ 169 cylinders |
| iii ➥ 154 cylinders |
| iv ➥ 264 cylinders |
| Best Explanation: Answer: (II) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.7➡ | UGC NET DEC 2023 In Linux, where is the user password stored ? |
| i ➥ /etc/password |
| ii ➥ /root/password |
| iii ➥ /etc/passwd |
| iv ➥ /root/passwd |
| Best Explanation: Answer: (iii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.8➡ | UGC NET DEC 2023 Given below are two statements: Statement (I): A thread is a dispatchable unit of work that does not executes sequentially and is not interruptible Statement (II): It is not possible to alter the behaviour of a thread by altering its context when thread is suspended In the light of the above statements, choose the most appropriate answer from the options given below: |
| i ➥ Both Statement I and Statement II are correct |
| ii ➥ Both Statement I and Statement II are incorrect |
| iii ➥ Statement I is correct but Statement II is incorrect |
| iv ➥ Statement I is incorrect but Statement II is correct |
| Best Explanation: Answer: (II) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.9➡ | UGC NET DEC 2023 A program that is used by other routines to accomplish a particular task, is called: |
| i ➥ Micro program |
| ii ➥ Micro operation |
| iii ➥ Routine |
| iv ➥ Subroutine |
| Best Explanation: Answer: (IV) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.10➡ | UGC NET DEC 2023 An Address in main memory is called : |
| i ➥ Virtual address |
| ii ➥ Memory address |
| iii ➥ Logical address |
| iv ➥ Physical address |
| Best Explanation: Answer: (IV) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.11➡ | UGC NET JUNE 2023 Consider the following program fragment that deals with a table T with 17 rows and 1024 columns, computing an average for each column and printing it to screen (i is row index and j is column index): for j = [0….1023]{ temp = 0 for i = [0…16] temp = temp +T[i][j] print (temp/ 17.0); T [i] [j] and temp are 32 bit floating point values and memory is word addressable. The temporary variable temp is kept in a processor register so access to temp does not involve a memory reference. The main memory is page and holds 16 pages of size 1024 words, the page replacement policy is “least recently used “, If T is stored in the virtual address space in row major format. What is the main memory hit ratio? |
| i ➥ 0 |
| ii ➥ 1 |
| iii ➥ 2 |
| iv ➥ 3 |
| Best Explanation: Answer: I Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.12➡ | UGC NET JUNE 2023 Consider the following program fragment that deals with a table T with 17 rows and 1024 columns, computing an average for each column and printing it to screen (i is row index and j is column index): for j = [0….1023]{ temp = 0 for i = [0…16] temp = temp +T[i][j] print (temp/ 17.0); T [i] [j] and temp are 32 bit floating point values and memory is word addressable. The temporary variable temp is kept in a processor register so access to temp does not involve a memory reference. The main memory is page and holds 16 pages of size 1024 words, the page replacement policy is “least recently used “, If T is stored in the virtual address space in row major format. Consider that T is stored in column major format, how many page faults will be encountered? |
| i ➥ 14 |
| ii ➥ 15 |
| iii ➥ 16 |
| iv ➥ 17 |
| Best Explanation: Answer: IV Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.13➡ | UGC NET JUNE 2023 Consider the following program fragment that deals with a table T with 17 rows and 1024 columns, computing an average for each column and printing it to screen (i is row index and j is column index): for j = [0….1023]{ temp = 0 for i = [0…16] temp = temp +T[i][j] print (temp/ 17.0); T [i] [j] and temp are 32 bit floating point values and memory is word addressable. The temporary variable temp is kept in a processor register so access to temp does not involve a memory reference. The main memory is page and holds 16 pages of size 1024 words, the page replacement policy is “least recently used “, If T is stored in the virtual address space in row major format. How many page faults will be encountered? |
| i ➥ 16, 402 |
| ii ➥ 17, 408 |
| iii ➥ 18, 208 |
| iv ➥ 18, 608 |
| Best Explanation: Answer: II Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.14➡ | UGC NET JUNE 2023 Consider the following program fragment that deals with a table T with 17 rows and 1024 columns, computing an average for each column and printing it to screen (i is row index and j is column index): for j = [0….1023]{ temp = 0 for i = [0…16] temp = temp +T[i][j] print (temp/ 17.0); T [i] [j] and temp are 32 bit floating point values and memory is word addressable. The temporary variable temp is kept in a processor register so access to temp does not involve a memory reference. The main memory is page and holds 16 pages of size 1024 words, the page replacement policy is “least recently used “, If T is stored in the virtual address space in row major format. Consider again that T is stored in column-major format, what is the main memory hit ratio? |
| i ➥ 80% |
| ii ➥ 95.6% |
| iii ➥ 97.8% |
| iv ➥ 99.9% |
| Best Explanation: Answer: IV Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.15➡ | UGC NET JUNE 2023 Consider the following program fragment that deals with a table T with 17 rows and 1024 columns, computing an average for each column and printing it to screen (i is row index and j is column index): for j = [0….1023]{ temp = 0 for i = [0…16] temp = temp +T[i][j] print (temp/ 17.0); T [i] [j] and temp are 32 bit floating point values and memory is word addressable. The temporary variable temp is kept in a processor register so access to temp does not involve a memory reference. The main memory is page and holds 16 pages of size 1024 words, the page replacement policy is “least recently used “, If T is stored in the virtual address space in row major format. What is fault ratio of row major to column major arrangements? |
| i ➥ 1024 : 1 |
| ii ➥ 1301: 1 |
| iii ➥ 1240: 1 |
| iv ➥ 9107: 8 |
| Best Explanation: Answer: I Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.16➡ | UGC NET JUNE 2023 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 completion and device malfunction occuring within the I/O devices In the light of the above statements, choose the correct answer from the options given below. |
| i ➥ Both A and R are true and R is the correct explanation of A |
| ii ➥ Both A and R are true but R is NOT the correct explanation of A |
| iii ➥ A is true but R is false |
| iv ➥ A is false but R is true |
| Best Explanation: Answer: IV Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.17➡ | UGC NET JUNE 2023 At a particular time of computation, the value of a counting semaphore is 7. Then 20p operations and ‘ x ‘ V operations were completed on this semaphore. If the final value of semaphore is 5. x will be |
| i ➥ 15 |
| ii ➥ 22 |
| iii ➥ 18 |
| iv ➥ 13 |
| Best Explanation: Answer: III Explanation:  |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.18➡ | UGC NET JUNE 2023 The following table shows the time between failures for a software :  The reliability of the system for one hour operation assuming an exponential model is- |
| i ➥ e ^ (- 9/29) |
| ii ➥ e ^ (- 7/29) |
| iii ➥ e ^ (- 5/29) |
| iv ➥ e ^ (- 3/29) |
| Best Explanation: Answer: III Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.19➡ | UGC NET JUNE 2023 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 process Assertion A: Increasing number of page frames allocated to a process sometimes increases the page fault rate. Reason R: Some programs do not exhibit locality of reference. In the light of the above statements, choose the correct answer from the options given below. |
| i ➥ Both A and R are true and R is the correct explanation of A |
| ii ➥ Both A and R are true but R is NOT the correct explanation of A |
| iii ➥ A is true but R is false |
| iv ➥ A is false but R is true |
| Best Explanation: Answer: II Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.20➡ | UGC NET JUNE 2023 Consider the following statements about the software product line system: Statement I: At the interaction level, components provide an operator display interface and an interface with the communication system used. Statement II: At the I/O management level, components handle operator authentication, report generator and query manager. In the light of the above statements, choose the most appropriate answer from the options given below. |
| i ➥ Both Statement I and Statement II are correct |
| ii ➥ Both Statement I and Statement II are incorrect |
| iii ➥ Statement I is correct but Statement II is incorrect |
| iv ➥ Statement I is incorrect but Statement II is correct |
| Best Explanation: Answer: I Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.21➡ | UGC NET JUNE 2023 Match List I with List II  |
| i ➥ A-IV, B-I, C-III, D-II |
| ii ➥ A-II, B-I, C-III, D-IV |
| iii ➥ A-I, B-II, C-III, D-IV |
| iv ➥ A-IV, B-III, C-I, D-II |
| Best Explanation: Answer: II Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.22➡ | UGC NET JUNE 2023 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 convey their resource and I/O requirement to the Kernel. In the light of the above statements, choose the correct answer from the options given below. |
| i ➥ Both A and R are true and R is the correct explanation of A |
| ii ➥ Both A and R are true but R is NOT the correct explanation of A |
| iii ➥ A is true but R is false |
| iv ➥ A is false but R is true |
| Best Explanation: Answer: II Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.23➡ | UGC NET JUNE 2023 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 program Statement II: A program can execute only when all of its components are loaded in the memory In the light of the above statements, choose the most appropriate answer from the options given below. |
| i ➥ Both Statement I and Statement II are correct |
| ii ➥ Both Statement I and Statement II are incorrect |
| iii ➥ Statement I is correct but Statement II is incorrect |
| iv ➥ Statement I is incorrect but Statement II is correct |
| Best Explanation: Answer: III Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.24➡ | UGC NET JUNE 2023 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 |
| i ➥ S1 S2 and S3 are true |
| ii ➥ S1, S3 false and S2 is true |
| iii ➥ S1, S2 are false and S3 is true |
| iv ➥ S1, S2 and S3 are false |
| Best Explanation: Answer: II Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.25➡ | UGC NET JUNE 2023 Consider the following table of arrival time and burst time for three processes P0,P1 P2:  The pre-emptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of a process. What is the average waiting time for the three processes? |
| i ➥ 3 ms |
| ii ➥ 3.67 ms |
| iii ➥ 4.47 ms |
| iv ➥ 4 ms |
| Best Explanation: Answer: II Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.26➡ | UGC NET JUNE 2023 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 to satisfy all requests if it takes 1 ms to move from one cylinder to adjacent one and shortest seek time first policy is used? |
| i ➥ 119 ms |
| ii ➥ 120 ms |
| iii ➥ 142 ms |
| iv ➥ 146 ms |
| Best Explanation: Answer: I Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.27➡ | UGC NET JUNE 2023 In a multiuser operating system, 20 requests are made to use a particular resource per hour, on an average. The probability that no request is made in 45 minutes is. |
| i ➥ e−15 |
| ii ➥ e−5 |
| iii ➥ 1−e−5 |
| iv ➥ 1−e−10 |
| Best Explanation: Answer: I Explanation:  |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.28➡ | NET June 2023 Consider the following table of arrival time and burst time for three processes P0.P1 P2:  The pre-emptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of a process. What is the average waiting time for the three processes? |
| i ➥ 3 ms |
| ii ➥ 3.67 ms |
| iii ➥ 4.47 ms |
| iv ➥ 4 ms |
| Best Explanation: Answer: (ii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.29➡ | NET June 2023 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 |
| i ➥ S1, S2 and S3 are true |
| ii ➥ S1, S3 false and S2 is true |
| iii ➥ S1, S2 are false and S3 is true |
| iv ➥ S1, S2 and S3 are false |
| Best Explanation: Answer: (ii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.30➡ | NET June 2023 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 convey their resource and I/O requirement to the Kernel. In the light of the above statements, choose the correct answer from the options given below. |
| i ➥ Both A and R are true and R is the correct explanation of A |
| ii ➥ Both A and R are true but R is NOT the correct explanation of A |
| iii ➥ A is true but R is false |
| iv ➥ A is false but R is true |
| Best Explanation: Answer: (ii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.31➡ | NET June 2023 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 program. Statement II: A program can execute only when all of its components are loaded in the memory. In the light of the above statements, choose the most appropriate answer from the options given below. |
| i ➥ Both Statement I and Statement II are correct |
| ii ➥ Both Statement I and Statement II are incorrect |
| iii ➥ Statement I is correct but Statement II is incorrect |
| iv ➥ Statement I is incorrect but Statement II is correct |
| Best Explanation: Answer: (iii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.32➡ | NET June 2023 At a particular time of computation, the value of a counting semaphore is 7. Then 20 p operations and ‘x’ V operations were completed on this semaphore. If the final value of semaphore is 5. x will be ? |
| i ➥ 15 |
| ii ➥ 22 |
| iii ➥ 18 |
| iv ➥ 14 |
| Best Explanation: Answer: (iii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
Q.33➡ | NET June 2023 Choose the correct answer from the options given below: |
| i ➥ A-IV B-I C-III D-II |
| ii ➥ A-II B-I C-III D-IV |
| iii ➥ A-I B-II C-III D-IV |
| iv ➥ A-IV B-III C-I D-II |
| Best Explanation: Answer: (ii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.34➡ | NET June 2023 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 process Assertion A: Increasing number of page frames allocated to a process sometimes increases the page fault rate. Reason R: Some programs do not exhibit locality of reference. In the light of the above statements, choose the correct answer from the options given below |
| i ➥ Both A and R are true and R is the correct explanation of A |
| ii ➥ Both A and R are true but R is NOT the correct explanation of A |
| iii ➥ A is true but R is false |
| iv ➥ A is false but R is true |
| Best Explanation: Answer: (ii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.35➡ | NET December 2022 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. |
| i ➥ Fork() |
| ii ➥ Clone() |
| iii ➥ Pthread() |
| iv ➥ Thread() |
| Best Explanation: Answer: (ii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.36➡ | NET December 2022 The main function of the microkernel is to provide a communication facility between the _______ program and the various _______ that are also running in user space . |
| i ➥ Virtual, processes |
| ii ➥ System, processes |
| iii ➥ Client, services |
| iv ➥ Virtual, services |
| Best Explanation: Answer: (iii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.37➡ | NET December 2022 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 shorted 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? |
| i ➥ 50% |
| ii ➥ 100% |
| iii ➥ 25% |
| iv ➥ 0% |
| Best Explanation: Answer: (iv) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.38➡ | NET December 2022 For the following set of processes scheduled using FCFS policy, determine the average waiting time. Assume that the processes arrived in the order P1, P2, P3, P4.  |
| i ➥ 8 |
| ii ➥ 16 |
| iii ➥ 32 |
| iv ➥ 48 |
| Best Explanation: Answer: (ii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.39➡ | NET December 2022 Which of the statement is not true in regards to virtual memory? |
| i ➥ The main objective for using virtual memory is to increase the effective capacity of the memory system |
| ii ➥ Size of the program can be as large as the size of the secondary memory |
| iii ➥ Program and data are stored in the secondary memory |
| iv ➥ None of these |
| Best Explanation: Answer: (iv) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.40➡ | NET December 2022 Which of the following statements are true? (A) Shortest remaining time first scheduling may cause starvation (B) Preemptive scheduling may cause starvation (C) Round robin is better than FCFS in term of response time Choose the correct answer from the options given below: |
| i ➥ A only |
| ii ➥ B, C only |
| iii ➥ A, B only |
| iv ➥ A, B, C |
| Best Explanation: Answer: (iv) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.41➡ | NET December 2022 In design protocol of critical section problem, each process must ask permission to enter critical section in ……… code, it then executes in the critical section; once it, finishes executes in the critical section it enters the …….. code. The process then enters the……..code. |
| i ➥ entry section, remainder section, exit section |
| ii ➥ entry section, exit section, remainder section |
| iii ➥ remainder section, entry section, exit section |
| iv ➥ remainder section, exit section, entry section |
| Best Explanation: Answer: (ii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.42➡ | NET December 2022 Match List (I) with List (II)  Choose the correct answer from the options given below: |
| i ➥ A-(II), B-(I), C-(IV), D-(III) |
| ii ➥ A-(II), B-(IV), C-(I), D-(III) |
| iii ➥ A-(I), B-(II), C-(III), D-(IV) |
| iv ➥ A-(II), B-(III), C-(I), D-(IV) |
| Best Explanation: Answer: (ii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.43➡ | NET December 2022 Select the correct order of events after power is initialized on a system: (A) Bootstrap loader is loaded from the disk (B) Kernel is loaded onto the memory (C) Firmware ROM loads boot block Choose the correct answer from the options given below: |
| i ➥ B, C, A |
| ii ➥ C, A, B |
| iii ➥ A, B, C |
| iv ➥ A, C, B |
| Best Explanation: Answer: (ii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.44➡ | NET December 2022 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…………. |
| i ➥ 80 ms |
| ii ➥ 76 ms |
| iii ➥ 84 ms |
| iv ➥ None of the above |
| Best Explanation: Answer: (ii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.45➡ | NET June 2022 If an operating system does not allow a child process to exist when the parent process has been terminated, this phenomenon is called as – |
| i ➥ Threading |
| ii ➥ Cascading termination |
| iii ➥ Zombie termination |
| iv ➥ Process killing |
| Best Explanation: Answer: (ii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.46➡ | NET June 2022 For the following page reference string 4, 3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5 the number of page faults that occur in Least Recently Used (LRU) page replacement algorithm with frame size 3 is |
| i ➥ 6 |
| ii ➥ 8 |
| iii ➥ 10 |
| iv ➥ 12 |
| Best Explanation: Answer: (iii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.47➡ | NET June 2022 what is called journaling in Linux operating system? |
| i ➥ Process scheduling |
| ii ➥ File saving as transaction |
| iii ➥ A type of thread |
| iv ➥ An editor |
| Best Explanation: Answer: (ii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
Q.48➡ | NET June 2022 |
| i ➥ (A)-(III),(B)-(II),(C)-(IV),(D)-(I) |
| ii ➥ (A)-(II),(B)-(III),(C)-(IV),(D)-(I) |
| iii ➥ (A)-(III),(B)-(II),(C)-(I),(D)-(IV) |
| iv ➥ (A)-(II),(B)-(III),(C)-(I),(D)-(IV) |
| Best Explanation: Answer: (i) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
Q.49➡ | NET June 2022 |
| i ➥ (A)-(III),(B)-(II),(C)-(IV),(D)-(I) |
| ii ➥ (A)-(I),(B)-(II),(C)-(III),(D)-(IV) |
| iii ➥ (A)-(II),(B)-(III),(C)-(I),(D)-(IV) |
| iv ➥ (A)-(II),(B)-(I),(C)-(III),(D)-(IV) |
| Best Explanation: Answer: (iii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
Q.50➡ | NET June 2022 |
| i ➥ (A)-(II),(B)-(I),(C)-(IV),(D)-(III) |
| ii ➥ (A)-(II),(B)-(I),(C)-(III),(D)-(IV) |
| iii ➥ (A)-(IV),(B)-(II),(C)-(I),(D)-(III) |
| iv ➥ (A)-(IV),(B)-(I),(C)-(II),(D)-(III) |
| Best Explanation: Answer: (iii) Explanation: Upload Soon |
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.51➡ | NET June 2021 Given memory access time as p nanoseconds and additional q nanoseconds for handling the page fault. What is the effective memory access time if a page fault occurs once for every 100 instructions? |
i ➥  |
ii ➥  |
iii ➥  |
iv ➥  |
| Answer: I ➥ Click below to see detailed Solution |
| [Easy Solution] | Explanation On YouTube | Page Fault | Help-Line |
| Q.52➡ | NET June 2021 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: |
| i ➥ A and B only |
| ii ➥ A only |
| iii ➥ B and C only |
| iv ➥ C only |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.53➡ | NET June 2021 Match List I with List II  Choose the correct answer from the options given below: |
| i ➥ A – II , B – III , C – IV , D – I |
| ii ➥ A – IV , B – I , C – II , D – III |
| iii ➥ A – IV , B – III , C – I , D – II |
| iv ➥ A – IV , B – III , C – II, D – I |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.54➡ | NET June 2021 Consider the following 3 processes with the length of the CPU burst time given in milliseconds:  What is the average waiting time for these processes if they are scheduled using preemptive shortest job first scheduling algorithm? |
| i ➥ 2.66 |
| ii ➥ 4.66 |
| iii ➥ 5.5 |
| iv ➥ 6 |
| Answer: II ➥ Click below to see detailed Solution |
| [Easy Solution] | Explanation On YouTube | CPU Scheduling | Help-Line |
| Q.55➡ | NET June 2021 Comprehension: Q5 to Q9 Read the following and answer the questions: Consider a machine with 16 GB main memory and 32-bits virtual address space, with page size as 4KB. Frame size and page size is same for the given machine. If a process of size 34KB is to be executed on this machine, then what will be the size of internal fragmentation for this process? |
| i ➥ 1KB |
| ii ➥ 2KB |
| iii ➥ 4KB |
| iv ➥ Zero |
| Answer: II ➥ Click below to see detailed Solution |
| [Easy Solution] | Explanation On YouTube | Memory Management | Help-Line |
| Q.56➡ | NET June 2021 Comprehension: Q5 to Q9 Read the following and answer the questions: Consider a machine with 16 GB main memory and 32-bits virtual address space, with page size as 4KB. Frame size and page size is same for the given machine. What is the size of page table for handling the given virtual address space, given that each page table entry is of size 2 bytes? |
| i ➥ 12KB |
| ii ➥ 2KB |
| iii ➥ 2MB |
| iv ➥ 32MB |
| Answer: III ➥ Click below to see detailed Solution |
| [Easy Solution] | Explanation On YouTube | Memory Management | Help-Line |
| Q.57➡ | NET June 2021 Comprehension: Q5 to Q9 Read the following and answer the questions: Consider a machine with 16 GB main memory and 32-bits virtual address space, with page size as 4KB. Frame size and page size is same for the given machine. What is the minimum number of bits needed for the physical address? |
| i ➥ 12 |
| ii ➥ 24 |
| iii ➥ 28 |
| iv ➥ 34 |
| Answer: IV ➥ Click below to see detailed Solution |
| [Easy Solution] | Explanation On YouTube | Memory Management | Help-Line |
| Q.58➡ | NET June 2021 Comprehension: Q5 to Q9 Read the following and answer the questions: Consider a machine with 16 GB main memory and 32-bits virtual address space, with page size as 4KB. Frame size and page size is same for the given machine. The number of bits reserved for the frame offset is __________. |
| i ➥ 12 |
| ii ➥ 14 |
| iii ➥ 32 |
| iv ➥ 8 |
| Answer: I ➥ Click below to see detailed Easy Solution |
| [Easy Solution] | Explanation On YouTube | Memory Management | Help-Line |
| Q.59➡ | NET June 2021 Comprehension: Q5 to Q9 Read the following and answer the questions: Consider a machine with 16 GB main memory and 32-bits virtual address space, with page size as 4KB. Frame size and page size is same for the given machine. Find number of pages required for the given virtual address space? |
| i ➥ 210 |
| ii ➥ 212 |
| iii ➥ 220 |
| iv ➥ 230 |
| Answer: III ➥ Click below to see detailed Easy Solution |
| [Easy Solution] | Explanation On YouTube | Memory Management | Help-Line |
| Q.60➡ | UGC NET November 2020 Suppose you have a Linux file system where the block size is 2K bytes, a disk address is 32 bits, and i-node contains the disk addresses of the first 12 direct blocks of file, a single indirect block, and a double indirect block. Approximately, what is the largest file that can be represented by an i-node? |
| i ➥ 513 Kbytes |
| ii ➥ 513 Mbytes |
| iii ➥ 537 Mbytes |
| iv ➥ 537 KBytes |
| Answer: II ➥ Click below to see detailed Easy Solution |
| [Easy Solution] | Explanation On YouTube | File System | Help-Line |
| Q.61➡ | UGC NET November 2020 Which of the following cloud concept/s is/are related to pooling and sharing of resources? A) Virtual Memory B) Service C) Virtualization Choose the correct answer from the options given below: |
| i ➥ (C) only |
| ii ➥ (A) and (B) only |
| iii ➥ (A) only |
| iv ➥ (B) only |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.62➡ | UGC NET November 2020 Assuming that the system call fork () never fails, consider the following C programs P1 and P2 executed on a UNIX/ Linux system:  Statement I: P1 displays “Happy” 8 times. Statement II: P2 displays “Happy” 12 times. In the light of the above statements, choose the correct answer from the options given below: |
| i ➥ Both Statement I and Statement II are true |
| ii ➥ Both Statement I and Statement II are false |
| iii ➥ Statement I is correct but Statement II is false |
| iv ➥ Statement I is incorrect but Statement II is true |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.63➡ | UGC NET November 2020 Consider a hypothetical machine with 3 pages of physical memory, 5 pages of virtual memory, and < A,B,C,D,A,B,E,A,B,C,D,E,B,A,B> as the stream of page reference by an application. if P and Q are the number of page faults that the application would incur with FIFO and LRU page replacement algorithms respectively, then (P,Q)=_________(Assuming enough space for storing 3 page frames) |
| i ➥ (11,10) |
| ii ➥ (12,11) |
| iii ➥ (10,11) |
| iv ➥ (11,12) |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.64➡ | UGC NET November 2020 Consider a disk system having 60 cylinders. Disk requests are received by a 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 adjacent one and Shortest Seek Time First (SSTF) algorithm is used? |
| i ➥ 240 milliseconds |
| ii ➥ 96 milliseconds |
| iii ➥ 120 milliseconds |
| iv ➥ 112 milliseconds |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.65➡ | UGC NET November 2020 Which of the following statements with respect to the multiprocessor system are true? A) Multiprocessor system is controlled by one operating system. B) In a Multiprocessor system, multiple computers are connected by means of communication lines. C) Multiprocessor system is classified as multiple instruction streams and multiple data stream systems. Choose the correct answer from the options given below |
| i➥ (A) only |
| ii ➥ (A) and (B) Only |
| iii ➥ (A) and (C) only |
| iv ➥ (B) and (C) only |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
Q.66➡ | UGC NET December 2019 Find average turnaround time and average waiting time using round robin CPU scheduling? |
| i ➥ 4, 0 |
| ii ➥ 5.66, 1.66 |
| iii ➥ 5.66, 0 |
| iv ➥ 7, 2 |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.67➡ | UGC NET December 2019 Suppose a system has 12 magnetic tape drives and at time t0, three processes are allotted tape drives out of their need as given below: At time t0, the system is in safe state.  Which of the following is safe sequence so that deadlock is avoided? |
| i ➥ (p0, p1, p2) |
| ii ➥ (p1, p0, p2) |
| iii ➥ (p2, p1, p0) |
| iv ➥ (p0, p2, p1) |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.68➡ | UGC NET December 2019 Identify the circumstances under which preemptive CPU scheduling is used : (a) A process switches from Running state to Ready state (b) A process switches from Waiting state to Ready state (c) A process completes its execution (d) A process switches from Ready to Waiting state Choose the correct option: |
| i ➥ (a) and (b) only |
| ii ➥ (a) and (d) only |
| iii ➥ (c) and (d) only |
| iv ➥ (a), (b), (c) only |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.69➡ | UGC NET December 2019 Which of the following inter-process communication model is used to exchange messages among co-operative processes? |
| i ➥ Shared memory model |
| ii ➥ Message passing model |
| iii ➥ Shared memory and message passing model. |
| iv ➥ Queues |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.70➡ | UGC NET December 2019 A counting semaphore is initialized to 8. 3 wait() operations and 4 signal() operations are applied. Find the current value of semaphore variable |
| i ➥ 9 |
| ii ➥ 5 |
| iii ➥ 1 |
| iv ➥ 4 |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.71➡ | UGC NET December 2019 Consider the following statements : (a) Windows Azure is a cloud-based operating system. (b) Google App Engine is an integrated set of online services for consumers to communicate and share with others. (c) Amazon Cloud Front is a web service for content delivery. Which of the statements is (are) correct? |
| i ➥ Only (a) and (b) |
| ii ➥ Only (a) and (c) |
| iii ➥ Only (b) and (c) |
| iv ➥ (a), (b) and (c) |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.72➡ | UGC NET December 2019 Which of the following CPU scheduling algorithms is/are supported by LINUX operating system? |
| i ➥ Non-preemptive priority scheduling |
| ii ➥ Preemptive priority scheduling and time sharing CPU scheduling |
| iii ➥ Time sharing scheduling only |
| iv ➥ Priority scheduling only |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.73➡ | UGC NET December 2019 Which of the following methods are used to pass any number of parameters to the operating system through system calls? |
| i ➥ Registers |
| ii ➥ Block or table in main memory |
| iii ➥ Stack |
| iv ➥ Block in main memory and stack |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.74➡ | UGC NET June 2019 A computer has six tapes drives with n processes competing for them. Each process may need two drives. What is the maximum value of n for the system to be deadlock free? |
| i ➥ 5 |
| ii ➥ 4 |
| iii ➥ 3 |
| iv ➥ 6 |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.75➡ | UGC NET June 2019 Match List-I with List-II  Choose the correct option from those given below: |
| i ➥ (a)-(i); (b)-(ii); (c)-(iii); (d)-(iv) |
| ii ➥ (a)-(iii); (b)-(i); (c)-(iv); (d)-(ii) |
| iii ➥ (a)-(ii); (b)-(i); (c)-(iv); (d)-(iii) |
| iv ➥ (a)-(ii); (b)-(iv); (c)-(iii);(d)-(i) |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.76➡ | UGC NET June 2019 Consider a disk system with 100 cylinders. The requests to access the cylinders occur in the following sequence: 4,34,10,7,19,73,2,15,6,20 Assuming that the head is current at cylinder 50, what is the time taken to satisfy all requests if it takes 1ms to move from the cylinder to adjacent one and the shortest seek time first policy is used? |
| i ➥ 357 ms |
| ii ➥ 238 ms |
| iii ➥ 276 ms |
| iv ➥ 119 ms |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.77➡ | UGC NET June 2019 At a particular time of computation, the value of a counting semaphore is 7. Then 20 P(wait) operations and 15 V(signal) operations are completed on this semaphore. What is the resulting value of the semaphore? |
| i ➥ 28 |
| ii ➥ 12 |
| iii ➥ 2 |
| iv ➥ 42 |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.78➡ | UGC NET June 2019 Consider three intensive processes, which requires 10,20 and 30 units of time and arrive at times 0,2 and 6 respectively. how many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero ad at the end |
| i ➥ 4 |
| ii ➥ 2 |
| iii ➥ 3 |
| iv ➥ 1 |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.79➡ | UGC NET June 2019 Consider that a process has been allocated 3 frames and has a sequence of page referencing 1,2,1,3,7,4,5,6,3,1 What shall be the difference i page faults for the above string using the algorithm of LRU and Optimal page replacement for referencing the string? |
| i ➥ 2 |
| ii ➥ 0 |
| iii ➥ 1 |
| iv ➥ 3 |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.80➡ | UGC NET June 2019 The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by |
| i ➥ Page size |
| ii ➥ Physical size of memory |
| iii ➥ The instruction set architecture |
| iv ➥ Number of processes in memory |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.81➡ | UGC NET June 2019 A processor can support a maximum memory of 4 GB where memory is word addressable and a word is 2 bytes. What will be the size of the address bus of the processor? |
| i ➥ At least 28 bits |
| ii ➥ At least 2 bytes |
| iii ➥ At least 31 bits |
| iv ➥ Minimum 4 bytes |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.82➡ | UGC NET June 2019 Which of the following UNIX/Linux pipes will count the number of lines in all the files having .c and .h as their extension in the current working directory? |
| i ➥ cat *.ch | wc -l |
| ii ➥ cat *.[c-h] | wc -l |
| iii ➥ cat *.[ch] | ls -l |
| iv ➥ cat *.[ch] | wc -l |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.83➡ | UGC NET June 2019 Which of the following are not shared by the threads of the same process? (a) Stack (b) Registers (c) Address Space (d) Message Queue |
| i ➥ (a) and (d) |
| ii ➥ (b) and (c) |
| iii ➥ (a) and (b) |
| iv ➥ (a), (b) and (c) |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.84➡ | UGC NET December 2018 Suppose a system has 12 instances of some resources with n processes competing for that resource. Each process may require 4 instances of the resource. The maximum value of n for which the system never enters into deadlock is |
| i ➥ 3 |
| ii ➥ 4 |
| iii ➥ 5 |
| iv ➥ 6 |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.85➡ | UGC NET December 2018 Suppose P,Q and R are co-operating processes satisfying Mutual Exclusion condition. Then if the process Q is executing in its critical section then |
| i ➥ ‘P’ executes in critical section |
| ii ➥ ‘R’ executes in critical section |
| iii ➥ Neither ‘P’ nor ‘R’ executes in their critical section |
| iv ➥ Both ‘P’ and ‘R’ executes in critical section |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.86➡ | UGC NET December 2018 A Computer uses a memory unit with 256K word of 32 bits each. A binary instruction code is stored in one word of memory. The instruction has four parts: an indirect bit, an operation code and a register code part to specify one of 64 registers and an address part. How many bits are there in operation code, the register code part and the address part? |
| i ➥ 7,7,18 |
| ii ➥ 18,7,7 |
| iii ➥ 7,6,18 |
| iv ➥ 6,7,18 |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.87➡ | UGC NET December 2018 Consider the following set of processes and the length of CPU burst time given in milliseconds:  Assume that processes being scheduled with Round-Robin Scheduling Algorithm with Time Quantum 4ms. Then The waiting time for P4 is_______ms. |
| i ➥ 0 |
| ii ➥ 4 |
| iii ➥ 12 |
| iv ➥ 6 |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.88➡ | UGC NET December 2018 Consider a system with 2 level cache. Access times of Level 1, Level 2 cache and main memory are 0.5 ns, 5 ns and 100 ns respectively. The hit rates of Level1 and Level2 caches are 0.7 and 0.8 respectively. What is the average access time of the system ignoring the search time within cache? |
| i ➥ 20.75 ns |
| ii ➥ 7.55 ns |
| iii ➥ 24.35 ns |
| iv ➥ 35.20 ns |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.89➡ | UGC NET December 2018 Consider a disk pack with 32 surfaces, 64 tracks and 512 sectors per pack. 256 bytes of data are stored in a bit serial manner in a sector. The number of bits required to specify a particular sector in the disk is |
| i ➥ 19 |
| ii ➥ 20 |
| iii ➥ 18 |
| iv ➥ 22 |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.90➡ | UGC NET December 2018 Dirty bit is used to show the |
| i ➥ Page with low frequency occurrence |
| ii ➥ Wrong page |
| iii ➥ Page with corrupted data |
| iv ➥ Page that is modified after being loaded into cache memory |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.91➡ | UGC NET December 2018 In Linux operating system environment____________command is used to print a file. |
| i ➥ print |
| ii ➥ lpr |
| iii ➥ ptr |
| iv ➥ pr |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.92➡ | UGC NET December 2018 Suppose for a process P, reference to pages in order are 1, 2, 4, 5,2,1,2,4. Assume that main memory can accommodate 3 pages and the main memory has already pages 1 and 2 in the order 1 – first, 2- second. At this moment, assume FIFO Page Replacement Algorithm is used then the number of page faults that occur to complete the execution of process P is |
| i ➥ 6 |
| ii ➥ 4 |
| iii ➥ 3 |
| iv ➥ 5 |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.93➡ | UGC NET December 2018 ________system call creates new process in Unix. |
| i ➥ fork |
| ii ➥ fork new |
| iii ➥ create |
| iv ➥ create new |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.94➡ | UGC NET December 2018 A process residing in main memory and ready and waiting for execution, is kept on |
| i ➥ Job Queue |
| ii ➥ Execution Queue |
| iii ➥ Wait Queue |
| iv ➥ Ready Queue |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.95➡ | UGC NET June 2018 At a particular time of computation, the value of a counting semaphore is 10. Then 12 P operations and “x” V operations were performed on this semaphore. If the final value of semaphore is 7, x will be : |
| i ➥ 8 |
| ii ➥ 9 |
| iii ➥ 11 |
| iv ➥ 10 |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.96➡ | UGC NET June 2018 In a paged memory, the page hit ratio is 0.40. The time required to access a page in secondary memory is equal to 120 ns. The time required to access a page in primary memory is 15 ns. The average time required to access a page is |
| i ➥ |
| ii ➥ 68 |
| iii ➥ 75 |
| iv ➥ 78 |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.97➡ | UGC NET June 2018 In a multi-user operating system, 30 requests are made to use a particular resource per hour, on an average. The probability that no requests are made in 40 minutes, when arrival pattern is a poisson distribution, is __ |
| i ➥ e-15 |
| ii ➥ 1-e-15 |
| iii ➥ 1-e-20 |
| iv ➥ e-20 |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.98➡ | UGC NET June 2018 Normally user programs are prevented from handling I/O directly by I/O instructions in them. For CPUs having explicit I/O instructions, such I/O protection is ensured by having the I/O instructions privileged. In a CPU with memory mapped I/O, there is no explicit I/O instruction. Which one of the following is true for a CPU with memory mapped I/O ? |
| i ➥ I/O protection is ensured by operating system routines. |
| ii ➥ I/O protection is ensured by a hardware trap. |
| iii ➥ I/O protection is ensured during system configuration. |
| iv ➥ I/O protection is not possible. |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.99➡ | UGC NET June 2018 Which UNIX/Linux command is used to make all files and sub-directories in the directory “progs” executable by all users ? |
| i ➥ chmod− R a+x progs |
| ii ➥ chmod −R 222 progs |
| iii ➥ chmod−X a+x progs |
| iv ➥ chmod −X 222 progs |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q.100➡ | UGC NET June 2018 Which of the following statements are true ? (i) External Fragmentation exists when there is enough total memory space to satisfy a request but the available space is contiguous. (ii) Memory Fragmentation can be internal as well as external. (iii) One solution to external Fragmentation is compaction. Code: |
| i ➥ (a) and (b) only |
| ii ➥ (a) and (c) only |
| iii ➥ (b) and (c) only |
| iv ➥ (a), (b) and (c) |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q51➡ | UGC NET June 2018 Page information in memory is also called as Page Table. The essential contents in each entry of a page table is/are . |
| i ➥ Page Access information |
| ii ➥ Virtual Page number |
| iii ➥ Page Frame number |
| iv ➥ Both virtual page number and Page Frame Number |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q52➡ | UGC NET June 2018 Consider a virtual page reference string 1, 2, 3, 2, 4, 2, 5, 2, 3, 4. Suppose LRU page replacement algorithm is implemented with 3 page frames in main memory. Then the number of page faults are . |
| i ➥ 5 |
| ii ➥ 7 |
| iii ➥ 9 |
| iv ➥ 10 |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q53➡ | UGC NET June 2018 Consider the following three processes with the arrival time and CPU burst time given in milliseconds :  The Gantt Chart for preemptive SJF scheduling algorithm is |
i ➥  |
ii ➥  |
iii ➥  |
iv ➥  |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q54➡ | UGC NET June 2018 In which of the following scheduling criteria, context switching will never take place ? |
| i ➥ ROUND ROBIN |
| ii ➥ Preemptive SJF |
| iii ➥ Non-preemptive SJF |
| iv ➥ Preemptive priority |
Show Answer With Best Explanation
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |