• Attempt any five questions.
• All questions carry equal marks.
Write and explain the control abstraction for Divide and conquer.
Explain the theta notation used in algorithm analysis.
What is an algorithm? Explain its characteristics.
Differentiate between greedy method and dynamic programming.
Write a greedy algorithm to state the Job-Sequencing with deadlines problem. Find an optimal sequence for n=5 jobs with profits (20,15,10,5,1) and deadlines (2,2,1,3,3).
What do you mean by forward and backward approach of problem solving in Dynamic Programming?
Discuss the need of Floyd Warshall Algorithm. Write the advantages and its time complexity.
Find minimum path cost between vertex s and t for the given multistage graph using dynamic programming.
Discuss the use of lower bound theory and its uses in solving the algebraic problem.
What is graph coloring problem? Describe the backtracking technique to m-coloring with the given planar graph.
Write about Hamiltonian cycle. Draw portion state space tree for the given graph.
Construct B Tree of order 5 for the list of elements 2,8,5,6,13,9,14,12,19,24,18,15,5,16,20,21.
How do you find the height of a balanced tree? Explain with an example.
Write short notes on any two:
i) Binary search
ii) Huffman coding
iii) Tree Traversals
iv) NP completeness.
