MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 445 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science Engineering (CSE) knowledge and support exam preparation. Choose a topic below to get started.
| 351. |
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» B. easy | |
| 352. |
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» B. coarse-granularity | |
| 353. |
Parallel Algorithm Models? |
| A. | data parallel model |
| B. | bit model |
| C. | data model |
| D. | network model |
| Answer» B. bit model | |
| 354. |
Writing parallel programs is referred to as? |
| A. | parallel computation |
| B. | parallel processes |
| C. | parallel development |
| D. | parallel programming |
| Answer» E. | |
| 355. |
task characteristics include? |
| A. | task generation. |
| B. | task sizes. |
| C. | size of data associated with tasks. |
| D. | all of above |
| Answer» E. | |
| 356. |
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» B. the solution to 20 puzzle | |
| 357. |
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» B. only one computation | |
| 358. |
Decomposition Techniques are? |
| A. | recursive decomposition |
| B. | data decomposition |
| C. | exploratory decomposition |
| D. | all of above |
| Answer» E. | |
| 359. |
Speculative Decomposition consist of _? |
| A. | conservative approaches |
| B. | optimistic approaches |
| C. | both a and b |
| D. | only b |
| Answer» D. only b | |
| 360. |
Mappings are determined by? |
| A. | task dependency |
| B. | task interaction graphs |
| C. | both a and b |
| D. | none of above |
| Answer» D. none of above | |
| 361. |
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» B. the critical data length | |
| 362. |
The number of tasks into which a problem is decomposed determines its? |
| A. | granularity |
| B. | priority |
| C. | modernity |
| D. | none of above |
| Answer» B. priority | |
| 363. |
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» B. is referred to as a task communication graph | |
| 364. |
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» B. execute directly | |
| 365. |
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» B. task and execution | |
| 366. |
A multiprocessor machine which is capable of executing multiple instructions on multiple data sets? |
| A. | sisd |
| B. | simd |
| C. | mimd |
| D. | misd |
| Answer» D. misd | |
| 367. |
NUMA architecture uses _______in design? |
| A. | cache |
| B. | shared memory |
| C. | message passing |
| D. | distributed memory |
| Answer» E. | |
| 368. |
For inter processor communication the miss arises are called? |
| A. | hit rate |
| B. | coherence misses |
| C. | comitt misses |
| D. | parallel processing |
| Answer» C. comitt misses | |
| 369. |
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» B. microprocessor | |
| 370. |
Fine-grain threading is considered as a ______ threading? |
| A. | instruction-level |
| B. | loop level |
| C. | task-level |
| D. | function-level |
| Answer» B. loop level | |
| 371. |
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» E. | |
| 372. |
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» D. none of the above | |
| 373. |
How does the number of transistors per chip increase according to Moore ´s law? |
| A. | quadratically |
| B. | linearly |
| C. | cubicly |
| D. | exponentially |
| Answer» E. | |
| 374. |
Systems that do not have parallel processing capabilities are? |
| A. | sisd |
| B. | simd |
| C. | mimd |
| D. | all of the above |
| Answer» B. simd | |
| 375. |
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» C. synchronization among threads in shared memory computing | |
| 376. |
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» E. | |
| 377. |
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» C. concurrent read | |
| 378. |
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» C. synchronization overheads | |
| 379. |
VLIW stands for ? |
| A. | very long instruction word |
| B. | very long instruction width |
| C. | very large instruction word |
| D. | very long instruction width |
| Answer» B. very long instruction width | |
| 380. |
Pipeline implements ? |
| A. | fetch instruction |
| B. | decode instruction |
| C. | fetch operand |
| D. | all of above |
| Answer» E. | |
| 381. |
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» C. parallel computation | |
| 382. |
A pipeline is like .................... ? |
| A. | an automobile assembly line |
| B. | house pipeline |
| C. | both a and b |
| D. | a gas line |
| Answer» B. house pipeline | |
| 383. |
In which application system Distributed systems can run well? |
| A. | hpc |
| B. | distrubuted framework |
| C. | hrc |
| D. | none of the above |
| Answer» B. distrubuted framework | |
| 384. |
Computer system of a parallel computer is capable of_____________ |
| A. | decentralized computing |
| B. | parallel computing |
| C. | centralized computing |
| D. | all of these |
| Answer» B. parallel computing | |
| 385. |
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» D. sm stands for streaming multiprocessor | |
| 386. |
In thread-function execution scenario thread is a ___________ |
| A. | work |
| B. | worker |
| C. | task |
| D. | none of the above |
| Answer» C. task | |
| 387. |
CUDA helps do execute code in parallel mode using __________ |
| A. | cpu |
| B. | gpu |
| C. | rom |
| D. | cash memory |
| Answer» C. rom | |
| 388. |
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» C. the ratio of number of multiple processors to size of data | |
| 389. |
Which are different sources of Overheads in Parallel Programs? |
| A. | interprocess interactions |
| B. | process idling |
| C. | all mentioned options |
| D. | excess computation |
| Answer» D. excess computation | |
| 390. |
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» E. | |
| 391. |
In Parallel DFS processes has following roles.(Select multiple choices if applicable) |
| A. | donor |
| B. | active |
| C. | idle |
| D. | passive |
| Answer» B. active | |
| 392. |
Partitioning on series done after ______________ |
| A. | local arrangement |
| B. | processess assignments |
| C. | global arrangement |
| D. | none of the above |
| Answer» D. none of the above | |
| 393. |
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» C. small sequence is the issue | |
| 394. |
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» D. 16 | |
| 395. |
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» D. node of the above. | |
| 396. |
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» E. | |
| 397. |
Which decompositioin technique uses divide-andconquer strategy? |
| A. | recursive decomposition |
| B. | sdata decomposition |
| C. | exploratory decomposition |
| D. | speculative decomposition |
| Answer» B. sdata decomposition | |
| 398. |
Nvidia GPU based on following architecture |
| A. | mimd |
| B. | simd |
| C. | sisd |
| D. | misd |
| Answer» C. sisd | |
| 399. |
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» B. the length of the smallest path in a task dependency graph is called the critical path length. | |
| 400. |
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» E. | |