High Performance Computing MCQ Questions and Answers UNIT – 5 What is High performance computing ? HPC – High Performance Computing is the use of parallel processing for running advanced application programs efficiently, reliably and quickly. The term applies especially to systems that function above a teraflop or 1012 floating-point operations per second. The term HPC is occasionally used as a synonym for supercomputing, although technically a supercomputer is a system that performs at or near the currently highest operational rate for computers. Some supercomputers work at more than a petaflop or 1015 floating-point operations per second.

## High Performance Computing MCQ UNIT – 5

high performance computing mcq questions and answers

- In _, the number of elements to be sorted is small enough to fit into the processβs main memory.

internal sorting

internal searching

external sorting

external searching

Answer: internal sorting

- __ algorithms use auxiliary storage (such as tapes and hard disks) for sorting because the number of elements to be sorted is too large to fit into memory.

internal sorting

internal searching

External sorting

external searching

Answer: External sorting

- __ can be comparison-based or noncomparison-based.

searching

Sorting

both a and b

none of above

Answer: Sorting

- The fundamental operation of comparison-based sorting is __

compare-exchange

searching

Sorting

swapping

Answer: compare-exchange

- The complexity of bubble sort is Ξ(n^2)

TRUE

FALSE

Answer: TRUE

- Bubble sort is difficult to parallelize since the algorithm has no concurrency.

TRUE

FALSE

Answer: TRUE

- Quicksort is one of the most common sorting algorithms for sequential computers because of its simplicity, low overhead, and optimal average complexity.

TRUE

FALSE

Answer: TRUE

- The performance of quicksort depends critically on the quality of the __

non-pivote

pivot

center element

len of array

Answer: pivot

- the complexity of quicksort is O(nlog n)

TRUE

FALSE

Answer: TRUE

- DFS begins by expanding the initial node and generating its successors. In each subsequent step, DFS expands one of the most recently generated nodes.

TRUE

FALSE

Answer: TRUE

## high performance computing mcq sppu

- The main advantage of __ is that its storage requirement is linear in the depth of the state space being searched.

BFS

DFS

a and b

none of above

Answer: DFS

- _ algorithms use a heuristic to guide search.

BFS

DFS

a and b

none of above

Answer: BFS

- If the heuristic is admissible, the BFS finds the optimal solution.

TRUE

FALSE

Answer: TRUE

- The search overhead factor of the parallel system is defined as the ratio of the work done by the parallel formulation to that done by the sequential formulation

TRUE

FALSE

Answer: TRUE

- The critical issue in parallel depth-first search algorithms is the distribution of the search space among the processors.

TRUE

FALSE

Answer: TRUE

- Graph search involves a closed list, where the major operation is a _

sorting

searching

lookup

none of above

Answer: lookup

- Breadth First Search is equivalent to which of the traversal in the Binary Trees?

Pre-order Traversal

Post-order Traversal

Level-order Traversal

In-order Traversal

Answer: Level-order Traversal

- Time Complexity of Breadth First Search is? (V β number of vertices, E β number of edges)

O(V + E)

O(V)

O(E)

O(V*E)

Answer: O(V + E)

- Which of the following is not an application of Breadth First Search?

When the graph is a Binary Tree

When the graph is a Linked List

When the graph is a n-ary Tree

When the graph is a Ternary Tree

Answer: When the graph is a Linked List

high performance computing mcq questions

- In BFS, how many times a node is visited?

Once

Twice

Equivalent to number of indegree of the node

Thrice

Answer: Equivalent to number of indegree of the node

- Is Best First Search a searching algorithm used in graphs.

TRUE

FALSE

Answer: TRUE

- The critical issue in parallel depth-first search algorithms is the distribution of the search space among the processors.

TRUE

FALSE

Answer: TRUE

- Graph search involves a closed list, where the major operation is a _

sorting

searching

lookup

none of above

Answer: lookup

- Which of the following is not a stable sorting algorithm in its typical implementation.

Insertion Sort

Merge Sort

Quick Sort

Bubble Sort

Answer: Quick Sort

- Which of the following is not true about comparison based sorting algorithms?

The minimum possible time complexity of a comparison based sorting algorithm is O(nLogn) for a random input array

Any comparison based sorting algorithm can be made stable by using position as a criteria when two elements are compared

Counting Sort is not a comparison based sorting algortihm

Heap Sort is not a comparison based sorting algorithm.

Answer: Heap Sort is not a comparison based sorting algorithm.

Data analytics mcqs with answers for SPPU

Digital Image Processing MCQ | Basics Of Image Sampling & Quantization

Basic of Digital Image Processing

ALL unite digital Image Processing MCQ

#### HPC MCQ UNIT – 1

**HPC MCQ UNIT -2 **

#### HPC MCQ UNIT – 3

#### HPC MCQ UNIT – 4

#### HPC MCQ UNIT – 6

## READ MORE…

If you found this post useful, donβt forget to share this with your friends, and if you have any query feel free to comment it in the comment section.

Thank you π Keep Learning !