Distributed Systems

Chapter 1

1- ‫ ــــــــــ‬communicate with system by performing tasks assigned to them.

D
a) Distributed System b) distributed databases c) Autonomous computers d) All

2- centralized computer that connects autonomous computer together via network is ‫ــــــــــ‬
B
a) Centralized System b) Distributed System c) A & B d) None

3- In distributed system, hardware or software components located at networked computers

communicate by ‫ــــــــــ‬ C
a) Bus b) global clock c) passing messages d) Cables

4- characteristics of ‫ ــــــــــ‬concurrency of components, lack of a global clock and independent

failures of components. B
a) Centralized System b) Distributed System c) Cloud System d) None

5- ‫ ــــــــــ‬is norm, In a network of computers to concurrent program execution

A
a) Concurrency b) global clock c) processor d) None

6- One of this is not examples of Distributed Systems

A
a) Banking system b) Bitcoin c) BitTorrent d) Multiplayer games

7- ‫ ــــــــــ‬All resources accessible, One component with non-autonomous parts, Single Point of
control/failure B
a) Decentralized System b) Centralized System c) Distributed System d) Cloud System

8- ‫ ــــــــــ‬Characteristics Software runs in concurrent processes on different processors

C
a) Decentralized System b) Centralized System c) Distributed System d) Cloud System
 Distributed Systems
9- ‫ ــــــــــ‬autonomous components are not shared by all users, resources may not be accessible
C
a) Decentralized System b) Centralized System c) Distributed System d) Cloud System

10- One of this not of Distributed System Key Characteristics

D
a) Transparency b) Heterogeneity c) Scalability d) Single Point of control

11- ‫ ــــــــــ‬Term refer to scaling-up the computational capability.

D
a) Parallel computing b) Distributed computing c) Multiprocessors d) A & B

12- Every component owns their part of decision in ‫ــــــــــ‬

A
a) Decentralized systems b) Centralized System c) Cloud System d) None

13- ‫ ــــــــــ‬perform multiple tasks simultaneously using multiple processors on single machine,
possibly with shared memory. A
a) Parallel computing b) Distributed computing c) Multiprocessors d) A & B

14- ‫ ــــــــــ‬use multiple autonomous machines with no shared memory

B
a) Parallel computing b) Distributed computing c) Multiprocessors d) A & B

15- in Parallel Computing The processors communicate with one another via a
C
a) Cables b) global clock c) Bus d) passing messages

16- in ‫ ــــــــــ‬Several processors execute various tasks simultaneously, in ‫ ــــــــــ‬Several

computers execute tasks simultaneously.
A
a) Parallel/Distributed b) Distributed/ Parallel c) Centralized/Parallel
d) None
Computing Computing Computing

17- ‫ ــــــــــ‬is Used to help improve system performance

C
a) Centralized Computing b) Distributed Computing c) Parallel Computing d) None

18- multiprocessors and multicomputer are the types of ‫ ــــــــــ‬computing systems

B
a) Cloud b) parallel c) Distributed d) None
 Distributed Systems

19- ‫ ــــــــــ‬is a single computer system containing multiple processors interconnected with the
common I/O and memory devices A
a) multiprocessor b) multicomputer c) Cloud d) A & B

20- ‫ ــــــــــ‬is a system consists of several autonomous computers connected.

B
a) multiprocessor b) multicomputer c) Cloud d) A & B

21- In ‫ ــــــــــ‬memory multiprocessors all CPUs shares the common memory, but in ‫ــــــــــ‬
memory multiprocessors every CPU has its own private memory. D
a) shared, private b) private, shared c) distributed, shared d) shared, distributed

22- The main objective of using a multiprocessor is to ‫ــــــــــ‬

D
a) improve system b) enhance system c) increase computational
d) boost execution speed
reliability scalability capacity

23- ‫ ــــــــــ‬System is a computer system with multiple processors that are connected together to
solve a problem. C
a) Multiprocessor b) c) Multicomputer d)

24- ‫ ــــــــــ‬autonomous computers connected in network and each computer has its own I/O and
memory devices, and other computing resources. B
a) multiprocessor b) multicomputer c) Cloud d) A & B

25- ‫ ــــــــــ‬distributed system enables a component to share data, nodes are interconnected for
collaboration purposes. D
a) Scalability b) Efficiency c) Reliability d) Data sharing

