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

Welcome to Scribd!

  • 11 views

    June - 2021 MCS-021

    Uploaded by

    sky200417

    Copyright:

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

    June - 2021 MCS-021

    Uploaded by

    sky200417
    11 views2 pages

    Original Title

    23._June_2021 MCS-021 IGNOUAssignmentGuru.com

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

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

    June - 2021 MCS-021

    Uploaded by

    sky200417

    Copyright:

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

    [2] MCS-021

    (b) What is circular queue ? Write algorithms


    No. of Printed Pages : 4 MCS-021
    for adding element to and deleting element
    M. C. A. (REVISED)/B. C. A. (REVISED)

    m
    from circular queue. 10

    o
    (MCA/BCA)

    .c
    (c) Describe Big O and Ω notations in detail.
    Term-End Examination
    June, 2021
    ru 10

    MCS-021 : DATA AND FILE STRUCTURES

    G u
    (d) Find minimum cost spanning tree for the
    Time : 3 Hours Maximum Marks : 100

    n t graph given below using Kruskal’s

    Weightage : 75%
    e algorithm : 10

    Note : (i) Question No. 1 is compulsory.


    n m
    (ii) Attempt any three questions from the

    s ig
    rest.

    A s
    (iii) All algorithms should be written near to
    ‘C’ language.

    O U
    N
    IG
    1. (a) Write algorithm for push and pop operations 2. (a) What is AVL tree ? Explain how a node is

    of a stack. Also write algorithm to check inserted into an AVL tree and how a node

    whether stack is empty or not. 10 is deleted from an AVL tree. 10

    P. T. O.
    [3] MCS-021 [4] MCS-021

    (b) Write any five differences between arrays (b) Write an algorithm to implement singly

    and pointers in ‘C’ Programing Language. 5 linked list using pointers. 10

    (c) Write linear search algorithm and find its


    time complexity. 5

    o m
    5. (a) Explain the difference between row-major

    3. (a) What is a Red-Black Tree ? Explain its


    .c
    representation of an array and column

    u
    r
    major representation of an array with the
    properties. 6

    (b) Explain Direct-File organisation. 6

    G u
    help of a suitable example. 10

    (c) Sort the following list using bubble sort in

    n t(b) Write short notes on the following : 5 each

    ascending order : 8
    e (i) Adjecency matrix representation of

    m
    graph

    n
    25, 29, 8, 68, 92, 30, 40
    (ii) Binary search

    g
    Show intermediate steps of the process.
    4. (a) Traverse the following Binary tree in :

    s
    10
    i
    (i) Pre-order
    (ii) Post-order
    A s
    O U
    N
    IG
    MCS-021

    P. T. O.

    You might also like