ISL ENGINEERING COLLEGE DEPARTMENT OF INFORMATION TECHNOLOGY DESIGN AND ANALYSIS OF ALGORITHMS QUESTION BANK BE III Year II Semester – PC 602 IT Academic Year: 2020-21 SHORT ANSWER QUESTIONS UNIT-I 1. Explain linear probing in Hashing with an example. 2. Define Heap. 3. List out the collision resolution techniques in hashing. 4. Why is an algorithm analysis required? 5. State about UNION & FIND operations. 6. List out the UNION algorithm using weighting rule. 7. Given f(n)=10n 2 +4n+3, then prove that f(n)=O(n 2 ). 8. List and define operations performed on sets? 9. What do you mean by performance analysi...