Back to 课程

Computer Science AS CIE

0% Complete
0/0 Steps
  1. data-representation as
    5 主题
  2. multimedia as
    3 主题
  3. compression as
    2 主题
  4. networks-and-the-internet as
    11 主题
  5. computers-and-components as
    5 主题
  6. logic-gates-and-logic-circuits as
    2 主题
  7. central-processing-unit-cpu-architecture as
    6 主题
  8. assembly-language- as
    4 主题
  9. bit-manipulation as
    1 主题
  10. operating-systems as
    3 主题
  11. language-translators as
    2 主题
  12. data-security as
    3 主题
  13. data-integrity as
    1 主题
  14. ethics-and-ownership as
    3 主题
  15. database-concepts as
    3 主题
  16. database-management-systems-dbms- as
    1 主题
  17. data-definition-language-ddl-and-data-manipulation-language-dml as
    1 主题
  18. computational-thinking-skills as
    1 主题
  19. algorithms as
    4 主题
  20. data-types-and-records as
    2 主题
  21. arrays as
    2 主题
  22. files as
    1 主题
  23. introduction-to-abstract-data-types-adt as
    1 主题
  24. programming-basics as
    1 主题
  25. constructs as
    2 主题
  26. structured-programming as
    1 主题
  27. program-development-life-cycle as
    1 主题
  28. program-design- as
    2 主题
  29. program-testing-and-maintenance as
    3 主题
课 Progress
0% Complete

Exam code:9618

Definition of algorithm

What is an algorithm?

  • An algorithm is a solution to a problem expressed as a sequence of defined steps

  • Methods of writing an algorithm before attempting to program a solution include:

    • Structured English

    • Pseudocode

    • Flowcharts

Structured English

  • Structured English is a human-readable method for describing algorithms using a combination of natural English language and programming logic

    • It uses clear English phrases to describe each step

    • Logic structures like IF…THEN, REPEAT, and WHILE may appear, but without strict syntax rules

    • Often used in the early planning stages before converting to pseudocode

Ask the user to enter their age
If the age is 18 or over
→ Display a welcome message
Otherwise
→ Display an access denied message

Pseudocode

  • Pseudocode is a precise, structured, and language-independent way of describing an algorithm that resembles a programming language

  • It follows specific exam-board-defined syntax

    • It includes formal elements like IF, THEN, ELSE, WHILE, REPEAT, DECLARE, and for assignment

    • Students must follow CIE’s pseudocode format in exams

INPUT Age
IF Age >= 18 THEN OUTPUT "Welcome to the site"
ELSE OUTPUT "Sorry, this site is for users 18 and over"
ENDIF

Flowcharts

  • Flowcharts are a visual tool that uses shapes to represent different functions to describe an algorithm

  • Used to visualise the flow of control in a system

  • Standard symbols include:

    • Oval for Start/End

    • Parallelogram for Input/Output

    • Rectangle for Processes

    • Diamond for Decisions

  • Arrows show the sequence of operations

flow-chart-symbols

Identifier tables

What is an identifier table?

  • An identifier table is used when writing pseudocode to keep track of all the identifier names used in an algorithm

  • An identifier is the name given to a variable, constant, array, procedure, or any other named element in the pseudocode

Why use an identifier table?

  • It helps you stay organised when designing an algorithm

  • Ensures consistent naming

  • Makes it easier to understand what each identifier stores or does

  • Useful in exam questions when you are asked to declare variables clearly

Identifier naming rules

  • Must start with a letter (A–Z or a–z)

  • Can include letters, digits (0–9), and underscores (_)

  • Accented characters and symbols are not allowed

  • Identifiers are case sensitive (e.g. Total and total are NOT treated the same)

Identifier

Description

StudentName

Stores a student’s full name

TestScore

Holds a test score value

MAX_SCORE

Maximum score allowed

FormList

Stores names in a form group

Responses

您的邮箱地址不会被公开。 必填项已用 * 标注