tech quiz
Authored by Karan K
Engineering
1st Grade
Used 2+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
5 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
Q1. Which data structure is most suitable for implementing recursion?
A) Queue
B) Array
C) Stack
D) Linked List
2.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
Q2. What is the worst-case time complexity to search an element in a balanced binary search tree?
A) O(n)
B) O(log n)
C) O(1)
D) O(n log n)
3.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
Q3. A priority queue can be efficiently implemented using:
A) Circular queue
B) Binary heap
C) Hash table
D) Linked list
4.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
Q4. In an AVL tree, what is the maximum difference between the heights of the left and right subtrees of any node?
A) 2
B) 1
C) log n
D) n
5.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
Q5. Which traversal of a binary search tree gives the nodes in sorted order?
A) Pre-order
B) Post-order
C) In-order
D) Level-orde
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?
