Code No: 54109/MT M.Tech.

– I Semester Supplementary Examinations, September, 2008 ALGORITHM ANALYSIS & DESIGN (Embedded Systems) Time: 3hours Answer any FIVE questions All questions carry equal marks ---

NR

Max. Marks:60

1. 2.a) b) 3. 4. 5. 6. 7. 8.

What is time and space complexity? Give and explain asymptotic notations with suitable examples. What is P and NP-complete problem? Prove that the color ability problem is NP-complete even if K is restricted to 3 and the maximum degree of any vertex is 4. Write an algorithm to find residues of a polynomial modulo a collection of polynomial moduli. Write the fast Fourier transform algorithm with an example. What do you mean by forward and backward approach of problem solving in dynamic programming and explain the algorithms. Write an algorithm to search an element in a list using binary search technique and derive time complexites. Write and explain a procedure for in order traversal of a tree with example and analyze the time and space complexity. Explain set representation using trees and develop algorithms for UNION and FIND using weighting and collapsing rules. ^*^*^

Sign up to vote on this title
UsefulNot useful