|
Overview
Programming Taskbook contains the following task groups:
- Begin Input-output and assignment (40 tasks; all tasks are available in the PT4Mini Edition),
- Integer Integers (30 tasks; all tasks are available in the PT4Mini Edition),
- Boolean Logical expressions (40 tasks; all tasks are available in the PT4Mini Edition),
- If Conditional statement (30 tasks; 6 tasks are available in the PT4Mini Edition),
- Case Selection statement (20 tasks; 5 tasks are available in the PT4Mini Edition),
- For Loop with the parameter (40 tasks; 9 tasks are available in the PT4Mini Edition),
- While Loop with the condition (30 tasks; 8 tasks are available in the PT4Mini Edition),
- Series Numerical sequences (40 tasks; 7 tasks are available in the PT4Mini Edition),
- Proc Procedures and functions (60 tasks; 7 tasks are available in the PT4Mini Edition),
- Func Functions (a modification of the Proc group for the Python, Ruby, and Julia languages) (60 tasks; 7 tasks are available in the PT4Mini Edition),
- Minmax Minimums and maximums (30 tasks; 6 tasks are available in the PT4Mini Edition),
- Array One-dimensional arrays (140 tasks; 15 tasks are available in the PT4Mini Edition),
- Matrix Two-dimensional arrays (matrices) (100 tasks; 8 tasks are available in the PT4Mini Edition),
- String Characters and strings (70 tasks; 8 tasks are available in the PT4Mini Edition),
- File Binary files (90 tasks; 13 tasks are available in the PT4Mini Edition),
- Text Text files (60 tasks; 10 tasks are available in the PT4Mini Edition),
- Param Structured data types in procedures and functions (70 tasks; 9 tasks are available in the PT4Mini Edition),
- Recur Recursion (30 tasks; 12 tasks are available in the PT4Mini Edition),
- Dynamic and Dynamic (obj) Dynamic data structures (80 tasks; 17 tasks are available in the PT4Mini Edition).
- Tree and Tree (obj) Trees (100 tasks, 20 tasks are available in the PT4Mini Edition),
Task texts do not contain notions that are specific for
some programming language.
All elements of any sequence of real numbers are supposed to contain different values, so each
sequence of real numbers contains just one minimal and maximal element. Sequences of integers may contain
elements with equal values, so such sequences may have several elements with minimal and maximal values.
Numerical arrays and files also satisfy these conditions.
If a task does not specify the maximal size of an input array then this size should be considered as
10 for one-dimensional arrays and 10 ´ 10 for two-dimensional arrays.
The "order number" notion is used for array elements; the first element of the one-dimensional
array named A has the order number 1 and is denoted as A1. Similarly,
the first element of the two-dimensional array named B is denoted as B1,1.
Lines and rows of two-dimensional array are also numbered from 1. Such approach does not depend on
a specific programming language and corresponds to traditional mathematical notation.
The "procedure" notion in task texts of Proc, Param, and Dynamic group
means not only Pascal procedures but also Visual Basic subroutines
and C++/C# functions with the void return type.
There are two variants of the Dynamic and Tree groups: the first one uses pointers
and is intended for Pascal and C++ languages, the second one uses objects
and is intended for C#, Visual Basic .NET, Python, Java, Ruby, and Julia languages.
Both variants of Dynamic and Tree groups are available in the PascalABC.NET version of Programming Taskbook;
the "object" variant have the "ObjDyn" and "ObjTree" name in the PascalABC.NET version.
|