44
61.4k

120+ Muli-core Architectures and Programming Solved MCQs

These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) , Programming Languages .

Chapters

Chapter: Multi-core Processors
1.

A collection of lines that connects several devices is called ______________

A. bus
B. peripheral connection wires
C. Both a and b
D. internal wires
Answer» A. bus
2.

PC Program Counter is also called ____________

A. instruction pointer
B. memory pointer
C. data counter
D. file pointer
Answer» A. instruction pointer
3.

Which MIMD systems are best scalable with respect to the number of processors?

A. Distributed memory computers
B. ccNUMA systems
C. nccNUMA systems
D. Symmetric multiprocessors
Answer» A. Distributed memory computers
4.

Cache coherence: For which shared (virtual) memory systems is the snooping protocol suited?

A. Crossbar connected systems
B. Systems with hypercube network
C. Systems with butterfly network
D. Bus based systems
Answer» D. Bus based systems
5.

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
Answer» A. on the property of locality of reference
6.

When number of switch ports is equal to or larger than number of devices, this simple network is referred to as ______________

A. Crossbar
B. Crossbar switch
C. Switching
D. Both a and b
Answer» D. Both a and b
7.

A remote node is being node which has a copy of a ______________

A. Home block
B. Guest block
C. Remote block
D. Cache block
Answer» D. Cache block
8.

A pipeline is like _______________

A. an automobile assembly line
B. house pipeline
C. both a and b
D. a gas line
Answer» A. an automobile assembly line
9.

Which cache miss does not occur in case of a fully associative cache?

A. Conflict miss
B. Capacity miss
C. Compulsory miss
D. Cold start miss
Answer» A. Conflict miss
10.

Bus switches are present in ____________

A. bus window technique
B. crossbar switching
C. linked input/output
D. shared bus
Answer» B. crossbar switching
11.

Systems that do not have parallel processing capabilities are ______________

A. SISD
B. MIMD
C. SIMD
D. MISD
Answer» A. SISD
12.

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?

A. 10
B. 20
C. 30
D. 40
Answer» B. 20
13.

SIMD represents an organization that ______________

A. Includes many processing units under the supervision of a common control unit
B. vector supercomputer and MIMD systems
C. logic behind pipelining an instruction as observe
D. receive an instruction from the controlling unit
Answer» A. Includes many processing units under the supervision of a common control unit
14.

Cache memory works on the principle of ____________

A. communication links
B. Locality of reference
C. Bisection bandwidth
D. average access time
Answer» B. Locality of reference
15.

In shared bus architecture, the required processor(s) to perform a bus cycle, for fetching data or instructions is ________________

A. One Processor
B. Two Processor
C. Multi-Processor
D. None of the above
Answer» A. One Processor
16.

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
Answer» C. Directory protocol
17.

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
Answer» B. Un-cached
18.

Requesting node sending the requested data starting from the memory, and the requestor which has made the only sharing node, known as ________.

A. Read miss
B. Write miss
C. Invalidate
D. Fetch
Answer» A. Read miss
19.

A processor performing fetch or decoding of different instruction during the execution of another instruction is called ______.

A. Direct interconnects
B. Indirect interconnects
C. Pipe-lining
D. Uniform Memory Access
Answer» C. Pipe-lining
20.

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

A. Star topology
B. Ring topology
C. Connect topology
D. Mesh topology
Answer» D. Mesh topology
21.

The concept of pipelining is most effective in improving performance if the 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
Answer» B. require about the same amount of time
22.

The expression 'delayed load' is used in context of

A. processor-printer communication
B. memory-monitor communication
C. pipelining
D. none of the above
Answer» C. pipelining
23.

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

A. Register
B. RAM
C. System heap
D. Cache
Answer» D. Cache
Chapter: Parallel Program Challenges
24.

Producer consumer problem can be solved using _____________

A. semaphores
B. event counters
C. monitors
D. All of the above
Answer» C. monitors
25.

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:

A. data consistency
B. race condition
C. aging
D. starvation
Answer» B. race condition
26.

The segment of code in which the process may change common variables, update tables, write into files is known as :

A. program
B. critical section
C. non – critical section
D. synchronizing
Answer» B. critical section
27.

All deadlocks involve conflicting needs for __________

A. Resources
B. Users
C. Computers
D. Programs
Answer» A. Resources
28.

___________ are used for signaling among processes and can be readily used to enforce a mutual exclusion discipline.

A. Semaphores
B. Messages
C. Monitors
D. Addressing
Answer» A. Semaphores
29.

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
Answer» A. there must be a fixed number of resources to allocate
30.

