Skip to content
InsemNov 20252019 patternSE IT

Data Structures & Algorithms (DSA) SPPU Insem Question Paper Nov 2025

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

Open the PDF
Subject code
214443
Pattern
2019 pattern
Exam
Insem
Session
Nov 2025
Max. marks
30
Time
1 Hour
Semester
III
Paper code
[6578]-29

Printed for: S.E. (Information Technology) (Insem.)

Instructions to the candidates

  1. Answers Q. 1 or Q.2 and Q.3 or Q. 4,
  2. Neat diagrams must be drawn wherever necessary.
  3. Figures to the right side indicate full marks.
  4. Assume Suitable data if necessary.

Questions

  1. Q1

    1. a)

      Could you categorize various forms of data structures and provide an illustration for each type?

      [5]
    2. b)

      Illustrate the concepts below using examples? Data, Data Object, Data Structure.

      [5]
    3. c)

      Implement the insertion operation for adding a node at the end of a doubly linked list. Provide the algorithm and code.

      [5]

  2. Q2

    1. a)

      Explain the concept of a linked organization in data structures. What are the advantages of using linked data structures over arrays?

      [5]
    2. b)

      What is a circular linked list, and how does it differ from a regular (singly or doubly) linked list? Give an example scenario where a circular linked list is useful.

      [5]
    3. c)

      Explain Row major and Column major representation of matrix with example?

      [5]

  3. Q3

    1. a)

      Analyzing the Time and Space Complexity: Provide an illustration along with a description of the time and space complexity.

      [5]
    2. b)

      What is Quick Sort, and how does it work? Explain the basic algorithm and its key steps with example.

      [5]
    3. c)

      Describe the concept of hashing in data structures. Analyse the best- case, worst- case, and average-case time complexities for hash table operations such as insertion, retrieval, and deletion.

      [5]

  4. Q4

    1. a)

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

      [5]
    2. b)

      Can you explain the significance of the Fibonacci sequence in nature or art? Give examples.

      [5]
    3. c)

      For binary search, explain the best-case, worst-case, and average-case scenarios. Provide the time complexity analysis for each of these cases. 

      [5]