data types, data structures and algorithms

• What is an array?


  A homogenous, mutable and finite (dynamic array sizing) data type that uses a singular identifier
• How do you search through a 2D array?


  Down the rows then across the columns
• What is a queue?


  A FIFO data structure that has front and rear pointers. Whichever element of data was queued first is the first element to be dequeued.
• How do circular queues work?

  Once the queues rear pointer is equal to the maximum size of the queue, the pointer loops back to the front of the array
• What are the properties of a queue?


  Data Structure

  FIFO

  Homogenous

  Immutable

  Elements edited via enqueue and dequeue
• What is a stack? 


  A LIFO data structure that has a top pointer, the last element to be added to the structure is the first one to leave
• What are properties of stacks?


  LIFO

  Homogenous

  Immutable

  Elements edited via pop and push
• What is a tuple?


  An ordered collection of objects which can contain different data types (data structure)

  Immutable
• What is a set?


  Unordered data structure of objects that has no duplicates

  Homogenous
• What is a record?

  Groups of related items of data