Subjects
Choose questions individually, practise online, or create a worksheet with matching answers. Counts include generated variants, not only authored originals.
A sorted sequence under the comparison rule
Ordering enables discarding half the interval safely.
32
3×10+2=32.
A condition preserved at a specified loop point
Initialization, preservation and termination connect the invariant to correctness.
8
64/2³=8.
It describes asymptotic growth under a cost model, while constants, hardware, implementation and input details affect wall-clock time.
Credit growth versus measured runtime.
An empty collection
Boundary cases can reveal indexing and termination bugs.
An algorithm should have a stated input contract, output goal and termination argument. A loop invariant describes what remains true at a defined point in each iteration.
UniversityAn algorithm should have a stated input contract, output goal and termination argument. A loop invariant describes what remains true at a defined point in each iteration.
UniversityAn ordered mutable collection addressed by position.
UniversityAn ordered mutable collection addressed by position.
UniversityThe array is sorted and balanced median choices are used. Count inspected elements, including the last one.
Grades 9–12The array is sorted and balanced median choices are used. Count inspected elements, including the last one.
Grades 9–12Learn core Python concepts with paper-based reasoning and small code-reading tasks.
Study HTML, CSS, JavaScript and accessible web structure without a paid bootcamp.
Learn tables, queries, joins and data modelling with original exercises.
Work through data cleaning, visualization, modelling and interpretation.
Study defensive security, privacy and risk management without offensive exploitation instructions.
Learn formulas, references, cleaning and charts for practical study and office work.