Data Anlytics MCQs 2000+ Question

  

                   Data Analytics MCQ 2000+

1. Which of the following is not an example of Social Media?

1. Twitter
2. Google
3. Instagram
4. YouTube

 Answer

Google

2. By 2025, the volume of digital data will increase to

1. TB
2. YB
3. ZB
4. EB

 Answer

ZB

3. Data Analysis is a process of

1. inspecting data
2. cleaning data
3. transforming data
4. All of Above

 Answer

All of above

4. Does Facebook uses “Big Data ” to perform the concept of Flashback?

1. True
2. False

 Answer

True

5. Which of the following is not a major data analysis approaches?

1. Data Mining
2. Predictive Intelligence
3. Business Intelligence
4. Text Analytics

 Answer

Predictive Intelligence

6. The Process of describing the data that is huge and complex to store and process is known as

1. Analytics
2. Data mining
3. Big data
4. Data warehouse

 Answer

Big data

7.  How many main statistical methodologies are used in data analysis?

1. 2
2. 3
3. 4
4. 5

 Answer

2

8. In descriptive statistics, data from the entire population or a sample is summarized with ?

1. Integer descriptor
2. floating descriptor
3. numerical descriptor
4. decimal descriptor

 Answer

numerical descriptor

9. ____ have a structure but cannot be stored in a database.

1. Structured
2. Semi Structured
3. Unstructured
4. None of these

 Answer

None of these

10. Data generated from online transactions is one of the example for volume of big data

1. TRUE
2. FALSE

 Answer

TRUE

11. Velocity is the speed at which the data is processed

1. True
2. False

 Answer

False

12. Value tells the trustworthiness of data in terms of quality and accuracy

1. TRUE
2. FALSE

 Answer

False

13. Hortonworks was introduced by Cloudera and owned by Yahoo

1. True
2. False

 Answer

False

14. ____ refers to the ability to turn your data useful for business

1. Velocity
2. variety
3. Value
4. Volume

 Answer

Value

15. GFS consists of ____ Master and _____ Chunk Servers

1. Single, Single
2. Multiple, Single
3. Single, Multiple
4. Multiple, Multiple

 Answer

Single, Multiple

16. Data Analysis is defined by the statistician?

1. William S.
2. Hans Peter Luhn
3.  Gregory Piatetsky-Shapiro
4.  John Tukey

 Answer

John Tukey

17. Files are divided into ____ sized Chunks.

1. Static
2. Dynamic
3. Fixed
4. Variable

 Answer

Fixed

18. _____ is an open source framework for storing data and running application on clusters of commodity hardware.

1. HDFS
2. Hadoop
3. MapReduce
4. Cloud

 Answer

Hadoop

19. HDFS Stores how much data in each clusters that can be scaled at any time?

1. 32
2. 64
3. 128
4. 256

 Answer

128

20. Hadoop Map Reduce allows you to perform distributed parallel processing on large volumes of data quickly and efficiently… is this Map Reduce or Hadoop

1. True
2. False

 Answer

True

21. Google Introduced Map Reduce Programming model in 2004

1. True
2. False

 Answer

True

22. Hadoop YARN is used for Cluster Resource Management in Hadoop Ecosystem

1. True
2. False

 Answer

True

23. _____ phase sorts the data & _____ creates logical clusters.

1. Reduce, YARN
2. MAP, YARN
3. REDUCE, MAP
4. MAP, REDUCE

 Answer

MAP, REDUCE

24. There is only one operation between Mapping and Reducing

1. True
2. False

 Answer

True

25. Which of the following is true about hypothesis testing?

1. answering yes/no questions about the data
2. estimating numerical characteristics of the data
3. describing associations within the data
4. modeling relationships within the data

 Answer

answering yes/no questions about the data

26. The goal of business intelligence is to allow easy interpretation of large volumes of data to identify new opportunities

1. True
2. False

 Answer

True

27. ____ is factors considered before Adopting Big Data Technology

1. Validation
2. Verification
3. Data
4. Design

 Answer

Validation

28. for improving supply chain management to optimize stock management, replenishment, and forecasting

1. Descriptive
2. Diagnostic
3. Predictive
4. Prescriptive

 Answer

Predictive

