Big-O complexity
For ages 17 and up.
Ten common operations and their time complexity.Start the quiz Every kit
What it asks
- What is the time complexity of quicksort, on average?O(1) · O(n log n) · O(n) · O(log n)quicksort, on average is O(n log n).
- What is the time complexity of insertion sort, in the worst case?O(log n) · O(n log n) · O(n) · O(n²)insertion sort, in the worst case is O(n²).
- What is the time complexity of linear search on an unsorted array?O(log n) · O(1) · O(n) · O(n²)linear search on an unsorted array is O(n).
- Field
- Computing and data
- Level
- ages 17 and up
- Questions
- 10, fresh each time
- Shape
- Multiple choice
- Made by
- rule, in code, no model
- Settings
- practice: answers at once, retries without limit, no security
About this kit.
Ten common operations and their time complexity.
What the computing and data kits are
Programming, algorithms, data structures, databases, networks, security and computing theory: code read and its output given, lines put in order, a program annotated, complexity classified, terms defined. For students, self-learners and hiring.
Why they are built this way
The only honest test of programming is programming. The code shapes here run the candidate's code against tests, ask what a program prints, and ask for the bug. Multiple choice about code tests reading; these test the skill.
How to use them
Use code-read kits to build fluency, code-exec for the real thing. Paste your own code base or documentation for questions on it. For hiring, combine the code shapes with a test from your own stack.
Made by rule
This kit is made in code: every time it opens, the numbers, words or arrangements are drawn fresh from its rule, so the same kit taken twice is two different quizzes from one rule. There is no answer bank to find, and the practice never runs out. Each question carries its explanation, shown at once in study mode.
The shape: multiple choice
The workhorse of assessment: one right answer among plausible options, marked at once, comparable across every student. Written well, the wrong options map the misconceptions in the room.
EdProcto marks selection questions by rule the moment the answer is given. Several-answer shapes give credit for the part that is right when partial credit is on; negative marking takes one over the number of wrong options, so guessing earns nothing on average; a confidence rating earns a bonus when sure and right and a larger penalty when sure and wrong, so it pays only when it is honest. Options can be shuffled per student, and the analysis shows which wrong option beat the right one.
Taking it
Open it in study mode for the answer and the explanation after each question, and a retry of only what you missed. Switch to exam mode for the real conditions. It comes due again in a few days; the dashboard shows what is due and what you missed last time. Share it with a code for a class, print it as a paper, or host it on a screen for a room.
Questions.
- What is in the Big-O complexity kit?
- 10 questions made by rule with fresh numbers every time it is opened, each with an explanation. Ten common operations and their time complexity.
- Does it cost anything?
- A free account opens every kit. Procto AI’s writing runs on a monthly allowance that the free plan includes; a children’s kit uses none of it, because its questions are made by rule.
- What happens after the quiz?
- The study screen shows the answer and the explanation after each question, then the questions missed, and offers a retry of those. Come back in a few days and take it again: what is still right then is what is known.
Also in computing and data.
Write 37 in binary.
Write 200 in hex.
A = 1, B = 0 into a NAND gate: the output?
SELECT COUNT(*) WHERE age > 30 on a small table.
print("python"[1:4])
What does this print?