High performance computing mcq sppu unit 5

High performance computing mcq questions and answers

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

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

  1. internal sorting
  2. internal searching
  3. external sorting
  4. external searching
Advertisement

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.

  1. internal sorting
  2. internal searching
  3. External sorting
  4. external searching
Advertisement

External sorting

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

  1. searching
  2. Sorting
  3. both a and b
  4. none of above
Advertisement

Sorting

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

  1. compare-exchange
  2. searching
  3. Sorting
  4. swapping
Advertisement

compare-exchange

5. The complexity of bubble sort is Θ(n^2)

  1. TRUE
  2. FALSE
Advertisement

TRUE

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

  1. TRUE
  2. FALSE
Advertisement

TRUE

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

  1. TRUE
  2. FALSE
Advertisement

TRUE

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

  1. non-pivote
  2. pivot
  3. center element
  4. len of array
Advertisement

pivot

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

  1. TRUE
  2. FALSE
Advertisement

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.

  1. TRUE
  2. 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.

  1. BFS
  2. DFS
  3. a and b
  4. none of above
Advertisement

DFS

12. _ algorithms use a heuristic to guide search.

  1. BFS
  2. DFS
  3. a and b
  4. none of above

BFS

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

  1. TRUE
  2. FALSE
Advertisement

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

  1. TRUE
  2. FALSE
Advertisement

TRUE

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

  1. TRUE
  2. FALSE

TRUE

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

  1. sorting
  2. searching
  3. lookup
  4. none of above
Advertisement

lookup

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

  1. Pre-order Traversal
  2. Post-order Traversal
  3. Level-order Traversal
  4. In-order Traversal
Advertisement

Level-order Traversal

18. Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges)

  1. O(V + E)
  2. O(V)
  3. O(E)
  4. O(V*E)

O(V + E)

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

  1. When the graph is a Binary Tree
  2. When the graph is a Linked List
  3. When the graph is a n-ary Tree
  4. When the graph is a Ternary Tree
Advertisement

When the graph is a Linked List

high performance computing mcq questions

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

  1. Once
  2. Twice
  3. Equivalent to number of indegree of the node
  4. Thrice
Advertisement

Equivalent to number of indegree of the node

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

  1. TRUE
  2. FALSE

TRUE

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

  1. TRUE
  2. FALSE
Advertisement

TRUE

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

  1. sorting
  2. searching
  3. lookup
  4. none of above
Advertisement

lookup

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

  1. Insertion Sort
  2. Merge Sort
  3. Quick Sort
  4. Bubble Sort

Quick Sort

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

  1. The minimum possible time complexity of a comparison based sorting algorithm is O(nLogn) for a random input array
  2. Any comparison based sorting algorithm can be made stable by using position as a criteria when two elements are compared
  3. Counting Sort is not a comparison based sorting algortihm
  4. Heap Sort is not a comparison based sorting algorithm.
Advertisement

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

Leave a Comment

Your email address will not be published. Required fields are marked *

Scroll to Top