Parallel Processing MCQ (Part-1)

Posted by

Parallel Processing MCQ

Parallel Processing MCQ, Objective Questions on Parallel Processing, Multiple Choice Questions on Parallel Processing, GATE Questions on Parallel Processing, Parallel Processing MCQ with answers

Multiple Choice Questions

Q. 1. It is possible to achieve parallelism

  • With and within the CPU
  • With many CPUs only
  • Without CPUs
  • All of the above

Answer: With and within the CPU

Q. 2. A CPU is also called as a

  • PE
  • Parallel computer
  • ALU
  • None of the above

Answer: PE

Q. 3. 100 MFLOPs corresponds to:

  • i/ 100 million floating-point operations/second
  • 1/1010 million floating-point operations/second
  • 100 million floating-point operations/second
  • None of the above

Answer: 100 million floating-point operations/second

Q. 4. Second Generation computers belong to:

  • 1945-54
  • 1955-64
  • 1965-74
  • None of the above

Answer: 1955-64

Q. 5. Third generation computers uses:

  • Multiprogramming and time-sharing
  • Multiprogramming
  • Multithreading
  • All of the above

Answer: Multiprogramming and time-sharing

Q. 6. With each new generation, the circuiting size becomes:

  • Bigger
  • Smaller
  • Smaller and advanced
  • None of the above

Answer: Smaller and advanced

Q. 7. Which of the following computers belong to 5th generation:

  • Cray-XMP
  • Intel Paragon
  • VPP 500
  • Both Intel Paragon and VPP 500

Answer: Both Intel Paragon and VPP 500

Q. 8. ENIAC stands for:

  • Electronic Numerical Integrator and Calculator
  • Electronic Number Integration and Calculation
  • Enhanced Number Integrator and Calculator
  • None of the above

Answer: Electronic Numerical Integrator and Calculator

Q.9. RTL stands for:

  • Register Transfer Language
  • Remote Transfer Language
  • RISC Transfer Language
  • None of the above

Answer: Register Transfer Language

Q.10. Tera flops means:

  • 1014
  • 1010 
  • 1012
  • None of these

Answer: 1012

Q.11. Parallelism is equal to

  • Hardware parallelism + Software parallelism
  • Hardware parallelism only
  • Software parallelism only
  • None of the above

Answer: Hardware parallelism + Software parallelism

Q. 12. The first mechanical adder/substractor was built in Franceby:

  • Charles Babbage
  • Blaise Pascal
  • Luse
  • Howard Aiken

Answer: Blaise Pascal

Q.13. CDC-6600 has how many functional units:

  • 5
  • 10
  • 15
  • 20

Answer: 10

Q.14. Instruction execution involves five phases which are:

  • Fetch, decode, operand, fetch, Execution, results.
  • Operand fetch, fetch, decode, Execution, results.
  • Fetch, execute, decode, operand fetch, results.
  • None of the above

Answer: Fetch, decode, operand, fetch, Execution, results.

Q.15. CPU means:

  • ALU – CU
  • ALU + CPU
  • ALU+CU
  • None of the above

Answer: ALU+CU

Q. 16. A COMA model comprises of:

  • Multiprocessor + Cache memory
  • Multiprocessor + Main memory
  • Microprocessor + Cache memory
  • None of the above

Answer: Multiprocessor + Cache memory

Q. 17. NORMA means:

  • Message passing multicomputer
  • Mainframes
  • Vector supercomputer
  • None of the above

Answer: Message passing multicomputer

Q. 18. Array Processors are put under which of these categories:

  • SISD
  • SIMD
  • MISD
  • MIND

Answer: SIMD

Q. 19. According to Fengs, average parallelism degree, P is given by the formula:

  • P_{a}=\frac{P}{T}
  • P_{a}=\sum_{i=1}^{T}\frac{P_{i}}{T}
  • P_{a}=\frac{P}{T_{i}}(i\leftarrow 1 to T)
  • None of the above

Answer: P_{a}=\sum_{i=1}^{T}\frac{P_{i}}{T}

Q. 20. LAN like Ethernet is a:

  • Loosely coupled
  • Pipelining
  • Not coupled
  • None of the above

Answer: Loosely coupled

Q. 21. The process of allowing instructions to execute out of order when resources are sufficient is called as

  • Scaffolding
  • Pipelining
  • Score boarding
  • None of the above

Answer: Score boarding

Q. 22. The speed-up, S(n), is given by:

  • S(n)=T(1)\ast T(n)
  • S(n)=T(n)/ T(1)
  • S(n)=T(1)/ T(n)
  • None of the above

Answer: S(n)=T(1)/ T(n)

Q. 23. The number of machine instructions to be executed in the program is called as the:

  • Cycle
  • Time Period
  • Instruction Count
  •  None of the above

Answer: Instruction Count

Q.24. The equation for Amadahl’s law is:

  • S(n)_{n\rightarrow \infty }=\frac{1}{f}
  • S(n)_{n\rightarrow \infty }=f
  • S(n)_{n\rightarrow \infty }=\frac{1}{T}
  • None of the above

Answer: S(n)_{n\rightarrow \infty }=\frac{1}{f}

Q.25. In temporal parallelism, temporal refers to

  • Time
  • Space
  • PEs Count
  • None of these

Answer: Time

Q. 26. Performance (P) and execution time (T) of CPU are related by:

  • P\propto T
  • P\propto \frac{1}{T}
  • P=T
  • P+T

Answer: P\propto \frac{1}{T}

Q. 27. David Kuck of University of Illinios adopted:

  • Implicit Parallelism
  • explicit Parallelism
  • Both
  • None of the above

Answer: Implicit Parallelism

Q. 28. Conditions of parallelism were given by:

  • Charles Babbage
  • Bernstein
  • Albrecht
  • None of the above

Answer: Bernstein

Q. 29. According to Bernstein, two process, Pi and Pj can execute in parallel if and only if:

  • P_{i}\parallel P_{j}
  • P_{i}/ P_{j}=1
  • P_{i}\ast P_{j}=1
  • None of the above

Answer: P_{i}\parallel P_{j}

Q. 30. For two statements, S1 and S2, if an execution path exists from S1 to S2 then they are said to be:

  • Antidependent
  • Flow dependence
  • Output dependence
  • None of the above

Answer: Flow dependence

Parallel Processing MCQ (Part-2)

Leave a Reply

Your email address will not be published. Required fields are marked *