McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) .
| 351. |
Multiprocessor is systems with multiple CPUs, which are capable of independently executing different tasks in parallel. In this category every processor and memory module has similar access time? |
| A. | uma |
| B. | microprocessor |
| C. | multiprocessor |
| D. | numa |
| Answer» A. uma | |
| 352. |
For inter processor communication the miss arises are called? |
| A. | hit rate |
| B. | coherence misses |
| C. | comitt misses |
| D. | parallel processing |
| Answer» B. coherence misses | |
| 353. |
NUMA architecture uses _______in design? |
| A. | cache |
| B. | shared memory |
| C. | message passing |
| D. | distributed memory |
| Answer» D. distributed memory | |
| 354. |
A multiprocessor machine which is capable of executing multiple instructions on multiple data sets? |
| A. | sisd |
| B. | simd |
| C. | mimd |
| D. | misd |
| Answer» C. mimd | |
| 355. |
In message passing, send and receive message between? |
| A. | task or processes |
| B. | task and execution |
| C. | processor and instruction |
| D. | instruction and decode |
| Answer» A. task or processes | |
| 356. |
The First step in developing a parallel algorithm is_________? |
| A. | to decompose the problem into tasks that can be executed concurrently |
| B. | execute directly |
| C. | execute indirectly |
| D. | none of above |
| Answer» A. to decompose the problem into tasks that can be executed concurrently | |
| 357. |
The number of tasks into which a problem is decomposed determines its? |
| A. | granularity |
| B. | priority |
| C. | modernity |
| D. | none of above |
| Answer» A. granularity | |
| 358. |
The length of the longest path in a task dependency graph is called? |
| A. | the critical path length |
| B. | the critical data length |
| C. | the critical bit length |
| D. | none of above |
| Answer» A. the critical path length | |
| 359. |
The graph of tasks (nodes) and their interactions/data exchange (edges)? |
| A. | is referred to as a task interaction graph |
| B. | is referred to as a task communication graph |
| C. | is referred to as a task interface graph |
| D. | none of above |
| Answer» A. is referred to as a task interaction graph | |
| 360. |
Mappings are determined by? |
| A. | task dependency |
| B. | task interaction graphs |
| C. | both a and b |
| D. | none of above |
| Answer» C. both a and b | |
| 361. |
Decomposition Techniques are? |
| A. | recursive decomposition |
| B. | data decomposition |
| C. | exploratory decomposition |
| D. | all of above |
| Answer» D. all of above | |
| 362. |
The Owner Computes Rule generally states that the process assigned a particular data item is responsible for? |
| A. | all computation associated with it |
| B. | only one computation |
| C. | only two computation |
| D. | only occasionally computation |
| Answer» A. all computation associated with it | |
| 363. |
A simple application of exploratory decomposition is_? |
| A. | the solution to a 15 puzzle |
| B. | the solution to 20 puzzle |
| C. | the solution to any puzzle |
| D. | none of above |
| Answer» A. the solution to a 15 puzzle | |
| 364. |
Speculative Decomposition consist of _? |
| A. | conservative approaches |
| B. | optimistic approaches |
| C. | both a and b |
| D. | only b |
| Answer» C. both a and b | |
| 365. |
task characteristics include? |
| A. | task generation. |
| B. | task sizes. |
| C. | size of data associated with tasks. |
| D. | all of above |
| Answer» D. all of above | |
| 366. |
Writing parallel programs is referred to as? |
| A. | parallel computation |
| B. | parallel processes |
| C. | parallel development |
| D. | parallel programming |
| Answer» D. parallel programming | |
| 367. |
Parallel Algorithm Models? |
| A. | data parallel model |
| B. | bit model |
| C. | data model |
| D. | network model |
| Answer» A. data parallel model | |
| 368. |
The number and size of tasks into which a problem is decomposed determines the? |
| A. | fine-granularity |
| B. | coarse-granularity |
| C. | sub task |
| D. | granularity |
| Answer» A. fine-granularity | |
| 369. |
A feature of a task-dependency graph that determines the average degree of concurrency for a given granularity is its ___________ path? |
| A. | critical |
| B. | easy |
| C. | difficult |
| D. | ambiguous |
| Answer» A. critical | |
| 370. |
The pattern of___________ among tasks is captured by what is known as a task-interaction graph? |
| A. | interaction |
| B. | communication |
| C. | optmization |
| D. | flow |
| Answer» A. interaction | |
| 371. |
Interaction overheads can be minimized by____? |
| A. | maximize data locality |
| B. | maximize volume of data exchange |
| C. | increase bandwidth |
| D. | minimize social media contents |
| Answer» A. maximize data locality | |
| 372. |
Type of parallelism that is naturally expressed by independent tasks in a task-dependency graph is called _______ parallelism? |
| A. | task |
| B. | instruction |
| C. | data |
| D. | program |
| Answer» A. task | |
| 373. |
Speed up is defined as a ratio of? |
| A. | s=ts/tp |
| B. | s= tp/ts |
| C. | ts=s/tp |
| D. | tp=s /ts |
| Answer» A. s=ts/tp | |
| 374. |
Parallel computing means to divide the job into several __________? |
| A. | bit |
| B. | data |
| C. | instruction |
| D. | task |
| Answer» D. task | |
| 375. |
_________ is a method for inducing concurrency in problems that can be solved using the divide-and-conquer strategy? |
| A. | exploratory decomposition |
| B. | speculative decomposition |
| C. | data-decomposition |
| D. | recursive decomposition |
| Answer» C. data-decomposition | |
| 376. |
The___ time collectively spent by all the processing elements Tall = p TP? |
| A. | total |
| B. | average |
| C. | mean |
| D. | sum |
| Answer» A. total | |
| 377. |
The dual of one-to-all broadcast is ? |
| A. | all-to-one reduction |
| B. | all-to-one receiver |
| C. | all-to-one sum |
| D. | none of above |
| Answer» A. all-to-one reduction | |
| 378. |
A hypercube has? |
| A. | 2d nodes |
| B. | 2d nodes |
| C. | 2n nodes |
| D. | n nodes |
| Answer» A. 2d nodes | |
| 379. |
The Prefix Sum Operation can be implemented using the ? |
| A. | all-to-all broadcast kernel. |
| B. | all-to-one broadcast kernel. |
| C. | one-to-all broadcast kernel |
| D. | scatter kernel |
| Answer» A. all-to-all broadcast kernel. | |
| 380. |
In the scatter operation ? |
| A. | single node send a unique message of size m to every other node |
| B. | single node send a same message of size m to every other node |
| C. | single node send a unique message of size m to next node |
| D. | none of above |
| Answer» A. single node send a unique message of size m to every other node | |
| 381. |
The gather operation is exactly the inverse of the ? |
| A. | scatter operation |
| B. | broadcast operation |
| C. | prefix sum |
| D. | reduction operation |
| Answer» A. scatter operation | |
| 382. |
Parallel algorithms often require a single process to send identical data to all other processes or to a subset of them. This operation is known as _________? |
| A. | one-to-all broadcast |
| B. | all to one broadcast |
| C. | one-to-all reduction |
| D. | all to one reduction |
| Answer» A. one-to-all broadcast | |
| 383. |
In which of the following operation, a single node sends a unique message of size m to every other node? |
| A. | gather |
| B. | scatter |
| C. | one to all personalized communication |
| D. | both a and c |
| Answer» D. both a and c | |
| 384. |
Gather operation is also known as ________? |
| A. | one to all personalized communication |
| B. | one to all broadcast |
| C. | all to one reduction |
| D. | all to all broadcast |
| Answer» A. one to all personalized communication | |
| 385. |
Conventional architectures coarsely comprise of a? |
| A. | a processor |
| B. | memory system |
| C. | data path. |
| D. | all of above |
| Answer» D. all of above | |
| 386. |
Data intensive applications utilize? |
| A. | high aggregate throughput |
| B. | high aggregate network bandwidth |
| C. | high processing and memory system performance. |
| D. | none of above |
| Answer» A. high aggregate throughput | |
| 387. |
A pipeline is like? |
| A. | overlaps various stages of instruction execution to achieve performance. |
| B. | house pipeline |
| C. | both a and b |
| D. | a gas line |
| Answer» A. overlaps various stages of instruction execution to achieve performance. | |
| 388. |
Scheduling of instructions is determined? |
| A. | true data dependency |
| B. | resource dependency |
| C. | branch dependency |
| D. | all of above |
| Answer» D. all of above | |
| 389. |
VLIW processors rely on? |
| A. | compile time analysis |
| B. | initial time analysis |
| C. | final time analysis |
| D. | mid time analysis |
| Answer» A. compile time analysis | |
| 390. |
Memory system performance is largely captured by? |
| A. | latency |
| B. | bandwidth |
| C. | both a and b |
| D. | none of above |
| Answer» C. both a and b | |
| 391. |
The fraction of data references satisfied by the cache is called? |
| A. | cache hit ratio |
| B. | cache fit ratio |
| C. | cache best ratio |
| D. | none of above |
| Answer» A. cache hit ratio | |
| 392. |
A single control unit that dispatches the same Instruction to various processors is? |
| A. | simd |
| B. | spmd |
| C. | mimd |
| D. | none of above |
| Answer» A. simd | |
| 393. |
The primary forms of data exchange between parallel tasks are? |
| A. | accessing a shared data space |
| B. | exchanging messages. |
| C. | both a and b |
| D. | none of above |
| Answer» C. both a and b | |
| 394. |
The First step in developing a parallel algorithm is? |
| A. | to decompose the problem into tasks that can be executed concurrently |
| B. | execute directly |
| C. | execute indirectly |
| D. | none of above |
| Answer» A. to decompose the problem into tasks that can be executed concurrently | |
| 395. |
The Owner Computes Rule generally states that the process assigned a particular data item are responsible for? |
| A. | all computation associated with it |
| B. | only one computation |
| C. | only two computation |
| D. | only occasionally computation |
| Answer» A. all computation associated with it | |
| 396. |
A simple application of exploratory decomposition is? |
| A. | the solution to a 15 puzzle |
| B. | the solution to 20 puzzle |
| C. | the solution to any puzzle |
| D. | none of above |
| Answer» A. the solution to a 15 puzzle | |
| 397. |
Speculative Decomposition consist of ? |
| A. | conservative approaches |
| B. | optimistic approaches |
| C. | both a and b |
| D. | only b |
| Answer» C. both a and b | |
| 398. |
Task characteristics include? |
| A. | task generation. |
| B. | task sizes. |
| C. | size of data associated with tasks. |
| D. | all of above. |
| Answer» D. all of above. | |
| 399. |
The dual of one-to-all broadcast is? |
| A. | all-to-one reduction |
| B. | all-to-one receiver |
| C. | all-to-one sum |
| D. | none of above |
| Answer» A. all-to-one reduction | |
| 400. |
A hypercube has? |
| A. | 2d nodes |
| B. | 3d nodes |
| C. | 2n nodes |
| D. | n nodes |
| Answer» A. 2d nodes | |
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.