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

Data Structure & Algorithm 2021 OLD PYQ.

Group A

 

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

(i) Match the following terms with their descriptions:

Stack Operation	FIFO
Queue Operation	Linera Search
O (n) Complexity	LIFO

(ii) A binary tree can have more than tow children per node. 

(a) True

(b) False 

(iii) In a max heap, the root node is always the largest element.

(a) True

(b) False 

(iv) A ________ is used to traverse a tree level by level.

(a) Stack                                   

(b) Queue

(c) Linked

(d) List

(v) The time complexity of accessing an element in an array by index is _________.

(a) O(n)

(b) O(1)

(c) O(log n )

(d) None of the above

(vi) The process of adding an element to the queue is called _______.

(a) Dequeue

(b) Peek

(c) Enqueue

(d) None of the above

(vii) Which sorting algorithm is the fastest for small arrays?

(a) Bubble Sort

(b) Insertion Sort

(c) Quick Sort

(d) Merge Sort

(viii) Which of the following is a linear data structure?

(a) Tree

(b) Graph

(c) Queue

(d) Heap

(ix) Match the following terms with their descriptions:

(a) Linked List	1. Fixed-size sequential collection
(b) Hash Table	2. Dynamic-size sequential collection
(c) Array	3. Key-value pairs

(x) The postfix expression for the infix expression “A* (B+C)” is _______.

(a) ABC+*

(b) A*BC

(c) *A+BC

 

 

Group:-"B"

 

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

 

2. Discuss advantages of using linked list over arrays.

OR

Discuss binary search with its complexity.

 

 

3. Describe the process of inserting a node in a binary search tree.

OR

 Explain the concept of recursion with an example.

 

4. Describe the procedure for deleting a node from a doubly linked list.

OR

How is a graph represented in computer memory?

 

5. Explain the merge Sort algorithm with an example.  

OR

Evaluate the following postfix expression using stack:

    Expression: 4 5 6 * + 2 /

 

6. Explain the concept of Abstract Data Types (ADTs) and why they are important in data structures.

OR

Discuss the concept of priority queues and how they differ from regular queues.

 

Group:- "C"

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

 

7. Convert the following infix expression to postfix:

( (a + b ) * c ) – ( d / ( e + f ) )

  OR

Convert the following prefix expression to infix: * + a b / - c d + e f

 

 

8. Explain in detail the implementation of a stack using arrays in C, including push and pop operations.  

                                                                           OR

Discuss the quicksort algorithm in detail, and write a C program to sort an array using quicksort.

 

9. Explain Circular Linked List. How memory can be utilized with Circular Linked List.

Discuss in detail.

OR

Explain the concept of balanced trees and described trees and describe be the operations of an AVL tree with a C implementation.

    

10. Explain Binary Search Tree. Discuss various tree traversal technique in binary tree.  

OR

Explain Queue Data structure with its various operations. Write algorithm for enqueue and dequeue.

 

11. Define Adjacency List and Adjacency Matrix in context of Graph. Also discuss its advantage in operation of graph.

OR

Write algorithm to implement a doubly linked list with various operations like insertion, deletion, and operations.

 

 

*****