26- one of this objectives is not of objective of using a multiprocessor

C
a) fault tolerance b) app matching c) scalability d) boost execution speed

27- ‫ ــــــــــ‬that we can change size of particular system, easily add more nodes in it.
A
a) Scalability b) Efficiency c) Reliability d) Data sharing
 Distributed Systems
28- ‫ ــــــــــ‬if there is single node failure, other nodes continue to function properly
C
a) Efficiency b) Less delay c) Failure handling d) Reliability

29- client requests server for resources or task, server allocates resource or performs task, sends
result as response to request. D
a) Middleware b) N-tier c) Peer-to-Peer Systems d) Client/Server Systems

30- ‫ ــــــــــ‬for a system to be reliable, it should handle errors efficiently.

A
a) Reliability b) Less delay c) Failure handling d) Efficiency

31- Nodes are an important part of a system, this node can work as a server or as a client for a
system. C
a) Middleware b) N-tier c) Peer-to-Peer Systems d) Client/Server Systems

32- in ‫ ــــــــــ‬each node performs its own task on its local memory and shares data through
supporting medium. C
a) Middleware b) N-tier c) Peer-to-Peer Systems d) Client/Server Systems

33- It works as base for different interoperability applications running on different operating
systems.
Data can be transferred to other between others by using this service. A

a) Middleware b) N-tier c) Peer-to-Peer Systems d) Client/Server Systems

34- data of client is stored in middle tier through which development can be done easily. used in
web apps. C
a) N-tier b) Middleware c) Three-tier d) Peer-to-Peer

35- structure of software app divided into multiple tiers.

A
a) N-tier b) Middleware c) Three-tier d) Peer-to-Peer

36- ‫ ــــــــــ‬is layer of app that operates on its own infrastructure or server
B
a) Middleware b) tier c) processor d) layer
 Distributed Systems
37- ‫ ــــــــــ‬is division of app that carries out discrete set of functions.
D
a) Middleware b) tier c) processor d) layer

38- ‫ ــــــــــ‬coupled multiprocessor system is also known as a distributed system

C
a) Tightly Coupled b) Tightly & loosely coupled c) Loosely coupled d) None

39- ‫ ــــــــــ‬is used to exchange the information between different computer modules of the
system A
a) MTS b) MTI c) MTC d) MTP

40- Efficient for real−time or high-speed processing applications, but they experience more
memory conflicts.
A
b) Tightly & loosely
a) Tightly Coupled c) Loosely coupled d) None
coupled

41- ‫ ــــــــــ‬is consists of its own local memory, a set of I/O devices, and a channel and switch,
One processor. C
a) Tightly Coupled b) Tightly & loosely coupled c) Loosely coupled d) None

42- multiprocessor which has very high degree of coupling among different processors of the
system is ‫ــــــــــ‬ A
a) Tightly Coupled b) Tightly & loosely coupled c) Loosely coupled d) None

43- A ‫ ــــــــــ‬coupled multiprocessor system has high data rate

A
a) Tightly b) Tightly & loosely c) Loosely d) None

44- Major drawback of ‫ ــــــــــ‬coupled multiprocessor system is that it has very low throughput.
C
a) Tightly b) Tightly & loosely c) Loosely d) None

45- Tightly coupled multiprocessor systems are relatively ‫ ــــــــــ‬expensive than loosely coupled
multiprocessor systems. B
a) equal b) more c) less
 Distributed Systems
46- Obtain higher efficiency when the processes executing on different computer modules need
less interaction B
a) Tightly b) loosely c) Tightly & loosely d) None

47- computing system is a uniprocessor machine capable of executing a single instruction, which
operates on a single data stream A
a) SISD b) SIMD c) MISD d) MIMD

48- Instructions are carried out sequentially by ‫ــــــــــ‬, which may or may not be capable of
parallel processing. A
a) SISD b) SIMD c) MISD d) MIMD

49- There may be more than one functional unit, one control unit is in charge of all functional
units. A
a) SISD b) SIMD c) MISD d) MIMD

50- Systems allow for pipeline processing or using numerous functional units to achieve parallel
processing. A
a) SISD b) SIMD c) MISD d) MIMD

