Design and Analysis of Algorithm
Max Marks: 20
Note: The Question paper is divided into three sections A, B, and C. Write Answer as per the given instruction.
Section-A (Very Short Answer Type Questions)
Note: Answer all questions. As per the nature of the question you delimit your answer in one word, one sentence or maximum up to 30 words. Each question carries 1 mark. 4×1=04
Q.1 Binary search is applied in already————array.
Q.2 Merge sort algorithm is an——-sorting algorithm
Q.3 The algorithm divides the array into two halves in ———.
Q.4 Divide and conquer algorithm is applied in a problem when sub-problems are——————————–.
Section-B (Short Answer Questions)
Note: Answer any 2 questions. Each answer should not exceed 200 words. Each question carries 4 marks. 2×4=08
Q1. What is the type of quick sort algorithm? External or internal?
Q2. Why does not quick sort algorithm need to combine the sorted sub-arrays later?
Q3. Compute 37 using divide and conquer method.
Q4. What are the difference between quick sort and merge sort algorithm?
Section ‘C’ (Long Answer Questions)
Note: Answer any one question. You have to delimit your each answer maximum up to 800 words. Each question carries 08 marks.
Q1. Given an array of n integers, write an algorithm to find the smallest element. Find number of instruction executed by your algorithm. What are the time and space complexities?
Q2. How does the binary search algorithm follow the divide and conquer method? Explain with an example
Latest Govt Job & Exam Updates: