GK

1. An Integer variable that is used to manage concurrent processes is called…..
   (A) Thread
   (B) Semaphore
   (C) Counter
   (D) None of the above
   
   Answer

   (B) Semaphore
2. Dijkstra’s banking algorithm for resource allocation is used for
   (A) Deadlock detection
   (B) Deadlock prevention
   (C) Deadlock avoidance
   (D) Deadlock recovery
   
   Answer

   (C) Deadlock avoidance
3. In UNIX, cached disk blocks are managed by the Kernel and referred to as…..
   (A) Cache
   (B) Disk Cache
   (C) Buffer Cache
   (D) None of the above
   
   Answer

   (C) Buffer Cache
4. …… is the smallest unit for processing that consists of a program counter, a stack & a set of registers.
   (A) Compiler
   (B) Thread
   (C) Heap
   (D) None of the above
   
   Answer

   (B) Thread
5. Which of the following services is not supported by the OS?
   (A) I/O Operation
   (B) Protection
   (C) Compilation
   (D) None of the above
   
   Answer

   (C) Compilation
6. Which of the following is used to remove deadlock?
   (A) Preemption
   (B) Mutual Exclusion
   (C) Circular Wait
   (D) None of the above
   
   Answer

   (A) Preemption
7. First Come First Serve (FCFS) Scheduling is…….
   (A) used to reduce waiting time
   (B) easy to understand and implement
   (C) impossible to implement
   (D) None of the Above
   
   Answer

   (B) easy to understand and implement
8. ……… is a system call of OS that is used to create a new process?
   (A) Shell
   (B) Kernel
   (C) Fork
   (D) Thread
   
   Answer

   (C) Fork
9. Which of the following is an example of Cooperative Multi-Tasking OS?
   (A) Lynx OS
   (B) Mac OS
   (C) MS DOS
   (D) None of the above
   
   Answer

   (B) Mac OS
10. The performance of Round Robin(RR) scheduling depends on……
    (A) quantum
    (B) priority
    (C) preemption
    (D) None of the above
    
    Answer

    (A) quantum