Crowdly
Add to Chrome
Questions Bank (1251540 total)
What is the complexity of extracting the largest element from the max-heap?
O(n)
0%
O(1)
0%
O(log n)
0%
O(n log n)
0%
View this question
What is the base case in recursion?
The maximum depth of recursion.
❌
The case where the function calls itself.
❌
The part of a function where recursion stops.
✅
The starting point of recursion.
❌
View this question
Which of the following is a valid property of a binary search tree?
Each path from the root to a leaf has the same length.
0%
Each node must have exactly two children.
0%
All levels of the tree must be filled.
0%
The left subtree contains values smaller than the root, and the right subtree contains values larger than the root.
0%
View this question
Which of the following data structures uses the First-In-First-Out (FIFO) principle?
Queue
0%
Binary Tree
0%
Hash Table
0%
Stack
0%
View this question
What BigO for: int sum = 0?
O(n)
0%
O(1)
0%
O(log n)
0%
O(n^2)
0%
View this question
What is the time complexity of: print(x+y)?
O(n)
0%
O(1)
0%
O(log n)
0%
O(n log n)
0%
View this question
What is the time complexity of adding an element to the end of a LinkedList with a tail pointer?
O(n)
❌
O(1)
✅
O(log n)
❌
O(n^2)
❌
View this question
Heap method: ... – can perform traverseUp actions starting from position ‘index’?
leftChildOf(index)
0%
heapify(index)
0%
traverseUp(index)
0%
parentOf(index)
0%
View this question
In a queue, which operation retrieves but does not remove the front element?
Enqueue
❌
Push
❌
Peek
✅
Dequeue
❌
View this question
Which of the following is an example of linear complexity?
Heap sort
0%
Binary search
0%
Recursive Fibonacci calculation
0%
Iterative loops based on input size
0%
View this question
Previous
1
More pages
122618
122619
122620
122621
122622
More pages
125154
Next
Telegram
Instagram
TikTok
Question Bank
Terms of Use
Contact Us
Add to Chrome