Search the courses, subjects, tracks, games and features, or jump straight to a page.
4 cards from this section. Quick, good the night before a test.
What is an array?
Think about how you can access its elements.
Define a stack.
Which order does it follow?
What data structure operates on a FIFO basis?
Remember about arrival order.
A stack follows which principle?
Last in is the first out!
Design a simple application using a stack; explain how it maintains state.
Think about how the back button functions.
Implement a basic priority queue algorithm and discuss its efficiency.
Consider scenarios where urgent tasks may need to be prioritized.
5 more questions in this section. Enroll free to practise them all.
Enroll free