# 1
| |||

| |||

Anna University Question Bank for CSE |

# 2
| |||

| |||

Re: Anna University Question Bank for CSE
here I am giving you question paper for BE Computer Science and Engineering course offered by Anna university in PDF file attached with it so you can get it easily some questions are given below : UNIT – I FUNDAMENTALS OF ALGORITHMS 1. Define Algorithm. 2. Define space complexity. 3. Define time complexity. 4. Define efficiency of an algorithm. 5. How will calculate the space complexity of an algorithm? 6. How will calculate the time complexity of an algorithm? 7. Define Big “Oh” notation. 8. Define Big “Theta” notation. 9. Define Big Omega notation. 10. Define Amortized analysis. 11. List out the limitations of asymptotic notations. 12. What are the characteristics of an algorithm? 13. Define Potential method. 14. What are the methods available for amortized analysis? 15. Why we go for Amortized Analysis? 16. List out the uses of an algorithm.
__________________ Answered By StudyChaCha Member |

Our Latest Videos |

Sponsored Links |