notesmates.in notesmates.

in

starred questions (⭐) are marked as expected for this

Rajiv Gandhi Proudyogiki Vishwavidyalaya, Bhopal

Computer Science & Engineering, III-Semester

Unit 1: Introduction, Arrays & Linked Lists

Theory Questions

1. ⭐ Define data structure. Classify data structures with examples.

2. ⭐ Explain abstract data types (ADTs) and their importance.

3. What is dynamic memory allocation? How is it implemented in C?

4. ⭐ Explain the concept of garbage collection in memory management.

5. Define asymptotic notations (Big-O, Omega, Theta) with examples.

6. Explain the memory representation of arrays and linked lists.

7. What is a circular linked list? How is it different from a singly linked list?

8. ⭐ Explain the concept of a doubly linked list and its advantages.

Problems

1. ⭐ Given a 2D array A[-100:100, -5:50], find the address of A[99,49] (Base=10, element size=4
bytes, row-major).

2. Write a C program to reverse a singly linked list.

3. ⭐ Write a C program to insert and delete nodes in a circular linked list.

4. Write a C program to implement a doubly linked list and perform insert/delete operations.

5. For multidimensional arrays A(-2:2, 2:22) and B(1:8, -5:5, -10:5):

- Find the length of each dimension.

- Calculate the number of elements.

- Compute the address of B[3,3,3] (Base=500, W=2).

notesmates.in notesmates.in
Downloaded from www.notesmates.in Uploaded on: 9/2/2025, 8:10:26 pm

Astroseeker - [email protected]
notesmates.in notesmates.in

Unit 2: Stacks & Queues

1. ⭐ Define stack. Explain its operations (Push, Pop) with algorithms.

2. ⭐ What is recursion? Explain with an example.

3. Differentiate between stable and in-place sorting algorithms.

4. Explain the concept of multiple stacks and their implementation.

5. ⭐ What is a priority queue? How is it implemented?

6. Explain the concept of a double-ended queue (D-Queue).

7. ⭐ Write a short note on circular queues.

8. How is a stack used in recursion? Explain with an example.

*Problems

1. ⭐ Convert the infix expression A + (B + D)/E - F*(G + H/K) to postfix notation.

2. ⭐ Evaluate the postfix expression: 5 3 + 8 2 -

3. Write a C program to implement a stack using arrays.

4. ⭐ Write a C program to implement a circular queue.

5. Write a C program to implement a priority queue.

Unit 3: Trees
Theory Questions

1. ⭐ *Define binary tree. Explain its types and properties.

2. ⭐ What is an AVL tree? Explain its rotations with examples.

3. Compare B-Tree, B+ Tree, and Red-Black Tree.

4. ⭐ *What is a heap? Explain its operations (insert, delete, heapify).

5. Explain the concept of threaded binary trees.

6. Write a short note on multi-way trees.

7. ⭐ *What is a binary search tree (BST)? Explain its operations.*

8. Explain the concept of tree traversal (in-order, pre-order, post-order).

notesmates.in notesmates.in
Downloaded from www.notesmates.in Uploaded on: 9/2/2025, 8:10:26 pm

Astroseeker - [email protected]
notesmates.in notesmates.in

Problems

1. ⭐ Construct an AVL tree with keys: 16, 23, 9, 163, 64, 29, 73, 83, 90, 96.

2. ⭐ Given in-order (E A C K F H D B G) and pre-order (F A E K C D H G B), reconstruct the binary

3. Perform in-order, pre-order, and post-order traversals on a BST.

4. ⭐ *Write a C program to insert and delete nodes in a BST.*

5. Write a C program to implement heap operations (insert, delete, heapify).

Unit 4: Graphs
Theory Questions*

1. ⭐ *Define graph. Explain its types (directed, undirected, weighted).*

2. ⭐ *Compare BFS and DFS algorithms.*

3. ⭐ *Explain Kruskal’s and Prim’s algorithms for finding MST.*

4. What is Dijkstra’s algorithm? Explain with an example.

5. Explain the concept of topological sorting with an example.

6. Write a short note on spanning trees.

7. What is Huffman coding? Explain its applications.

8. Explain the concept of graph representation (adjacency matrix, adjacency list).

*Problems*

1. ⭐ *Apply Dijkstra’s algorithm to find the shortest path in a given graph.*

2. ⭐ *Find MST using Kruskal’s and Prim’s algorithms for a given graph.*

3. Perform BFS and DFS on a given graph.

4. Write a C program to implement graph representation using adjacency lists.

5. Write a C program to implement topological sorting.

Unit 5: Sorting, Searching & Hashing

notesmates.in notesmates.in
Downloaded from www.notesmates.in Uploaded on: 9/2/2025, 8:10:26 pm

Astroseeker - [email protected]
notesmates.in notesmates.in

*Theory Questions*

1. ⭐ *Compare internal and external sorting techniques.*

2. ⭐ *Explain Quick Sort with an example.*

3. What is Merge Sort? Explain its working with an example.

4. ⭐ *Define hash function. Explain collision resolution strategies.

5. Compare linear probing and chaining in hashing.

6. ⭐ *Explain the concept of binary search with an example.

7. What is Radix Sort? Explain its working with an example.

8. Write a short note on sequential and index-sequential files.

*Problems*
1. ⭐ Sort the following data using Quick Sort: 9, 4, 12, 6, 5, 10, 7.

2. ⭐ Sort the following data using Merge Sort: 8, 3, 5, 1, 7, 2, 6, 4.

3. Implement binary search on a sorted array.

4. Create a hash table using linear probing for the dataset: {12, 25, 36, 20, 30}.

5. Write a C program to implement Radix Sort.

*Frequently Repeated PYQs* (expected to be repeated this

2. *AVL Tree Insertion* and balancing.

3. *Infix to Postfix Conversion*.

4. *Quick Sort Implementation*.

5. *Dijkstra’s Shortest Path Algorithm*

notesmates.in notesmates.in
Downloaded from www.notesmates.in Uploaded on: 9/2/2025, 8:10:26 pm

Astroseeker - [email protected]