INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

Similar documents
PART B UNIT II COMMUNICATION IN DISTRIBUTED SYSTEM PART A


Distributed Systems Question Bank UNIT 1 Chapter 1 1. Define distributed systems. What are the significant issues of the distributed systems?

DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK. UNIT I PART A (2 marks)

INSTITUTE OF AERONAUTICAL ENGINEERING

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

INSTITUTE OF AERONAUTICAL ENGINEERING

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

St. MARTIN S ENGINEERING COLLEGE Dhulapally,Secunderabad DEPARTMENT OF INFORMATION TECHNOLOGY Academic year

Homework #2 Nathan Balon CIS 578 October 31, 2004

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

DISTRIBUTED SYSTEMS. Second Edition. Andrew S. Tanenbaum Maarten Van Steen. Vrije Universiteit Amsterdam, 7'he Netherlands PEARSON.

Lecture 06: Distributed Object

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

Lecture 5: Object Interaction: RMI and RPC

Distributed Objects and Remote Invocation. Programming Models for Distributed Applications

INSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad COMPUTER SCIENCE AND ENGINEERING QUESTION BANK OPERATING SYSTEMS

MODELS OF DISTRIBUTED SYSTEMS

MLR INSTITUTE OF TECHNOLOGY DUNDIGAL , HYDERABAD QUESTION BANK

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

INSTITUTE OF AERONAUTICAL ENGINEERING (AUTONOMOUS)

Synchronization. Chapter 5

SIR C.R.REDDY COLLEGE OF ENGINEERING, ELURU DEPARTMENT OF INFORMATION TECHNOLOGY LESSON PLAN

MODELS OF DISTRIBUTED SYSTEMS

INSTITUTE OF AERONAUTICAL ENGINEERING

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING UNIT-1

INSTITUTE OF AERONAUTICAL ENGINEERING Autonomous Dundigal, Hyderabad

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

CHAPTER - 4 REMOTE COMMUNICATION

03 Remote invoaction. Request-reply RPC. Coulouris 5 Birrel_Nelson_84.pdf RMI

VALLIAMMAI ENGINEERING COLLEGE

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

Synchronization. Clock Synchronization

Concurrent & Distributed Systems Supervision Exercises

Distributed Systems Exam 1 Review Paul Krzyzanowski. Rutgers University. Fall 2016

Java RMI Middleware Project

ST.MARTIN'S ENGINEERING COLLEGE Dhulapally,Secunderabad-014

Distributed Systems Conclusions & Exam. Brian Nielsen

RMI: Design & Implementation

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad


INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

Exam 2 Review. Fall 2011

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

Chapter 1: Distributed Systems: What is a distributed system? Fall 2013

Distributed Systems. coordination Johan Montelius ID2201. Distributed Systems ID2201

COMMUNICATION IN DISTRIBUTED SYSTEMS

INSTITUTE OF AERONAUTICAL ENGINEERING

Distributed Systems COMP 212. Revision 2 Othon Michail

Curriculum 2013 Knowledge Units Pertaining to PDC

Parallel and Distributed Systems. Programming Models. Why Parallel or Distributed Computing? What is a parallel computer?

Chapter 5: Remote Invocation. Copyright 2015 Prof. Amr El-Kadi

Structured communication (Remote invocation)

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

Distributed Systems. The main method of distributed object communication is with remote method invocation

SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR

2 Copyright 2015 M. E. Kabay. All rights reserved. 4 Copyright 2015 M. E. Kabay. All rights reserved.

Remote Invocation. 1. Introduction 2. Remote Method Invocation (RMI) 3. RMI Invocation Semantics

Distributed Systems Conclusions & Exam. Brian Nielsen

Remote Invocation. Today. Next time. l Overlay networks and P2P. l Request-reply, RPC, RMI

CSci Introduction to Distributed Systems. Communication: RPC

Remote Procedure Call

416 practice questions (PQs)

