Chapter 2 - Data and Data Processing
Completion requirements
Chapter 2 Part 6 The data processing process
Part 6: The data processing process
Data processing
Data processing refers to the systematic handling of data in order to record, store, organize, analyse, manipulate or display it. The aim of data processing is to obtain information from the raw data to support decisions or control processes.
Characteristics of data processing (EVA principle)
Algorithm
An algorithm is a finite sequence of clearly defined instructions or rules that are used to solve a specific problem or perform a calculation. Algorithms are widely used in mathematics and computer science and serve as specifications for performing calculations and data processing
Properties of an algorithm
- Finiteness: An algorithm must end after a finite number of steps.
- Unambiguity: Each step of an algorithm must be clearly and unambiguously defined.
- Inputs: An algorithm can have zero or more inputs.
- Outputs: An algorithm provides at least one output.
- Executability: The individual steps of an algorithm must be so simple that they can be executed in finite time
Examples of algorithms
- Examples of algorithms:
- Everyday life: A recipe for a cake is an algorithm: it describes the ingredients (input), the preparation steps (process) and the finished cake (output).
- Computer science: A search algorithm searches a sorted list for a specific element.
- Mathematics: The Euclidean algorithm finds the greatest common divisor (GGT) of two numbers.
- Algorithms are the basis of many modern technologies and applications. They are used in a wide variety of areas, such as
- Automation of processes.
- Optimization of resources.
- Data processing and analysis.
- Decision-making in artificial intelligence.
- Algorithms decide e.g. in social media and other applications such as YouTube, Facebook, Google, etc. which entries or advertisements are displayed to us and thus significantly determine our consumption and information behavior, which friends we have and thus influence our whole life.
Example of a simple algorithm - Bubble Sort
- A simple example of an algorithm is the Bubble Sort. Here is a step-by-step description of how this algorithm works:
- Input: A list of unsorted numbers.
- Compare: Compare the first element with the second element.
- Swap: If the first element is larger than the second, swap them.
- Move on: Go to the next pair of elements and repeat the comparison and swap.
- End of the list: When the end of the list is reached, start again at the beginning of the list.
-
Repeat: Repeat steps 2 to 5 until no more swaps are necessary.
Programming languages
- Algorithms are the basis for computer programs
- Computer programs are written in programming languages
- A programming language is a formal language that is used to develop software that can run on hardware
- Examples of programming languages are: Machine languages, Basic, C++, Java, PHP, Ruby, Perl, ...