51- processors operate synchronously, where at each cycle all processors execute the same
instruction, each on different datum. B
a) SISD b) SIMD c) MISD d) MIMD

52- The ‫ ــــــــــ‬architectures can also support vector processing.

B
a) SISD b) SIMD c) MISD d) MIMD

53- ‫ ــــــــــ‬architectures are used mostly for problems having high degrees of data parallelism.
B
a) SISD b) SIMD c) MISD d) MIMD

54- In this type of synchronization fasting processor has to wait slowest one before it is starting
executing next instruction. D
a) internal b) Thread c) external d) Lockstep
 Distributed Systems
55- ‫ ــــــــــ‬consist of N processors each with its own control unit sharing a common memory
where data reside. C
a) SISD b) SIMD c) MISD d) MIMD

56- Most general and powerful class, each processor operates under control of an instruction
stream issued by its control unit. D
a) SISD b) SIMD c) MISD d) MIMD

57- All processors executing different subproblems on different data while solving a single
problem (asynchronously). D
a) SISD b) SIMD c) MISD d) MIMD

58- The communication between processors is preformed through a shared memory or an

interconnection network. D
a) SISD b) SIMD c) MISD d) MIMD

59- MIMD computers with a shared common memory are often referred to as multi ‫ــــــــــ‬
B
a) processors/loosely b) processors/tightly c) computer/loosely d) computer/tightly
coupled coupled coupled coupled

60- computers with an interconnection network connecting processors are known as multi ‫ـــــــــ‬
C
a) processors/loosely b) processors/tightly c) computer/loosely d) computer/tightly
coupled coupled coupled coupled

61- Processors exchange information through their interconnection network in ‫ ــــــــــ‬systems

A
a) Message passing b) Shared memory c) In both d) None

62- In ‫ ــــــــــ‬every processing element can access any module via interconnected network
directly. B
a) Message passing b) Shared memory c) In both d) None

63- The data and code are not divided into partitions in ‫ــــــــــ‬
B
a) Message passing b) Shared memory c) In both d) None
 Distributed Systems
64- in ‫ ــــــــــ‬Memory Access all Processing Elements access data with same access time.
B
a) Passing b) Uniform c) Non-Uniform d) Local

65- in ‫ ــــــــــ‬Memory Access some processing elements are closer to memory and some access
it later. C
a) Passing b) Uniform c) Non-Uniform d) Local

66- all processors are attached to a bus which connects them to memory. every machine with
shared memory shares specific memory, common bus system for all clients. A
a) Bus-based b) Hierarchical c) Non-uniform d) Message passing

67- Processors on different boards may communicate through inter-nodal buses, machine may
support over nine thousand processors. B
a) Bus-based b) Hierarchical c) Uniform d) Message passing

68- In Distributed memory, for data to be shared, it must be passed from one processor to
another as a ‫ــــــــــ‬. A
a) message

Chapter 2
1- ‫ ــــــــــ‬processes cause messages to be added to remote queues and ‫ ــــــــــ‬processes
remove messages from local queues. B
a) Receiving / Sending b) Sending / Receiving c) Sending d) Receiving

2- Some applications require that messages be delivered in ‫ ــــــــــ‬order.

A
a) sender b) receiver c) sender & receiver d) server

3- Point-to-point message service is ‫ ــــــــــ‬if messages are guaranteed to be delivered despite a

‘reasonable’ number of packets being dropped or lost. A
a) Reliability

4- Single global clock is used by all components in system such that whole system is operating in
lock, step manner. C
a) asynchronous b) Static c) synchronous d) Dynamic
 Distributed Systems
5- Not require global clock. Handshaking signals are used instead in order to coordinate the
operation of ‫ ــــــــــ‬systems. B
a) Static b) asynchronous c) synchronous d) Dynamic

6- ‫ ــــــــــ‬systems tend to be slower compared to ‫ ــــــــــ‬systems, they are race and hazard-free.
B
a) Asynchronous / Synchronous b) Synchronous / Asynchronous

7- Single central control unit is used to oversee and control operation of components of system.
D
a) circuit switching b) packet switching c) decentralized control d) centralized control

8- The control function is distributed among different components in the system.

C
a) circuit switching b) packet switching c) decentralized control d) centralized control

