McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) .
| 301. |
In All-to-All Personalized Communication on a Ring, the size of the message reduces by at each step |
| A. | p |
| B. | m-1 |
| C. | p-1 |
| D. | m |
| Answer» A. p | |
| 302. |
All-to-All Broadcast and Reduction algorithm on a Ring terminates in steps. |
| A. | p+1 |
| B. | p-1 |
| C. | p*p |
| D. | p |
| Answer» C. p*p | |
| 303. |
In All-to-all Broadcast on a Mesh, operation performs in which sequence? |
| A. | rowwise, columnwise |
| B. | columnwise, rowwise |
| C. | columnwise, columnwise |
| D. | rowwise, rowwise |
| Answer» B. columnwise, rowwise | |
| 304. |
Messages get smaller in and stay constant in . |
| A. | gather, broadcast |
| B. | scatter , broadcast |
| C. | scatter, gather |
| D. | broadcast, gather |
| Answer» C. scatter, gather | |
| 305. |
The time taken by all-to- all broadcast on a ring is . |
| A. | t= (ts + twm)(p-1) |
| B. | t= ts logp + twm(p-1) |
| C. | t= 2ts(√p – 1) - twm(p-1) |
| D. | t= 2ts(√p – 1) + twm(p-1) |
| Answer» B. t= ts logp + twm(p-1) | |
| 306. |
The time taken by all-to- all broadcast on a mesh is . |
| A. | t= (ts + twm)(p-1) |
| B. | t= ts logp + twm(p-1) |
| C. | t= 2ts(√p – 1) - twm(p-1) |
| D. | t= 2ts(√p – 1) + twm(p-1) |
| Answer» A. t= (ts + twm)(p-1) | |
| 307. |
The time taken by all-to- all broadcast on a hypercube is . |
| A. | t= (ts + twm)(p-1) |
| B. | t= ts logp + twm(p-1) |
| C. | t= 2ts(√p – 1) - twm(p-1) |
| D. | t= 2ts(√p – 1) + twm(p-1) |
| Answer» C. t= 2ts(√p – 1) - twm(p-1) | |
| 308. |
The prefix-sum operation can be implemented using the kernel |
| A. | all-to-all broadcast |
| B. | one-to-all broadcast |
| C. | all-to-one broadcast |
| D. | all-to-all reduction |
| Answer» B. one-to-all broadcast | |
| 309. |
Select the parameters on which the parallel runtime of a program depends. |
| A. | number of processors |
| B. | communication parameters of the machine |
| C. | all of the above |
| D. | input size |
| Answer» D. input size | |
| 310. |
The time that elapses from the moment the first processor starts to the moment the last processor finishes execution is called as . |
| A. | parallel runtime |
| B. | overhead runtime |
| C. | excess runtime |
| D. | serial runtime |
| Answer» B. overhead runtime | |
| 311. |
Select how the overhead function (To) is calculated. |
| A. | to = p*n tp - ts |
| B. | to = p tp - ts |
| C. | to = tp - pts |
| D. | to = tp - ts |
| Answer» C. to = tp - pts | |
| 312. |
What is is the ratio of the time taken to solve a problem on a single processor to the time required to solve the same problem on a parallel computer with p identical processing elements? |
| A. | overall time |
| B. | speedup |
| C. | scaleup |
| D. | efficiency |
| Answer» C. scaleup | |
| 313. |
Which is alternative options for latency hiding? |
| A. | increase cpu frequency |
| B. | multithreading |
| C. | increase bandwidth |
| D. | increase memory |
| Answer» B. multithreading | |
| 314. |
______ Communication model is generally seen in tightly coupled system. |
| A. | message passing |
| B. | shared-address space |
| C. | client-server |
| D. | distributed network |
| Answer» B. shared-address space | |
| 315. |
The principal parameters that determine the communication latency are as follows: |
| A. | startup time (ts) per-hop time (th) per-word transfer time (tw) |
| B. | startup time (ts) per-word transfer time (tw) |
| C. | startup time (ts) per-hop time (th) |
| D. | startup time (ts) message-packet-size(w) |
| Answer» A. startup time (ts) per-hop time (th) per-word transfer time (tw) | |
| 316. |
The number and size of tasks into which a problem is decomposed determines the __ |
| A. | granularity |
| B. | task |
| C. | dependency graph |
| D. | decomposition |
| Answer» A. granularity | |
| 317. |
Average Degree of Concurrency is... |
| A. | the average number of tasks that can run concurrently over the entire duration of execution of the process. |
| B. | the average time that can run concurrently over the entire duration of execution of the process. |
| C. | the average in degree of task dependency graph. |
| D. | the average out degree of task dependency graph. |
| Answer» A. the average number of tasks that can run concurrently over the entire duration of execution of the process. | |
| 318. |
Which task decomposition technique is suitable for the 15-puzzle problem? |
| A. | data decomposition |
| B. | exploratory decomposition |
| C. | speculative decomposition |
| D. | recursive decomposition |
| Answer» B. exploratory decomposition | |
| 319. |
Which of the following method is used to avoid Interaction Overheads? |
| A. | maximizing data locality |
| B. | minimizing data locality |
| C. | increase memory size |
| D. | none of the above. |
| Answer» A. maximizing data locality | |
| 320. |
Which of the following is not parallel algorithm model |
| A. | the data parallel model |
| B. | the work pool model |
| C. | the task graph model |
| D. | the speculative model |
| Answer» D. the speculative model | |
| 321. |
Nvidia GPU based on following architecture |
| A. | mimd |
| B. | simd |
| C. | sisd |
| D. | misd |
| Answer» B. simd | |
| 322. |
What is Critical Path? |
| A. | the length of the longest path in a task dependency graph is called the critical path length. |
| B. | the length of the smallest path in a task dependency graph is called the critical path length. |
| C. | path with loop |
| D. | none of the mentioned. |
| Answer» A. the length of the longest path in a task dependency graph is called the critical path length. | |
| 323. |
Which decompositioin technique uses divide-andconquer strategy? |
| A. | recursive decomposition |
| B. | sdata decomposition |
| C. | exploratory decomposition |
| D. | speculative decomposition |
| Answer» A. recursive decomposition | |
| 324. |
Consider Hypercube topology with 8 nodes then how many message passing cycles will require in all to all broadcast operation? |
| A. | the longest path between any pair of finish nodes. |
| B. | the longest directed path between any pair of start & finish node. |
| C. | the shortest path between any pair of finish nodes. |
| D. | the number of maximum nodes level in graph. |
| Answer» D. the number of maximum nodes level in graph. | |
| 325. |
Scatter is ____________. |
| A. | one to all broadcast communication |
| B. | all to all broadcast communication |
| C. | one to all personalised communication |
| D. | node of the above. |
| Answer» C. one to all personalised communication | |
| 326. |
If there is 4X4 Mesh Topology ______ message passing cycles will require complete all to all reduction. |
| A. | 4 |
| B. | 6 |
| C. | 8 |
| D. | 16 |
| Answer» C. 8 | |
| 327. |
Following issue(s) is/are the true about sorting techniques with parallel computing. |
| A. | large sequence is the issue |
| B. | where to store output sequence is the issue |
| C. | small sequence is the issue |
| D. | none of the above |
| Answer» B. where to store output sequence is the issue | |
| 328. |
Partitioning on series done after ______________ |
| A. | local arrangement |
| B. | processess assignments |
| C. | global arrangement |
| D. | none of the above |
| Answer» C. global arrangement | |
| 329. |
In Parallel DFS processes has following roles.(Select multiple choices if applicable) |
| A. | donor |
| B. | active |
| C. | idle |
| D. | passive |
| Answer» A. donor | |
| 330. |
Suppose there are 16 elements in a series then how many phases will be required to sort the series using parallel odd-even bubble sort? |
| A. | 8 |
| B. | 4 |
| C. | 5 |
| D. | 15 |
| Answer» D. 15 | |
| 331. |
Which are different sources of Overheads in Parallel Programs? |
| A. | interprocess interactions |
| B. | process idling |
| C. | all mentioned options |
| D. | excess computation |
| Answer» C. all mentioned options | |
| 332. |
The ratio of the time taken to solve a problem on a parallel processors to the time required to solve the same problem on a single processor with p identical processing elements. |
| A. | the ratio of the time taken to solve a problem on a single processor to the time required to solve the same problem on a parallel computer with p identical processing elements. |
| B. | the ratio of the time taken to solve a problem on a single processor to the time required to solve the same problem on a parallel computer with p identical processing elements |
| C. | the ratio of number of multiple processors to size of data |
| D. | none of the above |
| Answer» B. the ratio of the time taken to solve a problem on a single processor to the time required to solve the same problem on a parallel computer with p identical processing elements | |
| 333. |
CUDA helps do execute code in parallel mode using __________ |
| A. | cpu |
| B. | gpu |
| C. | rom |
| D. | cash memory |
| Answer» B. gpu | |
| 334. |
In thread-function execution scenario thread is a ___________ |
| A. | work |
| B. | worker |
| C. | task |
| D. | none of the above |
| Answer» B. worker | |
| 335. |
In GPU Following statements are true |
| A. | grid contains block |
| B. | block contains threads |
| C. | all the mentioned options. |
| D. | sm stands for streaming multiprocessor |
| Answer» C. all the mentioned options. | |
| 336. |
Computer system of a parallel computer is capable of_____________ |
| A. | decentralized computing |
| B. | parallel computing |
| C. | centralized computing |
| D. | all of these |
| Answer» A. decentralized computing | |
| 337. |
In which application system Distributed systems can run well? |
| A. | hpc |
| B. | distrubuted framework |
| C. | hrc |
| D. | none of the above |
| Answer» A. hpc | |
| 338. |
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 | |
| 339. |
Pipeline implements ? |
| A. | fetch instruction |
| B. | decode instruction |
| C. | fetch operand |
| D. | all of above |
| Answer» D. all of above | |
| 340. |
A processor performing fetch or decoding of different instruction during the execution of another instruction is called ______ ? |
| A. | super-scaling |
| B. | pipe-lining |
| C. | parallel computation |
| D. | none of these |
| Answer» B. pipe-lining | |
| 341. |
VLIW stands for ? |
| A. | very long instruction word |
| B. | very long instruction width |
| C. | very large instruction word |
| D. | very long instruction width |
| Answer» A. very long instruction word | |
| 342. |
Which one is not a limitation of a distributed memory parallel system? |
| A. | higher communication time |
| B. | cache coherency |
| C. | synchronization overheads |
| D. | none of the above |
| Answer» B. cache coherency | |
| 343. |
Which of these steps can create conflict among the processors? |
| A. | synchronized computation of local variables |
| B. | concurrent write |
| C. | concurrent read |
| D. | none of the above |
| Answer» B. concurrent write | |
| 344. |
Which one is not a characteristic of NUMA multiprocessors? |
| A. | it allows shared memory computing |
| B. | memory units are placed in physically different location |
| C. | all memory units are mapped to one common virtual global memory |
| D. | processors access their independent local memories |
| Answer» D. processors access their independent local memories | |
| 345. |
Which of these is not a source of overhead in parallel computing? |
| A. | non-uniform load distribution |
| B. | less local memory requirement in distributed computing |
| C. | synchronization among threads in shared memory computing |
| D. | none of the above |
| Answer» B. less local memory requirement in distributed computing | |
| 346. |
Systems that do not have parallel processing capabilities are? |
| A. | sisd |
| B. | simd |
| C. | mimd |
| D. | all of the above |
| Answer» A. sisd | |
| 347. |
How does the number of transistors per chip increase according to Moore ´s law? |
| A. | quadratically |
| B. | linearly |
| C. | cubicly |
| D. | exponentially |
| Answer» D. exponentially | |
| 348. |
Parallel processing may occur? |
| A. | in the instruction stream |
| B. | in the data stream |
| C. | both[a] and [b] |
| D. | none of the above |
| Answer» C. both[a] and [b] | |
| 349. |
To which class of systems does the von Neumann computer belong? |
| A. | simd (single instruction multiple data) |
| B. | mimd (multiple instruction multiple data) |
| C. | misd (multiple instruction single data) |
| D. | sisd (single instruction single data) |
| Answer» D. sisd (single instruction single data) | |
| 350. |
Fine-grain threading is considered as a ______ threading? |
| A. | instruction-level |
| B. | loop level |
| C. | task-level |
| D. | function-level |
| Answer» A. instruction-level | |
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.