Outline. EEC-681/781 Distributed Computing Systems. The OSI Network Architecture. Inter-Process Communications (IPC) Lecture 4

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

Distributed Systems Exam 1 Review. Paul Krzyzanowski. Rutgers University. Fall 2016

CS 403/534 Distributed Systems Midterm April 29, 2004

Fault Tolerance Part I. CS403/534 Distributed Systems Erkay Savas Sabanci University

Middleware. Adapted from Alonso, Casati, Kuno, Machiraju Web Services Springer 2004

FACULTY OF SCIENCE AND HUMANITIES

CSE 486/586: Distributed Systems

02 - Distributed Systems

CLOUD-SCALE FILE SYSTEMS

Operating System Support

TUTORIAL QUESTION BANK

02 - Distributed Systems

416 Distributed Systems. RPC Day 2 Jan 11, 2017

15-440/15-640: Homework 1 Due: September 23, :59pm

Communication Paradigms

Announcements. me your survey: See the Announcements page. Today. Reading. Take a break around 10:15am. Ack: Some figures are from Coulouris

Control. CS432: Distributed Systems Spring 2017

Dep. Systems Requirements

Advanced Distributed Systems

Distributed Systems 11. Consensus. Paul Krzyzanowski

Chapter 5: Distributed objects and remote invocation

COMMUNICATION PROTOCOLS: REMOTE PROCEDURE CALL (RPC)

A Report on RMI and RPC Submitted by Sudharshan Reddy B

Chapter 11: Implementing File-Systems

Distributed Systems (5DV147)

Software Paradigms (Lesson 10) Selected Topics in Software Architecture

Distributed Systems. Chapman & Hall/CRC. «H Taylor S* Francis Croup Boca Raton London New York

Q.1. (a) [4 marks] List and briefly explain four reasons why resource sharing is beneficial.

Frequently asked questions from the previous class survey

CS455: Introduction to Distributed Systems [Spring 2018] Dept. Of Computer Science, Colorado State University

Last Class: Clock Synchronization. Today: More Canonical Problems

Process. Program Vs. process. During execution, the process may be in one of the following states

NAME: STUDENT ID: MIDTERM 235 POINTS. Closed book, closed notes 70 minutes

Kingdom of Saudi Arabia Ministry of Higher Education College of Computer & Information Sciences Majmaah University. Course Profile

Transcription:

Course Name Course Code Class Branch INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad -500 043 COMPUTER SCIENCE AND ENGINEERING TUTORIAL QUESTION BANK 2015-2016 : DISTRIBUTED SYSTEMS : A60521 : III B. Tech II Semester : Computer Science and Engineering Year : 2015 2016 Course Faculty : Mr. P.Krishna Kishore Assistant Professor Mr. B.Surendra Reddy Assistant Professor OBJECTIVES To meet the challenge of ensuring excellence in engineering education, the issue of quality needs to be addressed, debated and taken forward in a systematic manner. Accreditation is the principal means of quality assurance in higher education. The major emphasis of accreditation process is to measure the outcomes of the program that is being accredited. In line with this, Faculty of Institute of Aeronautical Engineering, Hyderabad has taken a lead in incorporating philosophy of outcome based education in the process of problem solving and career development. So, all students of the institute should understand the depth and approach of course to be taught through this question bank, which will enhance learner s learning process. PART A (SHORT ANSWER QUESTIONS) UNIT I 1 Define distributed system? Knowledge 1 2 Define the properties of the distributed system? Knowledge 2 3 Define effective resource sharing? Knowledge 2 4 List the examples of the distributed systems? Knowledge 4 5 State the challenges of the distributed systems? Knowledge 7 6 Define distributed client and distributed server? Knowledge 3 7 Give some reasons why centralized systems are not adequate to modern computing? 8 Compute architectural and fundamental models? 9 Define interaction model? Knowledge 3 10 Describe failure model? Knowledge 3 11 Explain transparency and its types? 12 Define synchronous and asynchronous distributed systems? Knowledge 2 1 P a g e

