Mcse 011
Mcse 011
MCA (Revised)
Term-End Examination
June, 2017
MCSE-011 3,500
No. of Printed Pages : 2 MCSE-0111
MCA (Revised)
Term-End Examination
December, 2017
0=34 1.
MCSE 011
- 1 P.T.O.
3. (a) List and explain the 'ten' library
routines/functions in PVM programming. 10
MCSE-011 2 6,000
No. of Printed Pages.: 2 MCSE-011 1
MCA (Revised)
Term-End Examination
June, 2015
0655 -3
MCSE-011 : PARALLEL COMPUTING
Time : 3 hours Maximum Marks : 100
Note : Question Number 1 is compulsory. Attempt any
three questions from the rest.
MCSE-011 1 P.T.O.
(b) Define any two of the following terms : 10
(i) Node degree
(ii) Network diameter
(iii) Static interconnection network -
MCSE-011 2 8,000
No. of Printed Pages : 3 I MCSE-011
Co MCA (Revised)
O Term-End Examination
■-•4
December, 2011
MCSE-011 1 P.T.O.
2. (a) Explain three work sharing constructs of 10
open Mp.
(b) Explain the Gustaf sons's law for measuring 10
speed up performance with the help of an
example.
MCSE-011 2
(b) Explain Bens Network. Show the inter 10
connections of Bens Network for the
following permutations.
1 2 3 4 5 6 71
P= [0
2 3 4 0 1 6 7 5j
MCSE-011 3
No. of Printed Pages : 2 MCSE-011
MCA (Revised)
Term-End Examination
MCSE-011 1 P.T.O.
2. (a) Discuss Handler's classification. Explain 10
with an example.
(b) Use Bernstein's conditions for determining 10
parallelism in the following segments.
S1: X = Y + Z
S2: Z = U + V
S3: R = S + V
S4: Z = X + R
S5: Q = M + Z
MCSE-011 2
No. of Printed Pages : 2 MCSE-011
MCA (Revised)
599 4 Term-End Examination
December, 2014
MCSE-011 : PARALLEL COMPUTING
Time : 3 hours Maximum Marks : 100
MCSE-011 2 10,000
No. of Printed Pages : 3 MCSE-011
N MCA (Revised)
N
O Term-End Examination
O June, 2011
MCSE-011 1 P.T.O.
2. (a) Flynn's classification is based on 10
multiplicity of instruction stream and data
stream observed by CPU during program
execution. Explain in detail.
(b) Discuss the following with respect to a 10
parallel virtual machine.
(i) Compiling and running of a PVM
program.
Creating and managing Dynamic
process group.
MCSE-011 2
5. (a) A three stage Network is set so that. 10
P(S1) = ( 0 1 2 3 4 5 6 7)
( 2 5 3 7 0 4 6 1)
P(S2) = ( 0 1 2 3 4 5 6 7)
( 1 7 0 2 4 6 5 3)
P(S3) = (01 23 4 56 7)
(75364 201)
with permutation realised by Network.
(b) Define Cluster computing. Explain the 10
memory organisation in a cluster
computing. Give details of any of the
important project based on cluster
computing.
MCSE-011 3
No. of Printed Pages : 2 MCSE-011
O
MCA (Revised)
(NI Term-End Examination
O
June, 2012
MCSE-011 1 P.T.O.
2. (a) Explain the applicability and the restriction 10
involved in using the Amdhal's Law,
Guestafson's Law and Sun and Nis Law to
estimate the speed up performance of h
processor system compared with that of a
single processor system.
(b) When an algorithm is said to be 10
asymptotically time optimal ? Mention a
problem for which we have a time optimal
algorithm and justify your answer.
MCSE-011 2
No. of Printed Pages : 2 MCSE-011
MCA (Revised)
00 Term-End Examination
ON June, 2014
N-
O MCSE-011 : PARALLEL COMPUTING
Time : 3 hours Maximum Marks : 100
Note : Question number 1 is compulsory. Attempt any three
questions from the rest.
MCSE-011 1 P.T.O.
3. (a) What is grain size ? What are the different 15
categories of grain size ? How do we classify
Parallelism on the basis of grain size ?
(b) Describe the advantages of parallel 5
processing over sequential computations.
MCSE-011 2
No. of Printed Pages : 2 I MCSE-011
MCA (Revised)
Term-End Examination
December, 2018
C1-491
(d) OpenMP
MCSE-011 2 6,000
No. of Printed Pages : 2 MCSE-011
MCA (Revised)
Term-End Examination
09
June, 2013
MCSE-011 : PARALLEL COMPUTING
O
Time : 3 hours Maximum Marks : 100
Note : Question number 1 is compulsory. Attempt any three
questions from the rest.
MCSE-011 1 P.T.O.
3. (a) Explain the various criteria for classification 10
of parallel computer. Explain Flynn's
classification in detail.
(b) What are the various types of parallel 10
programming ? Explain,
MCSE-011 2
No. of Printed Pages : 2 I MCSE-011 I
MCA (Revised)
Term-End Examination
1:3 June, 2018
MCSE-011 2 6,000
No. of Printed Pages : 3 I MCSE-0111
MCA (Revised)
Term -End Examination
December, 2015
12 b=a+d
I3= C = a/f
MCSE-011 1 P.T.O.
2. (a) Identify the types of the following vector
processing instructions : 10
(i) C(I) = A(I) and B(I)
MCSE-011 2
5. Write short notes on the following : 4x5=20
(c) PRAM
MCSE-011 3 13,000
No. of Printed Pages : 4 MCSE-011 I
MCA (Revised)
Term-End Examination
4 December, 2016
MCSE-011 2
3. (a) Discuss the following issues in the design of
an interconnection network : 6
• Crossbar network
• Ring network
MCSE-011 3 P.T.O.
(d) Elaborate on the following performance
analysis tools : 4
(i) Visualization
MCSE-011 4 8,000
No. of Printed Pages : 4 I MCSE-011
MCA (Revised)
Term-End Examination
June, 2016
MCSE-01 1 1 P.T.O.
(c) Make a dataflow graph of the following
expression : 4
F.(a+b)*(a-c)/(d-e)
• Hyper-threading
• Grid computing
MCSE-011 2
(b) How will you define speed up if a number
of processors is added to perform fraction of
work in parallel ? 4
MCSE-011 3 P.T.O.
4. (a) Suppose you are given two sorted
sequences A and B of length four as :
A = (5, 10, 15, 20)
B = (4, 8, 12, 16)
(b) Granularity
MCSE-011 4 12,000