Scribd
Upload
41 views4 pages

HT TP: //qpa Pe R.W But .Ac .In: 2010-11 Parallel Programming

This document appears to be an exam paper containing questions related to parallel programming and algorithms. It includes: 1) 10 multiple choice questions worth 1 mark each on topics like Amdahl's law, supercomputers, synchronizing techniques, parallel programming languages, and time complexities of algorithms. 2) 3 short answer questions worth 5 marks each asking to explain block matrix multiplication, algorithm cost and Brent's law, and loop carried dependency. 3) 3 long answer questions worth 15 marks each asking to write PRAM algorithms for graph coloring and Gaussian elimination including time analysis, describe hypertree networks and compare to other topologies, and write an odd-even transposition sort algorithm. 4) 5

Uploaded by

arabindo
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
41 views4 pages

HT TP: //qpa Pe R.W But .Ac .In: 2010-11 Parallel Programming

This document appears to be an exam paper containing questions related to parallel programming and algorithms. It includes: 1) 10 multiple choice questions worth 1 mark each on topics like Amdahl's law, supercomputers, synchronizing techniques, parallel programming languages, and time complexities of algorithms. 2) 3 short answer questions worth 5 marks each asking to explain block matrix multiplication, algorithm cost and Brent's law, and loop carried dependency. 3) 3 long answer questions worth 15 marks each asking to write PRAM algorithms for graph coloring and Gaussian elimination including time analysis, describe hypertree networks and compare to other topologies, and write an odd-even transposition sort algorithm. 4) 5

Uploaded by

arabindo
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
You are on page 1/ 4

Name : ……………………………………………………………

htt
Roll No. : …………………………………………………………

Invigilator's Signature : ………………………………………..


CS/B.Tech(CSE)/SEM-7/CS-704C/2010-11
p:/
2010-11
PARALLEL PROGRAMMING
Time Allotted : 3 Hours Full Marks : 70
/q
The figures in the margin indicate full marks.
Candidates are required to give their answers in their own words
pap

as far as practicable.

GROUP – A
( Multiple Choice Type Questions )
1. Choose the correct alternatives for the following : 10 × 1 = 10
er.

i) Amdahl's law is about

a) lower limit on speed up


wb

b) upper limit on speed up

c) uncertainty limit on speed up

d) none of these.
ut .

ii) Super computer can solve

a) all high computation problems in a very high speed


a c.

b) all NP complete problems in polynomial time

c) all NP hard problems in polynomial time


in

d) all of these.

7403 [ Turn over


CS/B.Tech(CSE)/SEM-7/CS-704C/2010-11

iii) Which of the following is not a synchronizing


technique ?
htt
a) Barrier b) Exclude directive

c) Spin lock d) Critical directive.


p:/
iv) Which of the following is a language that supports
parallel programming ?

a) C++ b) C#
/q
c) C* d) None of these.

v) Most effective Gaussian elimination algorithm can be


computed in a SIMD machine with n processing element
pap

in ………… time complexity.


a) O (n3) b) O ( n 2 log n )
c) O (n2) d) O ( n log n ).

vi) Matrix multiplication in hyper cube network takes time


er.

of
a) O (n2) b) O ( n log n )

c) O(n) d) O ( log n ).
wb

vii) Pipelining is an example of

a) data parallelism b) fixed stage parallelism

c) control parallelism d) no parallelism.


ut .

viii) Which of the following is true data dependency ?

a) Loop carried dependency


a c.

b) Forward dependency

c) Backward dependency

d) All of these.
in

7403 2
CS/B.Tech(CSE)/SEM-7/CS-704C/2010-11

ix) Which of the following is a cost optimal algorithmn ?


htt
a) Biotonic sort in n processor

b) Matrix multiplication in hypercube


p:/
c) Matrix multiplication in 2d mesh

d) None of these.

x) Which of the PRAM algorithm can be modified to


/q
traverse a tree ?

a) Sum b) Vector multiplication


pap

c) Suffix sum d) Prefix sum.

GROUP – B
( Short Answer Type Questions )
er.

Answer any three of the following. 3 × 5 = 15

2. Explain block matrix multiplication with an example.

3. What is cost of an algorithm ? State Brent's law.


wb

4. What is loop carried dependency ? Explain with example.

5. Compare data parallelism and pipelining.


ut .

6. Explain the cache coherence problem.

GROUP – C
a c.

( Long Answer Type Questions )


Answer any three of the following. 3 × 15 = 45

7. Write a PRAM algorithm to solve the graph colouring


problem. Explain with an example.
in

7403 3 [ Turn over


CS/B.Tech(CSE)/SEM-7/CS-704C/2010-11

8. Write a parallel algorithm to solve Gaussian elimination.


htt
Calculate time complexity, speed up and the cost of the

algorithm. 9+6

9. Draw and describe the hypertree structure for SIMD


p:/
interconnection network. What is degree and bisection width

of this network ?
/q
What is a better interconnection network in respect of

degree, diameter and bisection width ? Explain. 5+4+6


pap

10. Write a parallel algorithm to sort an array using odd even

transposition sort. Explain with example. What kind of

interconnection network would give you best result for this


er.

algorithm ? 7+7+1

11. Write short notes on any three of the following : 3×5


wb

a) Load balancing

b) PRAM computational model


ut .

c) Barrier synchronization

d) Data flow dependency


a c.

e) Fortran 90.
in

7403 4

You might also like