9- Function & reliability of central control unit can become bottleneck in ‫ ــــــــــ‬control system.
D
a) circuit switching b) packet switching c) decentralized d) centralized

10- Complete path established prior to start of communication between source & destination.
A
a) circuit switching b) packet switching c) decentralized d) centralized

11- communication between source and destination via messages that are divided into called "
‫" ــــــــــ‬. C
a) Bytes b) Blocks c) Packets d) Segments

12- Established path will remain during whole communication period in ‫ــــــــــ‬.
A
a) circuit switching b) packet switching c) decentralized d) centralized

13- ‫ ــــــــــ‬is uses network resources more efficiently from other, it suffers from variable delays.
B
a) circuit switching b) packet switching c) decentralized d) centralized

14- Topology ‫ ــــــــــ‬Direct fixed links are established among nodes to form a fixed network.
C
a) packet b) Dynamic c) Static d) circuit
 Distributed Systems
15- Connections are established as needed, switching elements are used to establish B
connections among inputs & outputs.
a) Rings b) Dynamic c) Static d) circuit

16- ‫ ــــــــــ‬networks form all connections when the system is designed.

C
a) Rings b) Dynamic c) Static d) circuit

17- ‫ ــــــــــ‬networks are symmetric while linear arrays and mesh networks are not.
D
a) Static b) Dynamic c) circuit d) Rings

18- In a ‫ ــــــــــ‬network, messages must be routed along established links

D
a) Rings b) Dynamic c) circuit d) Static

19- What is the number of links from 1000 to 0101

C
a) 1 b) 2 c) 3 d) 4

20- If Source node is 0100 and Destination node is 1111 the route between them is ‫ــــــــــ‬
B
a) 0110 - 1101 b) 0101 - 0111 c) 0101 - 1101 d) 1100 - 1101

21- What is number of links If Source node is 0000 and Destination node is 0001
B
a) 0 b) 1 c) 2 d) 3

22- What is the maximum number of links that can be reached between a source and a
destination? A
a) 4 b) 5 c) 6 d) 7
 Distributed Systems
Chapter 3
1- Cost of crossbar system can be measured in terms of number of ‫ ــــــــــ‬required inside
crossbar. D
a) switching elements b) cross points c) crossbar d) a & b

2- Each switch point has ‫ ــــــــــ‬to set up transfer path among memory and processor.
C
a) Arbitration logic b) CPU c) control logic d) switches

3- eliminates multiple requests for access to same memory module on predetermined priority
basis. C
a) bus b) CPU c) control logic d) switches

4- Circuit contains ‫ ــــــــــ‬which choose data, address, and control from one CPU for
communication with memory module. A
a) multiplexers b) crossbar c) bus d) switching elements

5- ‫ ــــــــــ‬priority levels to select one CPU when two or more CPUs attempt to access same
memory. B
a) CPU b) Arbitration logic c) control logic d) switches

6- If there are n inputs and m outputs, we will need ‫ ــــــــــ‬switches to realize a crossbar.
A
a) n * m b) n2 c) nm d) n + m

7- Use of ‫ ــــــــــ‬reduces processor memory traffic. All processors communicate with single
shared memory. B
a) Global caches b) local caches c) multiplexers d) single bus

8- ‫ ــــــــــ‬consists of M memory modules, N processors, B buses. given bus is dedicated to

particular processor for duration of bus transaction. C
a) multiplexers b) Single bus c) Multiple Bus d) switches

9- upper input is transferred to upper output and lower input is transferred to lower output.
A
a) Straight b) Exchange c) Upper-broadcast d) Lower-broadcast
 Distributed Systems
10- upper input is transferred to lower output and lower input is transferred to upper output. B
a) Straight b) Exchange c) Upper-broadcast d) Lower-broadcast

11- upper input is broadcast to both upper and lower outputs.

C
a) Straight b) Exchange c) Upper-broadcast d) Lower-broadcast

12- lower input is broadcast to both upper and lower outputs.

D
a) Straight b) Exchange c) Upper-broadcast d) Lower-broadcast

13- Multistage Interconnect Network can be classified into Two types

B
a) True b) False

14- network can connect any idle input to any idle output, regardless of connections already
established across network.
C
B) Rearrangeable
A) Blocking C) Non-Blocking D) Static Networks
Non-Blocking

