Question 1

In Binary tree representation created by execution of Quick sort, Pivot is at

Accepted Answer

A) leaf node 
B) root of tree 
C) any internal node 
D) none of the above 
A) leaf node 
B) root of tree 
C) any internal node 
D) none of the above B

Question 2

Which of the following is not a Pipeline Conflicts?

Accepted Answer

A) timing variations 
B) branching 
C) load balancing 
D) data dependency 
A) timing variations 
B) branching 
C) load balancing 
D) data dependency C

Question 3

Which of following is NOT A WAY of mapping the input wires of the bitonic sorting network to a MESH of processes

Accepted Answer

A) row major mapping 
B) column major mapping 
C) row major snakelike mapping 
D) row major shuffled mapping 
A) row major mapping 
B) column major mapping 
C) row major snakelike mapping 
D) row major shuffled mapping B

Question 4

Which of the following statements is NOT TRUE for Internal Sorting algorithms

Accepted Answer

A) usually deal with small number of elements 
B) no of elements must be able to fit in process\s main memory 
C) use auxilliary memory like tape or hard disk 
D) ususally are of type compare-exchange 
A) usually deal with small number of elements 
B) no of elements must be able to fit in process\s main memory 
C) use auxilliary memory like tape or hard disk 
D) ususally are of type compare-exchange

Question 5

The procedure of sorting a bitonic sequence using bitonic splits is called

Accepted Answer

A) bitonic merge 
B) bitonic split 
C) bitonic divide 
D) bitonic series 
A) bitonic merge 
B) bitonic split 
C) bitonic divide 
D) bitonic series

Question 6

In first step of parallelizing quick sort for n elements to get subarrays, which of the following statement is TRUE

Accepted Answer

A) only one process is used 
B) n processes are used 
C) two processes are used 
D) none of the above 
A) only one process is used 
B) n processes are used 
C) two processes are used 
D) none of the above

Question 7

Pivot in Quick sort can be selected as

Accepted Answer

A) always first element 
B) always last element 
C) always middle index element 
D) randomly selected element 
A) always first element 
B) always last element 
C) always middle index element 
D) randomly selected element

Question 8

The odd-even transposition algorithm sorts n elements in n phases (n is even), each of which requires ------------compare-exchange operations

Accepted Answer

A) 2n 
B) n2 
C) n/2 
D) n 
A) 2n 
B) n2 
C) n/2 
D) n

Question 9

The VLIW processors are much simpler as they do not require of .....

Accepted Answer

A) computational register 
B) complex logic circuits 
C) ssd slots 
D) scheduling hardware 
A) computational register 
B) complex logic circuits 
C) ssd slots 
D) scheduling hardware

Question 10

While mapping Bitonic sort on Hypercube, Compare-exchange operations take place between wires whose labels differ in

Accepted Answer

A) one bit 
B) two bits 
C) three bits 
D) four bits 
A) one bit 
B) two bits 
C) three bits 
D) four bits

Question 11

The VLIW architecture follows ..... approach to achieve parallelism.

Accepted Answer

A) misd 
B) sisd 
C) simd 
D) mimd 
A) misd 
B) sisd 
C) simd 
D) mimd

Question 12

Quicksort's performance is greatly affected by the way it partitions a sequence.

Accepted Answer

A) True 
 B)False

Question 13

Which of the following is NOT a BITONIC Sequence

Accepted Answer

A) {8, 6, 4, 2, 3, 5, 7, 9} 
B) {0, 4, 8, 9, 2, 1} 
C) {3, 5, 7, 9, 8, 6, 4, 2} 
D) {1, 2, 4, 7, 6, 0, 1} 
A) {8, 6, 4, 2, 3, 5, 7, 9} 
B) {0, 4, 8, 9, 2, 1} 
C) {3, 5, 7, 9, 8, 6, 4, 2} 
D) {1, 2, 4, 7, 6, 0, 1}

Question 14

What is the worst case time complexity 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 15

______ have been developed specifically for pipelined systems.

Accepted Answer

A) utility software 
B) speed up utilities 
C) optimizing compilers 
D) none of the above 
A) utility software 
B) speed up utilities 
C) optimizing compilers 
D) none of the above

Question 16

Which is the sorting algorithm in below given steps -
1) procedure X_SORT(n)
2) begin
3) for i := n - 1 downto 1 do
4) for j := 1 to i do
5) compare-exchange(aj, aj + 1);
6) end X_SORT

Accepted Answer

A) selection sort 
B) bubble sort 
C) parallel selcetion sort 
D) parallel bubble sort 
A) selection sort 
B) bubble sort 
C) parallel selcetion sort 
D) parallel bubble sort

Question 17

The parallel execution of operations in VLIW is done according to the schedule determined by .....

Accepted Answer

