High Performance Computing MCQ

home MCQ Questions & Answer


Question 61 : The computer architecture aimed at reducing the time of execution of instructions is ________.

  1. CISC
  2. RISC
  3. SPARC
  4. ISA
    

Question 62 : parallel computer is capable of

  1. Decentalized computing
  2. Parallel computing
  3. Distributed computing
  4. centralized computing
    

Question 63 : Design of _______processor is complex

  1. parallel
  2. pipeline
  3. serial
  4. distributed
    

Question 64 : The instructions which copy information from one location to another either in the processor’s internal register set or in the external main memory are called

  1. Data transfer instructions
  2. Program control instructions
  3. Input-output instructions
  4. Logical instructions
    

Question 65 : The pattern of___________ among tasks is captured by what is known as a task-interaction graph

  1. interaction
  2. communication
  3. optmization
  4. flow
    

Question 66 : In vector processor a single instruction, can ask for ____________ data operations

  1. multiple
  2. single
  3. two
  4. four
    

Question 67 : The cost of a parallel processing is primarily determined by

  1. switching complexity
  2. circuit complexity
  3. Time Complexity
  4. space complexity
    

Question 68 : Interaction overheads can be minimized by____

  1. Maximize Data Locality
  2. Maximize Volume of data exchange
  3. Increase Bandwidth
  4. Minimize social media contents
    

Question 69 : This is computation not performed by the serial version

  1. Excess Computation
  2. serial computation
  3. Parallel Computing
  4. cluster computation
    

Question 70 : The cost of dynamic networks is often determined by the number of ____________ nodes in the network.

  1. Packet
  2. Ring
  3. Static
  4. Switching
    

Question 71 : The contention for the usage of a hardware device is called ______

  1. data hazard
  2. Stalk
  3. Deadlock
  4. structural hazard
    

Question 72 : Which Algorithm is better choice for pipelining

  1. Small Algorithm
  2. Hash Algorithm
  3. Merge-Sort Algorithm
  4. Quick-Sort Algorithm
    

Question 73 : In MPI programing MPI_Reduce is the instruction for

  1. Full operation
  2. Limited operation
  3. reduction operation
  4. selected operation
    

Question 74 : The stalling of the processor due to the unavailability of the instructions is called as ___________

  1. Input hazard
  2. data hazard
  3. structural hazard
  4. control hazard
    

Question 75 : _____processors rely on compile time analysis to identify and bundle together instructions that can be executed concurrently

  1. VILW
  2. LVIW
  3. VLIW
  4. VLWI
    

Question 76 : type of parallelism that is naturally expressed by independent tasks in a task-dependency graph is called _______ parallelism.

  1. Task
  2. Instruction
  3. Data
  4. Program
    

Question 77 : NSM has launched its first supercomputer at

  1. BHU
  2. IITB
  3. IITKG
  4. IITM
    

Question 78 : Writing parallel programs is referred to as

  1. Parallel computation
  2. parallel development
  3. parallel programing
  4. Parallel processing
    

Question 79 : A processor performing fetch or decoding of different instruction during the execution of another instruction is called ______ .

  1. Super-scaling
  2. Pipe-lining
  3. Parallel computation
  4. serial computation
    

Question 80 : Zero address instruction format is used for

  1. RISC architecture
  2. CISC architecture
  3. Von-Neuman architecture
  4. Stack-organized architecture
    

Question 81 : An interface between the user or an application program, and the system resources are

  1. microprocessor
  2. microcontroller
  3. multi-microprocessor
  4. operating system
    

Question 82 : The main objective in building the multi-microprocessor is

  1. greater throughput
  2. enhanced fault tolerance
  3. greater throughput and enhanced fault tolerance
  4. zero throughput
    

Question 83 : UMA architecture uses _______in design

  1. cache
  2. shared memory
  3. message passing
  4. distributed memory
    

Question 84 : To which class of systems does the von Neumann computer belong

  1. SIMD
  2. MIMD
  3. MISD
  4. SISD
    

Question 85 : characteristic of CISC (Complex Instruction Set Computer)

  1. Variable format instruction
  2. Fixed format instructions
  3. Instruction are executed by hardware
  4. unsign long char
    

Question 86 : A _________ computation performs one multiply-add on a single pair of vector elements

  1. dot product
  2. cross product
  3. multiply
  4. add
    

Question 87 : Data parallelism is parallelism inherent in

  1. program loops
  2. Serial program
  3. parallel program
  4. long programs
    

Question 88 : What is the execution time per stage of a pipeline that has 5 equal stages and a mean overhead of 12 cycles

  1. 2 cycles
  2. 3 cycles
  3. 5 cycles
  4. 4 cycles
    

Question 89 : This algorithm is a called greedy because

  1. the greedy algorithm never considers the same solution again
  2. the greedy algorithm always give same solution again
  3. the greedy algorithm never considers the optimal solution
  4. the greedy algorithm never considers whole program
    

Question 90 : If n is a power of two, we can perform this operation in ____ steps by propagating partial sums up a logical binary tree of processors.

  1. logn
  2. nlogn
  3. n
  4. n^2
    
  • chevron_left
  • 1
  • 2
  • 3
  • 4
  • chevron_right