DS Important Questions
DS Important Questions
Essay Questions
Unit - 1
1. Define Data Structure? Explain about Linear Data Structures in detail?
2. Define Searching? Write the algorithm for Linear Search? Explain it with
an example?
3. Define Searching? Write the algorithm for Binary Search? Explain it with
an example?
OR
4. Define Sorting? Write the algorithm for Bubble Sort? Explain it with the
following elements 44,33,23,43,55,12,64,77,75.
5. Define Sorting? Write the algorithm for Selection Sort? Explain it with
the following elements 44,33,23,43,55,12,64,77,75.
6. Define Sorting? Write the algorithm for Insertion Sort? Explain it with an
example.
Unit – 2
1. Define Single Linked List? Show its representation? Explain how
Insertion and Deletion of node takes place in Single Linked List with an
example?
2. Define Double Linked List? Show its representation? Explain how
Insertion and Deletion of node takes place in Double Linked List with an
example?
3. Define Polynomial? Explain addition of two polynomials?
OR
4. Define Stack? Show its representation? Write the algorithms for push
and pop operations? Explain them with an example?
5. Define Linked Stack? Show its representation? Write the algorithms for
push and pop operations? Explain them with an example?
6. Write the algorithm for Infix to Postfix conversion? Explain it with the
following example? a/b-c+d*e-a*c
1
2
Unit – 3
1. Define Queue? Show its representation? Write the algorithms for
Enqueue and Dequeue operations? Explain them with an example?
2. Define Linked Queue? Show its representation? Write the algorithms for
Enqueue and Dequeue operations? Explain them with an example?
OR
3. Define BFS? Write the algorithm for BFS and Explain with an example?
4. Define Deque? Write the algorithms for the basic operations performed
on deque and explain them with example.
Unit – 4
1. Define Binary Tree? State its properties? List different tree traversals
techniques? Explain them with example?
2. Define BST? Construct the Binary Search Tree for the following data 38,
14, 8, 23, 18, 20, 56, 45, 82 and insert and element 70 into the Binary
Search tree.
3. Define Max Heap? Discuss the insert and delete operations on max
heap with an example?
Unit – 5
1. Write the BFS algorithm and explain it with an example?
2. Write the DFS algorithm and explain it with an example?
OR
3. Define hash table? Explain various operations performed on hash table?
4. Define Collision? Discuss any two methods to resolve collision using
open addressing with an example?