## Lesson #18. String type and regular expressions

Back Menu Theory Lecture in pdf format Char type c: char; … c:=’a’;c: char; … c:=’a’; begin var c: char; c:=’a’; Println(c.IsDigit); // False Println(c.IsLetter); // True Println(c.IsLower); // True Println(c.IsUpper); // False Println(c.IsPunctuation); // знак препинания, boolean   с Читать далее

## Lesson #14. Lambda expressions

Back Menu Go ahead lambda expression Theory A lambda expression is some unnamed expression representing a functional dependency. Based on lambda expression, the compiler builds a function, identifies it in some way and replaces this lambda expression with this identifier. Читать далее

## Lesson #17. Sequence

Back Menu Go ahead Theory Standard sequence generators Range(a,b: integer): sequence of integer print(Range(1,10)); // [1,2,3,4,5,6,7,8,9,10]print(Range(1,10)); // [1,2,3,4,5,6,7,8,9,10] Range(a,b,step: integer): sequence of integer print(Range(1,10,2)); // [1,3,5,7,9]print(Range(1,10,2)); // [1,3,5,7,9] Range(c1,c2: char): sequence of char print(Range(’a’,’k’)); // [a,b,c,d,e,f,g,h,i,j,k]print(Range(‘a’,’k’)); // [a,b,c,d,e,f,g,h,i,j,k] Partition(a,b: real; Читать далее

## Lesson #16. Matrices

Back Menu Go ahead Theory: Two-dimensional arrays Lecture in pdf format Definition A matrix or two-dimensional array is a rectangular table of numbers (or other elements of the same type). Each element of the matrix has two indices (row number Читать далее

## Lesson #15. Arrays (slices, Sorting algorithms, Lists)

Back Menu Go ahead Theory: slices, Sorting algorithms Lection in pdf format + and * operations for arrays a + b – concatenation of two arrays into result array a * N – concatenation of N copies of a into Читать далее

## Lesson #13. Arrays (continuation)

Back Menu Go ahead Theory Lection in pdf format Filling an array with generated sequence. lambda expressions var a := Arr(1,3,5,7,9); // [1,3,5,7,9] var a := ArrFill(5,555); // [555,555,555,555,555] var a := Arr(55) * 4 + Arr(77) * 6; // Читать далее

## Lesson #12. Enumeration type. Arrays

Back Menu Go ahead Theory: Enumeration type Lection in pdf format An enumeration type, or enum, is a structure that enables you to create a variable with a fixed set of possible values. The most common example is to use Читать далее

## Lesson #11. Procedures and functions: tuples, algorithm wrappers, Local and global variables

Back Menu Go ahead Theory: Procedures and Functions Lection in pdf format Input validation: Assert statement Task Example: To do: Create the Mean (X, Y, AMean, GMean) procedure that calculates the arithmetic mean AMean = (X + Y) / 2 Читать далее

## Lesson #10. Procedures and functions

Back Menu Go ahead Theory: Procedures and Functions Lection in pdf format Labs and tasks Procedures Parameterless procedure and with parameters Lab 1, procedures: To do: Print 60 asterisks (star *), each on a new line. Use parameterless procedure. ✍ Читать далее

## Lesson #9. Nested loops

Back Menu Go ahead Theory Lection in pdf format Labs and tasks Nested Loops Lab 1: To do: Calculate the value of the function z(x,y) = xy for every x changing in the interval [2;8], and y changing in the Читать далее