Engineering

High Performance Computing MCQs: 437 Questions & Answers in Engineering

437 High Performance Computing MCQs in Engineering with answers & explanations. Page 12. Practice objective questions for competitive exams, interviews & sel… Use the answer toggle below to show or hide all solutions, tap an option to check one question, or open a question for its own page.

Page 12 of 22

Show answers

Answers hidden — tap an option or use “View Answer” on each question.

221

High Performance Computing MCQs: 437 Questions & Answers in Engineering

SIMD represents an organization that ______________.

Cache memory works on the principle of

Which of the following is a combination of several processors on a single chip?

______ have been developed specifically for pipelined systems.

The important feature of the VLIW is .....

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

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

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

Which of the following is not a Pipeline Conflicts?

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

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

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

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

Which of the following is NOT a BITONIC Sequence

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

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

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

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

What is TRUE about SHELL SORT

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

Study tips for High Performance Computing