A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

141. An example of a non-preemptive CPU scheduling algorithm is:
a. Shortest job first scheduling
b. Round robin scheduling
c. Priority scheduling
d. Fair share scheduling
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).Shortest job first scheduling

142. There are ‘n’ processes in memory. A process spends a fraction ‘p’ of its time waiting for I/O to complete. The CPU utilization is given by:
a. p^n
b. 1 - p^n
c. (1-p)^n
d. 1-np
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).1 - p^n

143. With 64 bit virtual addresses, a 4KB page and 256 MB of RAM, an inverted page table requires:
a. 8192 entries
b. 16384 entries
c. 32768 entries
d. 65536 entries
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).65536 entries

144. A computer has 6 tape drives with ‘n’ processes competing for them. Each process may need two drives. For which values of ‘n’ is the system deadlock free ?
a. 1
b. 2
c. 3
d. 6
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).3

145. A program has five virtual pages, numbered from 0 to 4. If the pages are referenced in the order 012301401234, with three page frames, the total number of page faults with FIFO will be equal to:
a. 0
b. 4
c. 6
d. 9
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).9

146. Average process size=s bytes. Each page entry requires e bytes. The optimum page size is given by:
a. √(se)
b. √(2se)
c. s
d. e
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).√(2se)

147. The aging algorithm with a=0.5 is used to predict run times. The previous four runs from oldest to most recent are 40, 20, 20 and 15 msec. The prediction for the next time will be:
a. 15 msec
b. 25 msec
c. 39 msec
d. 40 msec
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).25 msec

148. Moving process from main memory to disk is called:
a. Caching
b. Termination
c. Swapping
d. Interruption
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).Swapping

149. Part of a program where the shared memory is accessed and which should be executed indivisibly, is called:
a. Semaphores
b. Directory
c. Critical Section
d. Mutual exclusion
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).Critical Section

150. Windows is a .................. operating system.
a. Non pre-emptive
b. Pre-emptive
c. Multi-user
d. Real time
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).Multi-user