| Course Unit Code | 638-2024/01 |
|---|
| Number of ECTS Credits Allocated | 4 ECTS credits |
|---|
| Type of Course Unit * | Compulsory |
|---|
| Level of Course Unit * | First Cycle |
|---|
| Year of Study * | Second Year |
|---|
| Semester when the Course Unit is delivered | Summer Semester |
|---|
| Mode of Delivery | Face-to-face |
|---|
| Language of Instruction | Czech |
|---|
| Prerequisites and Co-Requisites | Course succeeds to compulsory courses of previous semester |
|---|
| Name of Lecturer(s) | Personal ID | Name |
|---|
| SVE05 | Ing. Pavel Švec, Ph.D. |
| Summary |
|---|
The objective of the course is familiarize students with principles,
classification of complexity and validity of algorithms, familiarize with
control a data structures of programme languages and abstract data types. |
| Learning Outcomes of the Course Unit |
|---|
Student will be able to
- analyze basic computer’s tasks;
- apply the basic data and control structures in the concept of the solution;
- build the algorithm of the solution;
- transform the algorithm to the computer program .
|
| Course Contents |
|---|
First Properties of algorithms, notations and description algorithms.
Second Problem solving techniques. Design and implementation of algorithms.
3rd Principles of high level programming languages. Symbols and separators, constants, identifiers.
4th Variables, representation of numbers, labels.
5th Expressions and statements.
6th Text files, standard input / output, binary files.
7th The concept of data. Simple data types. Structured data types.
8th Structured programming. The control structures. The block structure, scope.
9th Procedures and functions and their parameters.
10th Recursive procedures and functions, and direct and indirect recursion.
11th Pointers and dynamic variables. Linked structures, lists and trees.
12th Basic sorting methods and their efficiency.
13th Basic search methods, applications.
14th Debugging and program documentation. |
| Recommended or Required Reading |
|---|
| Required Reading: |
|---|
[1] HEGER, M.: Počítačová technika II. Studijní opora k předmětu. 2010
[2] HEROUT, P.: Učebnice jazyka C. 1. díl, 5. vyd. České Budějovice: Kopp, 2008, 271 s. ISBN 978-80-7232-351-7
[3] HEROUT, P.: Učebnice jazyka C. 2. díl, 3. vyd. České Budějovice: Kopp, 2007, s. 272-437, ISBN 978-80-7232-329-6
[4] KNUTH, D. E.: The art of computer programming. Vol. 1, Fundamental algorithms. 3rd ed. Boston: AddisonWesley, 1997, 650 s. ISBN 0-201-89683-4
|
[1] HEGER, M.: Počítačová technika II. Studijní opora k předmětu. 2010
[2] HEROUT, P.: Učebnice jazyka C. 1. díl, 5. vyd. České Budějovice: Kopp, 2008, 271 s. ISBN 978-80-7232-351-7
[3] HEROUT, P.: Učebnice jazyka C. 2. díl, 3. vyd. České Budějovice: Kopp, 2007, s. 272-437, ISBN 978-80-7232-329-6
[4] KNUTH, D. E.: The art of computer programming. Vol. 1, Fundamental algorithms. 3rd ed. Boston: AddisonWesley, 1997, 650 s. ISBN 0-201-89683-4 |
| Recommended Reading: |
|---|
| [1] WIRTH, N.: Algorithms + Data Structures = Programs. 1976. Prentice Hall. ISBN: 0130224189 |
| [1] WIRTH, N.: Algoritmy a štruktúry údajov, Alfa Bratislava, 1988. |
| Planned learning activities and teaching methods |
|---|
| Lectures, Tutorials, Project work |
| Assesment methods and criteria |
|---|
| Task Title | Task Type | Maximum Number of Points
(Act. for Subtasks) | Minimum Number of Points for Task Passing |
|---|
| Credit and Examination | Credit and Examination | 100 | 51 |
| Credit | Credit | | |
| Examination | Examination | | |