

Warm-up 01.04.2025
Flashcard
•
Professional Development
•
•
Practice Problem
•
Hard
Wayground Content
FREE Resource
Student preview

10 questions
Show all answers
1.
FLASHCARD QUESTION
Front
What does [] + [] evaluate to in JavaScript?
Back
2.
FLASHCARD QUESTION
Front
What does this Java snippet print? Options: true, false, NullPointerException, Compilation error
Back
false
3.
FLASHCARD QUESTION
Front
What is the result of 0.1 + 0.2 in JavaScript?
Back
0.30000000000000004
4.
FLASHCARD QUESTION
Front
What is the time complexity of the following code? Options: O(n), O(n / 2), O(log n), O(n^2)
Back
O(n)
5.
FLASHCARD QUESTION
Front
What is the time and memory complexity of the following code?
Back
time - O(n), mem -O(log n)
6.
FLASHCARD QUESTION
Front
What is the time complexity of a naïve recursive Fibonacci implementation?
Back
O(2^n)
7.
FLASHCARD QUESTION
Front
What is the main mistake in this classic binary search implementation?
Back
Integer overflow on mid = (l + r) / 2
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?