29. which among the following is not a Data mining and analytical applications?

1. profile matching
2. social network analysis
3. facial recognition
4. Filtering

 Answer

Filtering

30. _____ as a result of data accessibility, data latency, data availability, or limits on bandwidth in relation to the size of inputs

1. Computation-restricted throttling
2. Large data volumes
3. Data throttling
4. Data Parallelization

 Answer

Data throttling

31. As an example, an expectation of using a recommendation engine would be to increase same-customer sales by adding more items into the market basket

1. Lowering costs
2. Increasing revenues
3. Increasing productivity
4.  Reducing risk

 Answer

Increasing revenues

32. Which storage subsystem can support massive data volumes of increasing size.

1. Extensibility
2. Fault tolerance
3. Scalability
4. High-speed I/O capacity

 Answer

Scalability

33. _____ provides performance through distribution of data and fault tolerance through replication

1. HDFS
2. PIG
3. HIVE
4. HADOOP

 Answer

HDFS

34. ______ is a programming model for writing applications that can process Big Data in parallel on multiple nodes.

1. HDFS
2. MAP REDUCE
3. HADOOP
4. HIVE

 Answer

MAP REDUCE

35.  ____ takes the grouped key-value paired data as input and runs a Reducer function on each one of them.

1. MAPPER
2. REDUCER
3. COMBINER
4. PARTITIONER

 Answer

REDUCER

36. ____ is a type of local Reducer that groups similar data from the map phase into identifiable sets.

1. MAPPER
2. REDUCER
3. COMBINER
4. PARTITIONER

 Answer

COMBINER

37. While Installing Hadoop how many xml files are edited and list them ?

1. core-site.xml
2. hdfs-site.xml
3. mapred.xml
4. yarn.xml

 Answer

core-site.xml

38. Movie Recommendation systems are an example of

1. Classification
2. Clustering
3. Reinforcement Learning
4. Regression

1. 2 only
2. 1 and 3
3. 1 and 2
4. 2 and 3

 Answer

1 and 3

39. Sentiment Analysis is an example of

1. Regression
2. Classification
3. clustering
4. Reinforcement Learning

1. 1, 2 and 4
2. 1, 2 and 3
3. 1 and 3
4. 1 and 2

 Answer

1, 2 and 4

 1. The branch of statistics which deals with development of particular statistical methods is classified as

1. industry statistics
2. economic statistics
3. applied statistics
4. applied statistics

Show Answer

applied statistics

2. Which of the following is true about regression analysis?

1. answering yes/no questions about the data
2. estimating numerical characteristics of the data
3. modeling relationships within the data
4. describing associations within the data

Show Answer

modeling relationships within the data

3. Text Analytics, also referred to as Text Mining?

1. True
2. False
3. Can be true or False
4. Can not say

Show Answer

TRUE

4. What is a hypothesis?

1. A statement that the researcher wants to test through the data collected in a study.
2. A research question the results will answer.
3. A theory that underpins the study.
4. A statistical method for calculating the extent to which the results could have happened by chance.

Show Answer

A statement that the researcher wants to test through the data collected in a study.

5. What is the cyclical process of collecting and analyzing data during a single research study called?

1. Interim Analysis
2. Inter analysis
3. inter item analysis
4. constant analysis

Show Answer

Interim Analysis

6. The process of quantifying data is referred to as ____

1. Topology
2. Digramming
3. Enumeration
4. coding

Show Answer

Enumeration

7.  An advantage of using computer programs for qualitative data is that they _

1. Can reduce time required to analyse data (i.e., after the data are transcribed)
2. Help in storing and organising data
3. Make many procedures available that are rarely done by hand due to time constraints
4. All of the above

Show Answer

All of the Above

8. Boolean operators are words that are used to create logical combinations.

1. True
2. False

Show Answer

True

9. ______ are the basic building blocks of qualitative data.

1. Categories
2. Units
3. Individuals
4. None of the above

Show Answer

Categories

10. This is the process of transforming qualitative research data from written interviews or field notes into typed text.

1. Segmenting
2. Coding
3. Transcription
4. Mnemoning

Show Answer

Transcription

11. A challenge of qualitative data analysis is that it often includes data that are unwieldy and complex; it is a major challenge to make sense of the large pool of data.

