High Performance Computing Set 10

Computer Science Engineering (CSE)

Practice Mode Previous Next
On This Page

This set of High Performance Computing HPC Multiple Choice Questions & Answers (MCQs) focuses on High Performance Computing Set 10

Q1 | ______ have been developed specifically for pipelined systems.
  • utility software
  • speed up utilities
  • optimizing compilers
  • none of the above
Q2 | Which of the following is a combination of several processors on a single chip?
  • multicore architecture
  • risc architecture
  • cisc architecture
  • subword parallelism
Answer: multicore architecture
Q3 | The important feature of the VLIW is .....
  • ilp
  • cost effectiveness
  • performance
  • none of the mentioned
Answer: ilp
Q4 | The parallel execution of operations in VLIW is done according to the schedule determined by .....
  • sk scheduler
  • interpreter
  • compiler
  • encoder
Answer: compiler
Q5 | The VLIW processors are much simpler as they do not require of .....
  • computational register
  • complex logic circuits
  • ssd slots
  • scheduling hardware
Answer: scheduling hardware
Q6 | The VLIW architecture follows ..... approach to achieve parallelism.
  • misd
  • sisd
  • simd
  • mimd
Answer: mimd
Q7 | Which of the following is not a Pipeline Conflicts?
  • timing variations
  • branching
  • load balancing
  • data dependency
Answer: load balancing
Q8 | Which of the following statements is NOT TRUE for Internal Sorting algorithms
  • usually deal with small number of elements
  • no of elements must be able to fit in process\s main memory
  • use auxilliary memory like tape or hard disk
  • ususally are of type compare-exchange
Answer: use auxilliary memory like tape or hard disk
Q9 | In sorting networks for INCREASING COMPARATOR with input x,y select the correct output X', Y' from the following options
  • x\ = min { x , y } and y\ = min { x , y }
  • x\ = max { x , y } and y\ = min { x , y }
  • x\ = min { x , y } and y\ = max{ x , y }
  • x\ = max { x , y } and y\ = max { x , y }
Answer: x\ = min { x , y } and y\ = max{ x , y }
Q10 | In sorting networks for DECREASING COMPARATOR with input x,y select the correct output X', Y' from the following options
  • x\ = min { x , y } and y\ = min { x , y }
  • x\ = max { x , y } and y\ = min { x , y }
  • x\ = min { x , y } and y\ = max{ x , y }
  • x\ = max { x , y } and y\ = max { x , y }
Answer: x\ = max { x , y } and y\ = min { x , y }
Q11 | Which of the following is TRUE for Bitonic Sequence a) Monotonically increasing b) Monotonically Decreasing c) With cyclic shift of indices d) First increasing then decreasing
  • a) and b)
  • a) and b) and d)
  • a) and b) and c)
  • a) and b) and c) and d)
Answer: a) and b) and c) and d)
Q12 | Which of the following is NOT a BITONIC Sequence
  • {8, 6, 4, 2, 3, 5, 7, 9}
  • {0, 4, 8, 9, 2, 1}
  • {3, 5, 7, 9, 8, 6, 4, 2}
  • {1, 2, 4, 7, 6, 0, 1}
Answer: {1, 2, 4, 7, 6, 0, 1}
Q13 | The procedure of sorting a bitonic sequence using bitonic splits is called
  • bitonic merge
  • bitonic split
  • bitonic divide
  • bitonic series
Answer: bitonic merge
Q14 | While mapping Bitonic sort on Hypercube, Compare-exchange operations take place between wires whose labels differ in
  • one bit
  • two bits
  • three bits
  • four bits
Answer: one bit
Q15 | Which of following is NOT A WAY of mapping the input wires of the bitonicsorting network to a MESH of processes
  • row major mapping
  • column major mapping
  • row major snakelike mapping
  • row major shuffled mapping
Answer: column major mapping
Q16 | Which is the sorting algorithm in below given steps - 1. procedure X_SORT(n)2. begin3. for i := n - 1 downto 1 do4. for j := 1 to i do5. compare-exchange(aj, aj + 1);6. end X_SORT
  • selection sort
  • bubble sort
  • parallel selcetion sort
  • parallel bubble sort
Answer: bubble sort
Q17 | The odd-even transposition algorithm sorts n elements in n phases (n is even), each of which requires ------------compare-exchange operations
  • 2n
  • n2
  • n/2
  • n
Answer: n/2
Q18 | What is TRUE about SHELL SORT
  • moves elements only one position at a time
  • moves elements long distance
  • during second phase algorithm switches to odd even transposition sort
  • both 2 and 3
Answer: both 2 and 3
Q19 | Which is the fastest sorting algorithm
  • bubble sort
  • odd-even transposition sort
  • shell sort
  • quick sort
Answer: quick sort
Q20 | Quicksort's performance is greatly affected by the way it partitions a sequence.
  • true
  • false
Answer: true
Q21 | Pivot in Quick sort can be selected as
  • always first element
  • always last element
  • always middle index element
  • randomly selected element
Answer: randomly selected element
Q22 | Quick sort uses Recursive Decomposition
  • true
  • false
Answer: true
Q23 | In first step of parallelizing quick sort for n elements to get subarrays, which of the following statement is TRUE
  • only one process is used
  • n processes are used
  • two processes are used
  • none of the above
Answer: only one process is used
Q24 | In Binary tree representation created by execution of Quick sort, Pivot is at
  • leaf node
  • root of tree
  • any internal node
  • none of the above
Answer: root of tree
Q25 | What is the worst case time complexity of a quick sort algorithm?
  • o(n)
  • o(n log n)
  • o(n2)
  • o(log n)
Answer: o(n2)
Previous Next