Professional Documents
Culture Documents
Questions Chapter Wise
Questions Chapter Wise
PART – B
1. a. Explain briefly about analysis of algorithm (8)
b. Derive worst case and average case analysis of insertion sort (8)
2. Explain in detail about asymptotic notation (16)
3. Derive time complexity for matrix addition (16)
4. Explain amortized analysis along with their methods. (16)
5. Explain Performance Analysis. (16)
2. Define arrays.
3. List out the operations of the list ADT.
4. Define Deque.
5. Define push & pop in a stack.
6. Convert the infix expression a*b/c+d to its equivalent postfix expression.
7. List out the applications of stack.
8. Define circular queue.
9. What are the different types of Linked list?
10. List out the applications of queue.
11. Define priority Queue.
12. List the advantages of circular linked list.
13. Define Structure.
PART – B
1. Write a program in C to return the position of an element X in a
Linked List L. (16)
2. (a) Explain the various types of arrays and their manipulation of data
using c with example. (8)
(b) Define structure and union and their implementation with example. (8)
3. Write a Program in C to create an empty stack and to push an element
into it. (16)
4. Explain how queues can be implemented using Arrays. (16)
5. (a) Write a ‘C’ program to add two polynomials. (8)
(b) Write a C program to implement push operation in stack. (8)
6. Explain the various applications of stacks. (16)
(16)
PART – B
1. Construct an expression tree for the expression A+(B-C)*D+(E*F). (16)
2. Write a program in C to create an empty binary search tree
& search for an element X in it. (16)
3. Explain in detail about Open Addressing. (16)
4. (a) Write a function to delete the minimum element from a
binary heap. (8)
(b) State & explain the algorithm to perform Insertion Sort. (8)
5. Write a recursive algorithm for binary tree traversal with an
Example (16)
6. Write an Huffman coding with example (16)
7. Write a C program to perform Merge sort & analyze time
complexity of the algorithm. (16)
8. Write a C program to perform Quick sort & analyze time
complexity of the algorithm. (16)
PART – A (2 Marks)
1. Define a graph.
2. Define undirected graph.
3. Define directed graph.
4. Define a path in a graph.
PART – B
1. Explain the Dijikstra’s Algorithm for finding the shortest path and
find the shortest path from v1 to v6. (16)
********************************************************