Data Structures — Summer 2025

What is the best-case, average-case, and worst-case time complexity analysis?

Explain row-major order and column-major order representation of 2-D array.ss

Construct a Binary Search Tree for the following data. 0 21, 51, 12, 45, 17, 71, 19, 47, 78. Write Pre-order, In-order, and Post-order traversal of constructed BST.

Define following terms: 0 1. Full Binary Tree 2. Complete Binary Tree 3. Skewed Binary Tree

Write the importance of asymptotic analysis. Is O(n log n2) faster than2 O(n2)? Justify your answer with an example.

Convert the following infix expression into a postfix expression using stack. (a+b)^((c*d)/(e-f))

Write an algorithm to convert infix expression into postfix expression.

Illustrate how stack is used in the recursion.

Describe Threaded Binary Tree with example.

Write a Cprogram for the following operations on a circular queue. 1. Insert 2. Delete 3. Display

Write a recursive solution for Tower of Hanoi problem.

Explain the DFS traversal of the graph with an example.

Write an algorithm to sort existing singly linked list in acceding order according to the information field.

Define the following terms: 1. Field 2. Record 3. File

Sort the following data using merge sort. 50, 20, 70, 05, 30, 80, 55, 25

Find the minimum spanning tree of the following graph using Kruskal’s algorithm.1

What is hashing? Write the properties of a good hash function.

Sort the following data using quick sort. 50, 30,80,40, 35,70, 60, 20,75

Find the shortest path from Ato Fusing Dijkstra’s Algorithm.

Compare linear search and binary search in terms of their time complexity.

Write a Cprogram for a bubble sort.

What is hash collision? Explain collision resolution techniques.

Does a pivot selection method affect the time complexity of quick sort? Justify your answer.

Write a Cprogram for a selection sort.

List various file organizations and explain one in detail.