Friday 7 March 2014

OPERATING SYSTEM SOLVED MCQS

1) A thread
 A.    Is a lightweight process where the context switching is low
 B.    Is a lightweight process where the context switching is high
 C.     Is used to speed up paging
 D.     None of the above
 Ans:-A


2) Virtual memory can be implemented with
 A.    Segmentation
 B.    Paging
 C.     None
 D.     All of the above

Ans:- D

3) Memory utilization factor shall be computed as follows
 A.    Memory in use/allocated memory
 B.    Memory in use/total memory connected
 C.     Memory allocated/total memory available
 D.     Memory committed/total memory available

Ans:-

4) The size of the virtual memory depends on the size of the
 A.    Data bus
 B.    Main memory
 C.     Address bus
 D.     None of these

Ans:-  C

5) Which of the following is the solution of priority inversion problem?
 A.    Kill the higher priority process
 B.    Kill the lower priority process
 C.     Priority inheritance protocol
 D.     Semaphore

Ans:-  C

6) Program counter specifies
 A.    The current instruction to execute
 B.    The previous instruction to execute
 C.     The next instruction to execute
 D.     The last instruction to execute

Ans:- C

7) Where does the swap space residable?
 A.    RAM
 B.    Disk
 C.     ROM
 D.     On chip cache

Ans:- B

8) Which is the first program run on a computer when the computer boots up?
 A.    System software
 B.    Operating system
 C.     System operations
 D.     None
Ans:-B

9) A major security problem for operating system is
 A.    Authentication problem
 B.    Physical problem
 C.     Human problem
 D.     None of these

Ans:-A

10) Which of the following statements is true?
 A.    Segmentation is faster then paging
 B.    Paging is faster then segmentation
 C.     Paging and segmentation both having equal speed
 D.     None of these

Ans:-B

11) What is the reference count field in the inode?
 A.    It counts the number of processes currently executing in the inode.
 B.    It counts the number of hard links presently pointing at a particular inode.
 C.     It count the size of memory required by the inode.
 D.     None of the above.

Ans:-B

12) The mechanism that bring a page into memory only when it is needed is called
 A.    Segmentation
 B.    Fragmentation
 C.     Demand Paging
 D.     Page Replacement

Ans:-C
     Explanation Under the concept of demand paging , the page is brought into the memory only when it is needed 


13) Output hardware is often categorized according to whether it
 A.    Is expensive
 B.    Requires a large amount of electricity to work
 C.     Produces hardcopy or softcopy
 D.     Can fit on a desk top

Ans:-C

14) The operating system creates _____ from the physical computer
 A.    Virtual space
 B.    Virtual computers
 C.     Virtual device
 D.     None

Ans:- B

15) Several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place, is called a(n)
 A.    Shared memory segments
 B.    Race condition
 C.     Entry section
 D.     Process synchronization

Ans:-B

16) What is the reference count field in the inode? 
 A. It counts the number of processes currently executing in the inode.
 B. It counts the number of hard links presently pointing at a particular inode.
 C. It count the size of memory required by the inode.
 D. None of the above.
Ans:-B

17) The mechanism that bring a page into memory only when it is needed is called 
 A. Segmentation
 B. Fragmentation
 C. Demand Paging
 D. Page Replacement
Ans:- C
  Explanation Under the concept of demand paging , the page is brought into the memory only when it is needed 

18) Output hardware is often categorized according to whether it 
 A. Is expensive
 B. Requires a large amount of electricity to work
 C. Produces hardcopy or softcopy
 D. Can fit on a desk top
Ans:- C

19) The operating system creates _____ from the physical computer 
 A. Virtual space
 B. Virtual computers
 C. Virtual device
 D. None
Ans:-B

20) Several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place, is called a(n) 
 A. Shared memory segments
 B. Race condition
 C. Entry section
 D. Process synchronization
Ans:-B 

No comments:

Post a Comment