Scribd Logo
Upload

Welcome to Scribd!

  • 106 views

    Merge Sort: 1. Divide Step

    Uploaded by

    subbulakshmiv02
    The document describes the merge sort algorithm. It consists of three main steps: (1) divide the array into halves, (2) recursively sort the halves, (3) merge the sorted halves back into one sorted array. The key aspect is the merging step which combines two sorted sequences into a single sorted sequence.

    Copyright:

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

    Merge Sort: 1. Divide Step

    Uploaded by

    subbulakshmiv02
    106 views5 pages
    The document describes the merge sort algorithm. It consists of three main steps: (1) divide the array into halves, (2) recursively sort the halves, (3) merge the sorted halves back into one sorted array. The key aspect is the merging step which combines two sorted sequences into a single sorted sequence.

    Original Description:

    description

    Original Title

    Merge Sort

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes the merge sort algorithm. It consists of three main steps: (1) divide the array into halves, (2) recursively sort the halves, (3) merge the sorted halves back into one sorted array. The key aspect is the merging step which combines two sorted sequences into a single sorted sequence.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    106 views5 pages

    Merge Sort: 1. Divide Step

    Uploaded by

    subbulakshmiv02
    The document describes the merge sort algorithm. It consists of three main steps: (1) divide the array into halves, (2) recursively sort the halves, (3) merge the sorted halves back into one sorted array. The key aspect is the merging step which combines two sorted sequences into a single sorted sequence.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 5

    Merge Sort

    Merge-sort is based on the divide-and-conquer paradigm. The Merge-sort algorithm can be


    described in general terms as consisting of the following three steps:
    1. Divide Step
    If given array A has zero or one element, return S; it is already sorted. Otherwise, divide
    A into two arrays, A
    1
    and A
    2
    , each containing about half of the elements of A.
    2. Recursion Step
    Recursively sort array A
    1
    and A
    2
    .
    3. Conquer Step
    Combine the elements back in A by merging the sorted arrays A
    1
    and A
    2
    into a sorted
    sequence.
    We can visualize Merge-sort by means of binary tree where each node of the tree represents a
    recursive call and each external nodes represent individual elements of given array A. Such a tree
    is called Merge-sort tree. The heart of the Merge-sort algorithm is conquer step, which merge
    two sorted sequences into a single sorted sequence.






    1. For the given graph, draw the DFS and BFS?













    BFS: A X G H P E M Y J

    DFS: A X H P E Y M J G

    24. Classify the Hashing Functions based on the various methods by which the key value is
    found.
    A
    H X
    G P
    E
    Y
    M J
    The given graph:

    Direct method,
    Subtraction method,
    Modulo-Division method,
    Digit-Extraction method,
    Mid-Square method,
    Folding method,
    Pseudo-random method.

    25. What are the types of Collision Resolution Techniques and the methods used in each of the
    type?
    Open addressing (closed hashing),
    The methods used include:
    Overflow block,
    Closed addressing (open hashing)
    The methods used include:
    Linked list,
    Binary tree

    26. In RDBMS, what is the efficient data structure used in the internal storage representation?
    B+ tree. Because in B+ tree, all the data is stored only in leaf nodes, that makes searching
    easier. This corresponds to the records that shall be stored in leaf nodes.

    27. Draw the B-tree of order 3 created by inserting the following data arriving in sequence 92
    24 6 7 11 8 22 4 5 16 19 20 78












    28. Of the following tree structure, which is, efficient considering space and time
    complexities?
    (a) Incomplete Binary Tree
    (b) Complete Binary Tree
    (c) Full Binary Tree

    (b) Complete Binary Tree.
    By the method of elimination:
    Full binary tree loses its nature when operations of insertions and deletions are
    done. For incomplete binary trees, extra storage is required and overhead of NULL node
    11
    -
    5 7 19 24
    4
    -
    6
    -
    8
    -
    16
    -
    20 22 78
    11 -

    92
    checking takes place. So complete binary tree is the better one since the property of complete
    binary tree is maintained even after operations like additions and deletions are done on it.

    29. What is a spanning Tree?
    A spanning tree is a tree associated with a network. All the nodes of the graph appear on
    the tree once. A minimum spanning tree is a spanning tree organized so that the total edge weight
    between nodes is minimized.

    30. Does the minimum spanning tree of a graph give the shortest distance between any 2
    specified nodes?
    No.
    Minimal spanning tree assures that the total weight of the tree is kept at its minimum. But
    it doesnt mean that the distance between any two nodes involved in the minimum-spanning tree
    is minimum.

    31. Convert the given graph with weighted edges to minimal spanning tree.











    the equivalent minimal spanning tree is:










    32. Which is the simplest file structure?
    (a) Sequential
    (b) Indexed
    (c) Random

    (a) Sequential

    33. Whether Linked List is linear or Non-linear data structure?
    1 3
    2
    4
    5
    410
    600
    200
    400
    310
    1421
    2985
    612
    1
    2
    3
    4
    5
    410
    612
    200
    310
    According to Access strategies Linked list is a linear one.
    According to Storage Linked List is a Non-linear one.

    34. Draw a binary Tree for the expression :

    A * B - (C + D) * (P / Q)

















    35. For the following COBOL code, draw the Binary tree?

    01 STUDENT_REC.
    02 NAME.
    03 FIRST_NAME PIC X(10).
    03 LAST_NAME PIC X(10).

    02 YEAR_OF_STUDY.
    03 FIRST_SEM PIC XX.
    03 SECOND_SEM PIC XX.











    STUDENT_REC
    NAME YEAR_OF_STUDY
    FIRST_NAME LAST_NAME FIRST_SEM SECOND_SEM
    01
    02 02
    03 03 03 03
    -
    *
    *
    A
    B
    +
    /
    C
    P D
    Q

    You might also like