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.

171. When a process is accessing shared modifiable data, the process is said to be in:
a. Dead lock
b. Critical Section
c. Multitasking
d. Context Switching
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).Critical Section

172. The first MPI function call made by every MPI process is the call to:
a. MPI_Main()
b. MPI_Wtick()
c. MPI_Init()
d. MPI_Bcast()
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).MPI_Init()

173. Dijkstra’s Banker’s algorithm is used for:
a. Deadlock Prevention
b. Deadlock Detection
c. Deadlock Recovery
d. Deadlock Avoidance
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).Deadlock Avoidance

174. Memory bank experiencing too much contention from processor:
a. Fan-in
b. Hot-spot
c. Thrash
d. Fan-out
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).Thrash

175. 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
a. 18
b. 19
c. 20
d. 22
View Answer Report Discuss Too Difficult!
Answer: (c).20

176. Consider a system with 2 level cache. Access times of Level 1 cache, Level 2 cache and main memory are 0.5 ns, 5 ns and 100 ns respectively. The hit rates of Level 1 and Level 2 caches are 0.7 and 0.8 respectively. What is the average access time of the system ignoring the search time within the cache?
a. 35.20 ns
b. 7.55 ns
c. 20.75 ns
d. 24.35 ns
View Answer Report Discuss Too Difficult!
Answer: (b).7.55 ns

177. To overcome difficulties in Readers-Writers problem, which of the following statement/s is/are true?

(i) Writers are given exclusive access to shared objects
(ii) Readers are given exclusive access to shared objects
(iii) Both Readers and Writers are given exclusive access to shared objects
a. (i) only
b. (ii) only
c. (iii) only
d. Both (ii) and (iii)
View Answer Report Discuss Too Difficult!
Answer: (a).(i) only

178. Suppose a system has 12 instances of some resource 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
a. 3
b. 4
c. 5
d. 6
View Answer Report Discuss Too Difficult!
Answer: (a).3

179. Dirty bit is used to show the
a. wrong page
b. page with corrupted data
c. page with low frequency occurrence
d. page that is modified after being loaded into cache memory
View Answer Report Discuss Too Difficult!
Answer: (d).page that is modified after being loaded into cache memory

180. 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 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
a. 4
b. 3
c. 5
d. 6
View Answer Report Discuss Too Difficult!
Answer: (c).5