SylabUZ
| Course name | Principles of programming |
| Course ID | 11.3-WE-ELEKTP-PrinProgr-Er |
| Faculty | Faculty of Computer Science, Electrical Engineering and Automatics |
| Field of study | Electrical Engineering |
| Education profile | academic |
| Level of studies | First-cycle Erasmus programme |
| Beginning semester | winter term 2019/2020 |
| Semester | 3 |
| ECTS credits to win | 4 |
| Course type | obligatory |
| Teaching language | english |
| Author of syllabus |
|
| The class form | Hours per semester (full-time) | Hours per week (full-time) | Hours per semester (part-time) | Hours per week (part-time) | Form of assignment |
| Lecture | 15 | 1 | - | - | Credit with grade |
| Laboratory | 30 | 2 | - | - | Credit with grade |
To provide basic knowledge about computer system architecture and programming.
To provide basic knowledge about C program structure and design.
To give basic skills in using C commands and functions to solve programming problems.
-
Computer system structure. Operating system. Program structure and design.
Programming languages. Algorithmic languages. C programming. Program structure, commands syntax, identifiers, types, constans, declarations of data.
Arithmetic Operations, Relational and Logical Operations, Bitwise Operators, Assignment Operators, Type Conversions
Instructions: expressional instruction, empty instruction, grouping instruction.
Control instructions: if-else , for loop, switch, while loop. Printout formatting with printf function. Flag, field width, precision, formatting character.
Complex instructions, expressional instruction, grouping instruction. Control instructions: if-else, switch. Loops: do, while, for.
Functions: prototypes, declaration, definition, benefits for functions, arguments, result, calling out, use of functions, recurrence functions.
Scopes of names: local scope, external scope, modular programming.
Pointers: pointers syntax, declaration, operators, using the address and the pointed value. Use of
pointers to communicate with other elements.
Arrays : declaration, usage, pointers and arrays, strings.
Data structures. Features, operation. Arrays of structures. Fields. Unions.
Dynamic memory: standard memory allocation functions, dynamic memory management
Data structures: lists, stacks, binary trees, circular buffers.
Lecture, laboratory exercises.
| Outcome description | Outcome symbols | Methods of verification | The class form |
Lecture – the passing condition is to obtain a positive mark from the final test.
Laboratory – the passing condition is to obtain positive marks from all laboratory exercises to be planned during the semester.
Calculation of the final grade: lecture 50% + laboratory 50%
Modified by dr hab. inż. Radosław Kłosiński, prof. UZ (last modification: 01-11-2019 01:30)
