Skip to main content

Data Analytics MCQs UNIT-1

                           Data Analytics MCQs UNIT-1

1. Which is the type of Microcomputer Memory

  1. Address
  2. Contents
  3. Both a and b
  4. none

Show Answer

Both a and b

2. A collection of lines that connects several devices is called

  1. Bus
  2. Peripheral connection wires
  3. Both a and b
  4. internal wires

Show Answer

Bus

3. Conventional architectures coarsely comprise of a

  1. Processor
  2. Memory System
  3. Data path
  4. All of the above

Show Answer

All of the above

4. VLIW processors rely on

  1. Compile time analysis
  2. Initial time analysis
  3. Final time analysis
  4. id time analysis

Show Answer

Compile time analysis

5. HPC is not used in high span bridges

  1. True
  2. False

Show Answer

False

6. The access time of memory is …………… the time required for performing any single CPU operation.

  1. longer than
  2. shorter than
  3. negligible than
  4. same as

Show Answer

longer than

7. Data intensive applications utilize_

  1. High aggregate throughput
  2. High aggregate network bandwidth
  3. high processing and memory system performance
  4. none of above

Show Answer

High aggregate throughput

8. Memory system performance is largely captured by_

  1. Latency
  2. bandwidth
  3. both a and b
  4. none of above

Show Answer

both a and b

9. A processor performing fetch or decoding of different instruction during the execution of another instruction is called __ .

  1. Super-scaling
  2. Pipe-lining
  3. Parallel Computation
  4. none of above

Show Answer

Pipe-lining

10. For a given FINITE number of instructions to be executed, which architecture of the processor provides for a faster execution ?

  1. ISA
  2. ANSA
  3. Super-scalar
  4. All of the above

Show Answer

Super-scalar

11. HPC works out to be economical.

  1. True
  2. false

Show Answer

True

12. High Performance Computing of the Computer System tasks are done by

  1. Node Cluster
  2. Network Cluster
  3. Beowulf Cluster
  4. Stratified Cluster

Show Answer

Beowulf Cluster

13. Octa Core Processors are the processors of the computer system that contains

  1. 2 Processors
  2. 4 Processors
  3. 6 Processors
  4. 8 Processors

Show Answer

8 Processors

14. Parallel computing uses _ execution

  1. sequential
  2. unique
  3. simultaneous
  4. None of above

Show Answer

simultaneous

15. Which of the following is NOT a characteristic of parallel computing?

  1. Breaks a task into pieces
  2. Uses a single processor or computer
  3. Simultaneous execution
  4. May use networking

Show Answer

Uses a single processor or computer

16. Which of the following is true about parallel computing performance?

  1. Computations use multiple processors
  2. There is an increase in speed
  3. The increase in speed is loosely tied to the number of processor or computers used
  4. All of the answers are correct.

Show Answer

All of the answers are correct.

17. __ leads to concurrency.

  1. Serialization
  2. Parallelism
  3. Serial processing
  4. Distribution

Show Answer

Parallelism

18. MIPS stands for?

  1. Mandatory Instructions/sec
  2. Millions of Instructions/sec
  3. Most of Instructions/sec
  4. Many Instructions / sec

Show Answer

Millions of Instructions/sec

19. Which MIMD systems are best scalable with respect to the number of processors

  1. Distributed memory computers
  2. consume systems
  3. Symmetric multiprocessors
  4. None of above

Show Answer

Distributed memory computers

20. To which class of systems does the von Neumann computer belong?

  1. SIMD (Single Instruction Multiple Data)
  2. MIMD (Multiple Instruction Multiple Data)
  3. MISD (Multiple Instruction Single Data)
  4. SISD (Single Instruction Single Data)

Show Answer

SISD (Single Instruction Single Data)

21. Which of the architecture is power efficient?

  1. CISC
  2. RISC
  3. ISA
  4. IANA

Show Answer

RISC

22. Pipe-lining is a unique feature of _.

  1. RISC
  2. CISC
  3. ISA
  4. IANA

Show Answer

RISC

23. The computer architecture aimed at reducing the time of execution of instructions is __.

  1. RISC
  2. CISC
  3. ISA
  4. IANA

Show Answer

RISC

24. Type of microcomputer memory is

  1. processor memory
  2. primary memory
  3. secondary memory
  4. All of above

Show Answer

All of above

25. A pipeline is like_

  1. Overlaps various stages of instruction execution to achieve performance.
  2. House pipeline
  3. Both a and b
  4. A gas line

Show Answer

Overlaps various stages of instruction execution to achieve performance.

26. Scheduling of instructions is determined_

  1. True Data Dependency
  2. Resource Dependency
  3. Branch Dependency
  4. All of above

Show Answer

All of above

27. The fraction of data references satisfied by the cache is called_

  1. Cache hit ratio
  2. Cache fit ratio
  3. Cache best ratio
  4. none of above

Show Answer

Cache hit ratio

28. A single control unit that dispatches the same Instruction to various processors is__

  1. SIMD
  2. SPMD
  3. MIMD
  4. none of above

Show Answer

SIMD

29. The primary forms of data exchange between parallel tasks are_

  1. Accessing a shared data space
  2. Exchanging messages.
  3. Both A and B
  4. none of above

Show Answer

Both A and B

30. Switches map a fixed number of inputs to outputs.

  1. True
  2. False

Show Answer

True

 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

Graphics Processing Unit

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

 1. The primary and essential mechanism to support the sparse matrices is

  1. Gather-scatter operations
  2. Gather operations
  3. Scatter operations
  4. Gather-scatter technique

 Answer

Gather-scatter operations

