1.

Given a tree with N nodes and N-1 edges, calculate the maximum sum of the node
values from root to any of the leaves without re-visiting any node.

2. Implementation the  Binary Exponentiation by two different approaches

3. State Chinese Remainder Theorem with example and complete

4. Discuss the NP complete and NP hard problem ?Why some NP problems hard to solve?
5. What is Cook’s theorem.State and prove cook’s theorem
6. Discuss in detail Hamiltonian cycles
7. State any three examples of nondeterministic problems

8. What are Euclid Euler numbers ? Explain weather the given numbers
satisfy Euclid Euler Theorem or not
6, 28, 496, 8128, 33550336, 8589869056, 137438691328

1. What is breath first search in graphs? Write its algorithm and application
2.
3. What is Bubble sort? Explain with algorithm and example showing step by step
implementation for the given numbers
32,51,27,85,66,23,13,57
4. Implement radix sort on the given numbers and show its complexity
348,143,361,423,538,128,321,543,366

5. What are AVL trees? Describe the different rotations defined for AVL tree.
Insert the following elements step by step in sequence into an empty AVL tree
15,18,20,21,28,2330,26

6. Consider the binary search tree given below.

Find the result of in-order, pre-order, and post-order traversals.
Show the deletion of the root node
Insert 11, 22, 33, 44, 55, 66, and 77 in the tree

7. Consider the graph given below. Create the adjacency matrix and adjacent list of it

8. Given the following adjacency matrix, draw the weighted graph.

9. Consider five cities: (1) New Delhi, (2) Mumbai, (3) Chennai, (4) Bangalore, and (5)
Kolkata, and a list of flights that connect these cities as shown in the following table.Use
the given information to construct a graph.
Flight No Origin
Destination
101 2 3

102 3 2

103 5 3

104 3 4

105 2 5

106 5 2

107 5 1

108 1 4

109 5 4

110 4 5

10. Warshall‟s and Floyd‟s algorithm. Explain with an example.

11. Give an algorithm for constructing binary tree from given Inorder and Preorder traversals
Inorder DBFEAGCLJHK
Post order DFEBGLJKHCA
1. Construct the E denotes the following algebraic expression
[a+(b-c)]*[d-e)/(f+g-h)]
Draw its binary tree and its preorder and post order expression
12. Discuss the prims algorithm for minmum spanning tree. Give an example.
13. Implement Dijkshtra’s algorithm

14. Write a note on complexity analysis. Analysis the complexity of sorting algorithm
 15. Give an algorithm for printing the level order data in reverse order. For example, the
output for the below tree should be: 4 5 6 7 2 3 1

16. Construct minimal AVL trees of height 0,1,2,3,4, and 5. What is the number of
nodes in a minimal AVL tree of height 6?

2. Describe briefly 15-puzzle problem.

3. Describe flow network in route discovery
4. Describe pipe network problem.

How many different binary trees are possible with 3 nodes?

How to delete a node from a Binary tree

How to Finding Maximum and maximum Element in Binary Search Trees