Week 1
Watch web lectures and read syllabus!
First problem:
Person 1 donates 1 euro
Person 2 donates 2 euro
Till 100th person
How much total? HOMEWORK!!
Person (i) donates 1 more euro (x) then the person before so (x) is i+1
Algorithm: an effective method, consisting of a finite number of steps or instructions to solve a problem,
which always work.
Properties of algorithms:
- Input
- Output
- Definiteness (precise steps)
- Correctness (correct output)
- Finiteness (finite number of steps)
- Effectiveness (correct and reasonable time)
- Generality (for all problems of desired form)
Without algorithms no computer programs would exist. Computer programs are indispensable study
of algorithms is necessary. Development of analytical skills.
Solution strategies:
- Try something (guess and check)
- Go through all the possibilities
- Divide the problem into several sub problems or steps
- Use of formulas/equations
- Discover a structure or pattern
- Make a model
- Brute force
- Divide-and-conquer (D&C)
Understand
the problem
,Choose a Solve the Succes? Test/Check
strategy problem
, Week 2
Web lecture: From algorithm to flowcharts
Flowchart: a graphical representation (diagram/chart) of an algorithm/process. A flowchart consists of
data in planes (for example a square/triangle) connected with arrows.
Symbols of a flowchart:
- Flow lines: show the direction of data (flow of control)
- Start (1 output, 0 input) and end (0 output, 1 input) symbols: represented by ellipses, ovals,
circles or rectangles with rounded corners.
- Process block: represented by rectangle (for example: calculations, opening/closing a file)
- Input/output (I/O): represented by a parallelogram (example: reading input/printing output)
- Decision: represented by a diamond. 1 intput, 2 output.
- Process module: represented by a rectangle (two lines) with a line on both sides (example:
reading process/calculation process).
An algorithm description (spoken language or pseudo code) can not be entered directly into a computer.
The algorithm has to be converted into a computer program. Flowcharts are easy to analyze, to design,
to maintain or to document a process or program. They are important in problem analysis and in finding
efficient solution.
Web lecture: Recursion
Recursion: recursion is a technique where a method or function calls itself. Recursion is not a statement,
it is a technique.
Watch web lectures and read syllabus!
First problem:
Person 1 donates 1 euro
Person 2 donates 2 euro
Till 100th person
How much total? HOMEWORK!!
Person (i) donates 1 more euro (x) then the person before so (x) is i+1
Algorithm: an effective method, consisting of a finite number of steps or instructions to solve a problem,
which always work.
Properties of algorithms:
- Input
- Output
- Definiteness (precise steps)
- Correctness (correct output)
- Finiteness (finite number of steps)
- Effectiveness (correct and reasonable time)
- Generality (for all problems of desired form)
Without algorithms no computer programs would exist. Computer programs are indispensable study
of algorithms is necessary. Development of analytical skills.
Solution strategies:
- Try something (guess and check)
- Go through all the possibilities
- Divide the problem into several sub problems or steps
- Use of formulas/equations
- Discover a structure or pattern
- Make a model
- Brute force
- Divide-and-conquer (D&C)
Understand
the problem
,Choose a Solve the Succes? Test/Check
strategy problem
, Week 2
Web lecture: From algorithm to flowcharts
Flowchart: a graphical representation (diagram/chart) of an algorithm/process. A flowchart consists of
data in planes (for example a square/triangle) connected with arrows.
Symbols of a flowchart:
- Flow lines: show the direction of data (flow of control)
- Start (1 output, 0 input) and end (0 output, 1 input) symbols: represented by ellipses, ovals,
circles or rectangles with rounded corners.
- Process block: represented by rectangle (for example: calculations, opening/closing a file)
- Input/output (I/O): represented by a parallelogram (example: reading input/printing output)
- Decision: represented by a diamond. 1 intput, 2 output.
- Process module: represented by a rectangle (two lines) with a line on both sides (example:
reading process/calculation process).
An algorithm description (spoken language or pseudo code) can not be entered directly into a computer.
The algorithm has to be converted into a computer program. Flowcharts are easy to analyze, to design,
to maintain or to document a process or program. They are important in problem analysis and in finding
efficient solution.
Web lecture: Recursion
Recursion: recursion is a technique where a method or function calls itself. Recursion is not a statement,
it is a technique.
