Test yourself under real exam conditions: 50 timed questions, 60 on the clock, pass mark 70%%. Instant score with a full review of everything you got wrong. Free — no account needed.
Exam details
A data structure is a particular way of organizing data in a computer so that it can be used effectively.
An algorithm is a step-by-step procedure, which defines a set of instructions to be executed in a certain order to get the desired output.
Big O notation describes the upper bound of the time complexity of an algorithm. It represents the worst-case scenario.
Time complexity is a measure of the amount of time an algorithm takes to run as a function of the length of the input.
Space complexity is a measure of the amount of working storage an algorithm needs.