1. True
2. False

Show Answer

True

12. Hypothesis testing and estimation are both types of descriptive statistics.

1. True
2. False

Show Answer

False

13. A set of data organised in a participants(rows)-by-variables(columns) format is known as a “data set.”

1. True
2. False

Show Answer

True

14. A graph that uses vertical bars to represent data is called a ___

1. Line graph
2. Bar graph
3. Scatterplot
4. Vertical graph

Show Answer

Bar graph

15. ____ are used when you want to visually examine the relationship between two quantitative variables.

1. Bar graph
2. pie graph
3. line graph
4. Scatterplot

Show Answer

Scatterplot

16. The denominator (bottom) of the z-score formula is

1. The standard deviation
2. The difference between a score and the mean
3. The range
4. The mean

Show Answer

The standard deviation

17. Which of these distributions is used for a testing hypothesis?

1. Normal Distribution
2. Chi-Squared Distribution
3. Gamma Distribution
4. Poisson Distribution

Show Answer

Chi-Squared Distribution

18. A statement made about a population for testing purpose is called?

1. Statistic
2. Hypothesis
3. Level of Significance
4. Test-Statistic

Show Answer

Hypothesis

19. If the assumed hypothesis is tested for rejection considering it to be true is called?

1. Null Hypothesis
2. Statistical Hypothesis
3. Simple Hypothesis
4. Composite Hypothesis

Show Answer

Null Hypothesis

20. If the null hypothesis is false then which of the following is accepted?

1. Null Hypothesis
2. Positive Hypothesis
3. Negative Hypothesis
4. Alternative Hypothesis.

Show Answer

Alternative Hypothesis.

21. Alternative Hypothesis is also called as?

1. Composite hypothesis
2. Research Hypothesis
3. Simple Hypothesis
4. Null Hypothesis

Show Answer

Research Hypothesis

 1. What is the minimum no. of variables/ features required to perform clustering?

1. 0
2. 1
3. 2
4. 3

 Answer

1

2. For two runs of K-Mean clustering is it expected to get same clustering results?

1. Yes
2. No

 Answer

No

3. Which of the following algorithm is most sensitive to outliers?

1. K-means clustering algorithm
2. K-medians clustering algorithm
3. K-modes clustering algorithm
4. K-medoids clustering algorithm

 Answer

K-means clustering algorithm

4. The discrete variables and continuous variables are two types of

1. Open end classification
2. Time series classification
3. Qualitative classification
4. Quantitative classification

 Answer

Quantitative classification

5. Bayesian classifiers is

1. A class of learning algorithm that tries to find an optimum classification of a set of examples using the probabilistic theory.
2. Any mechanism employed by a learning system to constrain the search space of a hypothesis
3. An approach to the design of learning algorithms that is inspired by the fact that when people encounter new situations, they often explain them by reference to familiar experiences, adapting the explanations to fit the new situation.
4. None of these

 Answer

A class of learning algorithm that tries to find an optimum classification of a set of examples using the probabilistic theory.

6. Classification accuracy is

1. A subdivision of a set of examples into a number of classes
2. Measure of the accuracy, of the classification of a concept that is given by a certain theory
3. The task of assigning a classification to a set of examples
4. None of these

 Answer

Measure of the accuracy, of the classification of a concept that is given by a certain theory

7. Euclidean distance measure is

1. A stage of the KDD process in which new data is added to the existing selection.
2. The process of finding a solution for a problem simply by enumerating all possible solutions according to some pre-defined order and then testing them
3. The distance between two points as calculated using the Pythagoras theorem
4. none of above

 Answer

The distance between two points as calculated using the Pythagoras theorem

8. Hybrid is

1. Combining different types of method or information
2. Approach to the design of learning algorithms that is structured along the lines of the theory of evolution.
3. Decision support systems that contain an information base filled with the knowledge of an expert formulated in terms of if-then rules.
4. none of above

 Answer

Combining different types of method or information

9. Decision trees use ______ , in that they always choose the option that seems the best available at that moment.

1. Greedy Algorithms
2. divide and conquer
3. Backtracking
4. Shortest path algorithm

 Answer

Greedy Algorithms

10. Discovery is