2. In the gather operation, a single node collects a ———

  1. Unique message from each node
  2. Unique message from only one node
  3. Different message from each node
  4. None of Above

 Answer

Unique message from each node

3. In the scatter operation, a single node sends a ————

  1. Unique message of size m to every other node
  2. Different message of size m to every other node
  3. Different message of different size m to every other node
  4. All of Above

 Answer

Unique message of size m to every other node

4. Is All to all Bradcasting is same as All to all personalized communication?

  1. Yes
  2. No

 Answer

No

5. Is scatter operation is same as Broadcast?

  1. Yes
  2. No

 Answer

No

6. All-to-all personalized communication is also known as

  1. Total Exchange
  2. Personal Message
  3. Scatter
  4. Gather

 Answer

Total Exchange

7. By which way, scatter operation is different than broadcast

  1. Message size
  2. Number of nodes
  3. Same
  4. None of above

 Answer

Message size

8. The gather operation is exactly the _ of the scatter operation

  1. Inverse
  2. Reverse
  3. Multiple
  4. Same

 Answer

Inverse

9. The gather operation is exactly the inverse of the_

  1. Scatter operation
  2. Broadcast operation
  3. Prefix Sum
  4. Reduction operation

 Answer

Scatter operation

hpc mcq questions

10. The dual of one-to-all broadcast is all-to-one reduction. True or False?

  1. TRUE
  2. FALSE

 Answer

TRUE

11. A binary tree in which processors are (logically) at the leaves and internal nodes are routing nodes.

  1. TRUE
  2. FALSE

 Answer

TRUE

12. Group communication operations are built using point-to-point messaging primitives

  1. TRUE
  2. FALSE

 Answer

TRUE

13. Communicating a message of size m over an uncongested network takes time ts + tmw

  1. True
  2. False

 Answer

True

14. Parallel programs: Which speedup could be achieved according to Amdahl´s law for infinite number of processors if 5% of a program is sequential and the remaining part is ideally parallel?

  1. Infinite speedup
  2. 5
  3. 20
  4. None of above

 Answer

20

15. Shift register that performs a circular shift is called

  1. Invalid Counter
  2. Valid Counter
  3. Ring
  4. Undefined

 Answer

Ring

16. 8 bit information can be stored in

  1. 2 Registers
  2. 4 Registers
  3. 6 Registers
  4. 8 Registers

 Answer

8 Registers

17. The result of prefix expression * / b + – d a c d, where a = 3, b = 6, c = 1, d = 5 is

  1. 0
  2. 5
  3. 10
  4. 8

 Answer

10

18. The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of nodes in a binary tree of height h is?

  1. 2h – 1
  2. 2h – 1 – 1
  3. 2h + 1 – 1
  4. 2 * (h+1)

 Answer

2h + 1 – 1

19. A hypercube has_

  1. 2^d nodes
  2. 2d nodes
  3. 2n Nodes
  4. N Nodes

 Answer

2^d nodes

Parallel computing mcq with answers

20. The Prefix Sum Operation can be implemented using the_

  1. All-to-all broadcast kernel
  2. All-to-one broadcast kernel
  3. One-to-all broadcast Kernel
  4. Scatter Kernel

 Answer

All-to-all broadcast kernel

21.In the scatter operation_

  1. Single node send a unique message of size m to every other node
  2. Single node send a same message of size m to every other node
  3. Single node send a unique message of size m to next node
  4. None of Above

 Answer

Single node send a unique message of size m to every other node

22. In All-to-All Personalized Communication Each node has a distinct message of size m for every other node

  1. True
  2. False

 Answer

True

23. A binary tree in which processors are (logically) at the leaves and internal nodes are
routing nodes.

  1. True
  2. False

 Answer

True

24. In All-to-All Broadcast each processor is the source as well as destination.

  1. True
  2. False

 Answer

True

 

 

Comments

Post a Comment

Popular posts from this blog

short key of c programming

short key of c programming Shortcut Keys(Hot Keys)     Operation    Alt + F  -            Open file Alt + F3 -           Close Alt + F + N  -    New file Alt + X  -           Exit turbo c Alt + F5 -          Output Screen Alt + F + L  -    Check programme load or not. Alt + ENTER  - Full screen Shift + Del -       Cut Shift + Insert -   Paste Ctr + Insert -    Copy Alt+F9 -           Compile a program Ctr + F8           Bbreak point Ctrl+F9 -          To run a program Ctrl+s -...
1 comment
Read more

C LANGUAGE - OVERVIEW C - VARIABLES

C LANGUAGE - OVERVIEW Advertisements C is a general-purpose, high-level language that was originally developed by Dennis M. Ritchie to develop the UNIX operating system at Bell Labs. C was originally first implemented on the DEC PDP-11 computer in 1972. In 1978, Brian Kernighan and Dennis Ritchie produced the first publicly available description of C, now known as the K&R standard. The UNIX operating system, the C compiler, and essentially all UNIX application programs have been written in C. C has now become a widely used professional language for various reasons − Easy to learn Structured language It produces efficient programs It can handle low-level activities It can be compiled on a variety of computer platforms Facts about C C was invented to write an operating system called UNIX. C is a successor of B language which was introduced around the early 1970s. The language was formalized in 1988 by the American National Standard Institute  A N S I A N S ...
1 comment
Read more

environment

It looks like you meant "environment." The environment refers to the surroundings or conditions in which a person, animal, or plant lives or operates. It encompasses various elements, including natural resources, ecosystems, climate, and human-made structures. Protecting and preserving the environment is crucial for the well-being of all living organisms on Earth. Is there anything specific you'd like to discuss or learn about regarding the environment?
Post a Comment
Read more