πŸ“Š High Performance Computing
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
πŸ’¬ Discuss
βœ… Correct Answer: (A) hazard
πŸ“Š High Performance Computing
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
πŸ’¬ Discuss
βœ… Correct Answer: (C) branch penalty
πŸ“Š High Performance Computing
Q. _____ method is used in centralized systems to perform out of order execution.
  • (A) scorecard
  • (B) score boarding
  • (C) optimizing
  • (D) redundancy
πŸ’¬ Discuss
βœ… Correct Answer: (B) score boarding
πŸ“Š High Performance Computing
Q. The computer cluster architecture emerged as an alternative for ____.
  • (A) isa
  • (B) workstation
  • (C) super computers
  • (D) distributed systems
πŸ’¬ Discuss
βœ… Correct Answer: (C) super computers
πŸ“Š High Performance Computing
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
πŸ’¬ Discuss
βœ… Correct Answer: (D) first parameter value inside triple angle bracket (n) indicates excecution of kernel n times in parallel
πŸ“Š High Performance Computing
Q. In ___________, the number of elements to be sorted is small enough to fit into the process's main memory.
  • (A) internal sorting
  • (B) internal searching
  • (C) external sorting
  • (D) external searching
πŸ’¬ Discuss
βœ… Correct Answer: (A) internal sorting
πŸ“Š High Performance Computing
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
πŸ’¬ Discuss
βœ… Correct Answer: (C) external sorting
πŸ“Š High Performance Computing
Q. The fundamental operation of comparison-based sorting is ________.
  • (A) compare-exchange
  • (B) searching
  • (C) sorting
  • (D) swapping
πŸ’¬ Discuss
βœ… Correct Answer: (A) compare-exchange

Jump to