OCR AS Computing - Data Structures

OCR AS Computing - Data Structures

1. Arrays

   • 1-dimensional
     • Has only 1 set of elements
     • Referred to as array[x], where x is the index in the array
   • 2-dimensional
     • Has 2 sets of elements
     • Referred as array [x,y], where x is the row and y is the column
   • 3-dimensional
     • Has 3 sets of elements
     • Referred to as array [x,y,z]
   • Finite, ordered set of elements of the same data type

2. Tuples

   • An ordered set of values that can be any data type
     • e.g. pupil = ("John", 78, "a")

3. Records

   • A number of fields, each holding one item of data
   • A row in a database table that consists of many elements and has information stored about

4. Queues

   • First In First Out
   • An ordered collection of items which are added to the back and removed from the front
   • enQueue - adds a new item to the rear of the queue
   • deQueue - removes an item from the front of the queue
   • isEmpty() - checks if the queue is empty

5. Stacks

   • Last In, First Out( LIFO)
   • Can be implemented as either static or dynamic structure
   • push() - Adds an item to the stack
   • pop() - Removes an item from the stack
   • peek() - Returns the top value but does not remove it
   • isEmpty/isFull - checks if the stack is empty or full

6. Lists

   • An abstract data type consisting of a number of items in which the same item may occur more than once