Data Anlytics MCQs UNIT-2

 

1. The First step in developing a parallel algorithm is_

1. To Decompose the problem into tasks that can be executed concurrently
2. Execute directly
3. Execute indirectly
4. None of Above

 Answer

To Decompose the problem into tasks that can be executed concurrently

2. The number of tasks into which a problem is decomposed determines its_

1. Granularity
2. Priority
3. Modernity
4. None of Above

 Answer

Granularity

3. The length of the longest path in a task dependency graph is called_

1. the critical path length
2. the critical data length
3. the critical bit length
4. None of Above

 Answer

he critical path length

4. The graph of tasks (nodes) and their interactions/data exchange (edges)_

1. Is referred to as a task interaction graph
2. Is referred to as a task Communication graph
3. Is referred to as a task interface graph
4. None of Above

 Answer

Is referred to as a task interaction graph

5. Mappings are determined by_

1. task dependency
2. task interaction graphs
3. Both A and B
4. None of Above

 Answer

Both A and B

6. Decomposition Techniques are_

1. recursive decomposition
2. data decomposition
3. exploratory decomposition
4. speculative decomposition
5. All of above

 Answer

All of above

7. The Owner Computes rule generally states that the process assigned a particular data item is responsible for _

1. All computation associated with it
2. Only one computation
3. Only two computation
4. Only occasionally computation

 Answer

All computation associated with it

8. A simple application of exploratory decomposition is_

1. The solution to a 15 puzzle
2. The solution to 20 puzzle
3. The solution to any puzzle
4. None of Above

 Answer

The solution to a 15 puzzle

9. Speculative Decomposition consist of _

1. conservative approaches
2. optimistic approaches
3. Both A and B
4. only B

 Answer

Both A and B

hpc mcq questions

10. task characteristics include:

1. Task generation.
2. Task sizes.
3. Size of data associated with tasks.
4. All of above

 Answer

All of above

11. What is a high performance multi-core processor that can be used to accelerate a wide variety of applications using parallel computing.

1. CLU
2. GPU
3. CPU
4. DSP

 Answer

GPU

12. What is GPU?

1. Grouped Processing Unit
2. Graphics Processing Unit
3. Graphical Performance Utility
4. Graphical Portable Unit

 Answer

13. A code, known as GRID, which runs on GPU consisting of a set of

1. 32 Thread
2. 32 Block
3. Unit Block
4. Thread Block

 Answer

Thread Block

14. Interprocessor communication that takes place

1. Centralized memory
2. Shared memory
3. Message passing
4. Both A and B

 Answer

Both A and B

15. Decomposition into a large number of tasks results in coarse-grained decomposition

1. True
2. False

 Answer

False

16. Relevant task characteristics include

1. Task generation.
2. Task sizes
3. Size of data associated with tasks
4. Overhead
5. both A and B

 Answer

both A and B

17. The fetch and execution cycles are interleaved with the help of __

1. Modification in processor architecture
2. Clock
3. Special unit
4. Control unit

 Answer

Clock

18. The processor of system which can read /write GPU memory is known as

1. kernal
2. device
3. Server
4. Host

 Answer

Host

19. Increasing the granularity of decomposition and utilizing the resulting concurrency to perform more tasks in parallel decreses performance.

1. TRUE
2. FALSE

 Answer

FALSE

Parallel computing mcq with answers

20. If there is dependency between tasks it implies their is no need of interaction between them.

1. TRUE
2. FALSE

 Answer

FALSE

21. Parallel quick sort is example of task parallel model

1. TRUE
2. FALSE

 Answer

TRUE

22. True Data Dependency is

1. The result of one operation is an input to the next.
2. Two operations require the same resource.

 Answer

The result of one operation is an input to the next.

23. What is Granularity ?

1. The size of database
2. The size of data item
3. The size of record
4. The size of file

 Answer

The size of data item

24. In coarse-grained parallelism, a program is split into …………………… task and ……………………… Size

1. Large tasks , Smaller Size
2. Small Tasks , Larger Size
3. Small Tasks , Smaller Size
4. Equal task, Equal Size

 Answer

Large tasks , Smaller Size