A) sk scheduler 
B) interpreter 
C) compiler 
D) encoder 
A) sk scheduler 
B) interpreter 
C) compiler 
D) encoder

Question 18

In sorting networks for DECREASING COMPARATOR with input x,y select the correct output X', Y' from the following options

Accepted Answer

A) x\ = min { x , y } and y\ = min { x , y } 
B) x\ = max { x , y } and y\ = min { x , y } 
C) x\ = min { x , y } and y\ = max{ x , y } 
D) x\ = max { x , y } and y\ = max { x , y } 
A) x\ = min { x , y } and y\ = min { x , y } 
B) x\ = max { x , y } and y\ = min { x , y } 
C) x\ = min { x , y } and y\ = max{ x , y } 
D) x\ = max { x , y } and y\ = max { x , y }

Question 19

In sorting networks for INCREASING COMPARATOR with input x,y select the correct output X', Y' from the following options

Accepted Answer

A) x\ = min { x , y } and y\ = min { x , y } 
B) x\ = max { x , y } and y\ = min { x , y } 
C) x\ = min { x , y } and y\ = max{ x , y } 
D) x\ = max { x , y } and y\ = max { x , y } 
A) x\ = min { x , y } and y\ = min { x , y } 
B) x\ = max { x , y } and y\ = min { x , y } 
C) x\ = min { x , y } and y\ = max{ x , y } 
D) x\ = max { x , y } and y\ = max { x , y }

Question 20

Which is the fastest sorting algorithm

Accepted Answer

A) bubble sort 
B) odd-even transposition sort 
C) shell sort 
D) quick sort 
A) bubble sort 
B) odd-even transposition sort 
C) shell sort 
D) quick sort

In Binary tree representation created by execution of Quick sort, Pivot is at

Which of the following is not a Pipeline Conflicts?

Which of following is NOT A WAY of mapping the input wires of the bitonic sorting network to a MESH of processes

Which of the following statements is NOT TRUE for Internal Sorting algorithms

The procedure of sorting a bitonic sequence using bitonic splits is called

In first step of parallelizing quick sort for n elements to get subarrays, which of the following statement is TRUE

Pivot in Quick sort can be selected as

The odd-even transposition algorithm sorts n elements in n phases (n is even), each of which requires ------------compare-exchange operations

The VLIW processors are much simpler as they do not require of .....

While mapping Bitonic sort on Hypercube, Compare-exchange operations take place between wires whose labels differ in

The VLIW architecture follows ..... approach to achieve parallelism.

Quicksort's performance is greatly affected by the way it partitions a sequence.

Which of the following is NOT a BITONIC Sequence

What is the worst case time complexity of a quick sort algorithm?

______ have been developed specifically for pipelined systems.

Which is the sorting algorithm in below given steps - 1) procedure X_SORT(n) 2) begin 3) for i := n - 1 downto 1 do 4) for j := 1 to i do 5) compare-exchange(aj, aj + 1); 6) end X_SORT

The parallel execution of operations in VLIW is done according to the schedule determined by .....

In sorting networks for DECREASING COMPARATOR with input x,y select the correct output X', Y' from the following options

In sorting networks for INCREASING COMPARATOR with input x,y select the correct output X', Y' from the following options

Which is the fastest sorting algorithm

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

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 10: Sorting Algorithms and Pipelined Systems

In Binary tree representation created by execution of Quick sort, Pivot is at

Which of the following is not a Pipeline Conflicts?

Which of following is NOT A WAY of mapping the input wires of the bitonic sorting network to a MESH of processes

Which of the following statements is NOT TRUE for Internal Sorting algorithms

The procedure of sorting a bitonic sequence using bitonic splits is called

In first step of parallelizing quick sort for n elements to get subarrays, which of the following statement is TRUE

Pivot in Quick sort can be selected as

The odd-even transposition algorithm sorts n elements in n phases (n is even), each of which requires ------------compare-exchange operations

The VLIW processors are much simpler as they do not require of .....

While mapping Bitonic sort on Hypercube, Compare-exchange operations take place between wires whose labels differ in

The VLIW architecture follows ..... approach to achieve parallelism.

Quicksort's performance is greatly affected by the way it partitions a sequence.

Which of the following is NOT a BITONIC Sequence

What is the worst case time complexity of a quick sort algorithm?

______ have been developed specifically for pipelined systems.

Which is the sorting algorithm in below given steps - 1) procedure X_SORT(n) 2) begin 3) for i := n - 1 downto 1 do 4) for j := 1 to i do 5) compare-exchange(aj, aj + 1); 6) end X_SORT

The parallel execution of operations in VLIW is done according to the schedule determined by .....

In sorting networks for DECREASING COMPARATOR with input x,y select the correct output X', Y' from the following options

In sorting networks for INCREASING COMPARATOR with input x,y select the correct output X', Y' from the following options

Which is the fastest sorting algorithm

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

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