Task: Learning Journal

Open your Learning Journal by clicking on the image below

Good notes will help you organise and process data and information

Task 1: Fill out your learning Journal.

Open your Learning Journal and complete the task below .

Data Structures

In computer science, a data structure is a way of organizing and storing data in a computer so that it can be accessed and modified efficiently. Some common data structures include arrays, linked lists, stacks, queues, trees, and graphs. Each data structure has its own advantages and disadvantages and is suited for specific types of problems. The choice of a data structure is often determined by the specific requirements of a problem or application.

Arrays

An array is a data structure that stores a collection of items, similar to a list, but it has a fixed size. Think of an array as a row of lockers in a school, each locker has a number (index) and can store one item. Once the lockers are full, you can't add more items to it, but you can change the item stored in any locker.

For example, in computer science, an array can be used to store a list of integers or a list of strings, each element can be accessed by its index, just like opening the locker with the corresponding number. They are useful when you know the number of items you are going to store and you need to access the items quickly by their index.

Lists

A list in computer science is a data structure that also stores a collection of items, similar to an array. But unlike an array, a list can be resized, meaning you can add or remove items from it. Think of a list as a box where you can put things in and take things out whenever you want.

For example, in computer science, a list can be used to store a collection of integers or strings and you can add or remove items from the list as needed. The items in the list have no specific order and they can be accessed using an index just like an array, but unlike an array, you can easily add or remove items without worrying about the size. Lists are useful when you don't know the number of items you are going to store or when you need to insert or delete items often.

Records

A record is a data structure in computer science that stores a collection of related data items as a single unit, similar to a row in a spreadsheet or a struct in C.

Imagine a school's student file card, each card contains information about one student like name, age, gender, address, etc. Each piece of information is a field or attribute and the whole card is the record.

Two- dimensional Arrays

A two-dimensional array is a data structure in computer science that stores a collection of items in a grid-like format, similar to a table in a spreadsheet. Imagine a grid of lockers, each locker is addressed by its row and column, and can store one item.

For example, in computer science, a two-dimensional array can be used to store a table of numbers or strings, where each element can be accessed by its row and column. They are useful when you need to organize information in a tabular format, like a table of scores or a map.

Summing it all up

Lets look at the learning outcomes and decide which one best describes our current level of understanding :

Tick the one you feel is closest to your level