Termbank
  1. A
    1. Abstraction
    2. Alias
    3. Argument
    4. Array
  2. B
    1. Binary code file
    2. Binary number
    3. Bit
    4. Bitwise negation
    5. Bitwise operation
    6. Byte
  3. C
    1. C library
    2. C-function
    3. C-variable
    4. Character
    5. Code block
    6. Comment
    7. Compiler
    8. Complement
    9. Conditional statement
    10. Conditional structure
    11. Control structure
  4. D
    1. Data structure
    2. Duck typing
  5. E
    1. Error message
    2. Exception
  6. F
    1. Flag
    2. Float
  7. H
    1. Header file
    2. Headers
    3. Hexadecimal
  8. I
    1. Immutable
    2. Initialization
    3. Instruction
    4. Integer
    5. Interpreter
    6. Introduction
    7. Iteroitava
  9. K
    1. Keyword
  10. L
    1. Library
    2. Logical operation
  11. M
    1. Machine language
    2. Macro
    3. Main function
    4. Memory
    5. Method
  12. O
    1. Object
    2. Optimization
  13. P
    1. Parameter
    2. Placeholder
    3. Pointer
    4. Precompiler
    5. Precompiler directive
    6. Prototype
    7. Python console
    8. Python format
    9. Python function
    10. Python import
    11. Python list
    12. Python main program
    13. Python variable
    14. Python-for
    15. Pääfunktio
    16. printf
  14. R
    1. Resource
    2. Return value
  15. S
    1. Statement
    2. Static typing
    3. String
    4. Syntax
  16. T
    1. Terminal
    2. Type
    3. Typecast
  17. U
    1. Unsigned
  18. V
    1. Value
  19. W
    1. Warning
    2. while
Completed: / exercises

y86 Advanced Assembly exercises

This section contains exercises that might be needed later in the final project.

Efficient modulo (1p)

In the same way you can calculate a division using substraction you can also calculate the module of a number (that is the remainder of the division). You can test your skills in this voluntary exercise
The previous modulo implementation is good enough when dealing with small numbers. However, if we are calculating one trillion % 17, the subtraction has to be performed billions of times! This is very slow.
In this task you need to implement a faster modulo that scales better for larger inputs.
One way we can improve the simple subtraction loop is to increase the divisor. That way the dividend will be reduced faster. However, we can't increase the divisor willy nilly, as that will ruin the result:
123 % 17 = 4
123 % 18 = 15
However, if the new divisor is a multiple of the old one, and we do one more modulo with the original divisor, we can get the correct result:
123 %  17           = 4
123 % (17 * 3)      = 21
 21 %  17           = 4
123 % (17 * 3) % 17 = 4

123456789 %  7            = 1
123456789 % (7 * 100)     = 589
589       %  7            = 1
123456789 % (7 * 100) % 7 = 1

In general:
a % b = a % (b * n) % b, n > 0
However it is difficult to find a good value to multiply the divisor ahead of time, and multiplication can be slow too. But if you remember from previous tasks, doubling i.e. multiplication by two is cheap, as you can just as add the value to itself. Doubling will also ensure the divisor is a multiple of the original divisor. Doing the doubling once or twice will not be enough for large dividends. But if we keep doubling the divisor as we perform the subtractions we can reduce the dividend pretty fast. When the divisor grows bigger than the dividend, we can just reset it to the original and start the doubling again.
Here is an example of how the algorithm would work:
321 % 11 = ?

321 > 11, keep going
321 - 11 = 310, double 11 -> 22
310 > 22, keep going
310 - 22 = 288, double 22 -> 44
288 > 44, keep going
288 - 44 = 244, double 44 -> 88
244 > 88, keep going
244 - 88 = 156, double 88 -> 176
156 < 176, too big! -> reset to original divisor (11)
156 > 11, keep going
156 - 11 = 145, double 11 -> 22
145 > 22, keep going
145 - 22 = 123, double 22 -> 44
123 > 44, keep going
123 - 44 = 79, double 44 -> 88
 79 < 88, too big! -> reset to original divisor (11)
 79 > 11, keep going
 79 - 11 = 68, double 11 -> 22
 68 > 22, keep going
 68 - 22 = 46, double 22 -> 44
 46 > 44, keep going
 46 - 44 = 2, double 44 -> 88
  2 < 88, too big! -> reset to original divisor (11)
  2 < 11, even the original divisor is too big! We are done.

