PYQ – DATA STRUCTURES AND ALGORITHM (2418301) | SEMESTER 3RD (2ND YEAR) | Year 2025

Data Structure & Algorithm 2025 NEW PYQ.

Group A

 

Choose the most suitable answer from the following options: -   (1*20=20)

(i) Consider a max heap maximum value will always available at ……… node of a tree. 

(a) Koot 

(b) Intemal 

(ii) Tree is a ……… data structure.

(a) Linear

(b) Nonlinear 

(iii) In a linear search, searching an element in n list take …………. time in worst case.

(a) O(n²)

(b) O(n)

(c) O(n-1)

(d) O(n³)

(iv) An array is a collection of ………….. data types. 

(a) Similar                                

(b) Different 

(v) A binary tree has at most tow children.

(a) True

(b) False

(vi) 0/1 knapsack is an example of …………………. Programming.

(a) Greedy

(b) Dynamic  

(vii) An algorithm may be solved in different time complexity. 

(a) True

(b) False

(viii) Deleting an element from a linked list will ………………….. the list.

(a) grow

(b) shrink  

(ix) Worst-case time complexity of merge sort algorithm is …………

(a) O(n²)

(b) O(n)

(c) O(nlogn)

(d) O(n³) 

 
(x) Greedy approach always gives optimal solution

(a) True

(b) False 

 

Group:-"B"

➥ Answer all Five Questions: -                         (5*4=20) 

 

2. Define data Structure? Define Linear & Non-Linear Data Structure also. 

OR

List any three differences between Binary tree and Binary search tree.

 

3. Write down the procedure & Algorithm for linear search. 

OR

Explain STACK and its properties.

 

4. How many bytes will be allocated by a compiler for the array declarations?

    a. int x[100];

    b. char y[25];

    c. double d[10];  

OR

Explain divide and conquer approach with the help of merge sort.

 

5. Calculate the address X [2,2] in a 2D array X [1…5, 1…4] stored in the row major order in the     main memory. Assume base address to be 1000 and that each element requires 4 words of storage.  

OR

Define the following term in context of a graph:

Degree of a node

Height of a tree

 

6. Explain best case, worst case and average case analysis of an algorithm with example.

OR

Define graph. Explain its representation.

 

Group:- "C"

➥ Answer all Five Questions: -                         (5*6=30) 

 

7. Explain how Binary Search works. What conditions must be met to use Binary Search on an array?  

OR

Solve the following by Recursion tree T(n)=T(n/3)+T(2n/3)+n

 

8. Explain linked list with its type. Write an algorithm to insert a node at last in singly linked list.  

OR

Explain Hash Table. Describe its structure and advantages in terms of time complexity for search, insert, and delete operations.

 

9. Explain DYNAMIC Approach. Solve the following using 0/1 knapsack :

    W={ 1,2,5,6,4};  P={1,6,18,22,28}         WJTH CAPACITY=10.

OR

Define Heap and its properties. Explain its type with example.

 

10. Convert the following in Postfix & Prefix notations:

      a. A + ( B* C- ( D / E ^ F ) * G ) * H

      b. A + [ ( B + C ) + ( D + E ) * F ] / G

      c.  ( A + B ) * C / D + E ^ F / G  

OR

Define minimum spanning tree using prims algorithm.

 

11. Define & Explain Big-on notation. Calculate the Big-on notation 6n² + 2n + 1. 

OR

Write down a program for Bubble sort. Write down its complexity.

 

 

*****