Scribd Logo
Upload

Welcome to Scribd!

  • 84 views

    3 Hours / 70 Marks: Seat No

    Uploaded by

    Saad Vakharia
    This document contains instructions for a data structures exam consisting of 6 questions worth 70 total marks. It provides examples of question types that may be asked, including: 1) Short answer questions testing knowledge of data structure concepts like linear vs non-linear data structures, stack operations, tree and graph definitions and properties. 2) Algorithm questions asking to write pseudocode for operations on linked lists, sorting arrays, and traversing trees and graphs. 3) Coding questions providing examples to code implementations of stacks, recursion, and linked lists. 4) Problems analyzing time and space complexity, performing searches on sorted data, and converting expressions between infix, prefix and postfix forms. The instructions emphasize that

    Copyright:

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

    3 Hours / 70 Marks: Seat No

    Uploaded by

    Saad Vakharia
    84 views4 pages
    This document contains instructions for a data structures exam consisting of 6 questions worth 70 total marks. It provides examples of question types that may be asked, including: 1) Short answer questions testing knowledge of data structure concepts like linear vs non-linear data structures, stack operations, tree and graph definitions and properties. 2) Algorithm questions asking to write pseudocode for operations on linked lists, sorting arrays, and traversing trees and graphs. 3) Coding questions providing examples to code implementations of stacks, recursion, and linked lists. 4) Problems analyzing time and space complexity, performing searches on sorted data, and converting expressions between infix, prefix and postfix forms. The instructions emphasize that

    Original Title

    22317

    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 contains instructions for a data structures exam consisting of 6 questions worth 70 total marks. It provides examples of question types that may be asked, including: 1) Short answer questions testing knowledge of data structure concepts like linear vs non-linear data structures, stack operations, tree and graph definitions and properties. 2) Algorithm questions asking to write pseudocode for operations on linked lists, sorting arrays, and traversing trees and graphs. 3) Coding questions providing examples to code implementations of stacks, recursion, and linked lists. 4) Problems analyzing time and space complexity, performing searches on sorted data, and converting expressions between infix, prefix and postfix forms. The instructions emphasize that

    Copyright:

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

    3 Hours / 70 Marks: Seat No

    Uploaded by

    Saad Vakharia
    This document contains instructions for a data structures exam consisting of 6 questions worth 70 total marks. It provides examples of question types that may be asked, including: 1) Short answer questions testing knowledge of data structure concepts like linear vs non-linear data structures, stack operations, tree and graph definitions and properties. 2) Algorithm questions asking to write pseudocode for operations on linked lists, sorting arrays, and traversing trees and graphs. 3) Coding questions providing examples to code implementations of stacks, recursion, and linked lists. 4) Problems analyzing time and space complexity, performing searches on sorted data, and converting expressions between infix, prefix and postfix forms. The instructions emphasize that

    Copyright:

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

    21222

    22317
    3 Hours / 70 Marks Seat No.
    15 minutes extra for each hour

    Instructions : (1) All Questions are compulsory.


    (2) Illustrate your answers with neat sketches wherever necessary.
    (3) Figures to the right indicate full marks.
    (4) Assume suitable data, if necessary.

    Marks
    1. Attempt any FIVE of the following : 10
    (a) Define linear data structure and non-linear data structure.
    (b) Enlist operations on stack.
    (c) Define : (i) General tree (ii) Binary tree
    (d) Draw the diagram of circular queue with front and rear pointers.
    (e) Describe given two types of graphs : Directed and Undirected graph.
    (f) Define Abstract Data Type.
    (g) State any four applications of queue.

    2. Attempt any THREE of the following : 12


    (a) Describe the working of Bubble sort method with an example.
    (b) Write an algorithm to traverse a linked list.
    (c) Explain Queue overflow and underflow conditions with examples.
    (d) Explain the following terminologies with respect to graph :
    (i) In degree (ii) Out degree
    (iii) Successor (iv) Predecessor

    [1 of 4] P.T.O.
    22317 [2 of 4]
    3. Attempt any THREE of the following : 12

    (a) Describe time and space complexity with example of each.

    (b) Evaluate the following postfix expression :

    10, 2, *, 15, 3, /, +, 12, 3, +, +

    Show diagrammatically each step of evaluation using stack.

    (c) Find the position of element 30 using Binary search method in array

    A = {10, 5, 20, 25, 8, 30, 40}

    (d) For the following graph :

    (i) Give adjacency matrix representation

    (ii) Give adjacency list representation

    4. Attempt any THREE of the following : 12

    (a) Describe the working of radix sort with example.

    (b) Construct a binary search tree for following elements :

    22, 27, 14, 31, 40, 43, 44, 10, 20, 35

    Show each step of construction of BST.

    (c) Write an algorithm to insert a new node at the beginning of a Singly linked
    list. Give example.

    (d) Write a ‘C’ program to calculate the factorial of number using recursion.

    (e) Describe circular linked list with suitable diagram. Also state advantage of
    circular linked list over linear linked list.
    22317 [3 of 4]
    5. Attempt any TWO of the following : 12

    (a) Write a program to implement a stack with push, pop and display operations.

    (b) Draw tree for given expression and find pre-order and post-order traversal.

    (2b + 5c)2 (4d – 6e)5

    (c) Write an algorithm to search an element in linked list.

    6. Attempt any TWO of the following : 12

    (a) Describe the working of Selection Sort Method. Also sort given input list in
    ascending order using selection sort.

    Input list : 50, 24, 5, 12, 30

    (b) Convert the following Infix expression to its prefix form using stack. Show
    the details of stack at each step of conversion.

    Expression : P * Q  R – S / T + (U/V)

    (c) Create a Singly linked list using data fields 70, 50, 30, 40, 90. Search a node
    40 from the singly linked list & show procedure step-by-step with the help of
    diagram from start to end.

    _______________

    P.T.O.
    22317 [4 of 4]

    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