1. It is hidden within a database and can only be recovered if one is given certain clues (an example IS encrypted information).
2. The process of executing implicit previously unknown and potentially useful information from data
3. An extremely complex molecule that occurs in human chromosomes and that carries genetic information in the form of genes.
4. None of these

 Answer

The process of executing implicit previously unknown and potentially useful information from data

Data Analytics sppu mcq

11. Hidden knowledge referred to

1. A set of databases from different vendors, possibly using different database paradigms
2. An approach to a problem that is not guaranteed to work but performs well in most cases
3. Information that is hidden in a database and that cannot be recovered by a simple SQL query.
4. None of these

 Answer

Information that is hidden in a database and that cannot be recovered by a simple SQL query.

12. Decision trees cannot handle categorical attributes with many distinct values, such as country codes for telephone numbers.

1. True
2. False

 Answer

False

13. Enrichment is

1. A stage of the KDD process in which new data is added to the existing selection
2. The process of finding a solution for a problem simply by enumerating all possible solutions according to some pre-defined order and then testing them
3. The distance between two points as calculated using the Pythagoras theorem.
4. None of these

 Answer

A stage of the KDD process in which new data is added to the existing selection

14. _____ are easy to implement and can execute efficiently even without prior knowledge of the data, they are among the most popular algorithms for classifying text documents.

1. ID3
2. Naïve Bayes classifiers
3. CART
4. None of above

 Answer

Naïve Bayes classifiers

15. High entropy means that the partitions in classification are

1. Pure
2. Not Pure
3. Usefull
4. useless

 Answer

Uses a single processor or computer

16. Which of the following statements about Naive Bayes is incorrect?

1. Attributes are equally important.
2. Attributes are statistically dependent of one another given the class value.
3. Attributes are statistically independent of one another given the class value.
4. Attributes can be nominal or numeric

 Answer

Attributes are statistically dependent of one another given the class value.

17. The maximum value for entropy depends on the number of classes so if we have 8 Classes what will be the max entropy.

1. Max Entropy is 1
2. Max Entropy is 2
3. Max Entropy is 3
4. Max Entropy is 4

 Answer

Max Entropy is 3

18. Point out the wrong statement.

1. k-nearest neighbor is same as k-means
2. k-means clustering is a method of vector quantization
3. k-means clustering aims to partition n observations into k clusters
4. none of the mentioned

 Answer

k-nearest neighbor is same as k-means

19. Consider the following example “How we can divide set of articles such that those articles have the same theme (we do not know the theme of the articles ahead of time) ” is this:

1. Clustering
2. Classification
3. Regression
4. None of these

 Answer

Clustering

data analytics mcqs with answers

20. Can we use K Mean Clustering to identify the objects in video?

1. Yes
2. No

 Answer

Yes

21. Clustering techniques are ______ in the sense that the data scientist does not determine, in advance, the labels to apply to the clusters.

1. Unsupervised
2. supervised
3. Reinforcement
4. Neural network

 Answer

Unsupervised

22. _____ metric is examined to determine a reasonably optimal value of k.

1. Mean Square Error
2. Within Sum of Squares (WSS)
3. Speed
4. None of these

 Answer

Within Sum of Squares (WSS)

23. If an itemset is considered frequent, then any subset of the frequent itemset must also be frequent.

1. Apriori Property
2. Downward Closure Property
3. Either 1 or 2
4. Both 1 and 2

 Answer

Both 1 and 2

24. if {bread,eggs,milk} has a support of 0.15 and {bread,eggs} also has a support of 0.15, the confidence of rule {bread,eggs}→{milk} is

1. 0
2. 1
3. 2
4. 3

 Answer

1

25. Confidence is a measure of how X and Y are really related rather than coincidentally happening together.

1. True
2. False

 Answer

False

26. ______ recommend items based on similarity measures between users and/or items.

1. Content Based Systems
2. Hybrid System
3. Collaborative Filtering Systems
4. None of these

 Answer

Collaborative Filtering Systems

27. There are ______ major Classification of Collaborative Filtering Mechanisms

1. 1
2. 2
3. 3
4. none of above

 Answer

2

28. Movie Recommendation to people is an example of

1. User Based Recommendation
2. Item Based Recommendation
3. Knowledge Based Recommendation
4. content based recommendation

 Answer

