Question 1

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

Accepted Answer

A) the minimum possible time complexity of a comparison based sorting algorithm is o(nlogn) for a random input array 
B) any comparison based sorting algorithm can be made stable by using position as a criteria when two elements are compared 
C) counting sort is not a comparison based sorting algortihm 
D) heap sort is not a comparison based sorting algorithm. 
A) the minimum possible time complexity of a comparison based sorting algorithm is o(nlogn) for a random input array 
B) any comparison based sorting algorithm can be made stable by using position as a criteria when two elements are compared 
C) counting sort is not a comparison based sorting algortihm 
D) heap sort is not a comparison based sorting algorithm.

Question 2

Time Complexity of Breadth First Search 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) o(v + e) 
B) o(v) 
C) o(e) 
D) o(v*e)

Question 3

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

Accepted Answer

A) True 
 B)False

Question 4

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

Accepted Answer

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

Question 5

The complexity of bubble sort is ?(n2).

Accepted Answer

A) True 
 B)False

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

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

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

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

The complexity of bubble sort is ?(n2).

Understanding Cuda Kernel Code and Host GPU Interactions

Nvidia CUDA and GPU Programming

Characteristics and Operations in Parallel Programming

Communication Patterns and Algorithms in Distributed Systems

Communication Operations and Algorithms in Parallel Computing

Parallel Computing and Graph Algorithms

Parallel Processing and GPU Architecture

Computer Architecture and Multiprocessor Systems

Sorting Algorithms and Pipelined Systems

Algorithms and Parallel Formulations

Cuda Model, Parallelism, Memory System, and Communication Models

Parallel Communication and Runtime Analysis

Parallel Computing and GPU Architecture

Exploring Multiprocessor Systems and Parallel Algorithms

Parallel Processing and Algorithms

Distributed Systems and Computing

Filters

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

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

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

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

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

The complexity of bubble sort is ?(n2).

Understanding Cuda Kernel Code and Host GPU Interactions

Nvidia CUDA and GPU Programming

Characteristics and Operations in Parallel Programming

Communication Patterns and Algorithms in Distributed Systems

Communication Operations and Algorithms in Parallel Computing

Parallel Computing and Graph Algorithms

Parallel Processing and GPU Architecture

Computer Architecture and Multiprocessor Systems

Sorting Algorithms and Pipelined Systems

Algorithms and Parallel Formulations

Cuda Model, Parallelism, Memory System, and Communication Models

Parallel Communication and Runtime Analysis

Parallel Computing and GPU Architecture

Exploring Multiprocessor Systems and Parallel Algorithms

Parallel Processing and Algorithms

Distributed Systems and Computing

Filters