KARPAGAM ACADEMY OF HIGHER EDUCATION

(Deemed to be University)
(Established Under Section 3 of UGC Act, 1956)
Eachanari Post, Coimbatore- 641 021
FACULTY OF ARTS, SCIENCE, COMMERCE AND MANAGEMENT
DEPARTMENT OF COMPUTER APPLICATIONS
COURSE CODE : 24CAP103 COURSE NAME : ADVANCED DATA STRUCTURES
AND ALGORITHMS
CLASS : I MCA SECTION : A
QUESTION BANK
UNIT – I
TWO MARKS
1. Define a linear linked list and explain its basic structure.
2. Describe the concept of a doubly linked list and its advantages over a singly linked list.
3. Explain the purpose of a header node in a header linked list.
4. Name two common operations performed on linked lists and briefly explain each.
5. What is a stack, and what principle does it follow?
6. How can you represent a stack in memory using an array?
7. List two fundamental operations performed on stacks
8. Give an example of an application where stacks are commonly used.
9. Define a queue and its primary principle of operation.
10. Name two essential operations performed on queues and describe them briefly.

SIX MARKS
1. Explain the process of inserting a new node at the beginning of a linear linked list. Provide a
step-by-step illustration.
2. Discuss the advantages and disadvantages of using a doubly linked list compared to a linear
linked list. Provide examples of scenarios where each would be preferred.
3. Compare and contrast the implementations of stacks using arrays and linked lists. Discuss
the advantages and disadvantages of each approach.
4. Describe the operations involved in reversing a linear linked list. Provide both iterative and
recursive algorithms for reversing the list.
5. Compare and contrast the implementations of queues using arrays and linked lists. Discuss
the time complexity of various queue operations in each implementation.
6. Describe the operations involved in converting an infix expression to a postfix expression
using a stack. Provide a step-by-step example for a complex expression.
7. Explain the implementation of a stack using a dynamic array that automatically resizes itself
when it becomes full. Discuss the time complexity of push and pop operations in this
implementation.
8. Discuss the application of linked lists in representing polynomials. Explain how polynomial
addition and multiplication can be performed using linked lists.
9. Describe the process of implementing a priority queue using a heap data structure. Discuss
the operations involved in maintaining the heap property.
10. Explain the concept of a header linked list and its role in simplifying operations on linked lists.
Provide examples of scenarios where header linked lists are useful.
 11. KARPAGAM ACADEMY OF HIGHER EDUCATION
(Deemed to be University)
(Established Under Section 3 of UGC Act, 1956)
Eachanari Post, Coimbatore- 641 021
FACULTY OF ARTS, SCIENCE, COMMERCE AND MANAGEMENT
DEPARTMENT OF COMPUTER APPLICATIONS
COURSE CODE : 24CAP103 COURSE NAME : ADVANCED DATA STRUCTURES
AND ALGORITHMS
CLASS : I MCA SECTION : A
QUESTION BANK
UNIT – II
TWO MARKS
1. Define a binary tree and explain its basic structure.
2. What is the root of a tree, and how is it identified?
3. Explain the concept of a leaf node in a tree.
4. Differentiate between a binary tree and a binary search tree.
5. What is the primary property that distinguishes a binary search tree?
6. Explain the term "parent" node in the context of a tree.
7. Define the depth of a node in a tree.
8. What is the main goal of AVL trees, and how do they achieve it?
9. Define threaded binary trees and explain their advantage over regular binary trees.
10. What are B-trees, and in what context are they commonly used?