Item Based Recommendation

29. _____ recommenders rely on an explicitely defined set of recommendation rules

1. Constraint Based
2. Case Based
3. Content Based
4. User Based

 Answer

Case Based

30. Parallelized hybrid recommender systems operate dependently of one another and produce separate recommendation lists.

1. True
2. False

 Answer

False

 1. The branch of statistics which deals with development of particular statistical methods is classified as

1. industry statistics
2. economic statistics
3. applied statistics
4. applied statistics

 Answer

applied statistics

2. Which of the following is true about regression analysis?

1. answering yes/no questions about the data
2. estimating numerical characteristics of the data
3. modeling relationships within the data
4. describing associations within the data

 Answer

modeling relationships within the data

3. Text Analytics, also referred to as Text Mining?

1. True
2. False
3. Can be true or False
4. Can not say

 Answer

TRUE

4. What is a hypothesis?

1. A statement that the researcher wants to test through the data collected in a study.
2. A research question the results will answer.
3. A theory that underpins the study.
4. A statistical method for calculating the extent to which the results could have happened by chance.

 Answer

A statement that the researcher wants to test through the data collected in a study.

5. What is the cyclical process of collecting and analysing data during a single research study called?

1. Interim Analysis
2. Inter analysis
3. inter item analysis
4. constant analysis

 Answer

Interim Analysis

6. The process of quantifying data is referred to as ____

1. Topology
2. Digramming
3. Enumeration
4. coding

 Answer

Enumeration

7.  An advantage of using computer programs for qualitative data is that they _

1. Can reduce time required to analyse data (i.e., after the data are transcribed)
2. Help in storing and organising data
3. Make many procedures available that are rarely done by hand due to time constraints
4. All of the above

 Answer

All of the Above

8. Boolean operators are words that are used to create logical combinations.

1. True
2. False

 Answer

True

9. ______ are the basic building blocks of qualitative data.

1. Categories
2. Units
3. Individuals
4. None of the above

 Answer

Categories

10. This is the process of transforming qualitative research data from written interviews or field notes into typed text.

1. Segmenting
2. Coding
3. Transcription
4. Mnemoning

 Answer

Transcription

11. A challenge of qualitative data analysis is that it often includes data that are unwieldy and complex; it is a major challenge to make sense of the large pool of data.

1. True
2. False

 Answer

True

12. Hypothesis testing and estimation are both types of descriptive statistics.

1. True
2. False

 Answer

False

13. A set of data organised in a participants(rows)-by-variables(columns) format is known as a “data set.”

1. True
2. False

 Answer

True

14. A graph that uses vertical bars to represent data is called a ___

1. Line graph
2. Bar graph
3. Scatterplot
4. Vertical graph

 Answer

Bar graph

15. ____ are used when you want to visually examine the relationship between two quantitative variables.

1. Bar graph
2. pie graph
3. line graph
4. Scatterplot

 Answer

Scatterplot

16. The denominator (bottom) of the z-score formula is

1. The standard deviation
2. The difference between a score and the mean
3. The range
4. The mean

 Answer

The standard deviation

17. Which of these distributions is used for a testing hypothesis?

1. Normal Distribution
2. Chi-Squared Distribution
3. Gamma Distribution
4. Poisson Distribution

 Answer

Chi-Squared Distribution

18. A statement made about a population for testing purpose is called?

1. Statistic
2. Hypothesis
3. Level of Significance
4. Test-Statistic

 Answer

Hypothesis

19. If the assumed hypothesis is tested for rejection considering it to be true is called?

1. Null Hypothesis
2. Statistical Hypothesis
3. Simple Hypothesis
4. Composite Hypothesis

 Answer

Null Hypothesis

20. If the null hypothesis is false then which of the following is accepted?

1. Null Hypothesis
2. Positive Hypothesis
3. Negative Hypothesis
4. Alternative Hypothesis.

 Answer

Alternative Hypothesis.

21. Alternative Hypothesis is also called as?

1. Composite hypothesis
2. Research Hypothesis
3. Simple Hypothesis
4. Null Hypothesis

 Answer

Research Hypothesis

 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

  

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

  

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 thesource as well as destination.

1. True
2. False

 Answer

True