Multi Core Processors Set 1

Computer Science Engineering (CSE)

Practice Mode Next
On This Page

This set of Multi-core processors Multiple Choice Questions & Answers (MCQs) focuses on Multi Core Processors Set 1

Q1 | The idea of cache memory is based           
  • . on the property of locality of reference
  • . on the heuristic 90-10 rule
  • . on the fact that references generally tend to cluster
  • . all of the above
Answer: . on the fact that references generally tend to cluster
Q2 | Systems that do not have parallel processing capabilities are                         
  • . sisd
  • . mimd
  • . simd
  • . misd
Answer: . misd
Q3 | Parallel programs: Which speedup could be achieved according to Amdahl´s law for infinite number of processors if 5% of a program is sequential and the remaining part is ideally parallel?
  • . 10
  • . 20
  • . 30
  • . 40
Answer: . 20
Q4 | In shared bus architecture, the required processor(s) to perform a bus cycle, for fetching data or instructions is                            
  • . one processor
  • . two processor
  • . multi-processor
  • . none of the above
Answer: . multi-processor
Q5 | Alternative way of a snooping-based coherence protocol, is called a
  • . write invalidate protocol
  • . snooping protocol
  • . directory protocol
  • . write update protocol
Answer: . directory protocol
Q6 | If no node having a copy of a cache block, this technique is known as           
  • . cached
  • . un-cached
  • . shared data
  • . valid data
Answer: . valid data
Q7 | All nodes in each dimension form a linear array, in the                  .
  • . star topology
  • . ring topology
  • . connect topology
  • . mesh topology
Answer: . mesh topology
Q8 | tasks being performed in different stages :
  • . require different amount of time
  • . require about the same amount of time
  • . require different amount of time with time difference between any two tasks being same
  • . require different amount with time difference between any two tasks being different
Answer: . require different amount of time
Q9 | The expression 'delayed load' is used in context of
  • . processor-printer communication
  • . memory-monitor communication
  • . pipelining
  • . none of the above
Answer: . pipelining
Q10 | During the execution of the instructions, a copy of the instructions is placed in the            .
  • . register
  • . ram
  • . system heap
  • . cache
Answer: . system heap
Q11 | Producer consumer problem can be solved using                       
  • . semaphores
  • . event counters
  • . monitors
  • . all of the above
Answer: . monitors
Q12 | A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called:
  • . data consistency
  • . race condition
  • . aging
  • . starvation
Answer: . race condition
Q13 | Which one of the following statements describes the properties achieved?
  • . mutual exclusion but not progress
  • . progress but not mutual exclusion
  • . neither mutual exclusion nor progress
  • . both mutual exclusion and progress
Answer: . mutual exclusion but not progress
Q14 | All deadlocks involve conflicting needs for                  
  • . resources
  • . users
  • . computers
  • . programs
Answer: . resources
Q15 | To avoid deadlock                     
  • . there must be a fixed number of resources to allocate
  • . resource allocation must be done only once
  • . all deadlocked processes must be aborted
  • . inversion technique can be used
Answer: . there must be a fixed number of resources to allocate
Q16 | processes to solve the critical section problem.
  • . one
  • . two
  • . three
  • . four
Answer: . two
Q17 | Spinlocks are intended to provide                   only.
  • . mutual exclusion
  • . bounded waiting
  • . aging
  • . progress
Answer: . bounded waiting
Q18 | A semaphore is a shared integer variable                     .
  • . lightweight process
  • . that cannot drop below zero
  • . program counter
  • . stack space
Answer: . that cannot drop below zero
Q19 | A critical section is a program segment                         .
  • . where shared resources are accessed
  • . single thread of execution
  • . improves concurrency in multi-core system
  • . lower resource consumption
Answer: . lower resource consumption
Q20 | A counting semaphore was initialized to 10. Then 6 P (wait) operations and 4V (signal) operations were completed on this semaphore. The resulting value of the semaphore is                   
  • . 4
  • . 6
  • . 9
  • . 8
Answer: . 8
Q21 | How many times will process P0 print '0'?
  • . at least twice
  • . one
  • . three
  • . none of the above
Answer: . three
Q22 | A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, then                       
  • . better system utilization
  • . deadlock can never occur
  • . responsiveness
  • . faster execution
Answer: . responsiveness
Q23 | code, resources or data in such a way that only one process has access to shared object at a time.
  • . readers_writer locks
  • . barriers
  • . semaphores
  • . mutual exclusion
Answer: . semaphores
Q24 |                      is the ability of multiple processes to co-ordinate their activities by exchange of information.
  • . deadlock
  • . synchronization
  • . mutual exclusion
  • . cache
Answer: . deadlock
Q25 | Paths that have an unbounded number of allowed nonminimal hops from packet sources, this situation is referred to as                  .
  • . livelock
  • . deadlock
  • . synchronization
  • . mutual exclusion
Answer: . synchronization
Next