15- Crossbar is an example of ‫ ــــــــــ‬network.

C
B) Rearrangeable
A) Blocking C) Non-Blocking D) Static Networks
Non-Blocking

16- ‫ ــــــــــ‬network can establish all possible connections between inputs and outputs by
rearranging its existing connections.
B
B) Rearrangeable
A) Blocking C) Non-Blocking D) Static Networks
Non-Blocking

17- ‫ ــــــــــ‬network cannot realize all possible connections between inputs and outputs, because
connection between one free input to another free output is blocked
A
B) Rearrangeable
A) Blocking C) Non-Blocking D) Static Networks
Non-Blocking

18- ‫ ــــــــــ‬is an operating system which tries to maintain a single global view of managed
resources. A
a) DOS b) NOS c) Middleware d) Message passing
 Distributed Systems
19- can be thought as a collection of computers each running their own operating system, work
together to make their own services available to others. B
a) DOS b) NOS c) Middleware d) Message passing

20- It is used for managing multiprocessors and homogeneous multicomputer systems.

A
a) DOS b) NOS c) Middleware d) Message passing

21- It is used for heterogeneous multicomputer systems where local systems are made available
to remote clients. B
a) DOS b) NOS c) Middleware d) Message passing

22- It hides the interfaces of the underlying hardware such that it can be shared by multiple
processes. D
a) DOS b) NOS c) Middleware d) Message passing

23- Not of Types of Network Operating System

C
a) Peer-to-peer b) Client Server c) Middleware d) All

24- ‫ ــــــــــ‬network resources in which each system has same capabilities and responsibilities,
none of systems in is superior to others A
a) Peer To Peer b) Client-Server c) Middleware d) None

25- no master-slave relationship among the systems, all nodes at Network have an equal
relationship with others in ‫ ــــــــــ‬networks B
a) Middleware b) Peer To Peer c) Client-Server d) None

26- is software that extends operating system's services. It allows many components of
distributed approach to interact and handle data. A
a) Middleware b) Peer To Peer c) Client-Server d) None

27- is server-based Network in which storage and processing workload is shared among clients
and servers. C
a) Middleware b) Peer To Peer c) Client-Server d) None
 Distributed Systems
28- allows dispersed programs and services to communicate with one another.
a) Messaging c) Object A
b) RPC middleware d) Content-centric middleware
middleware middleware

29- protocol that allows one application to request service from another program on different
machine or network.
D
a) Middleware for b) Embedded c) Messaging
d) RPC middleware
data middleware middleware

30- allows software components or objects, such as containers, to communicate and interact
with program across distributed networks.
C
a) Messaging c) Object
b) RPC middleware d) Content-centric middleware
middleware middleware

31- delivers client-side requests for specific content, which is analogous to publish/subscribe
middleware such as Apache afka.
D
b) Object c) Middleware for
a) RPC middleware d) Content-centric middleware
middleware data

32- allows direct access to and interaction with databases; it often includes SQL database
software.
A
a) Middleware for b) Embedded c) Messaging
d) RPC middleware
data middleware middleware

33- is a signaling mechanism and a thread that is waiting on a semaphore can be signaled by
another thread. D
a) Loosely Coupled b) Tightly Coupled c) Middleware d) Semaphores

Chapter 4
1- ‫ ــــــــــ‬set of instructions executed in parallel concurrently, connect with each other in order
to solve problem. A
a) Parallel processing b) parallel algorithm c) computing d) Parallelism

2- ‫ ــــــــــ‬Phase is Decomposing computations of assigned problem into small tasks.

C
a) Communication b) Agglomeration c) Partitioning d) Mapping & Scheduling
 Distributed Systems
3- ‫ ــــــــــ‬Phase Enables an appropriate communication structure and algorithms to coordinate
task execution. C
a) Agglomeration b) Partitioning c) Communication d) Mapping & Scheduling

4- In ‫ ــــــــــ‬structure there is link (directly or indirectly) between tasks that require data with
other tasks that possess those data. A
a) channel b) Agglomeration c) Partitioning d) message-passing

5- In ‫ ــــــــــ‬structure, the message is sent and received on these channels.

D
a) channel b) Agglomeration c) Partitioning d) message-passing

