Parallel and Distributed Computing MCQs
Parallel and Distributed Computing MCQs
Parallel and Distributed Computing MCQs
Parallel and Distributed Computing MCQs – Questions Answers Test” is the set of important
MCQs.
1: Computer system of a parallel computer is capable of
A. Decentralized computing
B. Parallel computing
C. Centralized computing
D. Decentralized computing
E. Distributed computing
F. All of these
G. None of these
Answer - Click Here:
A
2: Writing parallel programs is referred to as
A. Parallel computation
B. Parallel processes
C. Parallel development
D. Parallel programming
E. Parallel computation
F. All of these
G. None of these
Answer - Click Here:
D
3: Simplifies application’s of three-tier architecture is ____________.
A. Maintenance
B. Initiation
C.Implementation
D. Deployment
E. All of these
F. None of these
Answer - Click Here:
D
4: Dynamic networks of networks, is a dynamic connection that grows is called
A. Multithreading
B. Cyber cycle
C. Internet of things
D. Cyber-physical system
E. All of these
F. None of these
Answer - Click Here:
C
5: In which application system Distributed systems can run well?
A. HPC
D. HTC
C. HRC
D. Both A and B
E. All of these
F. None of these
Answer - Click Here:
D
6: In which systems desire HPC and HTC.
A. Adaptivity
B. Transparency
C. Dependency
D. Secretive
E. Adaptivity
F. All of these
G. None of these
Answer - Click Here:
B
7: No special machines manage the network of architecture in which resources are known as
A. Peer-to-Peer
B. Space based
C. Tightly coupled
D. Loosely coupled
E. All of these
F. None of these
Answer - Click Here:
A
8: Significant characteristics of Distributed systems have of
A. 5 types
B. 2 types
C. 3 types
D. 4 types
E. All of these
F. None of these
Answer - Click Here:
C
9: Built of Peer machines are over
A. Many Server machines
B. 1 Server machine
C. 1 Client machine
D. Many Client machines
E. All of these
F. None of these
Answer - Click Here:
D
10: Type HTC applications are
A. Business
B. Engineering
C. Science
D. Media mass
E. All of these
F. None of these
Answer - Click Here:
A
11: Virtualization that creates one single address space architecture that of, is called
A. Loosely coupled
B. Peer-to-Peer
C. Space-based
D. Tightly coupled
E. Loosely coupled
F. All of these
G. None of these
Answer - Click Here:
C
12: We have an internet cloud of resources In cloud computing to form
A. Centralized computing
B. Decentralized computing
C. Parallel computing
D. Both A and B
E. All of these
F. None of these
Answer - Click Here:
E
13: Data access and storage are elements of Job throughput, of __________.
A. Flexibility
B. Adaptation
C. Efficiency
D. Dependability
E. All of these
F. None of these
Answer - Click Here:
C
14: Billions of job requests is over massive data sets, ability to support known as
A. Efficiency
B. Dependability
C. Adaptation
D. Flexibility
E. All of these
F. None of these
Answer - Click Here:
C
15: Broader concept offers Cloud computing .to select which of the following.
A. Parallel computing
B. Centralized computing
C. Utility computing
D. Decentralized computing
E. Parallel computing
F. All of these
G. None of these
Answer - Click Here:
C
16: Resources and clients transparency that allows movement within a system is called
A.Mobility transparency
B. Concurrency transparency
C. Performance transparency
D. Replication transparency
E. All of these
F. None of these
Answer - Click Here:
A
17: Distributed program in a distributed computer running a is known as
A. Distributed process
B. Distributed program
C. Distributed application
D. Distributed computing
E. All of these
F. None of these
Answer - Click Here:
B
18: Uniprocessor computing devices is called__________.
A. Grid computing
B. Centralized computing
C. Parallel computing
D. Distributed computing
E. All of these
F. None of these
Answer - Click Here:
B
19: Utility computing focuses on a______________ model.
A. Data
B. Cloud
C. Scalable
D. Business
E. All of these
F. None of these
Answer - Click Here:
D
20: what is a CPS merges technologies
A. 5C
B. 2C
C. 3C
D. 4C
E. All of these
F. None of these
Answer - Click Here:
C
21: Aberavationn of HPC
A. High-peak computing
B. High-peripheral computing
C. High-performance computing
D. Highly-parallel computing
E. All of these
F. None of these
Answer - Click Here:
C
22: Peer-to-Peer leads to the development of technologies like
A. Norming grids
B. Data grids
C. Computational grids
D. Both A and B
E. All of these
F. None of these
Answer - Click Here:
D
23: Type of HPC applications of.
A. Management
B. Media mass
C. Business
D. Science
E. All of these
F.None of these
Answer - Click Here:
D
24: The development generations of Computer technology has gone through
A. 6
B. 3
C. 4
D. 5
E. All of these
F. None of these
Answer - Click Here:
D
25: Utilization rate of resources in an execution model is known to be its
A. Adaptation
B. Efficiency
C. Dependability
D. Flexibility
E. All of these
F. None of these
Answer - Click Here:
B
26: Even under failure conditions Providing Quality of Service (QoS) assurance is the
responsibility of
A. Dependability
B. Adaptation
C. Flexibility
D. Efficiency
E. All of these
F. None of these
Answer - Click Here:
A
27: Interprocessor communication that takes place
A. Centralized memory
B. Shared memory
C. Message passing
D. Both A and B
E. All of these
F. None of these
Answer - Click Here:
D
28: Data centers and centralized computing covers many and
A. Microcomputers
B. Minicomputers
C. Mainframe computers
D. Supercomputers
E. All of these
F. None of these
Answer - Click Here:
D
29: Which of the following is an primary goal of HTC paradigm___________.
A. High ratio Identification
B. Low-flux computing
C. High-flux computing
D. Computer utilities
E. All of these
F. None of these
Answer - Click Here:
C
30: The high-throughput service provided is measures taken by
A. Flexibility
B. Efficiency
D. Adaptation
E. Dependability
F. All of these
G. None of these
Answer - Click Here:
D
A modem is very helpful to link up two computers with the help of?
(A). telephone line
(B). dedicated line
(C). All of these
(D). None of these
MCQ Answer: (C)
A whole micro-computer system consists of which of the following?
(A). microprocessor
(B). memory
(C). peripheral equipment
(D). all of these
(E). None of these
MCQ Answer: (D).
Which of the following program is a micro-program written in 0 and 1?
(A). binary micro-program
(B). binary microinstruction
(C). symbolic microinstruction
(D). Symbolic microinstruction
(E). None of these
MCQ Answer: A
A pipeline is similar to which of the following?
(A). a gas line
(B). house pipeline
(C). both a and b
(D). an automobile assembly line
(E). None of these
MCQ Answer: D
A processor performing fetching or decoding of instructions during the execution of another instruction is
commonly known as?
(A). Super-scaling
(B). Parallel Computation
(C). Pipe-lining
(D). None of these
MCQ Answer: D
An optimizing compiler performs which of the following?
(A). Better compilation of the given code.
(B). better memory management.
(C). Takes the benefit of processor type and decreases its process time.
(D). Both a and c
(E). None of these
MCQ Answer: C
Which of the following wires is a collection of lines that connects several devices?
(A). internal wires
(B). peripheral connection wires
(C). Both a and b
(D). bus
(E). None of these
MCQ Answer: (D).
Which of the following is an instruction to give a small delay in the program?
(A). NOP
(B). LDA
(C). BEA
(D). None of these
MCQ Answer: A
How to define a peripheral?
(A). any physical device connected to the computer
(B). tape drive connected to a computer
(C). any drives installed in the computer
(D). None of these
MCQ Answer: A
MCQ No - 1
Resources and clients transparency that allows movement within a system is
called ____________________
(A) Mobility transparency
(B) Concurrency transparency
(C) Replication transparency
(D) Performance transparency
Answer
A
MCQ No - 2
A distributed system is defined as a collection of autonomous computers linked
by a network with software designed to produce an integrated computing facility.
True or False?
(A) FALSE
(B) TRUE
Answer
B
MCQ No - 3
Which amongst the following is not an advantage of Distributed systems?
(A) Resource sharing
(B) Incremental growth
(C) Reliability
(D) None of the above
Answer
C
MCQ No - 4
If one site fails in distributed system, ___________
(A) the remaining sites can continue operating
(B) all the sites will stop working
(C) directly connected sites will stop working
(D) none of the mentioned
Answer
A
MCQ No - 5
The capability of a system to adapt the increased service load is called
_________
(A) capacity
(B) tolerance
(C) scalability
(D) none of the mentioned
Answer
C
MCQ No - 6
What are characteristic of Network Operating Systems ?
(A) Users are aware of multiplicity of machines
(B) They are transparent
(C) They are simple to use
(D) All of the mentioned
Answer
A
MCQ No - 7
What is the characteristics of atomicity ?
(A) Use communication links
(B) One processor as coordinator which handles all requests
(C) When responses are received from all processes, then process can enter its Critical Section
(D) All operations associated are executed to completion or none are performed
Answer
D
MCQ No - 8
Network operating system runs on ___________
(A) every system in the network
(B) server
(C) both server and every system in the network
(D) none of the mentioned
Answer
B
MCQ No - 9
The transparency that enables multiple instances of resources to be used, is
called ____________
(A) Performance transparency
(B) Scaling transparency
(C) Concurrency transparency
(D) Replication transparency
Answer
D
MCQ No - 10
A set of highly integrated machines that run the same process in parallel is
known to be ___________
(A) Space based
(B) Loosely coupled
(C) Tightly coupled
(D) Peer-to-Peer
Answer
C
MCQ No - 11
Which of the following will be true distributed system ?
(A) tightly-coupled software on loosely-coupled hardware
(B) loosely-coupled software on tightly-coupled hardware
(C) tightly-coupled software on tightly-coupled hardware
(D) loosely-coupled software on loosely-coupled hardware
Answer
A
MCQ No - 12
Distributed systems should ?
(A) high security
(B) have better resource sharing
(C) better system utilization
(D) low system overhead
Answer
B
MCQ No - 13
Scalability basically refers to the size of the network that is to be used and it
consists for various sizes. Thus this may create some problems in the network.
To solve the scalability problem, which are basically three techniques for scaling?
I. Hiding communication latencies II. Distribution III. Replication
(A) I, III
(B) II, III
(C) I, II
(D) I, II, III
Answer
D
MCQ No - 14
Distributed OS works on the ________ principle.
(A) File Foundation
(B) Multi system image
(C) Single system image
(D) Networking image
Answer
C
MCQ No - 15
Distributed systems have __________
(A) high security
(B) better resource sharing
(C) better system utilization
(D) low system overhead
Answer
B
MCQ No - 16
What is not true about distributed system ?
(A) It is a collection of processor
(B) All processors are synchronized
(C) They do not share memory
(D) None of the mentioned
Answer
B
MCQ No - 17
What are characteristics of Distributed Operating system ?
(A) Access is done like local resources
(B) Users are aware of multiplicity of machines
(C) Users are aware of multiplicity of machines
(D) They have multiple zones to access files
Answer
A
MCQ No - 18
In distributed file system, when a file’s physical storage location changes
________________
(A) file name need to be changed
(B) file name need not to be changed
(C) file’s host name need to be changed
(D) file’s local name need to be changed
Answer
B
MCQ No - 19
All the resources are tightly coupled in the computing paradigm of __________
(A) Cloud computing
(B) Parallel computing
(C) Distributed computing
(D) Centralized computing
Answer
D
MCQ No - 20
The transparency that enables accessing local and remote resources using
identical operations is called ____________
(A) Access transparency
(B) Concurrency transparency
(C) Performance transparency
(D) Scaling transparency
Answer
A
MCQ No - 21
Individual wires from machine to machine, with many different wiring patterns in
use is an example of _________
(A) Switched
(B) Bus
(C) Both
(D) None of the mentioned
Answer
A
MCQ No - 22
There are four requirements in the design of a distributed system. Choose the
correct combination from the list below.
(A) Network performance, Quality of Service (QoS), Caching and replication, Dependability issues
(B) Network dependency, Quantity of Service (QoS), Cookies and replication, Dependability issues.
(C) Network integrity, Quality of Software (QoS), Caching and alteration, Dependability issues
(D) Network Accessibility, Quality of hardware (QoH), Caching and replication, Dependability issues.
Answer
A
MCQ No - 23
Concurrency is one of the intrinsic characteristics of distributed systems. Here,
Parallel executions occurs because __________
(A) Many users simultaneously invoke commands or interact with (the same) application programs.
(B) Many server processes run concurrently, each corresponding to a single request from a client
process.
(C) A and B Both
(D) None of these
Answer
C
MCQ No - 24
"Consider the two statements. (A) A network operating system, the users access
remote resources in the same manner as local resource. (B) In a distributed
operating system, the user can access remote resources either by logging into
the appropriate remote machine or transferring data from the remote machine to
their own machine. Which of the statement is true?
(A) A true, B false
(B) B true, A false
(C) Both A and B false
(D) Both A and B true
Answer
C
MCQ No - 25
Centralized computing covers many data centers and ________
(A) Minicomputers
(B) Mainframe computers
(C) Microcomputers
(D) Supercomputers
Answer
D
MCQ No - 26
Data centers and centralized computing covers many and _________________
(A) Microcomputers
(B) Minicomputers
(C) Mainframe computers
(D) Supercomputers
Answer
D
MCQ No - 27
The characteristics of a distributed system are :
(A) Resource sharing, heterogeneity, openness, security
(B) Scalability, fault handling
(C) Concurrency, transparency
(D) ALL are acceptable answers
Answer
D
MCQ No - 28
Which are the character characteristics of a decentralized algorithms: I. No
machine has complete information about the system state. II. Machines make
decisions based only on local information. III. Failure of one machine does not
damage the algorithm. IV. There is no implicit assumption that a global clock
exist
(A) I, II, IV
(B) II, III, IV
(C) I, II, III, IV
(D) I, II, III
Answer
C
MCQ No - 29
What is not a major reason for building distributed systems ?
(A) Resource sharing
(B) Computation speedup
(C) Reliability
(D) Simplicity
Answer
D
MCQ No - 30
What are design issues in distributed system structure ?
(A) Scalability
(B) Fault-tolerance
(C) Flexibility
(D) All of the mentioned
Answer
D
MCQ No - 31
What are the characteristics of tightly coupled system ? I. Different clock II. Use
communication links III. Same clock IV. Distributed systems
(A) II, III and IV
(B) I and IV
(C) I, II and III
(D) I
Answer
A
MCQ No - 32
Location transparency allows for which of the following?
(A) Users to treat the data as if it is at one location
(B) Programmers to treat the data as if it is at one location
(C) Managers to treat the data as if it is at one location
(D) All of the above.
Answer
D
MCQ No - 33
All the resources are shared and integrated within one OS, in the computing
paradigm named _________
(A) Distributed computing
(B) Centralized computing
(C) Cloud computing
(D) Parallel computing
Answer
B
MCQ No - 34
What are the Advantages of Distributed Systems over Independent PCs?
(A) Data sharing
(B) Resource Sharing
(C) Communication
(D) All of the above
Answer
D
Operating System Questions & Answers – Distributed Operating System
This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on
“Distributed Operating System”.
1. In distributed system, each processor has its own ___________
a) local memory
b) clock
c) both local memory and clock
d) none of the mentioned
View Answer
2. If one site fails in distributed system then ___________
a) the remaining sites can continue operating
b) all the sites will stop working
c) directly connected sites will stop working
d) none of the mentioned
View Answer
Answer: a
Explanation: None.
3. Network operating system runs on ___________
a) server
b) every system in the network
c) both server and every system in the network
d) none of the mentioned
View Answer
Answer: a
Explanation: None.
4. Which technique is based on compile-time program transformation for accessing remote
data in a distributed-memory parallel system?
a) cache coherence scheme
b) computation migration
c) remote procedure call
d) message passing
View Answer
Answer: b
Explanation: None.
5. Logical extension of computation migration is ___________
a) process migration
b) system migration
c) thread migration
d) data migration
View Answer
Answer: a
Explanation: None.
6. Processes on the remote systems are identified by ___________
a) host ID
b) host name and identifier
c) identifier
d) process ID
View Answer
7. Which routing technique is used in a distributed system?
a) fixed routing
b) virtual routing
c) dynamic routing
d) all of the mentioned
View Answer
Answer: d
Explanation: None.
8. In distributed systems, link and site failure is detected by ___________
a) polling
b) handshaking
c) token passing
d) none of the mentioned
View Answer
Answer: b
Explanation: None.
9. The capability of a system to adapt the increased service load is called ___________
a) scalability
b) tolerance
c) capacity
d) none of the mentioned
View Answer
Answer: a
Explanation: None.
10. Internet provides _______ for remote login.
a) telnet
b) http
c) ftp
d) rpc
View Answer
Answer: a
Explanation: None.
Operating System Questions and Answers – Remote Procedure Calls
« Prev
Next »
This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on
“Remote Procedure Calls”.
1. Remote Procedure Calls are used ____________
a) for communication between two processes remotely different from each other on the
same system
b) for communication between two processes on the same system
c) for communication between two processes on separate systems
d) none of the mentioned
View Answer
Answer: c
Explanation: None.
2. To differentiate the many network services a system supports ______ are used.
a) Variables
b) Sockets
c) Ports
d) Service names
View Answer
Answer: c
Explanation: None.
3. RPC provides a(an) _____ on the client side, a separate one for each remote procedure.
a) stub
b) identifier
c) name
d) process identifier
View Answer
Answer: a
Explanation: None.
4. What is stub?
a) transmits the message to the server where the server side stub receives the message
and invokes procedure on the server side
b) packs the parameters into a form transmittable over the network
c) locates the port on the server
d) all of the mentioned
View Answer
Answer: d
Explanation: None.
Operating System Questions & Answers – Distributed Operating System – Types &
Resource Sharing
This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on
“Distributed Operating System – Types & Resource Sharing”.
1. What is not true about a distributed system?
a) It is a collection of processor
b) All processors are synchronized
c) They do not share memory
d) None of the mentioned
View Answer
Answer: b
Explanation: None.
2. What are the characteristics of processor in distributed system?
a) They vary in size and function
b) They are same in size and function
c) They are manufactured with single purpose
d) They are real-time devices
View Answer
Answer: a
Explanation: None.
3. What are the characteristics of a distributed file system?
a) Its users, servers and storage devices are dispersed
b) Service activity is not carried out across the network
c) They have single centralized data repository
d) There are multiple dependent storage devices
View Answer
Answer: a
Explanation: None.
4. What is not a major reason for building distributed systems?
a) Resource sharing
b) Computation speedup
c) Reliability
d) Simplicity
View Answer
Answer: d
Explanation: None.
5. What are the types of distributed operating system?
a) Network Operating system
b) Zone based Operating system
c) Level based Operating system
d) All of the mentioned
View Answer
Answer: a
Explanation: None.
6. In the token passing approach of distributed systems, processes are organized in a ring
structure ____________
a) logically
b) physically
c) both logically and physically
d) none of the mentioned
View Answer
Answer: a
Explanation: None.
7. In distributed systems, what will the transaction coordinator do?
a) starts the execution of transaction
b) breaks the transaction into number of sub transactions
c) coordinates the termination of the transaction
d) all of the mentioned
View Answer
Answer: d
Explanation: None.
8. In case of failure, a new transaction coordinator can be elected by ____________
a) bully algorithm
b) ring algorithm
c) both bully and ring algorithm
d) none of the mentioned
View Answer
Answer: c
Explanation: None.
9. In distributed systems, election algorithms assumes that ____________
a) a unique priority number is associated with each active process in system
b) there is no priority number associated with any process
c) priority of the processes is not required
d) none of the mentioned
View Answer
Answer: a
Explanation: None.
10. According to the ring algorithm, links between processes are ____________
a) bidirectional
b) unidirectional
c) both bidirectional and unidirectional
d) none of the mentioned
View Answer
Answer: b
Explanation: None.
Question : 1
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
Answer » Discuss »
Answer: (a)
Question : 2
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
Answer » Discuss »
Answer: (b)
Question : 3
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
Answer » Discuss »
Answer: (c)
Question : 4
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
Answer » Discuss »
Answer: (d)
Question : 5
Fine-grain Parallelism is
a) In parallel computing, it is a qualitative measure of the ratio of
computation to communication
b) Here relatively small amounts of computational work are done
between communication events
c) Relatively large amounts of computational work are done between
communication / synchronization events
d) None of these
Answer » Discuss »
Answer: (b)
Question : 6
Granularity is
a) In parallel computing, it is a qualitative measure of the ratio of
computation to communication
b) Here relatively small amounts of computational work are done
between communication events
c) Relatively large amounts of computational work are done between
communication / synchronization events
d) None of these
Answer » Discuss »
Answer: (a)
Question : 7
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
Answer » Discuss »
Answer: (b)
Question : 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
Answer » Discuss »
Answer: (a)
Question : 9
Functional Decomposition:
a) Partitioning in that the data associated with a problem is
decompose(D) Each parallel task then works on a portion of the dat(A)
b) Partitioning in that, the focus is on the computation that is to be
performed rather than on the data manipulated by the computation. The
problem is decomposed according to the work that must be done. Each
task then performs a portion of the overall work.
c) It is the time it takes to send a minimal (0 byte) message from point A
to point (B)
d) None of these
Answer » Discuss »
Answer: (b)
Question : 10
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
Answer » Discuss »
Answer: (b)
Question : 11
Coarse-grain Parallelism
a) In parallel computing, it is a qualitative measure of the ratio of
computation to communication
b) Here relatively small amounts of computational work are done
between communication events
c) Relatively large amounts of computational work are done between
communication / synchronization events
d) None of these
Answer » Discuss »
Answer: (c)
Question : 12
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
Answer » Discuss »
Answer: (b)
Question : 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
Answer » Discuss »
Answer: (a)
Question : 14
Massively Parallel
a) Observed speedup of a code which has been parallelized, defined as:
wall-clock time of serial execution and wall-clock time of parallel
execution
b) The amount of time required to coordinate parallel tasks. It includes
factors such as: Task start-up time, Synchronizations, Data
communications.
c) Refers to the hardware that comprises a given parallel system - having
many processors
d) None of these
Answer » Discuss »
Answer: (b)
Question : 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
Answer » Discuss »
Answer: (b)
Question : 1
Scalability refers to a parallel system’s (hardware and/or software) ability
a) To demonstrate a proportionate increase in parallel speedup with the
removal of some processors
b) To demonstrate a proportionate increase in parallel speedup with the
addition of more processors
c) To demonstrate a proportionate decrease in parallel speedup with the
addition of more processors
d) None of these
Answer » Discuss »
Answer: (b)
Question : 2
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
Answer » Discuss »
Answer: (a)
Question : 3
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
Answer » Discuss »
Answer: (c)
Question : 4
In shared Memory
a) Changes in a memory location effected by one processor do not affect
all other processors.
b) Changes in a memory location effected by one processor are visible to
all other processors
c) Changes in a memory location effected by one processor are randomly
visible to all other processors.
d) None of these
Answer » Discuss »
Answer: (b)
Question : 5
Collective communication
a) It involves data sharing between more than two tasks, which are often
specified as being members in a common group, or collective.
b) It involves two tasks with one task acting as the sender/producer of
data, and the other acting as the receiver/consumer.
c) It allows tasks to transfer data independently from one another.
d) None of these
Answer » Discuss »
Answer: (a)
Question : 6
Point-to-point communication referred to
a) It involves data sharing between more than two tasks, which are often
specified as being members in a common group, or collective.
b) It involves two tasks with one task acting as the sender/producer of
data, and the other acting as the receiver/consumer.*
c) It allows tasks to transfer data independently from one another.
d) None of these
Answer » Discuss »
Answer: (b)
Question : 7
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
Answer » Discuss »
Answer: (a)
Question : 8
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
Answer » Discuss »
Answer: (b)
Question : 9
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
Answer » Discuss »
Answer: (c)
Question : 10
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
Answer » Discuss »
Answer: (a)
Question : 6
Point-to-point communication referred to
a) It involves data sharing between more than two tasks, which are often
specified as being members in a common group, or collective.
b) It involves two tasks with one task acting as the sender/producer of
data, and the other acting as the receiver/consumer.*
c) It allows tasks to transfer data independently from one another.
d) None of these
Answer » Discuss »
Answer: (b)
Question : 7
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
Answer » Discuss »
Answer: (a)
Question : 8
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
Answer » Discuss »
Answer: (b)
Question : 9
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
Answer » Discuss »
Answer: (c)
Question : 10
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
Answer » Discuss »
Answer: (a)
Question : 16
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
Answer » Discuss »
Answer: (c)
Question : 17
Synchronous communications
a) It require some type of “handshaking” between tasks that are sharing
dat(A) This can be explicitly structured in code by the programmer, or it
may happen at a lower level unknown to the programmer.
b) It involves data sharing between more than two tasks, which are often
specified as being members in a common group, or collective.
c) It involves two tasks with one task acting as the sender/producer of
data, and the other acting as the receiver/consumer.
d) It allows tasks to transfer data independently from one another.
Answer » Discuss »
Answer: (a)
Question : 18
Latency is
a) Partitioning in that the data associated with a problem is
decompose(D) Each parallel task then works on a portion of the dat(A)
b) Partitioning in that, the focus is on the computation that is to be
performed rather than on the data manipulated by the computation. The
problem is decomposed according to the work that must be done. Each
task then performs a portion of the overall work.
c) It is the time it takes to send a minimal (0 byte) message from one
point to other point
d) None of these
Answer » Discuss »
Answer: (c)
Question : 19
Asynchronous communications
a) It involves data sharing between more than two tasks, which are often
specified as being members in a common group, or collective.
b) It involves two tasks with one task acting as the sender/producer of
data, and the other acting as the receiver/consumer.
c) It allows tasks to transfer data independently from one another.
d) None of these
Answer » Discuss »
Answer: (c)
Parallel Processing
Multiple Choice question & Answers:-
A. bus
C. Both a and b
D. internal wires
Answer: A. bus
A. microprocessor
B. memory
C. peripheral equipment
A. instruction pointer
B. memory pointer
C. data counter
D. file pointer
Answer: A. instruction pointer
A. 8
B. 16
C. 4
D. 32
Answer: A. 8
A. data transfer
B. logic operation
C. arithmetic operation
6) The access time of memory is ............... the time required for performing any single CPU operation.
A. Longer than
B. Shorter than
C. Negligible than
D. Same as
Answer: A. Longer than
7) Memory address refers to the successive memory words and the machine is called as ............
A. word addressable
B. byte addressable
C. bit addressable
A. Symbolic microinstruction
B. binary microinstruction
C. symbolic microinstruction
D. binary micro-program
B. house pipeline
C. both a and b
D. a gas line
11) Processors of all computers, whether micro, mini or mainframe must have
A. ALU
B. Primary Storage
C. Control unit
D. All of above
A. immediate
B. direct
C. indirect
D. register
A. fetch instruction
B. decode instruction
C. fetch operand
D. calculate operand
E. execute instruction
F. all of abve
16) Which of the following code is used in present day computing was developed by IBM corporation?
A. ASCII
B. Hollerith Code
C. Baudot code
D. EBCDIC code
17) When a subroutine is called, the address of the instruction following the CALL instructions stored
in/on the
A. stack pointer
B. accumulator
C. program counter
D. Stack
Answer: D. Stack
A. symbolic microinstruction
B. binary microinstruction
C. symbolic microprogram
D. binary microprogram
B. external
C. hardware
D. Software
Answer: B. external
B) Memory chips
C) Registers
D) I/O devices
22) The output of a gate is low when at least one of its input is low . It is true for
A) AND gate
B) OR gate
C) NAND gate
D) NOR gate
23) Which one of the following is most suitable to make a parity checker
A) AND gate
B) OR gate
C) Exclusive- OR gate
24) What is the minimum number of flip-flops required in a counter to count 100 pulses?
A) Five
B) seven
C) Ten
D) hundred
Answer: B) seven
25. For a RS flip-flop constructed with NAND gates and input R=1 and s=1 the state is
A) Memory state
B) Set state
C) Reset state
D) Unused state
Answer: D) Unused state
A) 3 bit long
B) 5 bit long
C) 7 bit long
D) 9 bit long
A) slow system
B) large system
A. RISC based
B. CISC based
A. telephone line
B. dedicated line
B. 200
D. 224
Answer: C. 255
34. In a system with a 16 bit address bus, what is the maximum number of 1K byte memory devices it
could contain
A. 16
B. 64
C. 256
D. 65536
Answer: C. 256
B. ROM
C. EPROM
D. ALL
Answer: A. RAM
36. A peripheral is
D. None of above
37. How many bits do you think will be adequate to encode individual character in Devnagari script
A. 12
B. 16
C. 64
D. 10
Answer: D. 10
38. Which of the following bus is used to transfer data from main memory to peripheral device?
A. DMA bus
B. Output bus
C. Data bus
40. CD -RAW is
A. Imaging
B. Graphics
C. Voice
A. Magnetic disks
B. floppy disks
C. Logic gates
D. Integrated Circuits
C. in the memory
D. in the stack
A. computer memory
B. primary storage
C. secondary storage
D. control memory
E. cache memory
Answer: D. control memory
A. fetch instruction
B. decode instruction
C. fetch operand
D. calculate operand
E. execute instruction
B. accumulator
A. 4
B. 2
C. 3
D. 6
Answer: B. 2
A. SISD
B. SIMD
C. MIMD
Answer: A. SISD
50. How many address lines are needed to address each memory location in a 2048X 4 memory chip?
A. 10
B. 11
C. 8
D. 12
Answer: B. 11
51. Who is regarded as the founder of Computer Architecture?
A. Alan Turing
B. Konrad Zuse
A. Size
B. Dynamic behaviour
C. Static behaviour
D. Speed
A. Processor/memory interface
B. Control unit
D. Instruction set
A. Quadratically
B. Linearly
C. Cubicly
D. Exponentially
Answer: D. Exponentially
A. Alan Turing
B. Konrad Zuse
C. J. Presper Eckert
A. Cache
B. Main memory
C. Hard disk
D. Register
57. Which cache miss does not occur in case of a fully associative cache ?
A. Conflict miss
B. Capacity miss
C. Compulsory miss
A. Coherence miss
B. Capacity miss
C. Conflict miss
A. System dumps
B. Physical addresses
C. rogram data
60. Which value has the speedup of a parallel program that achieves an efficiency of 75% on 32
processors?
A. 18
B. 24
C. 16
D. 20
Answer: B. 24
A. instruction execution
B. instruction prefetch
C. instruction decoding
D. instruction manipulation
62. The concept of pipelining is most effective in improving performance if the tasks being performed in
different stages :
C. require different amount of time with time difference between any two tasks being same
D. require different amount with time difference between any two tasks being different
A. Small Algorithm
B. Hash Algorithm
C. Merge-Sort Algorithm
D. Quick-Sort Algorithm
A. processor-printer communication
B. memory-monitor communication
C. pipelining
Answer: C. pipelining
A. Time Complexity
B. Switching Complexity
C. Circuit Complexity
A. LDA
B. NOP
C. BEA
Answer: B. NOP
D. none of the
A. parallel
B. serial
C. random
Answer: B. serial
70. Which one of the following is a characteristic of CISC (Complex Instruction Set Computer)
71. During the execution of the instructions, a copy of the instructions is placed in the ______ .
A. Register
B. RAM
C. System heap
D. Cache
Answer: D. Cache
72. Two processors A and B have clock frequencies of 700 Mhz and 900 Mhz respectively. Suppose A can
execute an instruction with an average of 3 steps and B can execute with an average of 5 steps. For the
execution of the same instruction which processor is faster ?
A. A
B. B
D. Insuffient information
Answer: A. A
73. A processor performing fetch or decoding of different instruction during the execution of another
instruction is called ______ .
A. Super-scaling
B. Pipe-lining
C. Parallel Computation
D. None of these
Answer: B. Pipe-lining
74. For a given FINITE number of instructions to be executed, which architecture of the processor
provides for a faster execution ?
A. ISA
B. ANSA
C. Super-scalar
Answer: C. Super-scalar
75. The clock rate of the processor can be improved by,
B. Takes advantage of the type of processor and reduces its process time.
D. Both a and c
Answer: B. Takes advantage of the type of processor and reduces its process time.
C. Be versatile.
79. As of 2000, the reference system to find the performance of a system is _____ .
A. Ultra SPARC 10
B. SUN SPARC
C. SUN II
D. None of these
80. When Performing a looping operation, the instruction gets stored in the ______.
A. Registers
B. Cache
C. System Heap
D. System stack
Answer: B. Cache
81. The average number of steps taken to execute the set of instructions can be made to be less than
one by following _______ .
A. ISA
B. Pipe-lining
C. Super-scaling
D. Sequential
Answer: C. Super-scaling
82. If a processor clock is rated as 1250 million cycles per second, then its clock period is ________ .
B. 1.6 * 10 ^ -9 sec
D. 8 * 10 ^ -10 sec
83. If the instruction, Add R1,R2,R3 is executed in a system which is pipe-lined, then the value of S
is (Where S is term of the Basic performance equation)
A. 3
B. ~2
C. ~1
D. 6
Answer: C. ~1
85. As of 2000, the reference system to find the SPEC rating are built with _____ Processor.
87. The computer architecture aimed at reducing the time of execution of instructions is ________.
A. CISC
B. RISC
C. ISA
D. ANNA
Answer: B. RISC
88. The Sun micro systems processors usually follow _____ architecture.
A. CISC
B. ISA
C. ULTRA SPARC
D. RISC
Answer: D. RISC
89. The RISC processor has a more complicated design than CISC.
A. True
B. False
Answer: B. False
90. The iconic feature of the RISC machine among the following are
A. Cost
B. Time delay
C. Semantic gap
A. IBM 370/168
B. VAX 11/780
C. Intel 80486
D. Motorola A567
A. RISC
B. CISC
C. ISA
D. IANA
Answer: A. RISC
94. In CISC architecture most of the complex instructions are stored in _____.
A. Register
B. Diodes
C. CMOS
D. Transistors
Answer: D. Transistors
A. CISC
B. RISC
C. ISA
D. IANA
Answer: B. RISC
96. To which class of systems does the von Neumann computer belong?
97. Parallel programs: Which speedup could be achieved according to Amdahl´s law for infinite number
of processors if 5% of a program is sequential and the remaining part is ideally parallel?
A. Infinite speedup
B. 5
C. 20
D. 50
Answer: C. 20
A. Control hazards
B. Data hazards
C. Structural hazards
D. None
99. Which MIMD systems are best scalable with respect to the number of processors?
B. ccNUMA systems
C. nccNUMA systems
D. Symmetric multiprocessors
100. Cache coherence: For which shared (virtual) memory systems is the snooping protocol suited?
A. Crossbar connected systems
This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on “Semaphores”.
1. An un-interruptible unit is known as ____________
a) single
b) atomic
c) static
d) none of the mentioned
View Answer
Answer: b
Explanation: None.
2. TestAndSet instruction is executed ____________
a) after a particular process
b) periodically
c) atomically
d) none of the mentioned
View Answer
Answer: c
Explanation: None.
3. Semaphore is a/an _______ to solve the critical section problem.
a) hardware for a system
b) special program for a system
c) integer variable
d) none of the mentioned
View Answer
Answer: c
Explanation: None.
4. What are the two atomic operations permissible on semaphores?
a) wait
b) stop
c) hold
d) none of the mentioned
View Answer
Answer: a
Explanation: None.
5. What are Spinlocks?
a) CPU cycles wasting locks over critical sections of programs
b) Locks that avoid time wastage in context switches
c) Locks that work better on multiprocessor systems
d) All of the mentioned
View Answer
Answer: d
Explanation: None.
advertisement
6. What is the main disadvantage of spinlocks?
a) they are not sufficient for many process
b) they require busy waiting
c) they are unreliable sometimes
d) they are too complex for programmers
View Answer
Answer: b
Explanation: None.
7. The wait operation of the semaphore basically works on the basic _______ system call.
a) stop()
b) block()
c) hold()
d) wait()
View Answer
Answer: b
Explanation: None.
8. The signal operation of the semaphore basically works on the basic _______ system call.
a) continue()
b) wakeup()
c) getup()
d) start()
View Answer
Answer: b
Explanation: None.
9. If the semaphore value is negative ____________
a) its magnitude is the number of processes waiting on that semaphore
b) it is invalid
c) no operation can be further performed on it until the signal operation is performed on it
d) none of the mentioned
View Answer
Answer: a
Explanation: None.
10. The code that changes the value of the semaphore is ____________
a) remainder section code
b) non – critical section code
c) critical section code
d) none of the mentioned
View Answer
Answer: c
Explanation: None.
11. The following program consists of 3 concurrent processes and 3 binary semaphores. The semaphores are
initialized as S0 = 1, S1 = 0, S2 = 0.
Process P0
while(true)
{
wait(S0);
print '0';
release(S1);
release(S2);
}
Process P1
wait(S1);
release(S0);
Process P2
wait(S2);
release(S0);
How many times will P0 print ‘0’?
a) At least twice
b) Exactly twice
c) Exactly thrice
d) Exactly once
View Answer
Answer: a
Explanation: None.
12. Each process Pi, i = 0,1,2,3,……,9 is coded as follows.
repeat
P(mutex)
{Critical Section}
V(mutex)
forever
The code for P10 is identical except that it uses V(mutex) instead of P(mutex). What is the largest number of
processes that can be inside the critical section at any moment (the mutex being initialized to 1)?
a) 1
b) 2
c) 3
d) None of the mentioned
View Answer
Answer: c
Explanation: Any one of the 9 processes can get into critical section after executing P(mutex) which decrements
the mutex value to 0. At this time P10 can enter critical section by incrementing the value to 1. Now any of the 9
processes can enter the critical section by again decrementing the mutex value to 0. None of the remaining
processes can get into their critical sections.
13. Two processes, P1 and P2, need to access a critical section of code. Consider the following synchronization
construct used by the processes.
Process P1 :
while(true)
{
w1 = true;
while(w2 == true);
Critical section
w1 = false;
}
Remainder Section
Process P2 :
while(true)
{
w2 = true;
while(w1 == true);
Critical section
w2 = false;
}
Remainder Section
Here, w1 and w2 have shared variables, which are initialized to false. Which one of the following statements is
TRUE about the above construct?
a) It does not ensure mutual exclusion
b) It does not ensure bounded waiting
c) It requires that processes enter the critical section in strict alternation
d) It does not prevent deadlocks but ensures mutual exclusion
View Answer
Answer: d
Explanation: None.
1. What will happen if a non-recursive mutex is locked more than once?
a) Starvation
b) Deadlock
c) Aging
d) Signaling
View Answer
Answer: b
Explanation: If a thread which had already locked a mutex, tries to lock the mutex again, it will enter into the
waiting list of that mutex, which results in a deadlock. It is because no other thread can unlock the mutex.
2. What is a semaphore?
a) is a binary mutex
b) must be accessed from only one process
c) can be accessed from multiple processes
d) none of the mentioned
View Answer
Answer: c
Explanation: None.
3. What are the two kinds of semaphores?
a) mutex & counting
b) binary & counting
c) counting & decimal
d) decimal & binary
View Answer
Answer: b
Explanation: None.
4. What is a mutex?
a) is a binary mutex
b) must be accessed from only one process
c) can be accessed from multiple processes
d) none of the mentioned
View Answer
Answer: b
Explanation: None.
5. At a particular time of computation the value of a counting semaphore is 7.Then 20 P operations and 15 V
operations were completed on this semaphore. The resulting value of the semaphore is? (GATE 1987)
a) 42
b) 2
c) 7
d) 12
View Answer
Answer: b
Explanation: P represents Wait and V represents Signal. P operation will decrease the value by 1 every time and V
operation will increase the value by 1 every time.
advertisement
6. A binary semaphore is a semaphore with integer values ____________
a) 1
b) -1
c) 0.8
d) 0.5
View Answer
Answer: a
Explanation: None.
7. The following pair of processes share a common variable X.
Process A
int Y;
A1: Y = X*2;
A2: X = Y;
Process B
int Z;
B1: Z = X+1;
B2: X = Z;
X is set to 5 before either process begins execution. As usual, statements within a process are executed
sequentially, but statements in process A may execute in any order with respect to statements in process B.
How many different values of X are possible after both processes finish executing?
a) two
b) three
c) four
d) eight
View Answer
Answer: c
Explanation: Here are the possible ways in which statements from A and B can be interleaved.
A1 A2 B1 B2: X = 11
A1 B1 A2 B2: X = 6
A1 B1 B2 A2: X = 10
B1 A1 B2 A2: X = 10
B1 A1 A2 B2: X = 6
B1 B2 A1 A2: X = 12.
8. The program follows to use a shared binary semaphore T.
Process A
int Y;
A1: Y = X*2;
A2: X = Y;
signal(T);
Process B
int Z;
B1: wait(T);
B2: Z = X+1;
X = Z;
T is set to 0 before either process begins execution and, as before, X is set to 5.
Now, how many different values of X are possible after both processes finish executing?
a) one
b) two
c) three
d) four
View Answer
Answer: a
Explanation: The semaphore T ensures that all the statements from A finish execution before B begins. So now
there is only one way in which statements from A and B can be interleaved:
A1 A2 B1 B2: X = 11.
9. Semaphores are mostly used to implement ____________
a) System calls
b) IPC mechanisms
c) System protection
d) None of the mentioned
View Answer
Answer: b
Explanation: None.
10. Spinlocks are intended to provide __________ only.
a) Mutual Exclusion
b) Bounded Waiting
c) Aging
d) Progress
View Answer
Answer: b
Explanation: None.
1: Computer system of a parallel computer is capable of
A. Decentralized computing
B. Parallel computing
C. Centralized computing
D. Decentralized computing
E. Distributed computing
F. All of these
G. None of these