Skip to content
EndsemMay 20252019 patternSE E&TC

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
210252
Pattern
2019 pattern
Exam
Endsem
Session
May 2025
Max. marks
70
Time
2½ Hours
Semester
IV
Paper code
[6402]-41

Printed for: S.E. (Computer Engineering)/(Artificial Intelligence & Data Science)/

Instructions to the candidates

  1. Answer to the questions Q1 or Q2, Q3 or Q4, Q5 or Q6 and Q7 or Q8.
  2. Assume the suitable data, if necessary.
  3. Figures to the right indicate full marks.
  4. Draw neat labelled diagram wherever necessary.

Questions

  1. Q1

    1. a)

      Define the following terms : i) Complete Graph ii) Connected Graph iii) Subgraph

      [6]
    2. b)

      Write a pseudo C/C++ code for depth traversal of graph represented using adjacency matrix.

      [6]
    3. c)

      Find MST for the following graph using Prim’s algorithm. Show various steps. 2

      Also asked:Nov 2025

      [6]

  2. Q2

    1. a)

      Write an algorithm for BFS traversal of graph.

      [6]
    2. b)

      Give difference between Prim’s and Kruskal’s algorithm.

      [6]
    3. c)

      What is topological sorting? Find topological sorting of given graph.

      [6]

  3. Q3

    1. a)

      Build AVL tree for following input: A,Z,B,Y,C,X,D,U,E. Show balance factor of all nodes and name rotation in each step.

      [6]
    2. b)

      Explain static and dynamic tree tables with suitable example.

      [6]
    3. c)

      Explain with example Red Black tree.

      Also asked:Nov 2025

      [5]

  4. Q4

    1. a)

      Write functions for LL and LR rotation with respect to AVL tree.

      [6]
    2. b)

      Explain with example K dimensional tree.

      [6]
    3. c)

      Construct AVL tree for following data: 15,20,24,10,13,7,30,36,25

      [5]

  5. Q5

    1. a)

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

      [10]
    2. b)

      Explain Tric data structure to insert, delete, search operations with example.

      [8]

  6. Q6

    1. a)

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

      [10]
    2. b)

      Explain following primary index, Secondary index, Sparse index and Dense index with example. 3

      [8]

  7. Q7

    1. a)

      Compare Sequential and Direct access file organization.

      Also asked:May 2024

      [8]
    2. b)

      What is the concept of Multilist Structure in file organization. Explain Coral ring for multilist structure.

      [9]

  8. Q8

    1. a)

      What is linked organization? Explain inverted file and cellular partitions with respect to linked organization.

      [9]
    2. b)

      What is Sequential and index sequential file organization? State its advantages and disadvantages. ♦♦♦

      Also asked:Nov 2025 ·May 2024

      [8]