Grade 10 · Computing
This quiz helps revise “Algorithms and data structures” in Computing for grade 10. It has 25 questions in five categories: Linear structures, Search and sorting, Trees and graphs, Complexity, Hashing and traversal. Questions get harder as the points go up, from 100 to 500.
The 100- and 200-point questions are open here. The rest show only their first words, and there are no answers: all of that is in the game itself.
What structure stores items in indexed cells and gives direct access to an item by its position?
Which structure returns the most recently added item first?
Which structure returns items…
In the gameWhat structure consists of…
In the gameWhich structure allows items…
In the gameWhich method checks items sequentially until the target is found or the end is reached?
Which sort repeatedly swaps adjacent items when they are in the wrong order?
Which method for sorted…
In the gameWhich sort divides data…
In the gameWhich sort chooses a…
In the game
What is the top node of a tree, where its hierarchy begins, called?
What is a tree node with no children called?
What is a connection…
In the gameWhat tree structure allows…
In the gameWhat network representation uses…
In the gameWhat time order describes an operation whose number of steps does not depend on input size?
An algorithm examines each of n items once. What is its time order?
At each step, a…
In the gameTwo nested loops each…
In the gameThere are log n…
In the game
What rule transforms a key into a table position for fast access?
What is it called when two different keys are assigned the same table position?
What is the ratio…
In the gameWhich traversal visits all…
In the gameWhich traversal follows one…
In the gameAll 25 questions and the answers are in the game. Invite your class or friends with a link — guests need no account.