13 Define omission failure? Knowledge 1 14 Define arbitrary failure? Knowledge 1 15 Define masking failure? Knowledge 3 16 Describe how failure handling in distributed system? Knowledge 3 17 What is meant by byzantine failure? Understand 7 18 Define types of failures? Knowledge 7 19 List the design requirements for distributed architectures? Knowledge 7 20 List the services provided by multiple servers, proxy servers, peer processes? Knowledge 7 UNIT II 1 Describe lamport logical clock? Knowledge 5 2 Describe events and process states? Knowledge 5 3 Define physical clock? Knowledge 6 4 Define logical time? Knowledge 5 5 Define logical clocks? Knowledge 5 6 Differentiate between election algorithm and mutual exclusion algorithms? 7 Describe the network time protocol? Knowledge 5 8 Explain distributed garbage collection? 9 Define vector clocks? Knowledge 5 10 Define global states? Knowledge 5 11 Explain distributed deadlock detection? 12 Explain distributed termination detection? 13 Define consistent cut? Knowledge 3 14 Define inconsistent cut? Knowledge 5 15 Demonstrate snapshot algorithm? 16 Define the termination of the snapshot algorithm? Knowledge 3 17 Define distributed debugging? Knowledge 5 18 List consistent global states? Knowledge 5 19 Define bully algorithm? Knowledge 5 20 Define the definition of the critical section? Knowledge 8 UNIT III 1 Define the uses of UDP? Knowledge 5 2 Explain TCP Stream communication? 3 List the issues related to the stream communication? Knowledge 8 4 Define data marshalling? Knowledge 7 5 Define data representation? Knowledge 5 6 Define CORBA? Knowledge 5 7 Explain request-reply protocols? 8 Demonstrate IP multicast? 9 Define some examples of the effects of reliability and ordering? Knowledge 8 10 Explain data gram communication in UNIX? Understand 8 11 Define types of network? Knowledge 5 2 P a g e

12 Define network principles? Knowledge 8 13 Define internet protocols? Knowledge 8 14 State client-server communication? Knowledge 8 15 Define group communication? Knowledge 8 16 Define RMI? Knowledge 8 17 Define RPC? Knowledge 8 18 Define socket? Knowledge 8 19 List the differences between TCP and UDP? Knowledge 8 20 Distinguish synchronous and asynchronous communication? Understand 8,9 UNIT IV 1 State distributed file system requirements? Knowledge 10 2 Write the types of the transparency? Understand 10 3 List the differences between global name service and x.500 directory Knowledge 10 service? 4 Define consistency and efficiency? Knowledge 10 5 Differentiate between Andrew file system and sun network file system? Understand 10 6 Define client integration in the SUN network file system? Knowledge 10 7 Define virtual file system? Knowledge 10 8 Define mount service? Knowledge 10 9 Explain cache consistency in Andrew file system? Understand 10 10 Explain other aspects in the Andrew file system? Understand 10 11 Define the definition of the domain name service? Knowledge 3 12 Define directory? Knowledge 5 13 Define global name service? Knowledge 5 14 Demonstrate the importance of the name services in the distributed system? 15 Define name resolution? Knowledge 8 16 Explain name service requirements? 17 Define name space? Knowledge 10 18 Explain the aliasing concept? 19 Explain name resolution? 20 List the directory services? Knowledge 3 UNIT V 1 Define transaction recovery? Knowledge 12 2 Compare the flat and nested distributed transactions? Understand 12 3 Define the properties of transactions? Knowledge 12 4 Define the types of locks? Knowledge 12 5 Define 2PL? Knowledge 12 6 Define shrinking and growing phase? Knowledge 12 7 Define time stamp ordering? Knowledge 12 8 List the methods of the concurrency control? Knowledge 12 9 Explain nested transactions? Understand 12 3 P a g e

