In this lesson, students learn about two-dimensional (2D) vectors, a data structure that stores elements in a grid-like arrangement of “rows” and “columns.” Every element of a 2D vector is a vector, similar to how every element of a 2D array is an array.
Students will be able to:
In this lesson, students learn about stacks, a linear data structure that follows the LIFO (Last In First Out) principle. Similar to the behavior of real-world stacks, such as a stack of plates or deck of cards, elements of a stack are both inserted and removed from the top of the stack.
Students will be able to:
push()
methodpop()
methodtop()
method size()
and empty()
In this lesson, students learn about queues, a linear data structure that follows the FIFO (First In First Out) principle. Similar to the behavior of real-world queues, such as a waiting queue or printing queue, elements of a queue are both inserted at the back of the queue and removed from the front of the queue.
Students will be able to:
push()
methodpop()
methodfront()
and back()
method, respectively.size()
and empty()
In this lesson, students complete a summative assessment of the unit’s learning objectives.
Students will be able to: