Scribd Logo
Upload

Welcome to Scribd!

  • 34 views

    MCSE-011: Time: 3 Hours Maximum Marks: 100

    Uploaded by

    priya
    This document is a 3 page exam for the course MCSE-011: Parallel Computing. It contains 5 questions testing various concepts in parallel computing. Question 1 has 5 parts testing dataflow computing, PRAM model, hypercube network, parallelism detection, and Amdahl's law. The other questions test Flynn's classification, parallel virtual machines, multithreading, array processors, and cluster computing memory organization. Students have 3 hours to complete 3 of the 5 questions.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    MCSE-011: Time: 3 Hours Maximum Marks: 100

    Uploaded by

    priya
    34 views3 pages
    This document is a 3 page exam for the course MCSE-011: Parallel Computing. It contains 5 questions testing various concepts in parallel computing. Question 1 has 5 parts testing dataflow computing, PRAM model, hypercube network, parallelism detection, and Amdahl's law. The other questions test Flynn's classification, parallel virtual machines, multithreading, array processors, and cluster computing memory organization. Students have 3 hours to complete 3 of the 5 questions.

    Original Description:

    mcs 011 june 11 paper needful

    Original Title

    MCSE-011june-11

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document is a 3 page exam for the course MCSE-011: Parallel Computing. It contains 5 questions testing various concepts in parallel computing. Question 1 has 5 parts testing dataflow computing, PRAM model, hypercube network, parallelism detection, and Amdahl's law. The other questions test Flynn's classification, parallel virtual machines, multithreading, array processors, and cluster computing memory organization. Students have 3 hours to complete 3 of the 5 questions.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    34 views3 pages

    MCSE-011: Time: 3 Hours Maximum Marks: 100

    Uploaded by

    priya
    This document is a 3 page exam for the course MCSE-011: Parallel Computing. It contains 5 questions testing various concepts in parallel computing. Question 1 has 5 parts testing dataflow computing, PRAM model, hypercube network, parallelism detection, and Amdahl's law. The other questions test Flynn's classification, parallel virtual machines, multithreading, array processors, and cluster computing memory organization. Students have 3 hours to complete 3 of the 5 questions.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3

    No.

    of Printed Pages : 3 MCSE-011

    N MCA (Revised)
    N
    O Term-End Examination
    O June, 2011

    MCSE-011 : PARALLEL COMPUTING

    Time : 3 hours Maximum Marks : 100

    Note : Question number 1 is compulsory. Attempt any three


    questions from the rest.

    1. (a) Explain the basic concepts of dataflow 8


    computing and describe various
    applications of parallel computing.
    (b) Explain PRAM Model with its 8
    components.
    (c) Explain Hypercube Network with 8
    properties.
    (d) Explain Bernstein conditions for detection 8
    of parallelism.
    (e) Explain the Amdahl's law for measuring 8
    speed up performance with the help of an
    example.

    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.

    3. (a) Explain the concept of multithreading and 10


    its use in parallel computer architecture.
    (b) Give the classification of vector instruction. 10
    Explain each.

    4. (a) Define array processing. Why are array 10


    processors called as SIMD Array
    computers ? With the help of a Block
    diagram. Explain the architecture of an
    SIMD array processor.
    (b) With the help of a diagram illustrate the 10
    concept of sorting using comparators for
    the unsorted list having the elements value
    as
    (3, 5, 8, 9, 10, 12, 14, 20, 95, 90, 60, 35, 23, 18, 0)

    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

    You might also like