Question 1

Which Parallel formulation of Quick sort is possible

Accepted Answer

A)  shared-address-space parallel formulation
B)  message passing formulation
C)  hypercube formulation
D)  all of the above D

Question 2

In parallel quick sort Pivot selecton strategy is crucial for

Accepted Answer

A)  maintaing load balance
B)  maintaining uniform distribution of elements in process groups
C)  effective pivot selection in next level
D)  all of the above D

Question 3

Time Complexity of DFS is? (V - number of vertices, E - number of edges)

Accepted Answer

A)  o(v + e) 
B)  o(v) 
C)  o(e) 
D)  o(v*e)  A

Question 4

In parallel Quick Sort each process divides the unsorted list into

Accepted Answer

A)  n lists
B)  2 lists
C)  4 lists
D)  n-1 lists

Question 5

Which formulation of Dijkstra's algorithm exploits more parallelism

Accepted Answer

A)  source-partitioned formulation
B)  source-parallel formulation
C)  partitioned-parallel formulation
D)  all of above

Question 6

Best-first search (BFS) algorithms can search both graphs and trees.

Accepted Answer

A) True 
 B)False

Question 7

to solve the all-pairs shortest paths problem which algorithm's is/are used
A. Floyd's algorithm
B. Dijkstra's single-source shortest paths
C. Prim's Algorithm
D. Kruskal's Algorithm

Accepted Answer

A)  a and c
B)  a and b
C)  b and c
D)  c and d

Question 8

Shell sort is an improvement on

Accepted Answer

A)  quick sort
B)  bubble sort
C)  insertion sort
D)  selection sort

Question 9

In execution of the hypercube formulation of quicksort for d = 3, split along -----------dimention to partition sequence into two big blocks, one greater than pivot and other smaller than pivot as shown in diagram

Accepted Answer

A)  first
B)  scond
C)  third
D)  none of above

Question 10

A CUDA program is comprised of two primary components: a host and a _____.

Accepted Answer

A)  gpu kernel
B)  cpu kernel
C)  os
D)  none of above

Question 11

A complete graph is a graph in which each pair of vertices is adjacent

Accepted Answer

A) True 
 B)False

Question 12

Simple backtracking is a depth-first search method that terminates upon finding the first solution.

Accepted Answer

A) True 
 B)False

Question 13

What is the average case time complexity of odd-even transposition sort?

Accepted Answer

A)  o(n log n) 
B)  o(n) 
C)  o(log n) 
D)  o(n2)

Question 14

important component of best-first search (BFS) algorithms is

Accepted Answer

A)  open list
B)  closed list
C)  node list
D)  mode list

Question 15

The kernel code is dentified by the ________qualifier with void return type

Accepted Answer

A)  _host_
B)  __global__ 
C)  _device_
D)  void

Question 16

The space required to store the adjacency matrix of a graph with n vertices is

Accepted Answer

A)  in order of n
B)  in order of n log n
C)  in order of n squared
D)  in order of n/2

Question 17

In Dijkstra's all pair shortest path each process compute the single-source shortest paths for all vertices assigned to it in SOURCE PARTITIONED FORMULATION

Accepted Answer

A) True 
 B)False

Question 18

identify Load-Balancing Scheme/s

Accepted Answer

A)  asynchronous round robin
B)  global round robin
C)  random polling
D)  all above methods

Question 19

Odd-even transposition sort is a variation of

Accepted Answer

A)  quick sort
B)  shell sort
C)  bubble sort
D)  selection sort

Question 20

Graph can be represented by

Accepted Answer

A)  identity matrix
B)  adjacency matrix
C)  sprse list
D)  sparse matrix

Exam 11: Algorithms and Parallel Formulations

Which Parallel formulation of Quick sort is possible

In parallel quick sort Pivot selecton strategy is crucial for

Time Complexity of DFS is? (V - number of vertices, E - number of edges)

In parallel Quick Sort each process divides the unsorted list into

Which formulation of Dijkstra's algorithm exploits more parallelism

Best-first search (BFS) algorithms can search both graphs and trees.

to solve the all-pairs shortest paths problem which algorithm's is/are used A. Floyd's algorithm B. Dijkstra's single-source shortest paths C. Prim's Algorithm D. Kruskal's Algorithm

Shell sort is an improvement on

In execution of the hypercube formulation of quicksort for d = 3, split along -----------dimention to partition sequence into two big blocks, one greater than pivot and other smaller than pivot as shown in diagram

A CUDA program is comprised of two primary components: a host and a _____.

A complete graph is a graph in which each pair of vertices is adjacent

Simple backtracking is a depth-first search method that terminates upon finding the first solution.

What is the average case time complexity of odd-even transposition sort?

important component of best-first search (BFS) algorithms is

The kernel code is dentified by the ________qualifier with void return type

The space required to store the adjacency matrix of a graph with n vertices is

In Dijkstra's all pair shortest path each process compute the single-source shortest paths for all vertices assigned to it in SOURCE PARTITIONED FORMULATION

identify Load-Balancing Scheme/s

Odd-even transposition sort is a variation of

Graph can be represented by