Section 7

Section 7

1. Arrays, Tuples and Records

   • Arrays are finite, ordered sets of elements of the same type. 2 dimensional arrays are the same, but are displayed as tables
   • A tuple is an ordered set of values which could be elements of any type as opposed to being limited to one.
   • A record contains a number of fields which each hold only one type of data

2. Queues

   • First in First Out - New elements may only be added to the end, elements may only be removed from the front
   • Circular queue - When an object is removed from the front of the queue, the object at the back will replace it
   • Priority Queues - Same as FIFO but objects are sorted depending on their "priority"

3. Dynamic vs Static

   • Dynamic data structures can grow or shrink in size. They are useful for implementing data structures where the max size is unknown beforehand, but they may grow too large and cause an overflow error if they exceed maximum memory limit.