Question Bank Based on Data Structures and Algorithms Syllabus
UNIT I
1-mark Questions:
1. Define ADT.
2. What is a singly linked list?
3. List any two operations on a list.
4. What is polynomial manipulation?
5. Define doubly linked list.
6. What is the use of circular linked lists?
7. Define insertion in a linked list.
8. What is traversal in list ADT?
9. What is list ADT?
10. Mention an application of linked lists.
5-mark Questions:
1. Explain the concept of ADT with examples.
2. Discuss array-based implementation of lists.
3. Compare singly and doubly linked lists.
4. Write short notes on polynomial manipulation.
5. Explain insertion and deletion operations in linked lists.
6. Describe merge and traversal operations in lists.
7. Discuss circular linked lists with diagram.
8. Explain applications of lists.
9. Compare array-based and linked list implementations.
10. Describe any five list operations with example.
10-mark Questions:
1. Explain the types of linked lists with operations.
2. Describe polynomial manipulation using linked lists.
3. Discuss insertion, deletion, merge and traversal in detail.
4. Write about different ADTs with examples.
5. Explain array-based vs linked list implementation.
6. Illustrate circular and doubly linked lists with diagrams.
7. Write a program for singly linked list operations.
8. Discuss implementation of polynomial addition using lists.
9. Compare and contrast various list ADTs.
10. Explain applications of different list types in real-time systems.
UNIT II
1-mark Questions:
1. What is a stack?
2. List any two applications of stack.
3. Define postfix expression.
4. What is an infix expression?
5. Define queue.
6. What is a circular queue?
7. Define priority queue.
8. What is a dequeue?
9. Mention one stack operation.
10. Mention one application of queue.
5-mark Questions:
1. Explain stack ADT operations.
2. Describe applications of stack in expression evaluation.
3. Differentiate infix and postfix expressions.
4. Explain queue ADT operations.
5. Write short notes on circular queue.
6. What are priority queues?
7. Describe dequeue operations.
8. Discuss applications of queues.
9. Explain evaluating arithmetic expressions using stacks.
10. Discuss conversion of infix to postfix.
10-mark Questions:
1. Discuss stack ADT with applications and operations.
2. Explain infix to postfix conversion using stack.
3. Describe queue and its types with diagrams.
4. Write a program for circular queue operations.
5. Explain various applications of queues.
6. Compare queue, circular queue, and dequeue.
7. Illustrate arithmetic expression evaluation using stacks.
8. Explain priority queues and their implementation.
9. Discuss stack vs queue data structures.
10. Write about implementation and applications of dequeue.
UNIT III
1-mark Questions:
1. Define tree ADT.
2. What is a binary tree?
3. List any tree traversal method.
4. What is an expression tree?
5. Define AVL tree.
6. What is a B-Tree?
7. What is a threaded binary tree?
8. Mention any one application of trees.
9. Define binary search tree.
10. What is a heap?
5-mark Questions:
1. Explain tree traversals with examples.
2. Discuss binary tree ADT.
3. Describe expression trees and their applications.
4. Explain binary search tree operations.
5. Write short notes on AVL trees.
6. Discuss threaded binary trees.
7. Explain structure and operations of B+ tree.
8. Compare B-tree and B+ tree.
9. What are heaps and their applications?
10. Describe different types of binary trees.
10-mark Questions:
1. Explain tree traversals with examples and algorithms.
2. Describe binary tree ADT and its applications.
3. Discuss AVL tree structure and rotations.
4. Compare B-tree and B+ tree with diagrams.
5. Describe expression tree and binary search tree.
6. Explain the structure and usage of heaps.
7. Illustrate threaded binary trees with operations.
8. Write a program for tree traversal methods.
9. Explain heap construction and operations with examples.
10. Discuss tree types and their applications in DSA.
UNIT IV
1-mark Questions:
1. What is a graph?
2. Define cut vertex.
3. What is topological sort?
4. What is bi-connectivity in graphs?
5. List two types of graph traversal.
6. What is an Euler circuit?
7. What is DFS?
8. Define BFS.
9. What is adjacency matrix?
10. Define connected graph.
5-mark Questions:
1. Explain DFS with example.
2. Describe BFS traversal.
3. What is topological sorting? Explain.
4. Explain bi-connectivity in graphs.
5. Define Euler circuit and its properties.
6. Discuss different representations of graphs.
7. Explain types of graphs with examples.
8. Discuss applications of graphs.
9. What is a cut vertex?
10. Compare DFS and BFS.
10-mark Questions:
1. Explain DFS and BFS with algorithms and examples.
2. Discuss topological sort with example.
3. Describe graph representations and types.
4. Explain bi-connectivity and cut vertices.
5. Discuss Euler circuits and paths with use cases.
6. Illustrate DFS and BFS with adjacency list and matrix.
7. Explain applications of graphs in real-world scenarios.
8. Compare different types of graphs with diagrams.
9. Write about graph traversal algorithms with implementation.
10. Explain properties and classification of graphs in detail.
UNIT V
1-mark Questions:
1. What is binary search?
2. Define linear search.
3. List any sorting algorithm.
4. What is shell sort?
5. Define radix sort.
6. What is hashing?
7. Define separate chaining.
8. What is open addressing?
9. What is rehashing?
10. Define hash function.
5-mark Questions:
1. Compare linear and binary search.
2. Explain bubble sort with example.
3. Write about selection sort algorithm.
4. Describe insertion sort process.
5. Explain shell sort with example.
6. Discuss radix sort and its efficiency.
7. What is hashing? Describe hash functions.
8. Explain open addressing method.
9. Discuss separate chaining technique.
10. What is extendible hashing?
10-mark Questions:
1. Explain linear and binary search with algorithms.
2. Discuss sorting algorithms with examples (any 3).
3. Compare and contrast all sorting techniques.
4. Describe hashing techniques with applications.
5. Explain radix sort and shell sort in detail.
6. Write in detail about collision resolution methods.
7. Illustrate extendible hashing with diagrams.
8. Explain the working of insertion and selection sort.
9. Describe various hashing methods with pros and cons.
10. Write algorithms for linear, binary search and analyze complexity.
