KKR & KSR INSTITUTE OF TECHNOLOGY AND SCIENCES
(AUTONOMOUS)
(Approved by AICTE, New Delhi, Affiliated to JNTUK Kakinada, Accredited by NBA and by NAAC –‘A’ Grade
B.Tech. IV Year I Sem. Regulation: R20
Date:
CSE Sections: ALL Academic Year:2024 -25
Question bank for Descriptive Test - II
Sub Code: 20CS7E06 Sub: DISTRIBUTED SYSTEMS
Answer all of the following Questions
Unit – III
Q. No. Question M CO LL PI’S
List the advantages and disadvantages of kernel level process and 8 C412.3 L2 5.3.1
1
user level process.?
Describe the process of creation of a new process along with the 8 C412.3 L3 5.1.2
2
process life cycle.
What is the need for protection? Explain various protection 8 C412.3 L3 6.1.1
3
mechanisms supported by operating systems.
4 With a neat diagram explain the layers of the operating system? 8 C412.3 L2 5.2.2
5 Demonstrate the architecture for multi-threaded servers. 8 C412.3 L2 2.3.1
List the issues related to thread programming, thread lifetime, C412.3
6 8 L3 2.2.2
thread synchronization, scheduling and implementation.
Unit - IV
Q. No. Question M CO LL PI’S
What are the non-functional requirements that peer-to-peer 8 C412.4 L2 1.3.1
a)
1 middleware must address.
b) Explain in detail about multicast communication? 8 C412.4 L2 3.1.6
a) Explain file service architecture with examples? 8 C412.4 L2 3.2.2
2 Discuss the Napster and its legacy with respect to distributed 8 C412.4 L3 3.2.2
b)
file systems.
Explain about overlay routing? Explain how it useful in peer 8 C412.4
a) L3 3.2.3
3 communication
b) What is the goal of an election algorithm? Explain it detail. 8 C412.4 L4 3.1.5
Explain how mutual exclusion is handled in distributed 8 C412.4 L3 3.3.1
a)
4 system.
b) What is distributed deadlock? Explain with example. 8 C412.4 L2 3.3.2
a) Explain concurrency control in distributed transaction 8 C412.4 L3 3.2.2
5 What is transaction recovery in distributed system? How can 8 C412.4 L3 3.4.1
b)
it be done?
What is replication? Explain about Active and Passive 8 C412.4 L2 3.1.1
a)
replications
6
What is transaction? Briefly explain about flat and nested 8 C412.4 L4 3.4.1
b)
distributed transactions.
Unit - V
Q. No. Question M CO LL PI’S
a) Explain Suzuki-Kasami’s Broadcast Algorithm in detail. 8 C412.5 L3 4.3.4
1
b) Explain the models of DEADLOCKS. 8 C412.5 L3 4.3.1
Explain system model for Deadlock detection in distributed 8 C412.5 L2 7.1.1
2 a)
systems.
Write a short notes on Deadlock Handling Strategies, Issues 8 C412.5 L2 7.2.2
b)
in deadlock Detection.
Examine Lamport’s snapshot recording algorithm for C412.5 L2 4.1.2
a) 8
3 determining the global states of distributed systems?
b) Explain MaeKawa’s voting algorithm in detail. 8 C412.5 L2 4.1.3
a) Explain Ricart-Agrawala Algorithm in detail. 8 C412.5 L2 4.1.2
4 Discuss KNAPP’S classification of distributed deadlock C412.5 L3 3.3.1
b) 8
detection algorithms in detail.
a) Write about the Local and Global Wait-for graphs. 8 C412.5 L4 5.3.1
What are the requirements for mutual exclusion in C412.5 L5 5.2.2
5 Distributed systems? Explain about various metrics used for
b) 8
evaluating the performance of mutual exclusion algorithms
in Distributed systems.
a) Explain algorithm for single resource model? 8 C412.5 L3 5.2.2
6
b) Distinguish about AND model and OR Model? 8 C412.5 L2 2.2.3
Course Coordinator Module Co-ordinator Programme Coordinator
Coordinator IQAC