321 % 11 = 2
The additional doubling and checks make this algorithm a bit slower for smaller inputs, but greatly more optimal for larger inputs: the naive implementation would have to do about 59 billion subtractions to calculate one trillion % 17, while this more efficient implementation would only require 365.
Again, the dividend will be in register %r8 and the divisor in %r9. Put the result in register %rax. Only nonnegative numbers are used in this task. The divisor will also never be zero.
Watch out: The divisor will overflow if the dividend is greater or equal to 2 ^ 63. To protect against this, you can add an additional check, which resets the divisor to its original value, if it happens to overflow. However, in this task such large dividends will not be tested, so overflow protection is optional.
Implement the efficient modulo: %rax = %r8 % %r9.
Warning: You have not logged in. You cannot answer.

Efficient multiplication (2p)

Previously, multiplication was implemented by "adding the multiplicand to the register as many times as the multiplier," which is an obviously inefficient way to perform multiplications. For example, the operation 8000*8000 takes more than 8000 instructions when performed with an addition loop.
Well... how can multiplication be done more efficiently? One answer is the Peasant binary algorithm.
You have encountered this calculation method when you were in elementary school and did multiplications with long multiplication. So let's start in the same way by multiplying our example by multiplying the binary numbers 101101 (45) and 110010 (50) side by side.
      110010 
x     101101
------------
      110010
     000000  (kertoja 0)
    110010
   110010
  000000     (kertoja 0)
+110010
------------
100011001010
It is observed that one large multiplication turns into a summation of the multiplicand shifted by bits.
Let's go through this calculation step by step using another example, when multiplying the same binary numbers 101101 (45) and 110010 (50) together.
1. Binary numbers representation. 
(101101) * (110010) = ?

101101 = 1x2^5 + 0x2^4 + 1x2^3 + 1x2^2 + 0x2^1 + 1x2^0 = 45
       = 1x2^5 + 1x2^3 + 1x2^2 + 1x2^0
110010 = 1x2^5 + 1x2^4 + 0x2^3 + 0x2^2 + 1x2^1 + 0x2^0 = 50
       = 1x2^5 + 1x2^4 + 1x2^1
Since the latter number has fewer terms, let's choose it as the multiplier this time.
2. Note that when the multiplier's bit is zero, it does not need to be taken into account because 0 * n = 0. Now the multiplication can be expressed as:
(110010) x (101101) = (1x2^5 + 1x2^4 + 1x2^1) x (101101) = ?
3. Hence, in the multiplication, each term is calculated once at a time and summed. 
(1x2^5) => 100000 x 101101 = 1440
              + 
(1x2^4) => 010000 x 101101 = 720
              + 
(1x2^1) => 000010 x 101101 = 90

Nyt  45 * 50 = 1440 + 720 + 90 = 2250
4. Individual terms can still be conveniently calculated using bit shifting. For example:
101101 x 100000 = (101101 << 5) = 10110100000
A more efficient multiplication can thus be implemented as follows:
1. Examine the bits of the multiplier individually to calculate partial products.
1. If the multiplier's bit is zero, the corresponding partial product is also zero.
1. If the multiplier's bit is one, calculate the corresponding multiplication between that individual bit and the multiplicand using bit shifting.
1. Sum the partial products for the final result.
Implement a program that calculates the multiplication with the method described above. The numbers to be multiplied are in registers %r11 and %r12. The program returns the result in the %rax-register."
%rax = %r11 x %r12. All numbers are always positive. Please, use the algorithm provided in the exercise instructions.
Warning: You have not logged in. You cannot answer.

Efficient division by two (1p)

Earlier, you implemented a simple, but slow, division algorithm. In this task we will concentrate on optimizing a special case: division by two. If we use the previous subtraction algorithm to divide a big number by two, the code will need to iterate an amount that is half of the number to be divided.
If you look what happens to a number's binary form, when it is divided by two, you can see that all the bits are shifted right by one: 11100111 / 2 = 01110011. We can use this observation to implement a better division algorithm.
We use a "cursor"-value that starts at two. In a loop we double this cursor, by adding it to itself. Doubling a value shifts all its binary bits to the left by one, so this cursor will look like: 10, 100, 1000, 10000, ... in binary. We then use this cursor value to check the status of each individual bit (except the first as it disappears anyway) in the input value we wish to divide by two. This is done with the bitwise and operation:
Input:  00111011 (59)
Cursor: 00000010 (2)