10 Define how the transactions are executed? Knowledge 12 11 Define deadlock? Knowledge 3 12 Define atomic commit protocols? Knowledge 5 13 Define distributed deadlock? Knowledge 8 14 Explain concurrency control in distributed transactions? 15 Define nested transactions? Knowledge 7 16 Explain deadlock detection? 17 Explain deadlock recovery? 18 Define wait-for-graph? Knowledge 5 19 Define phantom deadlocks? Knowledge 5 20 Explain recovery of nested transactions? Understand 1 PART B (LONGANSWER QUESTIONS) S. No Question UNIT - I Blooms 1 Discuss the challenges of the distributed systems with their examples? Understand 1 2 Differentiate between centralized systems and the distributed systems with a suitable example? 3 Discuss the applications of the distributed systems? Understand 7 4 Explain resource sharing in the distributed systems? Understand 7 5 Explain world wide web in a detail manner? Understand 7 6 Illustrate with an example how resources are shared in the distributed Understand 7 systems and explain how it is not possible in the centralized systems? 7 Describe features of the distributed systems and also examples of the Understand 7 distributed systems? 8 Discuss how distributed systems are more scalable than the centralized systems? 9 Explain failure handling and transparency? 10 Describe the definition of the distributed systems and effective resource sharing and explain them clearly? 11 Differentiate between centralized and distributed systems with atleast 15 differences? apply 7 12 Illustrate with an example how distributed plays a keen role in real world and support your answer? 13 Explain how events are ordering in an distributed systems and list all the types of an fundamental model? 14 Explain how reliability is achieved in one to one communication and explain in detail? 15 Explain briefly how threats are defeated in security of the distributed systems? 16 Discuss any five types of hardware resources and five types of data or software resource that can usefully be shared? 17 Describe the advantages and disadvantages of the HTML,URL&HTTP as core technologies for information browsing? Understand 7 apply 7 4 P a g e

18 List the three main components of the URL, stating how their boundaries Knowledge 12 are denoted and illustrating each one from your example? 19 Describe and illustrate the client server architecture of one or more major apply 7 internet applications? 20 Differentiate between buffering and caching? UNIT II 1 Explain clocks, events and process states? 2 Explain how synchronizing physical clocks? 3 Discuss the lamport logical clocks and logical time? 4 Describe distribute debugging? 5 Explain global states in detail? 6 Explain the snapshot algorithm of chandy and lamport? 7 Differentiate all the type of the multicast communication? Understand 8,9 8 Discuss the termination procedure of the snapshot algorithm with an example? 9 Explain how consistent global states are observing in distributed debugging process? 10 Evaluate possibly o and evaluating definitely o in distributed debugging process? 11 Explain why computer clock synchronization is necessary? Describe the design requirements for a system to synchronize the clocks in distributed systems? 12 Discuss the factors to be taken into account when deciding to which NTP server a client should synchronize its clock? 13 Discuss how it is possible to compensate for clock drift between synchronization points by observing the drift rate over time? 14 Explain clearly if all clients processes are single threaded, is mutual exclusion condition ME3, which specifies entry in happened-before order, relevant? 15 Explain why the algorithm for reliable multicast over IP multicast does not work for open groups. Given any algorithms for closed groups, how, simply, can we derive an algorithm for open groups? 16 Explain clearly how to adapt the bully algorithm to deal with temporary network partition and slow processes? 17 Explain clearly how to adapt the casually ordered multicast protocol to handle overlapping groups? 18 Define a solution to reliable, totally ordered multicast in a synchronous system, using a reliable multicast and a solution to the consensus problems? 19 Explain how that the byzantine agreement can be reached for the three generals, with one of them faulty, if the generals digitally signed their messages? 20 Illustrate an example execution of the ring-based algorithm to show that processes are not necessarily granted entry to the critical section in happened-before order? Remember 5 Knowledge 5 Understand 7 UNIT - III 1 Explain the API for the internet protocols in IPC? Apply 8 2 Explain UDP datagram communication in detail? Apply 8 3 Explain TCP stream communication in detail? Apply 8 4 Explain in detail about external data and marshalling? Understand 8 5 Explain client-server communication in detail? Understand 8 6 Explain group communication in detail? Understand 8 5 P a g e

