Zion Round 1 Test Set 2
Authored by SCOB23_Aniket_Patil SCOB23_Aniket_Patil
Professional Development
University
Used 1+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
25 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
15 mins • 1 pt
Asymptotic complexity of linear search with array in average case is
2.
MULTIPLE CHOICE QUESTION
15 mins • 1 pt
Upper bound is denoted as _______
3.
MULTIPLE CHOICE QUESTION
15 mins • 1 pt
Which one of the following is not a fundamental data type in C++?
4.
MULTIPLE CHOICE QUESTION
15 mins • 1 pt
A normal queue, if implemented using an array of size N-1, gets full when
5.
MULTIPLE CHOICE QUESTION
15 mins • 1 pt
Shell sort is also known as
6.
MULTIPLE CHOICE QUESTION
15 mins • 1 pt
Which one of the following is not an algorithm design strategy?
7.
MULTIPLE CHOICE QUESTION
15 mins • 1 pt
What will be the contents of the stack after performing following operations push(1), push(2), push(2), pop, pop, pop, push(2),push(1), pop, pop.
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Microsoft
or continue with
%20(1).png)
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?