6- ‫ ــــــــــ‬is intended to evaluate tasks and required communication with respect to performance
& implementation costs. B
a) Communication b) Agglomeration c) Partitioning d) Mapping & Scheduling

7- ‫ ــــــــــ‬aims to specify where each task has to be executed in which processor, execution
sequence, to minimized execution time. B
a) Agglomeration b) Mapping & Scheduling c) Communication d) Partitioning

8- Performance might be improved by reducing amount of time spent communicating sending

‫ ــــــــــ‬data. A
a) Less b) More c) Same d) Synchronized data

9- Main objective of ‫ ــــــــــ‬is to assign tasks to available processors to precedence requirements

between tasks are satisfied, overall completion time D
a) Synchronized data b) Partitioning c) Agglomeration d) Task scheduling

10- characteristic of a parallel program, task processing times, data dependencies and
synchronization, are known before program execution D
a) deterministic b) nondeterministic c) Static d) A & C

11- Does not require prior information. few assumptions about the parallel program can be made
before execution, scheduling decisions have to be made on the-fly. D
a) Static b) Dynamic c) nondeterministic d) B & C
 Distributed Systems

12- what is the level of F

B
a) 1 b) 2 c) 3 d) 4

13- what is the Number of successors for F

A
a) 1 b) 2 c) 3 d) 4

14- what is the level of e

C
a) 1 b) 2 c) 3 d) 4

15- what is the Number of successors for e

D
a) 1 b) 2 c) 3 d) 4

16- What is the value of time in Gantt Chart table

C
a) 0 to 3 b) 1 to 4 c) 0 to 4 d) 1 to 5

17- The previous drawing shows the optimal cut, Total Communication Cost = ‫ــــــــــ‬, Total Cost
= ‫ــــــــــ‬. B
a) 12, 26 b) 12, 38 c) 38, 12 d) 26, 12
 Distributed Systems

18- The previous drawing shows the cutting, Total Communication Cost = ‫ــــــــــ‬, Total Execution
Cost = ‫ــــــــــ‬. A
a) 38, 20 b) 20, 38 c) 12, 46 d)9, 11

19- deciding which process should be allocated to which processor in parallel and distributed
system. A
a) Process Allocation

20- used to represent data interaction between tasks

C
a) TPG b) TIP c) TIG d) TGI

21- Used to represent precedence relation between tasks

B
a) TIP b) TPG c) TGI d) TIG

22- Main goal of task assignment problem to minimization of ‫ــــــــــ‬

C
a) execution b) communication
c) both d) None
cost/time cost/time

23- How to achieve high level of parallelism. By achieving minimization of ‫ــــــــــ‬

C
a) execution b) communication
c) both d) None
cost/time cost/time

24- When the tasks execute on the same node has ‫ ــــــــــ‬Inter process communication cost
A
a) 0 b) 1 c) 2 d) 3
 Distributed Systems
25- Task interaction graph (TIG) is undirected graph, Task precedence graph (TPG) is directed
graph A
a) True b) False

>> Midterm Solution <<

1- One of these is not a distributed system characteristic
a) concurrency of c) independent D
b) No global clock d) All resources accessible
components failures

2- when tasks occur out of sequence and at different rates, this is called ‫ــــــــــ‬

a) concurrency of b) lack of a global c) independent B

d) All resources accessible
components clock failures

3- Which one is not Examples of Distributed Systems

B
a) hotel reservation b) Wikipedia c) Bitcoin d) Multiplayer games

4- use multiple processors on a single machine to perform multiple tasks simultaneously is

called ‫ــــــــــ‬
B
a) centralized b) parallel c) decentralized
d) distributed system
systems computing systems

5- Message transfer system is used to exchange information between different computer modules
in ‫ــــــــــ‬ A
a) Loosely Coupled b) Tightly Coupled c) A & B d) None

6- ‫ ــــــــــ‬multiprocessor system is also known as a distributed system

A
a) Loosely Coupled b) Tightly Coupled c) A & B d) None

7- ‫ ــــــــــ‬is similar to the current serial computer

A
a) SISD b) SIMD c) MISD d) MIMD

8- MIMD computers with a shared common memory are often referred to as ‫ــــــــــ‬
D
a) SISD b) multicomputer c) MISD d) multiprocessors
 Distributed Systems