7 Explain IP multicast in group communication? Understand 8 8 Explain reliability and ordering of multicast in group communication? Understand 8 9 Explain the two alternative approaches in the data representation and Understand 8 marshalling? 10 Describe the inter process communication in Unix with an example? Understand 9 11 Discuss the invocation semantics that can be achieved when the requestreply protocol is implemented over a TCP/IP connection, which guarantees that data is delivered in the order sent, without loss or duplication. Take into account all of the conditions causing a connection to be broken? 12 Define he interface to the election service in the CORBA IDL, and JAVA Knowledge 5 RMI. Note that CORBA IDL provides type long for 32-bit integers. Compare the methods in the two languages for specifying input and output arguments? 13 Explain how to use the java reflection to construct a generic dispatcher. Understand 8 Give java code for a dispatcher whose signature is: Public void dispatch(object target, amethod, byte[ ]args) 14 Define a remote object table that can support garbage collection as well as Knowledge 5 translating between local and remote object references? 15 Explain how a forwarding observer may be used to enhance the reliability Understand 8 and performance of the objects interest in an even service? 16 Explain how RMI is implemented? Understand 8 17 Explain RPC and its case studies in a detail manner? Understand 8 18 Define event and notifications and explain simple dealing room system? Knowledge 5 19 Explain jini distributed event specification with detail manner? Understand 8 20 Discuss in detail about java rmi case study? 6 P a g e UNIT IV 1 Explain file service architecture in detail? Apply 11 2 Explain sun network file system? Apply 10 3 Describe in detail about Andrew file system? Understand 10 4 Write about the recent advances in the distributed file systems? Apply 10 5 Explain the characteristics and distributed file system requirements? Apply 11 6 Describe basic distributed file system and storage systems and their Understand 11 properties? 7 Explain distributed file system with any two examples? Apply 11 8 Differentiate sun network file systems and Andrew file systems? Apply 11 9 Explain the implementation of the Andrew file systems? Apply 11 10 Explain NFS architecture of the sun network file systems? Apply 11 11 Explain name services and the domain name systems? Apply 11 12 Explain directory and discovery services? Apply 11 13 Discuss about global name service in detail? 14 Describe the X.500 directory service in detail? 15 Demonstrate the domain name system? 16 Explain the design and implementation issues of distributed shared Apply 11 memory? 17 Explain sequential consistency and Ivy in detail? Apply 11 18 Explain release consistency with an example? Apply 11 19 Discuss in detail about Munin? 20 Write a note on all consistency models? Apply 11

UNIT V 1 State and explain simple synchronization and failure model for Remember 12 transactions? 2 Explain transactions and their properties in detail? Apply 12 3 Write a brief note on nested transactions? Apply 12 4 Write a brief note on locks and its types? Apply 12 5 Explain about deadlocks in detail? Apply 12 6 Differentiate the methods for concurrency control? Understand 12 7 Explain about optimistic concurrency control? Apply 12 8 Explain about time stamp ordering? Apply 12 9 Explain flat and nested transactions with a neat sketch? Apply 12 10 Explain atomic commit protocols? Apply 12 11 Explain how transactions are recovered in distributed systems? 12 Describe how a non-recoverable situation could arise if write locks are released after the last operation of a transaction but before its commitments? 13 Explain why executions are always strict, even if read locks are released after the last operation of a transaction but before its commitments? 14 Explain how the two-phase commit protocol for nested transactions ensures that if the top-level transaction commits, all the right descendents are committed or aborted? 15 Explain with an example how two transactions are interleaved which are serially equivalent at each server but is not serially equivalent globally? 16 Describe how the actions of the 2-phase commit protocol relate to the concurrency control actions of each individual server, how does distributed deadlock detection fit in(assume in strict two-phase locking)? 17 Discuss the edge-chasing algorithm. Give examples to show that it could detect phantom deadlocks? 18 Explain how locks are released and acquired with a neat example? 19 Define deadlock? And explain how deadlocks are occurred and recovered in Knowledge 5 the distributed systems? 20 Differentiate all the types of the concurrency control mechanisms? Understand 12 PART C (PROBLEM SOLVING AND CRITICAL THINKING QUESTIONS) UNIT I 1 Describe the types of the system models and their types in a detail manner? Understand 4 2 Explain why architecture model is important for distributed systems? Understand 4 3 Explain fundamental model in detail? Understand 4 4 Explain system architectures in distributed systems? Apply 7 5 Demonstrate the design requirements for distributed architectures? Understand 7 6 Describe all the types of the fundamental models? Apply 7 7 Differentiate interaction model, security model, failure model? Understand 7 8 Illustrate the client-server architecture of one or more major internet applications? 9 Explain the types of the failures that may normally happen in distributed systems? Understand 7 Apply 7 7 P a g e

