Data Structures & Algorithms (DSA) SPPU Insem Question Paper Oct 2024
All 4 questions from this SPPU insem paper, as printed. Read them here or open the PDF.
- Subject code
- 214443
- Pattern
- 2019 pattern
- Exam
- Insem
- Session
- Oct 2024
- Max. marks
- 30
- Time
- 1 Hour
- Semester
- III
- Paper code
- [6359]-529
Printed for: S.E. (Information Technology) (Insem)
Instructions to the candidates
- Answer Q.1 or Q.2, Q.3 or Q.4.
- Neat diagrams must be drawn wherever necessary.
- Figures to the right side indicate full marks.
- Assume suitable data, if necessary.
Questions
Q1
- a)[5]
Explain Big-oh, Omega and Theta notation with example.
- b)[5]
This part has equations that don’t show as text. Open the PDF to read it.
- c)[5]
Consider integer array int arr[4][5]. If the base address is 1020, find the address of the element arr [3][4] with row major representation of array. (Consider size of integer as 4 byte).
OR- a)
Q2
- a)[5]
Explain the following Data Structures with example. i) Linear and Non-linear ii) Persistent and Epharmal
- b)[5]
Explain what is an algorithm. List and explain the characteristics of an algorithm.
- c)[5]
Write a C++ function to search a node in singly linked list. 2
- a)
Q3
- a)[5]
Sort the following array using quick sort method. Show all steps. 6, 13, 17, 61, 29, 21, 5, 94, 7.
- b)[5]
Differentiate between linear and binary search algorithm.
- c)[5]
What do you mean by sort stability. Explain with example.
OR- a)
Q4
- a)[5]
This part has equations that don’t show as text. Open the PDF to read it.
- b)[5]
Write a C++ function to search a key using binary search in non-recursive method.
- c)[5]
Explain the following concepts. i) Internal Sorting ii) External Sorting
- a)