Computer Science 1.4.2

Computer Science 1.4.2

1. Arrays

   • 1D Arrays
     • Example: JediCouncil = [“Yoda”,”Even Piell”,”Saesee Tiin”,”Mace Windu”,”Plo Koon”,Oppo Rancisis”,Ki Adi Mundi”]
   • 2D Arrays
     • Vehicles = [[“A-Wing Fighter”,”AT-AT Walker”,”BARC Speeder”], [“Alliance”,Imperial”,”Republic”],[“Aircraft”,”Walker”,”Speeder”]]
   • 3D Arrays
     • A 3D Array can be visualised like a stack of 2D arrays. Example: Imagine storing student timetables. We could store each timetable separately or we could combine them into one 3D array called StudentTimetables.
   • An array is a set of data items of the same data type grouped together using a single identifier.

2. Tuples

   • Tuples are ordered sets of values which can be elements of any type such as integers, strings, unlike arrays.
   • Tuples are immutable, meaning they cannot be modified once set up.

3. Stacks and Queues

   • Stacks
     • A Stack is a data structure for handling linear lists of data. They follow a LIFO Structure, meaning Last In First Out.
     • Stacks POP items off the top of the stack and PUSH items onto the top.
     • Pointers are used to keep track of the top.
   • Queues
     • Queues are data structures where new elements are added to the back and they are retrieved from the front, using FIFO, First In First Out.
     • If the front and rear pointers had the same value the queue would be empty.

Imágenes y archivos del mapa