Skip to content
EndsemMay 20252019 patternSE IT

Data Structures & Algorithms (DSA) SPPU Endsem Question Paper May 2025

All 8 questions from this SPPU endsem paper, as printed. Read them here or open the PDF.

Open the PDF
Subject code
214443
Pattern
2019 pattern
Exam
Endsem
Session
May 2025
Max. marks
70
Time
2½ Hours
Semester
III
Paper code
[6402]-57

Printed for: S.E. (I.T.)

Instructions to the candidates

  1. Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8 .
  2. Neat diagrams must be drawn wherever necessary.
  3. Figures to the right indicate full marks.
  4. Assume suitable data, if necessary.

Questions

  1. Q1

    1. a)

      This part has equations that don’t show as text. Open the PDF to read it.

      [6]
    2. b)

      Explain stack PUSH and POP operations with example.

      [6]
    3. c)

      Explain Priority Queue with example.

      [6]

  2. Q2

    1. a)

      This part has equations that don’t show as text. Open the PDF to read it.

      [6]
    2. b)

      Explain stack using Linked List with example.

      [6]
    3. c)

      Explain Implicit stack and explicit stack with example.

      [6]

  3. Q3

    1. a)

      In a given BST state the output of Inorder, preorder, postorder, level wise traversals. Also draw mirror image.

      [6]
    2. b)

      Explain recursive algorithm to display height of Binary Tree.

      [6]
    3. c)

      This part has equations that don’t show as text. Open the PDF to read it.

      [5]

  4. Q4

    1. a)

      Construct the expression tree from the following postfix expression using stack.AD * BC+ -

      [6]
    2. b)

      State and Explain the algorithm to search data in BST. Give example.

      [6]
    3. c)

      Explain advantages and disadvantages of TBT.

      [5]

  5. Q5

    1. a)

      If ‘1’ is the resource, explain step by step minimum spanning tree by ‘Prims’ algorithm.

      [6]
    2. b)

      Explain with example by which methods Graph is represented?

      [6]
    3. c)

      Explain the heap sort technique with the help of example.

      [6]

  6. Q6

    1. a)

      If ‘1’ is the source, find the shortest path from source to all vertices, using Dijkstra’s algorithm. Show answer step by step.

      [6]
    2. b)

      Show the output of DFT using stack. Use ‘A’ as a starting node.

      [6]
    3. c)

      Explain with example OBST.

      [6]

  7. Q7

    1. a)

      Create the hash table using Linear Probing Table size : 12 Data : 3, 2, 46, 6, 11, 13, 53, 12, 70, 90 Hash function: data% table size

      [6]
    2. b)

      Explain in brief any 3 Collision resolution techniques.

      [6]
    3. c)

      Compare sequential file and direct access file with example.

      Also asked:Dec 2025 ·May 2024

      [5]

  8. Q8

    1. a)

      Explain chaining without replacement with example.

      [6]
    2. b)

      Explain with example different types of Hash functions.

      [6]
    3. c)

      Differentiate ‘ifstream’ and ‘ofstream’ with example. 

      [5]