27Mar
Authored by A K
Computers
University
Used 4+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
10 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the time complexity of finding the kth smallest element in a binary search tree?
O(n)
O(log n)
O(k)
O(k log n)
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which of the following is NOT a property of a heap?
It is a complete binary tree
The root node is always the largest (in a max heap) or smallest (in a min heap) element
It is always balanced
Each node's value is greater (in a max heap) or smaller (in a min heap) than its children's values
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the maximum number of nodes in an AVL tree of height 6?
63
127
255
511
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the time complexity of finding the kth largest element in a max-heap?
O(1)
O(k log n)
O(n)
O(log n)
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which of the following is an example of a problem that can be solved using recursion with dynamic programming?
Finding the longest common subsequence of two strings
Generating all permutations of a set of elements
Solving the traveling salesman problem
Calculating the determinant of a matrix
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the time complexity of inserting a node into a red-black tree?
O(1)
O(n)
O(log n)
O(log^2 n)
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the worst-case time complexity of the backtracking algorithm for solving the n-queens problem?
O(1)
O(n)
O(n!)
O(2^n)
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
Already have an account?
