Computer Science

to disproportionately favour one side, group, or outcome over others

to make or show an unjust or prejudicial distinction between different categories of people

Algorithmic bias

Computational thinking

Comparing algorithms to computer programs

Representing algorithms using flowcharts

Representing algorithms using pseudocode

Tracing algorithms

Data structures

Tackling a project using computational thinking

In this unit pupils will discover the computational thinking techniques; decomposition, abstraction and algorithmic thinking. They will reflect on differences between algorithms and computer programs and explore how algorithms can be represented. Pupils will explore the impact of algorithmic bias.

Algorithms

What is it called when an algorithm disproportionately favours one side, group or outcome over others?

helps identify and address sources of bias

makes an unjust or prejudicial distinction between groups

running the algorithm on multiple devices

writing the algorithm in a specific programming language

Algorithmic bias can always be completely eliminated.

Algorithmic bias can be fixed by using any type of data.

Algorithmic bias can be reduced but not always completely eliminated.

Algorithmic bias is not a real issue in algorithms.

Which of the following is true about eliminating algorithmic bias?

What is one way to reduce algorithmic bias?

Place these steps in order for reducing algorithmic bias.

a way of organising and storing data in a computer

Static data structures are faster than dynamic data structures.

Static data structures have fixed size, while dynamic data structures can vary.

Dynamic data structures only store numbers.

Static data structures are used for algorithms, while dynamic ones are not.

What is the main difference between static and dynamic data structures?

An {{ }} is an example of a static data structure.

a data structure whose size can change as the program runs

a data structure that only stores numbers

a data structure that is fixed in size before the program runs

It ensures the program runs without errors.

It makes the program more efficient and easier to manage.

It guarantees the program will run faster.

Why is choosing the correct data structure important?

They are faster than static data structures.

They can adjust their size during program execution.

What is a key advantage of dynamic data structures?

Exit Quiz

What is it called when an algorithm disproportionately favours one side, group or outcome over others?