Exam 3: Parallel Execution in CUDA, Sorting Algorithms, and Search Techniques

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

What makes a CUDA code runs in parallel

The performance of quicksort depends critically on the quality of the ______-.

the complexity of quicksort is O(nlog n).

The fundamental operation of comparison-based sorting is ________.

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

_____ algorithms use a heuristic to guide search.

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

Cost of a parallel system is sometimes referred to____ of product

______________ 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.

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

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

______ can be comparison-based or noncomparison-based.

mathematically efficiency is

In BFS, how many times a node is visited?

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

In ___________, the number of elements to be sorted is small enough to fit into the process's main memory.

Is Best First Search a searching algorithm used in graphs.

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

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