Question 1

What is the average running time of a quick sort algorithm?

Accepted Answer

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

Question 2

Given an array of n elements and p processes, in the message-passing version of the parallel quicksort, each process stores ---------elements of array

Accepted Answer

A) n*p 
B) n-p 
C) p/n 
D) n/p 
A) n*p 
B) n-p 
C) p/n 
D) n/p

Question 3

In parallel Quick Sort Pivot is sent to processes by

Accepted Answer

A) broadcast 
B) multicast 
C) selective multicast 
D) unicast 
A) broadcast 
B) multicast 
C) selective multicast 
D) unicast

Question 4

A* algorithm is a

Accepted Answer

A) bfs algorithm 
B) dfs algorithm 
C) prim\s algorithm 
D) kruskal\s algorithm 
A) bfs algorithm 
B) dfs algorithm 
C) prim\s algorithm 
D) kruskal\s algorithm

Question 5

A person wants to visit some places. He starts from a vertex and then wants to visit every vertex till it finishes from one vertex, backtracks and then explore other vertex from same vertex. What algorithm he should use?

Accepted Answer

A) bfs 
B) dfs 
C) prim\s 
D) kruskal\s 
A) bfs 
B) dfs 
C) prim\s 
D) kruskal\s

What is the average running time of a quick sort algorithm?

Given an array of n elements and p processes, in the message-passing version of the parallel quicksort, each process stores ---------elements of array

In parallel Quick Sort Pivot is sent to processes by

A* algorithm is a

A person wants to visit some places. He starts from a vertex and then wants to visit every vertex till it finishes from one vertex, backtracks and then explore other vertex from same vertex. What algorithm he should use?

Understanding Cuda Kernel Code and Host GPU Interactions

Nvidia CUDA and GPU Programming

Parallel Execution in CUDA, Sorting Algorithms, and Search Techniques

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

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 11: Algorithms and Parallel Formulations

What is the average running time of a quick sort algorithm?

Given an array of n elements and p processes, in the message-passing version of the parallel quicksort, each process stores ---------elements of array

In parallel Quick Sort Pivot is sent to processes by

A* algorithm is a

A person wants to visit some places. He starts from a vertex and then wants to visit every vertex till it finishes from one vertex, backtracks and then explore other vertex from same vertex. What algorithm he should use?

Understanding Cuda Kernel Code and Host GPU Interactions

Nvidia CUDA and GPU Programming

Parallel Execution in CUDA, Sorting Algorithms, and Search Techniques

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

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