UNIT -1

2m
1. Describe the types of data structures?
2. What is a linear data structure?
3. What is ADT (abstract data types)?
4. Define time complexity
5. Define space complexity
6. Classify sorting algorithms
7. Write a note on implicit and explicit sorting techniques
8. Which sort algorithm works best on mostly sorted data
9. Classify searching algorithms

5m
1. What is linear data structure? List various types and explain the algorithm for
implementations of any one
2. What is an ADT? What are the basic operations typically associated with ADTs?
3. Explain time and space complexity analysis for linear data structure with suitable example.
4. Write a program to print elements of given array in reverse order and analyze its time and
space complexities

5. Write an explain the algorithm linear search technique with example program? Explain the
time and space complexity analysis of linear search algorithm
6. Write an explain the algorithm binary search technique with example program? Explain the
time and space complexity analysis of binary search algorithm

7. Write an explain the algorithm bobble sort technique with example program? Explain the
time and space complexity analysis of bobble sort algorithm
8. Write an explain the algorithm insertion sort technique with example program? Explain the
time and space complexity analysis of insertion sort algorithm
9. Write an explain the algorithm selection sort technique with example program? Explain the
time and space complexity analysis of selection sort algorithm
 UNIT – 2
2m

1. define a linked list

2. Write various types of lists?
3. How to create a node
4. How can you represent a linked list node?
5. What is a singly linked list
6. How many pointers are necessary to implement a simple linked list
7. What is double linked list
8. What is circular lined list
9. Difference between arrays and linked list
10. Write the Application which use linked list

5m

1. Explain the representation of singly linked list and its implementation. Write the pseudo code
(algorithm) for insertion, delectation and traversal operations on single linked list.
2. Explain the representation of double linked list and its implementation. Write the pseudo
code (algorithm) for insertion, delectation and traversal operations on double linked list.
3. Explain the representation of Circular linked list and its implementation. Write the pseudo
code (algorithm) for insertion, delectation and traversal operations on Circular linked list.
4. What is linked list? Explain how sparse matrices can be represented using linked list
5. Explain application of linked lists with suitable example
6. Explain the differences between arrays and linked lists in term of their implementation and
performance
 UNIT 3
2m

1. What is stack?
2. Write advantage of stack
3. Write the application of stack in search operation
4. What is the importance of “To of stack”?
5. Explain why stack is recursive data structure
6. Define the term backtracking
7. What is reversing list in stack

5m

1. Brief explain the properties and operation of stack

2. Write an algorithm to implement stack using arrays
3. Write an algorithm to implement stack using linked list

4. Explain how an arithmetic expression can be evaluated using stack. Give suitable example
5. Explain how to infix to postfix (or) prefix transformation can be done using stack. Given
suitable example
(Or)
convert the following infix expression to postfix and prefix expression.
(a + b / c) * d / ( e – f) + g

6. Write an algorithm to print reversing list using stack

7. Explain application of stack in recursive functions with example
8. Write an algorithm to implement backtracking. Give some application
 UNIT – 4
2m

1. What is queue
2. Write different types of queues
3. List of the application of queues
4. Write advantage of queue
5. What is Dequeue (double ended queue)
6. What are the benefits of circular queue
7. List the application of circular queue

5m:

1. Brief explain the properties and operation of Queue (enqueue)

2. Write an algorithm to implement Queue using arrays
3. Write an algorithm to implement Queue using linked list

4. Brief explain the properties and operation of DeQueue (double ended Queue)
5. Write an algorithm to implement Dequeue using arrays
6. Write an algorithm to implement Dequeue using linked list

7. Describe how queues are utilized in Breadth-first search algorithm

8. Discuss the application of Dequeue (double ended queue) with suitable example
9. Discuss the role of queues in scheduling algorithm for task management. Explain
 UNIT – 5
2m

1. What is tree
2. List of different types of trees
3. What is node, Edge, root, parent node, child node, sibling node, leaf node, degree of node,
level, height, depth
4. What is binary search tree
5. What are the applications of binary tree
6. What is operation on binary search tree
7. What are the properties of binary search tree (BST)
8. Define the hashing
9. Define the hash table
10. Define the hash function
11. What is the collision
12. List of the hashing techniques
13. How to dealing methods of collision
14. What is separate chaining (closed addressing)
15. What is open addressing
16. Define linear probing
17. Define quadratic probing
18. Define the doble hashing

5m

1. Write the insertion and deletion operation on binary search tree? Write the algorithm for the
operations?
2. What is the binary search tree? Construct the binary search tree
50,27,12,45,52,2,37,18,49,12,30
3. Write a recursive algorithm for in-order, pre-order, post-order tree traversals
4. What is hash function? Explain the different hash functions with example
5. What is collision in hash table? Explain how collision can be resolved using separate chaining
6. What is collision? explain with example. Explain the different collision resolution techniques
with example
7. Write about the concepts of open addressing and write the algorithm to implement it