10 Explain how events are ordering in real-time with neat sketch? Understand 4 UNIT II 1 2 3 Explain Network Time Protocol in detail? Differentiate failure assumptions and failure detectors? 5 Understand Explain distributed mutual exclusion in detail? 4 Discuss in detail about the algorithms of the mutual exclusion? 5 Define critical section and mutual exclusion and explain its algorithms? 6 Explain how election is done when any particular system crashes? 7 Briefly discuss the types of the election algorithms with a neat sketch? 8 Discuss in detail about the multicast communication? 9 Explain different kinds of problems that are associated with the coordination and agreement in distributed systems? 10 Discuss in detail about consensus and related problems in coordination and agreement? UNIT III 1 Discuss about the communication between distributed objects in RMI? Understand 8 2 Explain distributed object model and also discuss the design issues of RMI? Understand 8 3 Explain the implementation of the RMI and distributed garbage collection? Understand 8 4 Explain RPC with a neat example? Apply 8 5 Describe events and its types and explain notifications in the remote Understand 9 invocation? 6 Discuss about jinni distributed event specification? Understand 9 7 Explain Java RMI and its procedures? Apply 9 8 Explain how java RMI builds the client and server programs? Apply 9 9 Describe the design implementation of java RMI? Understand 10 Explain Sun RPC in detail? Understand 9 11 Explain distributed object model and also discuss the design issues of RMI? Understand 10 12 Explain the implementation of the RMI and distributed garbage collection? Understand 10 13 Explain RPC with a neat example? Understand 10 9 8 P a g e

14 Describe events and its types and explain notifications in the remote invocation? Understand 10 15 Discuss about jinni distributed event specification? Understand 11 16 Explain Java RMI and its procedures? Understand 11 17 Explain how java RMI builds the client and server programs? Understand 11 18 Describe the design implementation of java RMI? Understand 11 29 Explain Sun RPC in detail? Understand 10 20 Discuss about the communication between distributed objects in RMI? Understand 10 UNIT V 1 Explain two phase commit protocols for nested transactions? Remember 12 2 Explain concurrency control in distributed transactions? Understand 12 3 Write a brief note on distributed deadlocks? Understand 12 4 Explain the transaction recovery procedure in distributed transactions? Understand 12 5 Explain the recovery of the two- phase commit protocol in distributed Remember 12 transactions? 6 Explain in detail about the three- phase locking? Remember 12 7 Distinguish between three phase commit and two phase commit protocol? Remember 12 8 Explain with an example of the interleaving of two transactions that is Remember 12 serially equivalent at each server but is not serially equivalent globally? 9 Explain how the tow-phase commit protocol for nested transactions ensures Remember 12 that if the top-level transaction commits, all the right descendants are committed or aborted? 10 Distinguish all the locking protocols in distributed transactions? Understand 12 HOD, COMPUTER SCIENCE AND ENGINEERING 9 P a g e