Loop cards are a great game that can be played individually or as a class. They are perfect for review key vocabulary or questions at the end of a topic or when revising for an exam.
Instructions
Cut out the cards from the paper horizontally (but don't cut them in half!) and then shuffle them.
Now start joining each question on the right hand side of the card to the matching answer on the next card.
Carry on until all the cards loop together and you have competed the game!
Hint: Make sure that you set your paper to portrait to print 4 cards per sheet of A4 paper.
They can change in size during program execution, which makes them more flexible and adaptable than static data structures.
What are the appropriate applications for a queue?
Job scheduling, task prioritization, and network data handling.
What is the role of a base case in a recursive algorithm?
The base case defines the terminating condition for a recursive algorithm and prevents the function from entering an infinite loop.
What is the time complexity of removing an element from a static queue?
O(1)
What is the disadvantage of using inorder tree traversal?
The disadvantage of using inorder tree traversal is that it may not be suitable for all types of tree data structures.
What is the time complexity for deleting an element from a linked list?
Constant time or O(1) if deleting at the head or tail, otherwise linear time or O(n).
What is the advantage of using a circular queue?
It allows for efficient use of memory and avoids the need for expensive array resizing
What is a queue?
A queue is a dynamic data structure that follows the First In First Out (FIFO) principle, where the first element added to the queue is the first one to be removed.
What is the time complexity of the stack operations PUSH and POP?
The time complexity of both PUSH and POP operations is O(1).