00111011
00000010 -> is set

00111011
00000100 -> not set

00111011
00001000 -> is set

00111011
00010000 -> is set

00111011
00100000 -> is set

00111011
01000000 -> not set

00111011
10000000 -> not set

The actual inputs will have 64 bits.
Because we want to create a result where each bit of the input is shifted right by one, every time we find a bit that is set in the input, we add to the result (which starts at zero) half of the cursor. So, if the cursor is 100 (in binary) and it detects that the third bit is set, then we have to add 10 (in binary) to the result.
To clarify, given the previous example and using a variable named value that will provide intermediate values: 
Input:  b00111011 (59)
Cursor: b00000010 (2)
value:  b00000000 (0)

Input:  b00111011
Cursor: b00000010 -> is set
Value:  b00000000 + b00000001 (0 + 1) = b00000001 (1) -> Since cursor is set

Input:  b00111011
Cursor: b00000100 -> not set
Value:  b00000001 (1) -> does not change

Input:  b00111011
Cursor: b00001000 -> is set
Value:  b00000001 +  b00000100 (1+4) = b00000101 (5)-> since cursor is set

Input:  b00111011
Cursor: b00010000 -> is set
Value:  b00000101 +  b00001000 (5+8) = b000001101 (13)-> since cursor is set

Input:  b00111011
Cursor: b00100000 -> is set
Value:  b00001101 +  b00010000 (13+16) = b00011101 (29)-> since cursor is set


Input:  b00111011
Cursor: b01000000 -> not set
Value:  b00011101 (29) -> does not change


Input:  b00111011
Cursor: b10000000 -> not set
Value:  b00011101 (29) -> does not change
This algorithm has a constant time worst case performance, because the amount of bits in the input is fixed.
The value to be halved is given in register %r8. Write the result to register %rax. Dividend will never be zero.
HINT: To avoid a chicken and the egg -problem, you probably want to keep track of the cursor's previous value, so you when the cursor is doubled, you have easy access to a value that is half the current cursor. Be careful not to overflow the cursor! The automatic tester will try larger inputs as well.
Implement the efficient division: %rax = %r8 / 2.
Warning: You have not logged in. You cannot answer.

Modular exponentiation (3p)

Certain mathematical algorithms require the computation of a remainder of an exponentiation: base ^ exponent % modulo. This is called modular exponentiation. At first, calculating it may look daunting, as even a simple expression of 123 ^ 456 yields a result with almost a thousand digits. That is way bigger than the 64-bit unsigned integer limit most computers can efficiently work with. However, the presence of the modulo operation allows us to greatly optimize this algorithm to be blazingly fast.
123 ^ 456 might be hundreds of digits long, but if it is immediately followed by a modulo of 789, we know the answer is in range of 0-788. Also, modulo operation has a nice property: a * b % c = (a % c) * (b % c) % c, i.e. we can add modulos to the intermediary products and the final product will be the same. And because exponentiation is just repeated multiplication, we break it up to:
a ^ b % c = (a * a * ... b times ... * a) % c = ((((a % c) * a % c) * a % c) * ...) * a % c
Basically, as we calculate the exponent and multiply the exponent base with itself, we take a modulo after each of the multiplication steps, which ensures the result never grows too big. This is a good improvement, but it still has a problem: if we need to calculate lets say 101 ^ 1100303023 % 93, we need to perform more than a billion multiplication and modulo operations.
The last improvements are a bit technical. If you want a proof for why they work, you should read the attached link above.
First we reduce the base of the exponentiation by taking the modulo of it: base <- base % modulo. We also initialize the result to one. We then go through all the bits in the exponent, from least significant to most. (You can use the same cursor-method as in the efficient division by two -task, but this time the cursor starts at one.) For each bit that is set, we update the result: result <- result * base % modulo. After this, in the same iteration of the loop, we update the base (no matter if the bit in the exponent was set or not): base <- base * base % modulo.
Pseudo-code for the algorithm:
base := base % modulo
result = 1

for each bit in exponent from LSB to MSB:
    if bit is set:
        result := result * base % modulo
    base := base * base % modulo
