Skip to content
EndsemMay 20242019 patternSE E&TC

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

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 2024
Max. marks
70
Time
2½ Hours
Semester
IV
Paper code
[6261]-36

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

Instructions to the candidates

  1. Answer to the questions Q. No. 1 or Q. No. 2, Q. No. 3 or Q. No. 4, Q. No. 5 or Q. No. 6, Q. No. 7 or Q. No. 8.
  2. Draw neat labelled diagrams wherever necessary.
  3. Figures to the right indicate full marks.
  4. Assume suitable data, if necessary.

Questions

  1. Q1

    1. a)

      Elaborate following terminologies : i) Graph ii) Adjacency List iii) Adjacency Matrix

      [6]
    2. b)

      Differentiate between tree and graph.

      [6]
    3. c)

      Write pseudo code for Floyd-Warshall algorithm.

      [6]

  2. Q2

    1. a)

      Find the shortest path using Dijkstra’s algorithm. Write all the sequence of steps used in algorithms.

      [6]
    2. b)

      Write Prim’s algorithm to find minimum spanning tree.

      [6]
    3. c)

      Write the applications of : i) Graph ii) BFS iii) DFS

      [6]

  3. Q3

    1. a)

      Explain following terms w.r.t. symbol table : i) Insert & lookup operations ii) Advantages iii) Disadvantages

      [6]
    2. b)

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

      [6]
    3. c)

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

      [6]

  4. Q4

    1. a)

      What is the need of AA tree? List the five invariants that AA tree must satisfy.

      [6]
    2. b)

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

      [6]
    3. c)

      Show the balanced AVL tree after deletion of mentioned node : i) Delete 30 ii) Delete 55 iii) Delete 60

      [6]

  5. Q5

    1. a)

      What is indexing? What are the advantages of indexing? Discuss clustering index with example.

      [6]
    2. b)

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

      [6]
    3. c)

      Why B+ tree? List its properties and advantages.

      [5]

  6. Q6

    1. a)

      Explain with example trie tree. Give properties and advantages of trie tree.

      [6]
    2. b)

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

      [6]
    3. c)

      What is difference between B and B+ tree?

      [5]

  7. Q7

    1. a)

      Explain Index Sequential file and discuss their advantages and disadvantages.

      Also asked:Nov 2025 ·May 2025

      [6]
    2. b)

      List & explain two possible ways of representing records.

      [6]
    3. c)

      Differentiate between indexed sequential file and direct access file.

      Also asked:May 2025

      [5]

  8. Q8

    1. a)

      Explain Sequential file organization and discuss their advantages and disadvantages.

      Also asked:Nov 2025 ·May 2025

      [6]
    2. b)

      What is coral rings? Describe inverted files w.r.t linked organization.

      [6]
    3. c)

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

      [5]