Scribd
Upload
76 views1 page

CS3551 - Distributed Computing IA1 QP

This document outlines the structure of the Internal Assessment Examination for the B.Tech course in Artificial Intelligence and Data Science, specifically for the subject of Distributed Computing. It includes details about the exam format, marking scheme, and a list of questions divided into two parts, covering topics such as distributed systems, algorithms, and communication primitives. The examination is scheduled for October 2024 and is prepared by Mr. V. Sathesh Kumar and approved by the HOD of AIDS.

Uploaded by

rlogeshwaran280
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
76 views1 page

CS3551 - Distributed Computing IA1 QP

This document outlines the structure of the Internal Assessment Examination for the B.Tech course in Artificial Intelligence and Data Science, specifically for the subject of Distributed Computing. It includes details about the exam format, marking scheme, and a list of questions divided into two parts, covering topics such as distributed systems, algorithms, and communication primitives. The examination is scheduled for October 2024 and is prepared by Mr. V. Sathesh Kumar and approved by the HOD of AIDS.

Uploaded by

rlogeshwaran280
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Register No.

INTERNAL ASSESMENT EXAMINATION – I, October 2024


COURSE: [Link] – ARTIFICIAL INTELLIGENCE AND DATA SCIENCE
SUB: CS3551 & DISTRIBUTED COMPUTING
Class & Semester: III Year & V Date: (FN)
Duration: 1.5Hrs Maximum: 50 Marks
PART – A (7 x 2 = 14 Marks)

[Link]. ANSWER ALL QUESTIONS Marks CO BTL


Marks)
1 What is a distributed system? 2 CO1 Re (K1)
2 Identify the features of distributed systems? 2 CO1 Cr (K3)
3 What are the three types of parallel systems. 2 CO1 An (K6)
4 Compare the hierarchy of execution classes? 2 CO2 Re (K1)
5 What is NTP? 2 CO2 Cr (K4)
6 Identify the two design issues for suzuki–kasami’s.? 2 CO3 An (K1)
7 List the three types of messages for Deadlock handling. 2 CO3 Re (K1)

PART – B (3 x 12 = 36 Marks)
[Link]. ANSWER ALL QUESTIONS Marks CO BTL
8 a. Identify the key algorithmic challenges in distributed computing. 12 CO1 An(K4)
Or
b. Summarize the primitives for distributed communication. 12 CO1 Re(K2)
9 a. Explain in detail about the distributed algorithm to implement total order and 12 CO2 An(K4)
causal order of messages.
Or
b Explain the channels to simulate an execution using asynchronous primitives
12 CO2 Re(K5)
on a synchronous system.
10.a Explain in detail about Lamport‘s algorithm
12 CO3 Cr(K4)
Or
b. Explain Ricart-Agrawala algorithm with required pseudocode. 12 CO3 An(K2)

Prepared by
Teaching Coordinator/ Approved by
Mr. V. SATHESH KUMAR
IQAC Coordinator HOD– AIDS
AP/AIDS

You might also like