Crowdly
Add to Chrome
Questions Bank (1441086 total)
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
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 BigO for: int sum = 0?
O(n)
0%
O(1)
0%
O(log n)
0%
O(n^2)
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
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
What is the primary advantage of using a hash table?
Simplified data sorting
❌
O(1) time complexity for insertion, deletion, and search in average cases
✅
Reduced memory usage compared to arrays
❌
Predictable order of elements
❌
View this question
What is the Big-O of the following cycle: for (int i=0; i<N*N; i++) {System.out.println(i);}
O(n)
❌
O(2^n)
❌
O(log n)
❌
O(n^2)
✅
View this question
Stack method: ... - Retrieves and deletes the topmost element of the stack
T dequeue(T)
❌
T pop()
✅
T peek()
❌
int size()
❌
View this question
What is the time complexity of removing the last element (with previous) of a LinkedList?
O(n)
❌
O(1)
0%
O(log n)
0%
O(n^2)
0%
View this question
What is the typical time complexity for accessing an element at a specific index in an ArrayList?
O(n)
❌
O(1)
✅
O(log n)
❌
O(n^2)
❌
View this question
Previous
1
More pages
141573
141574
141575
141576
141577
More pages
144109
Next
Telegram
Instagram
TikTok
Question Bank
Terms of Use
Contact Us
Add to Chrome