Top 80+ Solved Multi-core processors MCQ Questions Answer

From 1 to 15 of 61

Q. The idea of cache memory is based           

a. . on the property of locality of reference

b. . on the heuristic 90-10 rule

c. . on the fact that references generally tend to cluster

d. . all of the above

  • c. . on the fact that references generally tend to cluster

Q. Alternative way of a snooping-based coherence protocol, is called a

a. . write invalidate protocol

b. . snooping protocol

c. . directory protocol

d. . write update protocol

  • c. . directory protocol

Q. If no node having a copy of a cache block, this technique is known as           

a. . cached

b. . un-cached

c. . shared data

d. . valid data

  • d. . valid data

Q. All nodes in each dimension form a linear array, in the                  .

a. . star topology

b. . ring topology

c. . connect topology

d. . mesh topology

  • d. . mesh topology

Q. tasks being performed in different stages :

a. . require different amount of time

b. . require about the same amount of time

c. . require different amount of time with time difference between any two tasks being same

d. . require different amount with time difference between any two tasks being different

  • a. . require different amount of time

Q. The expression 'delayed load' is used in context of

a. . processor-printer communication

b. . memory-monitor communication

c. . pipelining

d. . none of the above

  • c. . pipelining

Q. During the execution of the instructions, a copy of the instructions is placed in the            .

a. . register

b. . ram

c. . system heap

d. . cache

  • c. . system heap

Q. Producer consumer problem can be solved using                       

a. . semaphores

b. . event counters

c. . monitors

d. . all of the above

  • c. . monitors

Q. Which one of the following statements describes the properties achieved?

a. . mutual exclusion but not progress

b. . progress but not mutual exclusion

c. . neither mutual exclusion nor progress

d. . both mutual exclusion and progress

  • a. . mutual exclusion but not progress

Q. All deadlocks involve conflicting needs for                  

a. . resources

b. . users

c. . computers

d. . programs

  • a. . resources

Q. To avoid deadlock                     

a. . there must be a fixed number of resources to allocate

b. . resource allocation must be done only once

c. . all deadlocked processes must be aborted

d. . inversion technique can be used

  • a. . there must be a fixed number of resources to allocate
Subscribe Now

Get All Updates & News