Applied algorithmic thinking

This is a basic concept in computer science

Once you can define an algorithms you must analyze and deduce algorithms. Really, you need to trace what an algorithm does.

def find_max (L):
    max = 0
    for x in L:
        if x > max:
            max = x
    return max

Standards

These standards are used from the IB Computer Science Subject Guide

• Discuss an algorithm to solve a specific problem.
• Analyse an algorithm presented as a flow chart.
• Analyse an algorithm presented as pseudocode.
• Construct pseudocode to represent an algorithm.
• Suggest suitable algorithms to solve a specific problem.
• Deduce the efficiency of an algorithm in the context of its use.
• Determine the number of times a step in an algorithm will be performed for given input data

.

Give the precise meaning of a word, phrase, concept or physical quantity.

Break down in order to bring out the essential elements or structure. To identify parts and relationships, and to interpret information to reach conclusions.

Reach a conclusion from the information given.

Follow and record the action of an algorithm.

Offer a considered and balanced review that includes a range of arguments, factors or hypotheses. Opinions or conclusions should be presented clearly and supported by appropriate evidence.

Break down in order to bring out the essential elements or structure. To identify parts and relationships, and to interpret information to reach conclusions.

Develop information in a diagrammatic or logical form.

Propose a solution, hypothesis or other possible answer.

Reach a conclusion from the information given.

The circumstances that form the setting for an event, statement, or idea, and in terms of which it can be fully understood and assessed.

Obtain the only possible answer.

A unit of abstract mathematical system subject to the laws of arithmetic.