## Lesson #8. Sum, Accumulators, Product and Counter. Minimum and maximum value

Back Menu Go ahead Theory Lection # 8 in pdf format Sum (addition) Syntax: The sum in Pascal is calculated by the recurrent expression: S = S + Y where S is the accumulated amount Y – next summand Labs Читать далее

## Lesson #7. Loops. Arbitrary step

Back Menu Go ahead Theory Lection # 7 in pdf format Labs and tasks How to use arbitrary step in for loop & loop Lab 1: To do: Output all 2-digit odd numbers from 11 to 21. Expected output: 11 Читать далее

## Lesson #6. Loops. Simple tasks

Back Menu Go ahead Theory Lection # 6 in pdf format Loops are used to repeat actions The loop consists of: a loop header and a loop body One loop iteration is one repetition of the loop body The simpliest Читать далее

## Lesson #5. Minimum and Maximum. If statemens (continuation)

Back Menu Go ahead Theory Search for minimum and maximum Which of the two variables is greater (maximum): var (x,y) := ReadInteger2; var Max: integer; if x>y then Max := x else Max := y;var (x,y) := ReadInteger2; var Max: Читать далее

## Lesson #3 and #4. Conditions

Back Menu Go ahead Theory Lection # 3 in pdf format IF Statements If statements are concerned with Boolean logic. If the statement is true, the block of code associated with the if statement is executed. If the statement is Читать далее

## Lesson #2. Working with digits of a number

Back Menu Go ahead Theory Lecture # 2 in pdf format Integer division and remainder after division Div The div operation is an integer division, where the result is a number without fractional part. The div operation calculates the integer Читать далее

## Lesson #1. Introduction to PascalABC.NET

Menu Go ahead Theory Lecture # 1 in pdf format Variable Definition & Assigning a value to it In Pascal abc.net variables can be defined within the body of the program between begin and end keywords. The principle of locality: Читать далее