High Performance Computing MCQs with answers Page - 3

Here, you will find a collection of MCQ questions on High Performance Computing. Go through these questions to enhance your preparation for upcoming examinations and interviews.

To check the correct answer, simply click the View Answer button provided for each question.

Have your own questions to contribute? Click the button below to share your MCQs with others!

+ Add Question

A

Admin • 831.35K Points
Coach

Q. Any condition that causes a processor to stall is called as _____.

  • (A) hazard
  • (B) page fault
  • (C) system error
  • (D) none of the above

A

Admin • 831.35K Points
Coach

Q. The time lost due to branch instruction is often referred to as _____.

  • (A) latency
  • (B) delay
  • (C) branch penalty
  • (D) none of the above

A

Admin • 831.35K Points
Coach

Q. _____ method is used in centralized systems to perform out of order execution.

  • (A) scorecard
  • (B) score boarding
  • (C) optimizing
  • (D) redundancy

A

Admin • 831.35K Points
Coach

Q. The computer cluster architecture emerged as an alternative for ____.

  • (A) isa
  • (B) workstation
  • (C) super computers
  • (D) distributed systems

A

Admin • 831.35K Points
Coach

Q. What makes a CUDA code runs in parallel

  • (A) __global__ indicates parallel execution of code
  • (B) main() function indicates parallel execution of code
  • (C) kernel name outside triple angle bracket indicates excecution of kernel n times in parallel
  • (D) first parameter value inside triple angle bracket (n) indicates excecution of kernel n times in parallel

A

Admin • 831.35K Points
Coach

Q. ______________ algorithms use auxiliary storage (such as tapes and hard disks) for sorting because the number of elements to be sorted is too large to fit into memory.

  • (A) internal sorting
  • (B) internal searching
  • (C) external sorting
  • (D) external searching

A

Admin • 831.35K Points
Coach

Q. ______ can be comparison-based or noncomparison-based.

  • (A) searching
  • (B) sorting
  • (C) both a and b
  • (D) none of above

A

Admin • 831.35K Points
Coach

Q. The fundamental operation of comparison-based sorting is ________.

  • (A) compare-exchange
  • (B) searching
  • (C) sorting
  • (D) swapping

A

Admin • 831.35K Points
Coach

Q. The complexity of bubble sort is Θ(n2).

  • (A) true
  • (B) false
  • (C) ---
  • (D) ---

A

Admin • 831.35K Points
Coach

Q. Bubble sort is difficult to parallelize since the algorithm has no concurrency.

  • (A) true
  • (B) false
  • (C) ---
  • (D) ---

Add MCQ in this Category

If you want to share an MCQ question in this category, it's a great idea! It will be helpful for many other students using this website.

Share Your MCQ

Browse Categories

Click on category to learn MCQs of that category.