NOTICE

Here is the list of assignments on Data Structures and Algorithm (CS-102) for Section A and Section B students (ONLY) of 2nd year (including backlog students of Section A and Section B) which they have to submit on 28th April 2012 between 5:00pm to 6:00pm at my office (2nd floor CSE Department, Room No 30), failing of which no marks will be credited to them. N.B: Individually you should come and deposit the record. Dont submit in a piece of paper.
1. Sort the following elements using selection sort method 34, 23, 67, 89, 45, 12, 66, 90, 17, 9 2. Search the element 88 from the list of elements using linear search, Binary search and Fibonacci search. Specify the number of comparison that you have made for each case. 22,33,55,66,77,88,99 3. Define recursion. Write a recursive algorithm to find the multiplication of two numbers by repeated addition with a constraint that minimum number of function call (e.g. 13*3 = 13+13+13 but not 3+3+3+13 times) 4. Which sorting algorithm is the best one (no. of comparison is less) for the following group of elements? 8, 8, 8, 8, 8, 8, 8, 8, 8, 8 5. Perform QUICKSORT on the array given below. You must show the content of the array at 44 33 11 55 77 90 40 60 99 22 88 66

each step in the sorting process. 6. Construct DFS starting at node 0 for the graph whose adjacency matrix is given below 0 0 0 0 0 0 0 1 1 0 1 0 0 0 2 1 0 0 0 0 1 3 0 0 1 0 1 0 4 0 1 0 0 0 0 5 0 0 0 1 1 0

0 1 2 3 4 5