Important Questions of Data Structure and Algorithm (DSA)

 .

1. What is Data structure? Explain different operations to be performed on data structure.

2. Define stack as ADT. Convert P+Q-(R*S/T+U) - V*W into infix expression to postfix.

3. Define Queue. Explain its type with example.

4.  Difference between stack and Queue.

5. Difference between Linear Queue and circular Queue.

6. Write an algorithm to enqueue and dequeue data element in a circular queue.                             

7. Define Linked List. Explain its type. How does double linked List is different from circular linked List.

8. What is recursion and recursive function? write a recursive function to compute Fibonacci number.

9. What is an AVL tree ? Create an  AVL tree from the following data:
    18, 12, 14, 8, 85, 25, 31, 24, 27

10. Define B-tree? How to insertion and deletions of elements can be done in a B-tree.

11. Create an B-tree from the following Data: 
    3,1,4,85,9,2,6,8,7,11,13,19, 2,23

12. What is Quick Quick sort? Implement the quick sort to sort the following data items: 
    12, 1, 14,7,2, 10, 4, 7, 22, 6, 15.

13. What is insertion sort? Trace and sort the following data using insertion sort 

    90, 57, 80, 10, 22, 21, 45, 9, 78

14. What is external sorting? Explain heap sort algorithm and trace it to sort the data:
     82, 90, 10, 12, 15, 77, 55, 23, 25, 32.

15. Define Hash Function. Describe the types of collision revolution techniques with suitable example.

16. How does collision occur during hashing? Explain any bro hashing function.

18. Define graph and tree data structure. Explain breadth first traversal and depth first traversal with example.

18. Define graph as ADT. Explain the different way to represent a graph. For the following graph use Prim's algorithm to find a minimum spanning tree stating from the node A.

19. What are deterministic and non-deterministic algorithms? Explain the use of Big oh notation to measure the complexity of the algorithm with example.

20. What do you mean by Huffman Algorithm? Explain with example. Construct the B tree of order 5 using following data: 
    20, 10, 26, 55, 80, 11, 9, 60, 67, 55, 22, 76, 56, 45, 34, 100, 150.

21. What do you mean by MST? Explain kruskal's algorithm with example

22. What are depth and degree of a node in a tree? perform pre-order, in-order and post-order traversal            of the following tree: