Scribd Logo
Upload

Welcome to Scribd!

  • 93 views

    Data Structure Questions: 21 Let Us Take A Tree With 5 Nodes (N 5)

    Uploaded by

    api-3722999
    The document contains 35 questions about data structures and algorithms. It asks about topics like data structures used in different data models, implementing priority queues and linked lists, tree traversal methods, sorting algorithms, hashing functions, B-trees, spanning trees, and minimal spanning trees. It also includes questions about file structures, binary tree representations of expressions, and drawing the binary tree for a given COBOL code.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd

    Data Structure Questions: 21 Let Us Take A Tree With 5 Nodes (N 5)

    Uploaded by

    api-3722999
    93 views6 pages
    The document contains 35 questions about data structures and algorithms. It asks about topics like data structures used in different data models, implementing priority queues and linked lists, tree traversal methods, sorting algorithms, hashing functions, B-trees, spanning trees, and minimal spanning trees. It also includes questions about file structures, binary tree representations of expressions, and drawing the binary tree for a given COBOL code.

    Original Title

    d

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document contains 35 questions about data structures and algorithms. It asks about topics like data structures used in different data models, implementing priority queues and linked lists, tree traversal methods, sorting algorithms, hashing functions, B-trees, spanning trees, and minimal spanning trees. It also includes questions about file structures, binary tree representations of expressions, and drawing the binary tree for a given COBOL code.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    93 views6 pages

    Data Structure Questions: 21 Let Us Take A Tree With 5 Nodes (N 5)

    Uploaded by

    api-3722999
    The document contains 35 questions about data structures and algorithms. It asks about topics like data structures used in different data models, implementing priority queues and linked lists, tree traversal methods, sorting algorithms, hashing functions, B-trees, spanning trees, and minimal spanning trees. It also includes questions about file structures, binary tree representations of expressions, and drawing the binary tree for a given COBOL code.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    of 6

    Data Structure Questions

    1. What is data structure?

    2. List out the areas in which data structures are applied extensively?

    3. What are the major data structures used in the following areas : RDBMS,
    Network data model & Hierarchical data model.

    4. If you are using C language to implement the heterogeneous linked list, what
    pointer type will you use?

    5. Minimum number of queues needed to implement the priority queue?

    6. What is the data structures used to perform recursion?

    7. What are the notations used in Evaluation of Arithmetic Expressions using prefix
    and postfix forms?

    8. Convert the expression ((A + B) * C – (D – E) ^ (F + G)) to equivalent Prefix


    and Postfix notations.

    9. Sorting is not possible by using which of the following methods?

    10. A binary tree with 20 nodes has null branches?


    21
    Let us take a tree with 5 nodes (n=5)

    Null Branches

    11. What are the methods available in storing sequential files ?

    12. How many different trees are possible with 10 nodes ?


    1014
    For example, consider a tree with 3 nodes(n=3), it will have the maximum
    combination of 5 different (ie, 23 - 3 = 5) trees.

    1
    i ii iii iv v

    13. List out few of the Application of tree data-structure?

    14. List out few of the applications that make use of Multilinked Structures?

    15. In tree construction which is the suitable efficient data structure?


    (a) Array (b) Linked list (c) Stack (d) Queue (e) none

    16. What is the type of the algorithm used in solving the 8 Queens problem?

    17. In an AVL tree, at what condition the balancing is to be done?

    18. What is the bucket size, when the overlapping and collision occur at same time?

    19. Traverse the given tree using Inorder, Preorder and Postorder traversals.

    Given tree:
    A

    B C

    D E F G

    H I J

    2
    20. There are 8, 15, 13, 14 nodes were there in 4 different trees. Which of them could
    have formed a full binary tree?

    21. In the given binary tree, using array you can store the node 4 at which location?

    2 3

    4
    At location 6
    5
    1 2 3 - - 4 - - 5

    Root LC1 RC1 LC2 RC2 LC3 RC3 LC4 RC4

    where LCn means Left Child of node n and RCn means Right Child of node n

    22. Sort the given values using Quick Sort?

    65 70 75 80 85 60 55 50 45

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

    The given graph:

     BFS: AXGHPEMYJ

     DFS: AXHPEYMJG

    3
    24. Classify the Hashing Functions based on the various methods by which the key
    value is found.

    25. What are the types of Collision Resolution Techniques and the methods used in
    each of the type?

    26. In RDBMS, what is the efficient data structure used in the internal storage
    representation?

    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

    11 -

    5 7 19 24

    4 - 6 - 8 - 16 - 20 22 78 92

    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

    29. What is a spanning Tree?

    30. Does the minimum spanning tree of a graph give the shortest distance between
    any 2 specified nodes?

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

    600
    1 3 200
    612
    410 310
    2985 5
    400
    2 4
    1421

    4
    32. Which is the simplest file structure?
    (a) Sequential
    1 3
    (b) Indexed
    (c) Random
    200
    612 310
    410 List is linear or Non-linear data structure?
    33. Whether Linked
    2 4 5
    34. Draw a binary Tree for the expression :
    A * B - (C + D) * (P / Q)

    * *

    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.

    5
    6

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy