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.

Important Notice!

Dear users, compscibits.com is now permanently moved to compsciedu.com. Please update all your links and bookmarks accordingly. Soon, the site will be accessible through URL compsciedu.com only.

121. Applications-software
a. is used to control the operating system
b. includes programs designed to help programmers
c. performs a specific task for computer users
d. all of the above
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).performs a specific task for computer users

122. At any given time Parallel Virtual Machine (PVM) has ……………. send buffer and …………… receive buffer.
a. one-one
b. one-two
c. two-two
d. two-one
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).one-two

123. In the process management Round-robin method is essentially the pre-emptive version of …………
a. FILO
b. FIFO
c. SSF
d. Longest time first
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).FIFO

124. A page fault
a. is an error specific page.
b. is an access to the page not currently in memory.
c. occur when a page program occur in a page memory.
d. page used in the previous page reference.
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).is an access to the page not currently in memory.

125. A semaphore count of negative n means (s = –n) that the queue contains ………….. waiting processes.
a. n + 1
b. n
c. n – 1
d. 0
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).n

126. A program is located in the smallest available hole in the memory is ……………
a. best – fit
b. first – bit
c. worst – fit
d. buddy
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).best – fit

127. With a four programs in memory and with 80% average I/O wait, the CPU utilization is?
a. 60%
b. 70%
c. 90%
d. 100%
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).60%

128. Assume N segments in memory and a page size of P bytes. The wastage on account of internal fragmentation is:
a. NP/2 bytes
b. P/2 bytes
c. N/2 bytes
d. NP bytes
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).NP/2 bytes

129. Suppose it takes 100 ns to access a page table and 20 ns to access associative memory with a 90% hit rate, the average access time equals:
a. 20 ns
b. 28 ns
c. 90 ns
d. 100 ns
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).28 ns

130. Variable partition memory management technique with compaction results in:
a. Reduction of fragmentation
b. Minimal wastage
c. Segment sharing
d. None of the above
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).Reduction of fragmentation