3.1.3

Algorithms (1/2)

Test yourself on Algorithms (1/2)

Test your knowledge with free interactive questions on Seneca — used by over 10 million students.

Algorithms

 

Definition

Definition

  • An algorithm is the steps and rules that are followed when completing a process.
  • The main actions in an algorithm are sequence, selection and repetition.
Sequence

Sequence

  • The sequence is the order of the steps.
    • E.g. the toppings cannot be put on the cakes until they are cooked.
Selection

Selection

  • Selection is a yes/no choice.
  • A yes/no choice can be thought of as an ‘if ... then’ instruction.
  • E.g. should the cakes be taken out of the oven?
    • If an inserted knife comes out clean, then yes.
    • If an inserted knife comes out dirty, then no.
Repetition

Repetition

  • Repetition means doing the same step over again.
Jump to other topics
1

Using Computers

1.1

Computers as a Tool

1.1.1Uses of Computers1.1.2More Uses of Computers1.1.3Advantages of Information Technology1.1.4More Advantages of Information Technology
1.2

Data

1.2.1Storing Data1.2.2Databases1.2.3Sorting & Filtering Data1.2.4Interrogating Data
1.3

Plagiarism & Illegal Sharing

1.3.1Plagiarism1.3.2Copyrighted Content
2

Networks & the World Wide Web

2.1

Networks

2.1.1Parts of Networks2.1.2The Internet2.1.3The World Wide Web
2.2

Searching Online

2.2.1Searching the World Wide Web2.2.2Searching Tips2.2.3Reliable Information
2.3

Protecting Yourself Online

2.3.1Your Digital Footprint2.3.2Being Safe2.3.3Online Safety2.3.4Viruses2.3.5Malware2.3.6People Online2.3.7Your Feelings2.3.8Getting Help
3

Computational Thinking

3.1

Computational Thinking

3.1.1Computational Thinking3.1.2Decomposing Tasks3.1.3Algorithms (1/2)3.1.4Algorithms (2/2)3.1.5Logical Reasoning & Debugging
4

Computer Languages

4.1

Coding

4.1.1Code4.1.2Programs4.1.3Writing Programs4.1.4Writing Your Own Program: Input, Outputs, Design4.1.5Turning an Algorithm into an App (1/2)4.1.6Turning an Algorithm into an App (2/2)

Practice questions on Algorithms (1/2)

Can you answer these? Test yourself with free interactive practice on Seneca — used by over 10 million students.

  1. 1
    Which main action in an algorithm can be represented by an '=if= ... =then=' instruction?Multiple choice
  2. 2
    What main action in an algorithm describes the order of the steps?Multiple choice
Answer all questions on Algorithms (1/2)

Unlock your full potential with Seneca Premium

  • Unlimited access to 10,000+ open-ended exam questions

  • Mini-mock exams based on your study history

  • Unlock 800+ premium courses & e-books

Get started with Seneca Premium

Decomposing Tasks

Algorithms (2/2)