SIX MARKS
1. Describe the process of creating a binary tree from a given set of data. Provide step-by-step
illustrations.
2. Discuss the importance of maintaining the binary search tree property during insertion and
deletion operations. How they are resolved.
3. Discuss the concept of threaded binary trees and how they improve the efficiency of tree
traversal operations. Provide examples of threaded tree traversal algorithms.
4. Explain the structure and operations of a B-tree, focusing on how it maintains balance and
optimizes search operations. Discuss scenarios where B-trees are preferred over BST.
5. Discuss the characteristics and advantages of B+ trees compared to B-trees. Explain how B+
trees support efficient range queries and sequential access.
6. Compare and contrast max heaps and min heaps in terms of their properties and
applications. Provide examples of scenarios where each type of heap is useful.
7. Discuss the heap sort algorithm and its time complexity. Provide a step-by-step explanation
of the heap sort process.
8. Explain how heaps can be used to implement priority queues. Discuss the operations
involved in priority queue management using heaps.
9. Describe the process of deleting a node from a binary search tree and restoring the binary
search tree property after deletion. Provide examples to illustrate different cases.
10. Discuss the advantages of using binary search trees over other data structures for
implementing dictionaries or associative arrays. Provide examples of dictionary operations
on binary search trees.
 11. KARPAGAM ACADEMY OF HIGHER EDUCATION
(Deemed to be University)
(Established Under Section 3 of UGC Act, 1956)
Eachanari Post, Coimbatore- 641 021
FACULTY OF ARTS, SCIENCE, COMMERCE AND MANAGEMENT
DEPARTMENT OF COMPUTER APPLICATIONS
COURSE CODE : 24CAP103 COURSE NAME : ADVANCED DATA STRUCTURES
AND ALGORITHMS
CLASS : I MCA SECTION : A
QUESTION BANK
UNIT – III
TWO MARKS
1. Define a graph and explain its basic components.
2. What is the difference between a directed graph and an undirected graph?
3. Define the degree of a vertex in a graph.
4. Describe the adjacency matrix representation of a graph.
5. What is a path in a graph, and how is it different from a cycle?
6. Explain the concept of a directed acyclic graph (DAG).
7. What is a spanning tree, and how does it differ from a minimum spanning tree?
8. Define the term "topological sort" in the context of directed acyclic graphs.
9. What are articulation points in a graph, and why are they significant?
10. Define biconnected components in a graph.

SIX MARKS
1. Explain the adjacency list representation of a graph. Discuss its advantages over the
adjacency matrix representation.
2. Discuss the operations involved in performing a depth-first search (DFS) traversal of a graph.
Provide an example of DFS traversal on a given graph.
3. Explain the concept of Dijkstra's algorithm for finding the shortest paths in a weighted graph.
Provide a step-by-step example of Dijkstra's algorithm on a given graph.
4. Describe the concept of topological sorting and its application in scheduling tasks with
dependencies. Provide an example scenario where topological sorting is used.
5. Discuss the importance of articulation points in graph theory. Explain how they are identified
and their significance in network analysis.
6. Explain the concept of bridges in a graph. Discuss their significance in network reliability and
connectivity.
7. Define biconnected components in a graph and explain their role in network analysis.
Provide examples of real-world applications.
8. Describe Eulerian tours and their properties. Explain how Eulerian tours can be used to solve
the Eulerian path problem.
9. Explain the concept of Hamiltonian tours in a graph. Discuss their significance in the traveling
salesman problem and network routing.
10. Compare and contrast Eulerian tours with Hamiltonian tours. Discuss their respective
properties and applications in graph theory.
 KARPAGAM ACADEMY OF HIGHER EDUCATION
(Deemed to be University)
(Established Under Section 3 of UGC Act, 1956)
Eachanari Post, Coimbatore- 641 021
FACULTY OF ARTS, SCIENCE, COMMERCE AND MANAGEMENT
DEPARTMENT OF COMPUTER APPLICATIONS
COURSE CODE : 24CAP103 COURSE NAME : ADVANCED DATA STRUCTURES
AND ALGORITHMS
CLASS : I MCA SECTION : A
QUESTION BANK
UNIT – IV
TWO MARKS
1. Define a direct address table and explain its basic structure.
2. What is a hash table, and how does it differ from a direct address table?
3. Explain the concept of a hash function in the context of hash tables.
4. Describe the process of resolving collisions in hash tables.
5. What is synonymous chaining, and how does it help in collision resolution?
6. Explain the concept of open addressing in hash tables.
7. Define rehashing and explain its significance in hash table operations.
8. What are the advantages of using a hash table over other data structures?
9. How does the load factor affect the performance of a hash table?
10. Explain the term "collision" in the context of hash tables.

