Explain selection sort with example.
[3 marks]Differentiate: Linear Vs Non-linear data structure.
[4 marks]Explain asymptotic notations in detail.
[7 marks]Explain applications of stack.
[3 marks]Explain Binary search with example.
[4 marks]Explain types of queues in detail.
[7 marks]Explain singly linked list and doubly linked list in detail.
Explain different methods of recurrence.
[3 marks]Explain collision resolution techniques in detail.
[4 marks]Explain Merge sort with example.
[7 marks]Explain activity selection problem in detail.
[3 marks]Explain multiplication of two large integer numbers with example.
[4 marks]Explain Quick sort with example.
[7 marks]Define the following: 1. Undirected graph 2. Directed Acyclic graph 3. Loop
[3 marks]Differentiate: DFS Vs BFS.
[4 marks]Construct the AVL tree for following sequence: 150,155,160,115,110,140,120,145,130,180
[7 marks]Define the following: 1. Degree of Tree 2. Forest 3. Complete binary tree
[3 marks]Construct binary search tree for following sequence and find inorder and preorder traversal for the same: 45,56,39,12,34,78,54,67,10,32,89,81
[4 marks]Explain kruskal’s algorithm with example.
[7 marks]Differentiate: Greedy Method Vs Dynamic Programming.
[3 marks]Explain Minmax principle.
[4 marks]Explain Matrix chain multiplication in detail.1
[7 marks]Explain general characteristics of greedy algorithm.
[3 marks]Explain Making Change problem in detail.
[4 marks]Explain eight queen’s problem in detail.
[7 marks]