Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

I MCSE-011 I MCA (Revised) Term-End Examination 1:3 June, 2018

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

No.

of Printed Pages : 2 I MCSE-011 I

MCA (Revised)
Term-End Examination
1:3 June, 2018

MCSE-011 : PARALLEL COMPUTING

Time : 3 hours Maximum Marks : 100

Note : Question no. 1 is compulsory. Attempt any three


questions from the rest.

1. (a) What are the problems faced in


Superscalar architecture ? Explain how
these problems were addressed and
resolved in VLIW architecture. 10

(b) Define permutation network using an


example. Also discuss Perfect Shuffle
permutation and Butterfly permutation. 10
(c) What is a Parallel Virtual Machine ?
Discuss its features and advantages. 10
(d) Differentiate between Threads and
Processes. Explain the concept of Thread
with basic methods in concurrent
programming languages for creation and
termination of threads. 10
MCSE-011 1 P.T.O.
2. (a) Discuss the PRAM model. Which PRAM
model can be used to execute any other
PRAM algorithm and how can it be used ? 10
(b) Explain at least two techniques used for
optimization of a parallel code. 10

3. (a) Why are Array processors called as SIMD


array computers ? Explain the architecture
of SIMD array processer using a block
diagram. 10
(b) What is meant by Cluster Computing ?
Explain the memory organisation in
cluster computing. 10

4. (a) What are the different models of


distributed systems ? Also discuss various
advantages of distributed systems. 10
(b) Illustrate Flynn's classification of parallel
computer systems. Also list the features of
all categories of parallel systems. 10

5. Write short notes on the following : 4x5=20


(a) Grid Computing
(b) Handler's Classification
(c) Hyperthreacling Technology
(d) Bitonic Sorting Algorithm

MCSE-011 2 6,000

You might also like