SIX MARKS
1. Discuss the advantages and disadvantages of direct addressing compared to hash tables for
storing large datasets. Provide suitable examples
2. Explain the concept of a hash function and discuss the characteristics of a good hash
function. Provide examples of common hash functions used in practice.
3. Describe the process of collision resolution in hash tables. Compare and contrast
synonymous chaining and open addressing as collision resolution techniques
4. Compare and contrast the time complexity of basic operations (insertion, deletion, and
search) in hash tables using synonymous chaining and open addressing for collision
resolution.
5. Describe a scenario where a hash table with open addressing would outperform a hash table
with synonymous chaining, and vice versa.
6. Discuss the impact of hash function collisions on hash table performance. Explain how a
well-designed hash function can minimize collisions and improve hash table efficiency.
7. Explain the concept of dynamic resizing in hash tables. Discuss the trade-offs involved in
choosing an appropriate resizing strategy and its impact on hash table performance.
8. Discuss the importance of uniformity in hash function distribution. Describe techniques used
to achieve uniform distribution and their impact on hash table performance.
9. Describe the process of handling deletion in hash tables with synonymous chaining and open
addressing. Discuss the challenges associated with deletion and techniques
 10. Compare and contrast the space efficiency of hash tables using synonymous chaining and
open addressing. Discuss how the choice of collision resolution technique impacts space
utilization and memory overhead.
KARPAGAM ACADEMY OF HIGHER EDUCATION
(Deemed to be University)
(Established Under Section 3 of UGC Act, 1956)
Eachanari Post, Coimbatore- 641 021
FACULTY OF ARTS, SCIENCE, COMMERCE AND MANAGEMENT
DEPARTMENT OF COMPUTER APPLICATIONS
COURSE CODE : 24CAP103 COURSE NAME : ADVANCED DATA STRUCTURES
AND ALGORITHMS
CLASS : I MCA SECTION : A
QUESTION BANK
UNIT – V
TWO MARKS
1. Define Bubble sort and explain its basic operation.
2. Explain how Insertion Sort works and its best-case time complexity.
3. Define Bucket (or Radix) sort and discuss its suitability for sorting integers.
4. Explain the concept of Merge Sort and its time complexity.
5. Describe the partitioning process in Quick Sort and its significance.
6. Define Heap Sort and discuss its use of a heap data structure.
7. Explain the concept of Shell Sort and its improvement over Insertion Sort.
8. Define Linear Search and explain its basic algorithm.
9. Describe the Binary Search algorithm and its time complexity.
10. Discuss the stability property of sorting algorithms and its importance.

SIX MARKS
1. Compare and contrast Bubble Sort, Selection Sort, and Insertion Sort in terms of their time
complexity, space complexity, and stability. Provide suitable examples
2. Discuss the concept of radix sort and its application in sorting integers. Explain how radix
sort works, and analyze its time complexity.
3. Explain the Divide and Conquer strategy employed by Merge Sort and Quick Sort. Compare
and contrast the partitioning process in Quick Sort with the merging process in Merge Sort.
4. Discuss the steps involved in implementing Heap Sort and analyze its time complexity.
Explain how the heap data structure is used in Heap Sort, and discuss its advantages and
limitations.
5. Compare and contrast linear search and binary search in terms of their time complexity,
space complexity, and suitability for sorted and unsorted arrays.
6. Describe the process of merging two sorted arrays efficiently. Discuss the time complexity of
the merging process and its significance in sorting algorithms such as Merge Sort.
7. Discuss the concept of stability in sorting algorithms and its relevance in practical
applications. Provide neat examples.
8. Explain the concept of searching in the context of sorting algorithms. Discuss the role of
searching techniques such as linear search and binary search in sorting algorithms
9. Discuss the concept of external sorting and its importance in scenarios where data cannot fit
entirely in memory. Describe the various techniques used in external sorting.
10. Compare and contrast the performance of sorting algorithms such as Quick Sort, Merge Sort,
and Heap Sort on different datasets, including sorted, partially sorted, and randomly shuffled
arrays. Discuss factors that influence their performance.