ISL ENGINEERING COLLEGE DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING DESIGN AND ANALYSIS OF ALGORITHMS QUESTION BANK BE III Year II Semester (A & B Sections) –PC 603 CS Academic Year: 2020-21 SHORT ANSWER QUESTIONS UNIT-I 1. Why is an algorithm analysis required? 2. State about UNION & FIND operations. 3. List out the UNION algorithm using weighting rule. 4. Given f(n)=10n 2 +4n+3, then prove that f(n)=O(n 2 ). 5. List and define operations performed on sets? 6. What do you mean by performance analysis of an algorithm? Explain. 7. Explain the significance of input size of a problem. 8. State the weighting, collapsing rules in sets. 9. Explain set representation and write algorithm for FIND. 10. Solve T(n)=3T(n/3)+√n. 11. Define the terms direct recursive and indirect rec