The result will be ready after the loop.
Please, note that you need to use the efficient multiplication and the efficient module if you want to keep the results in a reasonable set of instructions. Be careful, when you call to subroutines to not override registers. Consider also where do you place the stack.
The base of the exponent is given in %r8, while the exponent will be in %r9 and the modulo in %r10. Write the result to %rax. All the values will be non-negative, the modulo at least two, and the base at least one.
HINT: You should reuse the efficient multiplication and efficient modulo you implemented earlier. Call them as subroutines.
Implement modular exponentiation: %rax = %r8 ^ %r9 % %r10.
Warning: You have not logged in. You cannot answer.
?
Abstraction is a process through which raw machine language instructions are "hidden" underneath the statements of a higher level programming language. Abstraction level determines how extensive the hiding is - the higher the abstraction level, the more difficult it is to exactly say how a complex statement will be turned into machine language instructions. For instance, the abstraction level of Python is much higher than that of C (in fact, Python has been made with C).
Alias is a directive for the precompiler that substitus a string with another string whenever encountered. In it's basic form it's comparable to the replace operation in a text editor. Aliases are define with the #define directeve, e.g. #define PI 3.1416
Argument is the name for values that are given to functions when they are called. Arguments are stored into parameters when inside the function, although in C both sides are often called just arguments. For example in printf("%c", character); there are two arguments: "%c" format template and the contents of the character variable.
Array is a common structure in programming languages that contains multiple values of (usually) the same type. Arrays in C are static - their size must be defined when they are introduced and it cannot change. C arrays can only contain values of one type (also defined when introduced).
Binary code file is a file that contains machine language instructions in binary format. They are meant to be read only by machines. Typically if you attempt to open a binary file in a text editor, you'll see just a mess of random characters as the editor is attempting to decode the bits into characters. Most editors will also warn that the file is binary.
Binary number is a number made of bits, i.e. digits 0 and 1. This makes it a base 2 number system.
A bit is the smallest unit of information. It can have exactly two values: 0 and 1. Inside the computer everything happens with bits. Typically the memory contains bitstrings that are made of multiple bits.
Bitwise negation is an operation where each bit of a binary number is negated so that zeros become ones and vice versa. The operator is ~.
Bitwise operations are a class of operations with the common feature that they manipulate individual bits. For example bitwise negation reverses each bit. Some operations take place between two binary values so that bits in the same position affect each other. These operations include and (&), or (|) and xor (^). There's also shift operations (<< and >>) where the bits of one binary number are shifted to the left or right N steps.
Byte is the size of one memory slot - typically 8 bits. It is the smallest unit of information that can be addressed from the computer's memory. The sizes of variable types are defined as bytes.
External code in C is placed in libraries from which they can be taken to use with the #include directive. C has its own standard libraries, and other libraries can also be included. However any non-standard libraries must be declared to the compiler. Typically a library is made of its source code file (.c) and header file (.h) which includes function prototypes etc.
Functions in C are more static than their Python counterparts. A function in C can only have ne return value and its type must be predefined. Likewise the types of all parameers must be defined. When a function is called, the values of arguments are copied into memory reserved for the function parameters. Therefore functions always handle values that are separate from the values handled by the coe that called them.
C variables are statically typed, which means their type is defined as the variable is introduced. In addition, C variables are tied to their memory area. The type of a variable cannot be changed.
Character is a single character, referred in C as char. It can be interpreted as an ASCII character but can also be used as an integer as it is the smallest integer that can be stored in memory. It's exactly 1 byte. A character is marked with single quotes, e.g. 'c'.
Code block is a group of code lines that are in the same context. For instance, in a conditional structure each condtion contains its own code block. Likewise the contents of a function are in their own code block. Code blocks can contain other code blocks. Python uses indentation to separate code blocks from each other. C uses curly braces to mark the beginning and end of a code block.
Comments are text in code files that are not part of the program. Each language has its own way of marking comments. Python uses the # character, C the more standard //. In C it's also possible to mark multiple lines as comments by placing them between /* and */.
A compiler is a program that transforms C source code into a binary file containing machine language instructions that can be executed by the computer's processor. The compiler also examines the source code and informs the user about any errors or potential issues in the code (warnings). The compiler's behavior can be altered with numerous flags.
Complement is a way to represent negative numbers, used typically in computers. The sign of a number is changed by flipping all its bits. In two's complement which is used in this course, 1 is added to the result after flipping.
Conditional statement is (usually) a line of code that defined a single condition, followed by a code block delimited by curly braces that is entered if the condition evaluates as true. Conditional statements are if statements that can also be present with the else keyword as else if. A set of conditional statements linked together by else keywords are called conditional structures.
Conditional structure is a control structure consisting of one or more conditional statements. Most contrl structures contain at least two branches: if and else. Between these two there can also be any number of else if statements. It is however also possible to have just a single if statement. Each branch in a conditional structure cotains executable code enclosed within a block. Only one branch of the structure is ever entered - with overlapping conditions the first one that matches is selected.
Control structures are code structures that somehow alter the program's control flow. Conditional structures and loops belong to this category. Exception handling can also be considered as a form of control structure.
Data structure is a comman name for collection that contain multiple values. In Python these include lists, tuples and dictionaries. In C the most common data structures are arrays and structs.
Python's way of treating variable values is called dynamic typing aka duck typing. The latter comes from the saying "if it swims like a duck, walks like a duck and quacks like a duck, it is a duck". In other words, the validity of a value is determined by its properties in a case-by-case fashion rather than its type.
An error message is given by the computer when something goes wrong while running or compiling a program. Typically it contains information about the problem that was encountered and its location in the source code.
An exception is what happens when a program encounters an error. Exceptions have type (e.g. TypeError) that can be used in exception handling within the program, and also as information when debugging. Typically exceptions also include textual description of the problem.
Flags are used when executing programs from the command line interface. Flags are options that define how the program behaves. Usually a flag is a single character prefixed with a single dash (e.g. -o) or a word (or multiple words connected with dashes) prefixed with two dashes (e.g. --system. Some flags are Boolean flags which means they are either on (if present) or off (if not present). Other flags take a parameter which is typically put after the flag separated either by a space or = character (e.g. -o hemulen.exe.
Floating point numbers are an approximation of decimal numbers that are used by computers. Due to their archicture computers aren't able to process real decimal numbers, so they use floats instead. Sometimes the imprecision of floats can cause rounding errors - this is good to keep in mind. In C there are two kinds of floating point numbers: float and double, where the latter has twice the number of bits.
Header files use the .h extension, and they contain the headers (function prototypes, type definitions etc.) for a .c file with the same name.
Headers in C are used to indicate what is in the code file. This includes things like function prototypes. Other typical content for headers are definition of types (structs etc.) and constants. Headers can be at the beginning of the code file, but more often - especially for libraries - they are in placed in a separate header (.h) file.
Hexadecimal numbers are base 16 numbers that are used particularly to represent memory addresses and the binary contents of memory. A hexadecimal number is typically prefixed with 0x. They use the letters A-F to represent digits 10 to 15. Hexadecimals are used because each digit represents exactly 4 bits which makes transformation to binary and back easy.
In Python objects were categorized into mutable and immutable values. An immutable value cannot have its contents changed - any operations that seemingly alter the object actually create an altered copy in a new memory location. For instance strings are immutable in Python. In C this categorization is not needed because the relationship of variables and memory is tighter - the same variable addresses the same area of memory for the duration of its existence.
When a variable is given its initial value in code, the process is called initialization. A typical example is the initialization of a number to zero. Initialization can be done alongside with introduction: int counter = 0; or separately. If a variable has not been initialized, its content is whatever was left there by the previous owner of the memory area.
Instruction set defines what instructions the processor is capable of. These instructions form the machine language of the processor architecture.
Integers themselves are probably familiar at this point. However in C there's many kinds of integers. Integer types are distinguished by their size in bits and whether they are signed or not. As a given number of bits can represent up to (2 ^ n) different integers, the maximum value for a signed integer is (2 * (n - 1))
Python interpreter is a program that transforms Python code into machine language instructions at runtime.
The moment a variable's existence is announed for the first is called introduction. When introduced, a variable's type and name must be defined, e.g. int number;. When a variable is introduced, memory is reserved for it even though nothing is written there yet - whatever was in the memory previously is still there. For this reason it's often a good idea to initialize variables when introducing them.
Iteroitava objekti on sellainen, jonka voi antaa silmukalle läpikäytäväksi (Pythonissa for-silmukalle). Tähän joukkoon kuuluvat yleisimpinä listat, merkkijonot ja generaattorit. C:ssä ei ole silmukkaa, joka vastaisi Pythonin for-silmukan toimintaa, joten taulukoiden yms. läpikäynti tehdään indeksiä kasvattavilla silmukoilla.
Keywords are words in programming languages that have been reserved. Good text editors generally use a different formatting for keywords (e.g. bold). Usually keywords are protected and their names cannot be used for variables. Typical keywords include if and else that are used in control structures. In a way keywords are part of the programming language's grammar.
A library is typically a toolbox of functions around a single purpose. Libraries are taken to use with the include directive. If a library is not part of the C standard library, its use must also be told to the compiler.
Logical operation refers to Boole's algebra, dealing with truth values. Typical logical operations are not, and, or which are often used in conditional statements. C also uses bitwise logical operations that work in the same way but affect each bit separately.
Machine language is made of instructions understood by the processor. Machine language is often called Assembly and it is the lowest level where it's reasonable for humans to give instructions to computers. Machine language is used at the latter part of this course - students taking the introduction part do not need to learn it.
Macro is an alias that defines a certain keyword to be replaced by a piece of code. When used well, macros can create more readable code. However, often the opposite is true. Using macros is not recommended in this course, you should just be able to recognize one when you see it.
In C the main function is the starting point when the program is run. The command line arguments of the program are passed on to the main function (although they do not have to be received), and its return value type is int. At its shortest a main function can defined as int main().
When programs are run, all their data is stored in the computer's memory. The memory consists of memory slots with an address and contents. All slots are of equal size - if an instance of data is larger, a continuous area of multiple memory slots is reserved.
Method is a function that belongs to an object, often used by the object to manipulate itself. When calling a method, the object is put before the method: values.sort().
Object is common terminology in Python. Everything in Python is treated as objects - this means that everything can be referenced by a variable (e.g. you can use a variable to refer to a function). Objects are typically used in object-oriented languages. C is not one.
Optimization means improving the performance of code, typically by reducing the time it takes to run the code or its memory usage. The most important thing to understand about opimization is that it should not be done unless it's needed. Optimization should only be considered once the code is running too slowly or doesn't fit into memory. Optimization should also not be done blindly. It's important to profile the code and only optimize the parts that are most wasteful.
A parameter is a variable defined alongside with a function. Parameters receive the values of the function's arguments when it's called. This differentation between parameters and arguments is not always used, sometimes both ends of the value transfer are called arguments.
Placeholders are used in string formatting to mark a place where a value from e.g. a variable will be placed. In Python we used curly braces to mark formatting placeholders. In C the % character is used which is followed by definitions, where the type of the value is mandatory. For instance "%c" can only receive a char type variable.
Pointers in C are special variables. A pointer contains a memory address of the memory location where the actual data value is located. In a sense they work like Python variables. A variable can be defined as a pointer by postfixing its type with * when it's being introduced, e.g. int* value_ptr; creates a pointer to an integer. The contents of the memory address can be fetched by prefixing the variable name with * (e.g. *value_ptr. On the other hand, the address of a memory adress can be fetched by prefixing a variable name with &, (e.g. &value.
The C precompiler is an apparatus that goes through all the precompiler directives in the code before the program is actually compiled. These directives include statements which add the source code of the included libraries into the program, and define directives that can define constant values (aliases) and macros.
Directives are instructions that are addressed at the precompiler. They are executed and removed from the code before the actual compilation. Directives start with the # character. The most common one is include which takes a library into use. Another common one is define, which is used e.g. to create constant values.
Prototype defines a function's signature - the type of its return value, its name and all the arguments. A prototype is separate from the actual function definition. It's just a promise that the function that matches the prototype will be found in the code file. Prototypes are introduced at the beginning of the file or in a separate header file. In common cases the prototype definition is the same as the line that actually starts the function introduction.
Interactive interpreter or Python console is a program where users can write Python code lines. It's called interactive because each code line is executed after its been fully written, and the interpreter shows the return value (if any).
The format method of string in Python is a powerful way to include variable values into printable text. The string can use placeholders to indicate where the format method's arguments are placed.
Python functions can have optional parameters that have a given default value. In Python the values of arguments in a function call are transferred to function parameters through reference, which means that the values are the same even though they may have different names. Python functions can have multiple return values.
In Python the import statement is used for bringing in modules/libraries - either built-in ones, thrid party modules or other parts of the same application. In Python the names from the imported module's namespace are accessible through the module name (e.g. math.sin). In C libraries are taken to use with include, and unlike Python import it brings the library's namespace into the program's global namespace.
Python lists were discovered to be extremely effective tools in Elementary Programming. A Python list is an ordered collection of values. Its size is dynamic (i.e. can be changed during execution) and it can include any values - even mixed types. Lists can also include other lists etc.
In Python main program is the part of code that is executed when the program is started. Usually the main program is at the end of the code file and most of the time under if __name__ == "__main__": if statement. In C there is no main program as such, code execution starts with the main function instead.
In Python a variable is a reference to a value, a connection between the variable's name in code and the actual data in memory. In Python variables have no type but their values do. The validity of a value is tested case by case when code is executed. In these ways they are different from C variables, and in truth Python variables are closer to C pointers.
Pythonin for-silmukka vastaa toiminnaltaan useimmissa kielissä olevaa foreach-silmukkaa. Se käy läpi sekvenssin -esim. listan - jäsen kerrallaan, ottaen kulloinkin käsittelyssä olevan jäsenen talteen silmukkamuuttujaan. Silmukka loppuu, kun iteroitava sekvenssi päättyy.
Pääfunktio on C:ssä ohjelman aloituspiste ja se korvaa Pythonista tutun pääohjelman. Oletuksena pääfunktion nimi on main ja se määritellään yksinkertaisimmillaan int main().
Resource referes to the processing power, memory, peripheral devices etc. that are availlable in the device. It includes all the limitations within which programs can be executed and therefore defines what is possible with program code. On a desktop PC resources are - for a programmer student - almost limitless, but on embedded devices resources are much more scarce.
Return value is what a function returns when its execution ends. In C functions can only have one return value, while in Python there can be multiple. When reading code, return value can be understood as something that replaces the function call after the function has been executed.
A statement is a generic name for a single executable set of instructions - usually one line of code.
C uses static typing This means that the type of variables is defined as they are created, and values of different types cannot be assigned to them. The validity of a value is determined by its type (usually done by the compiler). Python on the other hand uses dynamic typing aka.duck typing.
In Python all text is handled as strings and it has no type for single characters. However in C there are no strings at all - there's only character arrays. A character array can be defined like a string however, e.g. char animal[7] = "donkey"; where the number is the size of the array + 1. The +1 is neede because the string must have space for the null terminator '\0' which is automatically added to the end of the "string".
Syntax is the grammar of a programming language. If a text file does not follow the syntax of code, it cannot be executed as code, or in the case of C, it cannot be compiled.
Terminal, command line interface, command line prompt etc. are different names to the text-based interface of the operating system. In Windows you can start the command line prompt by typing md to the Run... window (Win+R). Command line is used to give text-based commands to the operating system.
The data in a computer's memory is just bits, but variables have type. Type defines how the bits in memory should be interpreted. It also defines how many bits are required to store a value of the type. Types are for instance int, float and char.
Typecast is an operation where a variable is transformed to another type. In the elementary course this was primarily done with int and float functions. In C typecast is marked a bit differently: floating = (float) integer}. It's also noteworthy that the result must be stored in a variable that is the proper type. it is not possible to change the type of an existing variable.
Unsigned integer is a an integer type where all values are interpreted as positive. Since sign bit is not needed, unsigned integers can represent twice as large numbers as signed integers of the same size. An integer can be introduced as unsigned by using the unsigend keyword, e.g. unsigned int counter;.
In the elementary programming course we used the term value to refer to all kinds of values handled by programs be it variables, statement results or anything. In short, a value is data in the computer's memory that can be referenced by variables. In C the relationship between a variable and its value is tighter as variables are strictly tied to the memory area where its value is stored.
A warning is a notification that while executing or - in this course particularly - compiling it, something suspicious was encountered. The program may still work, but parts of it may exhibit incorrect behavior. In general all warnings should be fixed to make the program stable.
One way to print stuff in C is the printf function, which closely resembles Python's print function. It is given a printable string along with values that will be formatted into the string if placeholders are used. Unlike Python, C's printf doesn't automatically add a newline at the end. Therefore adding \n at the end is usually needed.
Out of loops, while is based on repetition through checking a condition - the code block inside the loop is repeated until the loop's condition is false. The condition is defined similarly to conditional statements, e.g. while (sum < 21).