**High performance computing mcq questions and answers**

**1. 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

internal sorting

**2. __ 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

External sorting

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

- searching
- Sorting
- both a and b
- none of above

Sorting

**4. The fundamental operation of comparison-based sorting is __**

- compare-exchange
- searching
- Sorting
- swapping

compare-exchange

**5. The complexity of bubble sort is Î˜(n^2)**

- TRUE
- FALSE

TRUE

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

- TRUE
- FALSE

TRUE

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

- TRUE
- FALSE

TRUE

**8. The performance of quicksort depends critically on the quality of the __**

- non-pivote
- pivot
- center element
- len of array

pivot

**9. the complexity of quicksort is O(nlog n)**

- TRUE
- FALSE

TRUE

**10. 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

TRUE

**high performance computing mcq sppu**

**11. 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

DFS

**12. _ algorithms use a heuristic to guide search.**

- BFS
- DFS
- a and b
- none of above

BFS

**13. If the heuristic is admissible, the BFS finds the optimal solution.**

- TRUE
- FALSE

TRUE

**14. 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

TRUE

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

- TRUE
- FALSE

TRUE

**16. Graph search involves a closed list, where the major operation is a _**

- sorting
- searching
- lookup
- none of above

lookup

**17. 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

Level-order Traversal

**18. 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)

O(V + E)

**19. 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

When the graph is a Linked List

**high performance computing mcq questions**

**20. In BFS, how many times a node is visited?**

- Once
- Twice
- Equivalent to number of indegree of the node
- Thrice

Equivalent to number of indegree of the node

**21. Is Best First Search a searching algorithm used in graphs.**

- TRUE
- FALSE

TRUE

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

- TRUE
- FALSE

TRUE

**23. Graph search involves a closed list, where the major operation is a _**

- sorting
- searching
- lookup
- none of above

lookup

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

- Insertion Sort
- Merge Sort
- Quick Sort
- Bubble Sort

Quick Sort

**25. 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.

Heap Sort is not a comparison based sorting algorithm.

**Data Analytics sppu mcq**

**high performance computing mcq sppu**

high performance computing mcq, high performance computing mcq sppu, high performance computing mcq questions, high performance computing multiple choice questions, high performance computing mcq questions and answers, sppu question bank mcq pdf, high performance computing quiz, hpc mcq questions, parallel computing mcq with answers, high performance computing mcq questions and answers sppu