9- MIMD with an interconnection network connecting processors are often referred to as ‫ــــــــــ‬
B
a) SISD b) multicomputer c) MISD d) multiprocessors

10- ‫ ــــــــــ‬is one of Distributed memory (passing Message) models.

c) Hypercube D
a) Linear array b) Tree networks d) All
network

11- A path is established prior to the start of communication between a source and destination in
‫ــــــــــ‬
B
c) Dynamic
a) packet switching b) circuit switching d) Linear array
Networks

12- Example of Limited Connection Networks is ‫ــــــــــ‬

D
a) Ring b) 2D Array c) cube d) All

13- In hypercube, the route from node I and j can be found by ‫ ــــــــــ‬the binary address of I and j
C
a) Adding b) Anding c) XOR-ing d) Multiplying

14- Upper input is transferred to upper output and lower input is transferred to lower output in
‫ــــــــــ‬ A
a) Straight SE b) Exchange SE c) Upper-broadcast d) Lower-broadcast

15- A ‫ ــــــــــ‬connect any idle input to any idle output, regardless of the connections already
established across the network.
C
b) Rearrangeable
a) blocking c) Non-blocking d) static networks
non-blocking

16- Omega network is an example of ‫ ــــــــــ‬networks.

A
b) Rearrangeable
a) blocking c) Non-blocking d) static networks
non-blocking

17- ‫ ــــــــــ‬hide the differences between hardware, operating systems, and protocols.
C
a) Loosely Coupled b) Tightly Coupled c) Middleware d) Semaphores
C
 Distributed Systems
18- allows for communication between embedded applications and real-time operating systems.
a) Loosely Coupled b) Tightly Coupled c) Middleware d) Semaphores

19- ‫ ــــــــــ‬phase is intended to evaluate the tasks and the required communication with respect
to the performance and implementation costs. C
a) Partitioning b) Communication c) Agglomeration d) Mapping

20- ‫ ــــــــــ‬phase specify where each task has to be executed in which processor and determine
a sequence for their execution. D
a) Partitioning b) Communication c) Agglomeration d) Mapping

21- task graph is always represented by ‫ــــــــــ‬

B) Undirected
A) Network Graph C) Dag D) Gantt Chart
Network Graph

22- The connectivity of the processing elements can be represented using ‫ــــــــــ‬

B) Undirected A
A) Network Graph C) Dag D) Gantt Chart
Network Graph

23- In the following In-Forest, the priority level of node (a) is ‫ــــــــــ‬
D
a) 1 b) 3 c) 4 d) 5

24- the priority level of node (e) in the pervious graph is ‫ــــــــــ‬
C
a) 1 b) 3 c) 4 d) 5
 Distributed Systems
25- If interval ordered scheduling is applied to pervious graph, priority of (a) is ‫ــــــــــ‬
B
a) 5 b) 9 c) 10 d) 13

26- If interval ordered scheduling is applied to pervious graph, priority of (e) is ‫ــــــــــ‬
A
a) 5 b) 7 c) 9 d) 12

27- ‫ ــــــــــ‬set of m heterogeneous processing elements connected using interconnection

network. C
a) Program tasks b) schedule c) Target machine d) scheduling system

28- few assumptions about the parallel program can be made before execution, scheduling
decisions have to be made on-the-fly in ‫ ــــــــــ‬scheduling. C
a) deterministic b) Static c) Non-Deterministic d) interval schedule

29- ‫ ــــــــــ‬networks are used in the design of high-performance small-scale multiprocessors

D
a) Hypercube b) Multiple bus c) Multistage d) Crossbar

30- ‫ ــــــــــ‬is used for heterogeneous multicomputer systems where local systems are made
available to remote clients. B
a) DOS b) NOS c) Middleware d) Message passing

‫ت ِالِي ُه‬
ُ ِ‫ت َفْردهُ ِعْنَُد َح َاج‬ ُ ْ ‫ت َوَما َحِف َظ‬
ُ ْ ‫ت َوَما َتَعَّلَم‬ ُ َ ‫َّاللهمُ اين ِا ْسَتْوَدَع‬
ُ ْ ‫ك َما َقَرَأ‬
ُ ِ ‫ِاْن‬
‫ك َعِلَّ ُي كلُ ِش ُْئ َقِدَ ُير‬