MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 657 Mcqs, each offering curated multiple-choice questions to sharpen your Testing Subject knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Execution of several activities at the same time. |
| A. | processing |
| B. | parallel processing |
| C. | serial processing |
| D. | multitasking |
| Answer» C. serial processing | |
| 2. |
Parallel processing may occur |
| A. | in the instruction stream |
| B. | b. in the data stream |
| C. | both[a] and [b] |
| D. | none of the above |
| Answer» D. none of the above | |
| 3. |
Data hazards occur when ..................... |
| A. | greater performance loss |
| B. | pipeline changes the order of read/write access to operands |
| C. | some functional unit is not fully pipelined |
| D. | machine size is limited |
| Answer» C. some functional unit is not fully pipelined | |
| 4. |
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 | |
| 5. |
which of the following is not scheme for static mapping |
| A. | block distribution |
| B. | block cyclic distributions |
| C. | cyclic distributions |
| D. | self scheduling |
| Answer» E. | |
| 6. |
which of the following are classes of dynamic mapping centralized method |
| A. | self scheduling |
| B. | chunk scheduling |
| C. | both a and b |
| D. | none of the above |
| Answer» D. none of the above | |
| 7. |
which of the following are methods for containing interaction overheads |
| A. | maximizing data locality |
| B. | minimize volumn of data exchange |
| C. | min frequency of interactions |
| D. | all the above |
| Answer» E. | |
| 8. |
which of the following is false regarding data parallel model |
| A. | all task perform same computations |
| B. | degree of parallelism increase with size of problem |
| C. | matrix multiplication is example of data parallel computations |
| D. | dynamic mapping is done |
| Answer» E. | |
| 9. |
work pool model uses ---------------- approach for task assignment |
| A. | static |
| B. | dynamic |
| C. | centralized |
| D. | decentralized |
| Answer» C. centralized | |
| 10. |
which of the following is not an advantage of OpenGL |
| A. | there is more detailed documentation for opengl while other api\s don\t have such detailed documentation. |
| B. | opengl is portable. |
| C. | opengl is more functional than any other api. |
| D. | it is not a cross-platform api, |
| Answer» E. | |
| 11. |
OpenGL stands for: |
| A. | a. open general liability |
| B. | b. open graphics library |
| C. | c. open guide line |
| D. | d. open graphics layer |
| Answer» C. c. open guide line | |
| 12. |
Allowing multiple instructions for issuing in a clock cycle, is the goal of |
| A. | single-issue processors |
| B. | dual-issue processors |
| C. | multiple-issue processors |
| D. | no-issue processors |
| Answer» D. no-issue processors | |
| 13. |
Multithreading allowing multiple-threads for sharing the functional units of a |
| A. | multiple processor |
| B. | single processor |
| C. | dual core |
| D. | corei5 |
| Answer» C. dual core | |
| 14. |
When instruction i and instruction j are tends to write the same register or the memory location, it is called |
| A. | input dependence |
| B. | output dependence |
| C. | ideal pipeline |
| D. | digital call |
| Answer» C. ideal pipeline | |
| 15. |
model based on the passing of stream of data through process arranged in a succession is called as |
| A. | producer consumer model |
| B. | hybrid model |
| C. | task graph model |
| D. | work pool model |
| Answer» B. hybrid model | |
| 16. |
Having load before the store in a running program order, then interchanging this order, results in a |
| A. | waw hazards |
| B. | destination registers |
| C. | war hazards |
| D. | registers |
| Answer» D. registers | |
| 17. |
which of the following is not an parallel algorithm model |
| A. | data parallel model |
| B. | task graph model |
| C. | task model |
| D. | work pool model |
| Answer» D. work pool model | |
| 18. |
a code known as grid which runs on GPU consisting of a set of |
| A. | 32 thread |
| B. | unit block |
| C. | 32 block |
| D. | thread block |
| Answer» E. | |
| 19. |
Which of the following correctly describes a GPU kernel |
| A. | a kernel may contain a mix of host and gpu code |
| B. | all thread blocks involved in the same computation use the same kernel |
| C. | a kernel is part of the gpu\s internal micro-operating system, allowing it to act as in independent host |
| D. | kernel may contain only host code |
| Answer» C. a kernel is part of the gpu\s internal micro-operating system, allowing it to act as in independent host | |
| 20. |
True or false: Functions annotated with the __global__ qualifier may be executed on the host or the device |
| A. | true |
| B. | false |
| Answer» B. false | |
| 21. |
The style of parallelism supported on GPUs is best described as |
| A. | misd - multiple instruction single data |
| B. | simt - single instruction multiple thread |
| C. | sisd - single instruction single data |
| D. | mimd |
| Answer» C. sisd - single instruction single data | |
| 22. |
Which of the following is not a form of parallelism supported by CUDA |
| A. | vector parallelism - floating point computations are executed in parallel on wide vector units |
| B. | thread level task parallelism - different threads execute a different tasks |
| C. | block and grid level parallelism - different blocks or grids execute different tasks |
| D. | data parallelism - different threads and blocks process different parts of data in memory |
| Answer» B. thread level task parallelism - different threads execute a different tasks | |
| 23. |
CUDA is a parallel computing platform and programming model |
| A. | true |
| B. | false |
| Answer» B. false | |
| 24. |
A good mapping does not depends on which following factor |
| A. | knowledge of task sizes |
| B. | the size of data associated with tasks |
| C. | characteristics of inter-task interactions |
| D. | task overhead |
| Answer» E. | |
| 25. |
What is a high performance multi-core processor that can be used to accelerate a wide variety of applications using parallel computing. |
| A. | cpu |
| B. | dsp |
| C. | gpu |
| D. | clu |
| Answer» D. clu | |
| 26. |
When the topological sort of a graph is unique? |
| A. | a) when there exists a hamiltonian path in the graph |
| B. | b) in the presence of multiple nodes with indegree 0 |
| C. | c) in the presence of single node with indegree 0 |
| D. | d) in the presence of single node with outdegree 0 |
| Answer» B. b) in the presence of multiple nodes with indegree 0 | |
| 27. |
True or False: The threads in a thread block are distributed across SM units so that each thread is executed by one SM unit. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 28. |
threads being block altogether and being executed in the sets of 32 threads called a |
| A. | thread block |
| B. | 32 thread |
| C. | 32 block |
| D. | unit block |
| Answer» B. 32 thread | |
| 29. |
Topological sort of a Directed Acyclic graph is? |
| A. | a) always unique |
| B. | b) always not unique |
| C. | c) sometimes unique and sometimes not unique |
| D. | d) always unique if graph has even number of vertices |
| Answer» D. d) always unique if graph has even number of vertices | |
| 30. |
CUDA thought that 'unifying theme' of every form of parallelism is |
| A. | cda thread |
| B. | pta thread |
| C. | cuda thread |
| D. | cud thread |
| Answer» D. cud thread | |
| 31. |
blocking optimization is used to improve temmporal locality for reduce |
| A. | hit miss |
| B. | misses |
| C. | hit rate |
| D. | cache misses |
| Answer» C. hit rate | |
| 32. |
which of the following is not the array distribution method of data partitioning |
| A. | block |
| B. | cyclic |
| C. | block cyclic |
| D. | chunk |
| Answer» E. | |
| 33. |
In ------------task are defined before starting the execution of the algorithm |
| A. | dynamic task |
| B. | static task |
| C. | regular task |
| D. | one way task |
| Answer» C. regular task | |
| 34. |
Which of the following is not an application of topological sorting? |
| A. | a) finding prerequisite of a task |
| B. | b) finding deadlock in an operating system |
| C. | c) finding cycle in a graph |
| D. | d) ordered statistics |
| Answer» E. | |
| 35. |
In most of the cases, topological sort starts from a node which has __________ |
| A. | a) maximum degree |
| B. | b) minimum degree |
| C. | c) any degree |
| D. | d) zero degree |
| Answer» E. | |
| 36. |
Topological sort can be applied to which of the following graphs? |
| A. | a) undirected cyclic graphs |
| B. | b) directed cyclic graphs |
| C. | c) undirected acyclic graphs |
| D. | d) directed acyclic graphs |
| Answer» E. | |
| 37. |
which of the following is not an example of explorative decomposition |
| A. | n queens problem |
| B. | 15 puzzal problem |
| C. | tic tac toe |
| D. | quick sort |
| Answer» E. | |
| 38. |
In this decomposition problem decomposition goes hand in hand with its execution |
| A. | data decomposition |
| B. | recursive decomposition |
| C. | explorative decomposition |
| D. | speculative decomposition |
| Answer» D. speculative decomposition | |
| 39. |
which problems can be handled by recursive decomposition |
| A. | backtracking |
| B. | greedy method |
| C. | divide and conquer problem |
| D. | branch and bound |
| Answer» D. branch and bound | |
| 40. |
which of the following is a an example of data decomposition |
| A. | matrix multiplication |
| B. | merge sort |
| C. | quick sort |
| D. | 15 puzzal |
| Answer» B. merge sort | |
| 41. |
which of the following is not a granularity type |
| A. | course grain |
| B. | large grain |
| C. | medium grain |
| D. | fine grain |
| Answer» C. medium grain | |
| 42. |
In task dependency graph longest directed path between any pair of start and finish node is called as -------------- |
| A. | total work |
| B. | critical path |
| C. | task path |
| D. | task length |
| Answer» C. task path | |
| 43. |
Task dependency graph is ------------------ |
| A. | directed |
| B. | undirected |
| C. | directed acyclic |
| D. | undirected acyclic |
| Answer» D. undirected acyclic | |
| 44. |
Renaming relative to the source is _____ the source. |
| A. | xor |
| B. | xnor |
| C. | and |
| D. | nand |
| Answer» B. xnor | |
| 45. |
the procedure is disturbed and require only point-to-point _______ |
| A. | synchronization |
| B. | communication |
| C. | both |
| D. | none |
| Answer» B. communication | |
| 46. |
every node has to know when to communicate that is |
| A. | call the procedure |
| B. | call for broadcast |
| C. | call for communication |
| D. | call the congestion |
| Answer» B. call for broadcast | |
| 47. |
Nides with zero in i least significant bits participate in _______ |
| A. | algorithm |
| B. | broadcast |
| C. | communication |
| D. | searching |
| Answer» D. searching | |
| 48. |
For sake of simplicity, the number of nodes is a power of |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |
| 49. |
In one -to- all broadcast there is |
| A. | divide and conquer type algorithm |
| B. | sorting type algorithm |
| C. | searching type algorithm |
| D. | simple algorithm |
| Answer» B. sorting type algorithm | |
| 50. |
In a balanced binary tree processing nodes is equal to |
| A. | leaves |
| B. | number of elemnts |
| C. | branch |
| D. | none |
| Answer» B. number of elemnts | |