Skip to content
EndsemDec 20252019 patternSE IT

Data Structures & Algorithms (DSA) SPPU Endsem Question Paper Dec 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
Dec 2025
Max. marks
70
Time
2½ Hours
Semester
III
Paper code
[6582]-61

Printed for: S.E. (Information Technology)

Instructions to the candidates

  1. Answer Q1 or Q2, Q3 or Q4, Q5 or Q6, Q7 or Q8.
  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)

      Explain Representation of stack using array, structure and linked list with example.

      [6]
    2. b)

      Write a short note on doubly ended queue with example.

      [6]
    3. c)

      Explain sequential organization of 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)

      Convert following infix expression to postfix expression. (a+b)*(c/d)-e

      [6]
    3. c)

      Explain operations on stack with example.

      [6]

  3. Q3

    1. a)

      Explain representation of tree using sequential and linked organization.

      [6]
    2. b)

      Discuss the merits & demerits of implementing threaded binary tree.

      [6]
    3. c)

      Explain binary tree traversals with example.

      [5]

  4. Q4

    1. a)

      Explain conversion of general tree to binary tree with example.

      [6]
    2. b)

      Explain operations on binary search tree with example.

      [6]
    3. c)

      Explain treaded binary tree with example. 2

      [5]

  5. Q5

    1. a)

      Explain Representation of graph with example.

      [6]
    2. b)

      Write short note on prim’s algorithm with example.

      [6]
    3. c)

      Write short note on kruskal’s algorithm with example.

      [6]

  6. Q6

    1. a)

      Write short note on Dijkstra’s algorithm with example.

      [6]
    2. b)

      Write short note on AVL tree with example.

      [6]
    3. c)

      Write short note on Heap data structure with example.

      [6]

  7. Q7

    1. a)

      Define hash table and Explain Basic Concepts of hashing.

      [6]
    2. b)

      Explain Linear Probing with example.

      [6]
    3. c)

      Explain Quadratic Probing with example.

      [5]

  8. Q8

    1. a)

      Explain any three operations on file with example.

      [6]
    2. b)

      Differentiate between index sequential and direct access file.

      Also asked:May 2025 ·May 2024

      [6]
    3. c)

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

      [5]