Back to all Digital Society topics
Topic 3.2Digital Society HL20 flashcards

Algorithms

Practice Flashcards

Flip cards to reveal answers
Card 1 of 203.2.1
3.2.1
Question

Define: algorithm

Click to reveal answer

Track your progress — Sign up free to save your progress and get smart review reminders based on spaced repetition.

All Flashcards in Topic 3.2

Below are all 20 flashcards for this topic. Sign up free to track your progress and get personalized review schedules.

3.2.14 cards

Card 1definition
Question

Define: algorithm

Answer

A set of defined steps that solves a problem or carries out a task.

Card 2concept
Question

The four characteristics of an algorithm

Answer

Unambiguous, finite, well-defined inputs and outputs, feasible.

Card 3concept
Question

How is an algorithm's effectiveness judged?

Answer

Often by efficiency — how much work it does as the size of the job grows.

Card 4comparison
Question

Is an algorithm the same as a program?

Answer

No. A recipe is an algorithm. A program is one way of expressing an algorithm so a computer can run it.

3.2.24 cards

Card 5concept
Question

The four components of an algorithm

Answer

Instructions, variables, conditionals, loops.

Card 6definition
Question

What does a conditional do?

Answer

Runs a step only if something is true — which is where decisions, and unfairness, enter an algorithm.

Card 7definition
Question

What does a loop do?

Answer

Repeats steps until a condition is met, applying one rule to every item — which turns a rule into a policy.

Card 8concept
Question

Why is a threshold never neutral?

Answer

Wherever the line falls, someone sits just the wrong side of it, and the rest of the system cannot see them.

3.2.34 cards

Card 9example
Question

Four ways to represent an algorithm

Answer

Natural language, flow chart, pseudocode, and code in a programming language.

Card 10definition
Question

Flow chart shapes

Answer

A rectangle is a step. A diamond is a decision with two ways out.

Card 11concept
Question

Why does the form matter socially?

Answer

It decides who can read and therefore check the rule. Code excludes almost everyone; a flow chart excludes almost nobody.

Card 12concept
Question

Weakness of natural language

Answer

It is ambiguous — the one thing an algorithm must not be.

3.2.44 cards

Card 13concept
Question

Four core operations on a set

Answer

Sorting (reorder), searching (find one), filtering (remove), classifying (label).

Card 14example
Question

Other uses the guide names

Answer

Prioritising, associating, counting, software development, and machine learning.

Card 15comparison
Question

Sorting vs filtering

Answer

Sorting keeps everyone and changes the order. Filtering removes, and the removed are invisible to everything downstream.

Card 16concept
Question

The question that opens a counter-argument

Answer

What happens to the person at the bottom of the ranking?

3.2.54 cards

Card 17concept
Question

The algorithmic dilemmas the guide names

Answer

Bias and fairness; accountability; transparency and black boxes; erosion or loss of human judgement.

Card 18concept
Question

Where does algorithmic bias come from?

Answer

The training data, who is missing from it, stand-in measures, and the target chosen — not from a biased rule.

Card 19concept
Question

Why is removing a protected field not enough?

Answer

Other fields stand in for it — postcode, school, a gap in work — so the model rebuilds it.

Card 20comparison
Question

Why is transparency alone not enough?

Answer

Knowing why you were rejected is useless if nobody is obliged to reconsider. Accountability is a separate requirement.

Want smart review reminders?

Sign up free to track your progress. Our spaced repetition algorithm will tell you exactly which cards to review and when.

Start Free
IB Digital Society HL Topic 3.2 Flashcards | Algorithms | Aimnova