64251-mt----distributed Computing
This document was uploaded by user and they confirmed that they have the permission to share it. If you are author or own the copyright of this book, please report to us by using this DMCA report form. Report DMCA
Overview
Download & View 64251-mt----distributed Computing as PDF for free.
More details
- Words: 167
- Pages: 1
NR
Code No: 64251/MT
M.Tech. – II Semester Regular Examinations, September, 2008 DISTRIBUTED COMPUTING (Web Technologies) Time: 3hours
Max. Marks:60 Answer any FIVE questions All questions carry equal marks ---
1.a) b)
Give a brief discription of workstation clusters. Explain, some broadcast operations and their time complexity.
2.a) b)
Discuss, divide-and-conquer method with example. Write about partitioning strategies.
3.
Develop a pipeline solution to compute sin θ according to sin θ =θ −
θ3 θ5 θ7 θ9 3!
+
5!
+
7!
+
9!
A series of values are input θ 0 ,θ1 ,θ 2 ,θ 3 ........ 4.a) With the aid of sketches, explain the butterfly barrier. b) How the deadlock will eliminate in a pair of processes transmission. 5.a) Explain the ring termination algorithm. b) What are the two single source shartest-path algorithms and explain any one 6.a) b)
Write a algorithm for matrix multiplication. Explain about merge sort.
7.
Discuss, in detail, about numerical integration.
8.a) b)
Explain about Fox’s algorithm Explain MPI-COMM-SPLIT. ^^^
Code No: 64251/MT
M.Tech. – II Semester Regular Examinations, September, 2008 DISTRIBUTED COMPUTING (Web Technologies) Time: 3hours
Max. Marks:60 Answer any FIVE questions All questions carry equal marks ---
1.a) b)
Give a brief discription of workstation clusters. Explain, some broadcast operations and their time complexity.
2.a) b)
Discuss, divide-and-conquer method with example. Write about partitioning strategies.
3.
Develop a pipeline solution to compute sin θ according to sin θ =θ −
θ3 θ5 θ7 θ9 3!
+
5!
+
7!
+
9!
A series of values are input θ 0 ,θ1 ,θ 2 ,θ 3 ........ 4.a) With the aid of sketches, explain the butterfly barrier. b) How the deadlock will eliminate in a pair of processes transmission. 5.a) Explain the ring termination algorithm. b) What are the two single source shartest-path algorithms and explain any one 6.a) b)
Write a algorithm for matrix multiplication. Explain about merge sort.
7.
Discuss, in detail, about numerical integration.
8.a) b)
Explain about Fox’s algorithm Explain MPI-COMM-SPLIT. ^^^
Related Documents
Computing
October 2019 42
Computing
May 2020 20
High Performance Computing Cloud Computing
June 2020 16
Quantum Computing
November 2019 23
Green Computing
November 2019 21
Computing Cpt1
October 2019 27More Documents from "Sonu Rai"
Rr321405-automobile-engineering
October 2019 7
R05010802-physical-chemistry
October 2019 11
Rr10102-mathematics-i
October 2019 9
Rar05321701-data-and-computer-communications-set1
October 2019 12
R05221301-electrical-and-electronic-measurements
October 2019 16