T.J.S.

ENGINEERING COLLEGE
TJS Nagar, Kavaraipettai, Chennai 601206 DEP RT!ENT O" CO!P#TER SCIENCE ND ENGINEERING I!PORT NT 16 ! RK $#ESTIONS

UNIT-I 1) What are the important problem types focused by the researchers? Explain all the types with example 2) What is empirical analysis of an algorithm? Discuss its strength and weakness. ) Discuss the fundamentals of analysis framework. !) Explain the "arious asymptotic notations used in algorithm techni#ues. $) Describe briefly the notions of complexity of algorithm. %) What is pseudo code? Explain with an example. &) Explain "arious criteria used for analy'ing algorithms. () Discuss briefly the se#uence of steps in designing and analy'ing algorithm )) Explain the general framework for analy'ing the efficiency of algorithm 1*) Explain the fundamentals of algorithmic problem sol"ing with algorithm design and analysis process diagram 11) Explain simple factoring algorithm with example 12) Explain the Euclid+s algorithm with example ,-./0.. 1) Discuss the general plan for analy'ing the efficiency of non recursi"e algorithms 2) Write an algorithm for a gi"en numbers to n generate the nth number of the 1ibonacci se#uences. ) Explain the necessary steps for analy'ing the efficiency of recursi"e algorithms. !) Write short notes on algorithm "isuali'ation $) Design a recursi"e algorithm to compute the factorial function 12n) 3n4 for an arbitrary non negati"e integer n also deri"e the recurrence relation. %) Explain the general plan for mathematical analysis of recursi"e algorithms with example. &) Explain algorithm "isuali'ation with examples. () Write an algorithm to find the number of binary digits in the binary representation of a positi"e decimal integer and analy'e its efficiency )) Write an algorithm for finding of the largest element in a list of n numbers 1*) Differentiate mathematical analysis of algorithm and empirical analysis of algorithm 11) Explain static algorithm "isuali'ation and dynamic algorithm "isuali'ation with example 12) Explain algorithm animation with example ,-./0... 1) Explain 5rute force method with proper example 2) Explain selection sort and bubble sort algorithm with proper example ) Explain se#uential searching algorithm with example !) Explain brute force string matching algorithm with example $) Explain the di"ide and con#uer algorithms with example %) Explain merge sort algorithm with example &) Explain #uick sort algorithm with example () Explain binary search algorithm with example )) Explain binary tree tra"ersals and related properties with example 1*) Explain insertion sort with example 11) Explain Depth 1irst 6earch and 5readth 1irst 6earch 12) Write an algorithm to sort a set of - numbers using insertion sort 1 ) /race the algorithm for the following set of number 2*7 $7 1(7 ( 1!7 !17 7 )

1!) 8ention any three search algorithms which is preferred in general? why? ,-./0.9 1) Explain /ransform and con#uer techni#ues with example 2) Explain pre sorting ) Explain balanced search tree with example !) Explain 5inary 6earch /ree with example $) Explain :9; /rees with example %) Explain Warshall+s algorithm with example &) Explain 1loyd+s algorithm with example () Explain <ptimal 5inary search trees with example )) Explain =rim+s algorithm with example 1*) Explain >ruskal+s :lgorithm 11) Explain Di?kstra+s :lgorithm 12) Explain @uffman /rees 1 ) Explain the method of finding the minimum spanning tree for connected graph using prims algorithm 1!) @ow will you find the shortest path between two gi"en "ertices using Di?kkstra+s :lgorithm? Explain ,-./09 1) Explain backtracking with example 2) Explain n0Aueen+s problem with example ) Explain @amiltonian circuit problem with proper example !) Explain subset problem with proper example $) Explain 5ranch and bound /echni#ues with proper example %) Explain >napsack problem with example &) Explain tra"elling salesman problem with example () Explain strassen+s matrix multiplication problem with example )) Discuss the features of tra"elling salesman problem 1*) Bi"en a graph B3C97E7WD shown in the figure where "ertices refer to cities7 edges refer to connection between cities7 weight associated with each edge represents the cost. 1ind out the minimum cost for the salesman 11) Discuss -= completeness in >napsack problem with ?ustification 12) :pply backtracking techni#ue to sol"e the following instance of the subset sum problem 63C17 7!7$D and d311 1 ) Explain subset problem and discuss the possible solution strategies using backtracking