Asymptotic Notations and Growth Functions
Curriculum and historical examination lineage for Asymptotic Notations and Growth Functions under Unit 1 (Introduction to Algorithm Design and Asymptotic Analysis) of Design and Analysis of Algorithms (21CSC204J) at SRMIST.
Historical appearance distribution across SRMIST Formative Tests (CT1, CT2) and University End Semester examinations.
Factual marks weightage of questions asked on this topic in historical examinations.
Representative historical questions extracted directly from SRMIST examination papers.
What is the worst case tight bound of Naive String matcher? [1] A. O((m-n)+1)m B. O((n-m)+1)n C. O((n-m)+1)m D. O(m-(n+1))
Which of the following is linear asymptotic notations? (A) O(1) (B) O(log n) (C) O(n) (D) O(n log n) [1]
Illustrate all asymptotic notations with graphical representation. [8]
Examinations where questions for Asymptotic Notations and Growth Functions have appeared.
Master Asymptotic Notations and Growth Functions in MintAI
Practice past exam questions, test recurring archetypes, and view predictive probability for this topic before your upcoming exam.