Font size
WorksheetsCS8603- DS IAT2 MCQ
Total questions: 74
Worksheet time: 46mins
Two events are called Concurrent, if
Time stamps are not equal
Time stamp are Equal
Time stamp are related
None of above
1. When single failure can cause an infinite number of failure, it is
Orphan message
Domino Effect
Livelock
None of these
Restore processes to previous error-free state is known as
Backward Recovery
Forward Recovery
Both A and B
None of these
When stored data cannot be access, it is known as
Communication failure
Secondary storage failure
System Failure
Process failure
A server halts, but is working correctly until it halts.
Crash Failure
Omission Failure
Timing Failure
Response Failure
Fault may be of
Transient Fault
Intermittent Fault
Permanent Fault
All of these
perform operation and, if needs be, perform it again is
Time redundancy
Redundancy
Information Redundancy
None of these
identify the characteristics of processor in distributed system.
They vary in size and function
They are same in size and function
They are manufactured with single purpose
They are real-time devices
Specify the routing technique is used in distributed system.
fixed routing
virtual routing
dynamic routing
all of the mentioned
When a distributed system is able to hide that a printer is being used concurrently by several users, what type of transparency does it provide?
Location transparency
Access transparency
Concurrency transparency
Replication transparency
Two events are called Casually Related, if
Time stamps are not equal
Time stamp are equal
Time stamp are related
None of the Above
Number of message required in Suzuki Kasami algorithm is
3(N-1)
2(N-1)
0 or N
0 or (N-1)
Number of message required in Ricart Agrawala Algorithm is?
3(N-1)
2(N-1)
3vN
N
The ____________________may arise when a process rolls back to its checkpoint after a failure and requests all the other affected processes also to roll back
Rollback
Phantom Effect
Domino Effect
Livelock problem
Point out the wrong statement.
Abstraction enables the key benefit of cloud computing: shared, ubiquitous access
Virtualization assigns a logical name for a physical resource and then provides a pointer to that physical resource when a request is made
All cloud computing applications combine their resources into pools that can be assigned on demand to users
All of the mentioned
In Suzuki Kasmi, When site Si receives a REQUEST(j, n) message, it sets
RNi [j]:= max(RNi [j], n)
RNi [j]:= Min(RNi [j], n)
RNi [j]:= Avg(RNi [j], n)
None of these
The response time is equivalent to
Synchronization Delay + response time
2(Synchronization delay) + Response time
Synchronization delay+ response time/2
None of these
A ---------- message from site Si to site Sj indicates that Si cannot grant Sj ’s request because it has currently granted permission to a site with a higher priority request
Failed
Yield
Enquire
Require
Which of the following is not the approach of deadlock detection
Centralized approach
Distributed approach
Token based approach
Hierarchical approach
The time to execute each step of a process has known upper and lower bounds
Asynchronous
synchronous
Late Response
None of these
1. In the above diagram what we conclude about e11 and e21
e11 || e21
e11=e21
e11≠ e21
None of these
In the diagram conclude about e22 and e13
e13-->e22
e22-->e13
e13=e22
e13≠ e22
25: Utilization rate of resources in an execution model is known to be its
A. Adaptation
B. Efficiency
C. Dependability
D. Flexibility
A server fails to respond to incoming requests
Crash Failure
Omission Failure
Timing Failure
Response Failure
Machines from different subnets cannot communicate
Process Failure
Machine Failure
Network Failure
None of these
bringing back the failed node in step with other nodes in the system is called
Recovery
Fault Tolerance
Masking Failure
None of these
Domino effect is the cause of
Orphan Message
Livelock
Lost message
failed message
2.The capability of a system to adapt the increased service load is called __________
a) scalability
b) tolerance
c) capacity
d) none of the mentioned
3. 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
4.Distributed systems should?
(A) high security
(B) have better resource sharing
(C) better system utilization
(D) low system overhead
5.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
6.What are design issues in distributed system structure ?
(A) Scalability
(B) Fault-tolerance
(C) Flexibility
(D) All of the mentioned
7.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
8.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
9.Which amongst the following is not an advantage of Distributed systems?
(A) Resource sharing
(B) Incremental growth
(C) Reliability
(D) None of the above
13.Which of the following approaches are used to achieve reliable systems?
a) Fault prevention
b) Fault removal
c) Fault tolerance
d) All of the mentioned
18.Which routing technique is used in a distributed system?
a) fixed routing
b) virtual routing
c) dynamic routing
d) all of the mentioned
20.Processes on the remote systems are identified by ___________
a) host ID
b) host name and identifier
c) identifier
d) process ID
The file once created can not be changed is called
immutable file
mutex file
mutable file
none of the mentioned
In distributed systems, link and site failure is detected by
polling
handshaking
token passing
Message passing
1. How does the hardware or software components located at networked computers communicate and coordinate their actions in a distributed system?
Using a global clock
Passing messages
--------------- is a software layer that provides a programming abstraction as well as masking the heterogeneity of the underlying networks, hardware, operating systems and programming languages
(a)
The main motivation for constructing distributed systems is -------------
(a)
TCP and IP
Choose process states
running
ready to run
blocked
stacked
What is the graph used for deadlock identification
resource allocation graph
process allocation graph
thread allocation graph
instance allocation graph
Which of the following condition is required for deadlock to be possible?
mutual exclusion
a process may hold allocated resources while awaiting assignment of other resources
no resource can be forcibly removed from a process holding it
all of the mentioned
If any of the process is waiting for a long time then it is called as
Deadlock
semaphore
starvation
None
Only one thread at a time can use a resource
mutual exclusion
hold and wait
no preemption
CIRCULAR WAIT
A set of process or thread waits for a resource which is held by another waiting process is called
Deadlock
starvation
synchronization
concurrency
Thread holding at least one resource is waiting to acquire additional resources held by other threads are called as
hold and wait
no preemption
circular wait
mutual exclusion
The process of restoring the database to the consistent state that existed before the failure called ...
Rollback
Commit
Transaction
Recovery
Transaction cannot complete due to some internal error condition, is the explanation of ...
System crash
Logical errors
Systems errors
Disk failure
The process of assigning the value of data item X to the local variable xi is ...
read (X)
write (X)
input (X)
output (X)
The process of assigning the value of local variable xi to data item {X} in the buffer block is ...
read (X)
write (X)
input (X)
output (X)
Log based recovery mechanism that allows updates of an uncommitted transaction to be made to the buffer, or the disk itself, before the transaction commits is ...
Concurrent database modification
Deferred database modification
Immediate database modification
Bulk database modification
Technique that can be used to reduce the overhead of searching the log and redoing transactions is ...
checkpointing techniques
concurrent techniques
flashback techniques
save point techniques
What is Mutual Exclusion?
Only one process is
allowed to execute the critical section (CS) at any given time
More than two process is
allowed to execute the critical section (CS) at any given time
All the process can access the shared resources at given time
None of the above
................ is the sole means for implementing
distributed mutual exclusion?
Shared data variables
Control variables
Message Passing
Direct Communication
............... is one of the basic approaches for
implementing distributed mutual exclusion?
Synchronozation Approach
Quorum-based approach
Casual Order
All of the Above
how can measure the system throughput of mutual exclusion algorithm?
Synchronization Delay+Average CS Excution time
1/(Synchronization Delay+Average CS Excution time)
N(N+1)
None of the above
Lamport’s algorithm requires ................. messages per CS invocation?
O(N) messages
M x N no of REQUEST messages
N no of REQUEST messages
3(N-1)
Request Deffered array RD[N] used in which mutual exclusion algorithm?
Lamport's Algorithm
Ricart–Agrawala Algorithm
Maekawa’s algorithm
Suzuki–Kasami’s algorithm
Ricart–Agrawala algorithm requires ................. messages per CS Execution?
2(N-1) messages
(N − 1) messages
3(N - 1) messages
None of the above
when a site Si receives a REQUEST(j, n) message, the request is outdated if...........?
RNi[j] > n.
RNi[j] = n.
Both A and B
None of the above
What is Deadlock?
A set of processes request resources that are held
by other processes in the set.
only one process is allowed to execute
Determines the messaging behavior that can be expected by the distributed program
All of the above
Deadlocks can be dealt with using any one of the following three strategies?
Mutual Exclusion, Synchronization, and Casual Order
Deadlock prevention, deadlock avoidance, and deadlock detection
Ready State, Running State, and Blocked State
None of the above
The state of the system can be modeled by directed
graph is called ..........
acyclic graph
cyclic graph
undirectional graph
wait-for graph (WFG)
A process can request more than one resource simultaneously and the request is satisfied only after all the requested resources are granted to the process.It's called ......... Model
AND Model
OR Model
AND-OR Model
All of the above
A process can make a request for numerous resources
simultaneously and the request is satisfied if any one of the requested resources is granted. It's is called ........ Model
AND Model
OR model
AND - OR Model
None of the above
Periodically saving the state of a process during the failure-free execution. The saved state is called ........
Rollback Recovery
Fault tolerance
Both A and B
Checkpoint
The procedure of restarting from a previously checkpointed state is called..........
Checkpoint
Rollback recovery
Deadlock Detection
Both Checkpoint and Rollback Recovery
What is Orphan messages?
Messages with receive recorded but message send not recorded
Both Message receive and message send recorded
Both Message receive and message send are not recorded
None of the above
