5.Asymptotic Notations and Basic Efficiency Classes
Asymptotic Notations and Efficiency Classes Quiz
Test your understanding of algorithms and time complexities with our engaging quiz! This quiz features questions designed to assess your knowledge of asymptotic notations, efficiency classes, and specific algorithm implementations.
Participate to:
- Enhance your algorithm skills
- Challenge your knowledge
- Prepare for interviews or exams
"What is the time complexity of fun()? Int fun(int n) { int count = 0; for (int I = 0; I < n; i++) for (int j = I; j > 0; j--) count = count + 1; return count; } "
Theta (n)
Theta (n^2)
Theta (n*logN)
Theta (nLognLogn)
"What is time complexity of fun()? Int fun(int n) { int count = 0; for (int I = n; I > 0; I /= 2) for (int j = 0; j < I; j++) count += 1; return count; }"
O(n^2)
O(nLogn)
O(n)
O(nLognLogn)
What is the asymptotic runtime for traversing all nodes in a binary search tree with n nodes and printing them in order?
O(n^2)
O(nLogn)
O(n)
O(nLognLogn)
Suppose we have a O(n) time algorithm that finds median of an unsorted array. Now consider a QuickSort implementation where we first find median using the above algorithm, then use median as pivot. What will be the worst case time complexity of this modified QuickSort.
O(n^2)
O(n^2 Logn)
O(n Logn Logn)
O(nLogn)
{"name":"5.Asymptotic Notations and Basic Efficiency Classes", "url":"https://www.quiz-maker.com/QPREVIEW","txt":"Test your understanding of algorithms and time complexities with our engaging quiz! This quiz features questions designed to assess your knowledge of asymptotic notations, efficiency classes, and specific algorithm implementations.Participate to:Enhance your algorithm skillsChallenge your knowledgePrepare for interviews or exams","img":"https:/images/course4.png"}