Question 1

How stack is represented using dynamic array? Explain with example.

Accepted Answer

A dynamic array stack automatically resizes its underlying contiguous memory block when its capacity is fully exhausted.

Question 2

Identify the applications of stack.

Accepted Answer

Stacks are utilized for function call tracking, arithmetic expression evaluation, and executing algorithmic backtracking logic.

Question 3

Elaborate the disadvantages of Linked List over Arrays.

Accepted Answer

Linked lists suffer from high memory overhead per node and the complete inability to perform $O(1)$ random access.

Question 4

Justify how circular queue is different from normal queue.

Accepted Answer

A circular queue mathematically connects its absolute end back to its beginning to completely eliminate wasted, empty memory spaces.

Question 5

Differentiate between sequential and binary search.

Accepted Answer

Sequential search scans sequentially $O(n)$, while binary search optimally halves a strictly sorted dataset in $O(\log n)$ time.

Question 6

Illustrate different traversal techniques used in binary search tree.

Accepted Answer

Binary Search Trees utilize standard depth-first traversals: In-order, Pre-order, and Post-order to systematically visit nodes.

Question 7

List out best, average and worst case complexity of merge and quick sort.

Accepted Answer

Merge Sort guarantees $O(n \log n)$, while Quick Sort degrades to $O(n^2)$ strictly in its worst-case scenario.

Question 8

Examine the relationship between number of nodes and height of AVL tree.

Accepted Answer

AVL trees enforce a strict logarithmic mathematical relationship between their total node count and maximum depth.

Question 9

Determine advantages and disadvantages of adjacent matrix representation for …

Accepted Answer

Adjacency matrices provide instantaneous $O(1)$ edge lookups but suffer from extreme $O(V^2)$ memory waste for sparse graphs.

Question 10

Explain how quadratic probing is done.

Accepted Answer

Quadratic probing resolves hash collisions by probing forward in progressively larger, quadratic jump intervals.

Question 11

Convert the following infix expression into postfix expression:

Accepted Answer

A step-by-step algorithmic conversion of a complex infix mathematical expression containing multiple parenthetical groupings into Reverse Polish Notation (Postfix).

Question 12

Consider the preorder of a BST: 20, 5, 3, 4, 10, 15, 30, 25, 40

Accepted Answer

A logical deduction reconstructing a Binary Search Tree purely from its Pre-order traversal, subsequently generating the required Post-order sequence.

Question 13

Write an algorithm to enqueue and dequeue an element in a queue.

Accepted Answer

A detailed algorithmic presentation of the Enqueue and Dequeue operational mechanics for a standard linear queue data structure implemented via an array.

Question 14

Sort the following elements using quick sort: 28, 5, 16, 36, 11, 19, 25

Accepted Answer

A meticulous, step-by-step algorithmic trace executing the Quick Sort divide-and-conquer methodology on a designated array sequence.

Question 15

Write an algorithm for DFS traversal.

Accepted Answer

A detailed algorithmic outlining of the Depth-First Search (DFS) graph traversal methodology utilizing a stack-based structure and a visited array.

Question 16

What is a MST? Differentiate between Kruskal and Prim's algorithm with their …

Accepted Answer

A definitive comparison differentiating Kruskal's edge-based greedy algorithm from Prim's vertex-based algorithm for finding Minimum Spanning Trees.

Question 17

Explain the algorithm for deleting an element from doubly linked list.

Accepted Answer

A step-by-step algorithmic breakdown for physically deleting a specific, targeted element from anywhere within a Doubly Linked List structure.

Question 18

Examine each step involved with Radix sort to sort the given array - 329, 457…

Accepted Answer

A detailed step-by-step trace of the Radix Sort algorithm, demonstrating its non-comparative bucket-based sorting methodology utilizing stable Counting Sort across the ones, tens, and hundreds digit places.

Question 19

Write a C program to add a node with data 'X' before a node with data 'Y' in …

Accepted Answer

A complete, deeply annotated C programming implementation demonstrating the precise memory pointer manipulation required to insert a specific node immediately prior to another specific node in a Singly Linked List.

Question 20

Create an AVL tree using the following nodes 10, 6, 11, 12, 1, 7, 0, 2, 3. Wh…

Accepted Answer

A detailed trace executing the complex insertion and rotation sequence to build an AVL tree from a dataset, followed by the rigorous rebalancing protocol required after targeted node deletion.

Question 21

Consider the following graph -

Accepted Answer

An exhaustive, step-by-step graphical tracing of Prim's greedy algorithmic methodology to aggressively construct a Minimum Spanning Tree from a complexly weighted initial graph topology.

Question 22

(a) Write a recursive program for towers of Hanoi.

Accepted Answer

A bipartite explanation detailing the complex recursive logic driving the Towers of Hanoi solution, coupled with a rigorous stack-based computational trace evaluating a highly complex Reverse Polish Notation (Postfix) algebraic expression.

Data Structures