Practice Parallel computing - computer mcq Online Quiz (set-1) For All Competitive Exams

Q-1)   In designing a parallel program, one has to break the problem into discreet chunks of work that can be distributed to multiple tasks. This is known as

(a) Decomposition

(b) Partitioning

(c) Compounding

(d) Both A and B

Q-2)   It is the simultaneous use of multiple compute resources to solve a computational problem

(a) Parallel computing

(b) Single processing

(c) Sequential computing

(d) None of these

Q-3)   These applications typically have multiple executable object files (programs). While the application is being run in parallel, each task can be executing the same or different program as other tasks. All tasks may use different data

(a) Single Program Multiple Data (SPMD)

(b) Multiple Program Multiple Data (MPMD)

(c) Von Neumann Architecture

(d) None of these

Q-4)   It distinguishes multi-processor computer architectures according to how they can be classified along the two independent dimensions of Instruction and Dat(A) Each of these dimensions can have only one of two possible states: Single or Multiple.

(a) Single Program Multiple Data (SPMD)

(b) Flynn’s taxonomy

(c) Von Neumann Architecture

(d) None of these

Q-5)   Here a single program is executed by all tasks simultaneously. At any moment in time, tasks can be executing the same or different instructions within the same program. These programs usually have the necessary logic programmed into them to allow different tasks to branch or conditionally execute only those parts of the program they are designed to execute.

(a) Single Program Multiple Data (SPMD)

(b) Multiple Program Multiple Data (MPMD)

(c) Von Neumann Architecture

(d) None of these

Q-6)   These computer uses the stored-program concept. Memory is used to store both program and data instructions and central processing unit (CPU) gets instructions and/ or data from memory. CPU, decodes the instructions and then sequentially performs them.

(a) Single Program Multiple Data (SPMD)

(b) Flynn’s taxonomy

(c) Von Neumann Architecture

(d) None of these

Q-7)   Parallel computing can include

(a) Single computer with multiple processors

(b) Arbitrary number of computers connected by a network

(c) Combination of both A and B

(d) None of these

Q-8)   Serial Execution

(a) A sequential execution of a program, one statement at a time

(b) Execution of a program by more than one task, with each task being able to execute the same or different statement at the same moment in time

(c) A program or set of instructions that is executed by a processor.

(d) None of these

Q-9)   Parallel Execution

(a) A sequential execution of a program, one statement at a time

(b) Execution of a program by more than one task, with each task being able to execute the same or different statement at the same moment in time

(c) A program or set of instructions that is executed by a processor.

(d) None of these

Q-10)   Load balancing is

(a) Involves only those tasks executing a communication operation

(b) It exists between program statements when the order of statement execution affects the results of the program.

(c) It refers to the practice of distributing work among tasks so that all tasks are kept busy all of the time. It can be considered as minimization of task idle time.

(d) None of these

Q-11)   Data dependence is

(a) Involves only those tasks executing a communication operation

(b) It exists between program statements when the order of statement execution affects the results of the program.

(c) It refers to the practice of distributing work among tasks so that all tasks are kept busy all of the time. It can be considered as minimization of task idle time.

(d) None of these

Q-12)   Synchronous communication operations referred to

(a) Involves only those tasks executing a communication operation

(b) It exists between program statements when the order of statement execution affects the results of the program.

(c) It refers to the practice of distributing work among tasks so that all tasks are kept busy all of the time. It can be considered as minimization of task idle time.

(d) None of these

Q-13)   In shared Memory:

(a) Here all processors access, all memory as global address space

(b) Here all processors have individual memory

(c) Here some processors access, all memory as global address space and some not

(d) None of these

Q-14)   In the threads model of parallel programming

(a) A single process can have multiple, concurrent execution paths

(b) A single process can have single, concurrent execution paths.

(c) A multiple process can have single concurrent execution paths.

(d) None of these

Q-15)   Cache Coherent UMA (CC-UMA) is

(a) Here all processors have equal access and access times to memory

(b) Here if one processor updates a location in shared memory, all the other processors know about the update.

(c) Here one SMP can directly access memory of another SMP and not all processors have equal access time to all memories

(d) None of these

Q-16)   Uniform Memory Access (UMA) referred to

(a) Here all processors have equal access and access times to memory

(b) Here if one processor updates a location in shared memory, all the other processors know about the update.

(c) Here one SMP can directly access memory of another SMP and not all processors have equal access time to all memories

(d) None of these

Q-17)   Non-Uniform Memory Access (NUMA) is

(a) Here all processors have equal access and access times to memory

(b) Here if one processor updates a location in shared memory, all the other processors know about the update.

(c) Here one SMP can directly access memory of another SMP and not all processors have equal access time to all memories

(d) None of these

Q-18)   In shared Memory

(a) Multiple processors can operate independently but share the same memory resources

(b) Multiple processors can operate independently but do not share the same memory resources

(c) Multiple processors can operate independently but some do not share the same memory resources

(d) None of these

Q-19)   Distributed Memory

(a) A computer architecture where all processors have direct access to common physical memory

(b) It refers to network based memory access for physical memory that is not common

(c) Parallel tasks typically need to exchange dat(A) There are several ways this can be accomplished, such as through, a shared memory bus or over a network, however the actual event of data exchange is commonly referred to as communications regardless of the method employe(D)

(d) None of these

Q-20)   Shared Memory is

(a) A computer architecture where all processors have direct access to common physical memory

(b) It refers to network based memory access for physical memory that is not common.

(c) Parallel tasks typically need to exchange dat(A) There are several ways this can be accomplished, such as through, a shared memory bus or over a network, however the actual event of data exchange is commonly referred to as communications regardless of the method employe(D)

(d) None of these