A minimum of _____ variable(s) is/are required to be shared between processes to solve the critical section problem.

A. one
B. two
C. three
D. four
Answer» B. two
31.

Spinlocks are intended to provide __________ only.

A. Mutual Exclusion
B. Bounded Waiting
C. Aging
D. Progress
Answer» B. Bounded Waiting
32.

To ensure difficulties do not arise in the readers – writer’s problem, _______ are given exclusive access to the shared object.

A. readers
B. writers
C. readers and writers
D. none of the above
Answer» B. writers
33.

If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called ___________.

A. Out-of-order execution
B. Hardware prefetching
C. Software prefetching
D. mutual exclusion
Answer» D. mutual exclusion
34.

A semaphore is a shared integer variable ____________.

A. lightweight process
B. that cannot drop below zero
C. program counter
D. stack space
Answer» B. that cannot drop below zero
35.

A critical section is a program segment ______________.

A. where shared resources are accessed
B. single thread of execution
C. improves concurrency in multi-core system
D. Lower resource consumption
Answer» A. where shared resources are accessed
36.

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 ___________

A. 4
B. 6
C. 9
D. 8
Answer» D. 8
37.

A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, then _____________

A. Better system utilization
B. deadlock can never occur
C. Responsiveness
D. Faster execution
Answer» B. deadlock can never occur
38.

_____________ refers to the ability of multiple process (or threads) to share code, resources or data in such a way that only one process has access to shared object at a time.

A. Readers_writer locks
B. Barriers
C. Semaphores
D. Mutual Exclusion
Answer» D. Mutual Exclusion
39.

____________ is the ability of multiple processes to co-ordinate their activities by exchange of information.

A. Deadlock
B. Synchronization
C. Mutual Exclusion
D. Cache
Answer» B. Synchronization
40.

Paths that have an unbounded number of allowed nonminimal hops from packet sources, this situation is referred to as __________.

A. Livelock
B. Deadlock
C. Synchronization
D. Mutual Exclusion
Answer» A. Livelock
41.

Let S and Q be two semaphores initialized to 1, where P0 and P1 processes the following statements wait(S);wait(Q); ---; signal(S);signal(Q) and wait(Q); wait(S);---;signal(Q);signal(S); respectively. The above situation depicts a _________.

A. Livelock
B. Critical Section
C. Deadlock
D. Mutual Exclusion
Answer» C. Deadlock
42.

Which of the following conditions must be satisfied to solve the critical section problem?

A. Mutual Exclusion
B. Progress
C. Bounded Waiting
D. All of the mentioned
Answer» D. All of the mentioned
43.

Mutual exclusion implies that ____________.

A. if a process is executing in its critical section, then no other process must be executing in their critical sections
B. if a process is executing in its critical section, then other processes must be executing in their critical sections
C. if a process is executing in its critical section, then all the resources of the system must be blocked until it finishes execution
D. none of the mentioned
Answer» A. if a process is executing in its critical section, then no other process must be executing in their critical sections
44.

Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter its critical section ____________.

A. after a process has made a request to enter its critical section and before the request is granted
B. when another process is in its critical section
C. before a process has made a request to enter its critical section
D. none of the mentioned
Answer» A. after a process has made a request to enter its critical section and before the request is granted
45.

What are the two atomic operations permissible on semaphores?

A. Wait
B. Stop
C. Hold
D. none of the mentioned
Answer» A. Wait
46.

What are Spinlocks?

A. CPU cycles wasting locks over critical sections of programs
B. Locks that avoid time wastage in context switches
C. Locks that work better on multiprocessor systems
D. All of the mentioned
Answer» D. All of the mentioned
47.

What is the main disadvantage of spinlocks?

A. they are not sufficient for many process
B. they require busy waiting
C. they are unreliable sometimes
D. they are too complex for programmers
Answer» B. they require busy waiting
48.

The signal operation of the semaphore basically works on the basic _______ system call.

A. continue()
B. wakeup()
C. getup()
D. start()
Answer» B. wakeup()
49.

If the semaphore value is negative ____________.

A. its magnitude is the number of processes waiting on that semaphore
B. it is invalid
C. no operation can be further performed on it until the signal operation is performed on it
D. none of the mentioned
Answer» A. its magnitude is the number of processes waiting on that semaphore
Chapter: Shared Memory Programming with OpenMP
50.

Which directive must precede the directive: #pragma omp sections (not necessarily immediately)?

A. #pragma omp section
B. #pragma omp parallel
C. None
D. #pragma omp master
Answer» A. #pragma omp section

Done Studing? Take A Test.

Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.