Gurantor department | Department of Computer Science | Credits | 4 |

Subject guarantor | doc. Mgr. Jiří Dvorský, Ph.D. | Subject version guarantor | doc. Mgr. Jiří Dvorský, Ph.D. |

Study level | undergraduate or graduate | Requirement | Compulsory |

Year | 1 | Semester | summer |

Study language | Czech | ||

Year of introduction | 2019/2020 | Year of cancellation | |

Intended for the faculties | FEI | Intended for study types | Bachelor |

Instruction secured by | |||
---|---|---|---|

Login | Name | Tuitor | Teacher giving lectures |

DOH089 | Ing. Pavel Dohnálek, Ph.D. | ||

DVO26 | doc. Mgr. Jiří Dvorský, Ph.D. | ||

FAI0013 | Ing. Michal Fait, Ph.D. | ||

FAL0046 | Ing. Jan Faltýnek | ||

KOT06 | Ing. Martin Kot, Ph.D. | ||

PRO0199 | Ing. Petr Prokop |

Extent of instruction for forms of study | ||
---|---|---|

Form of study | Way of compl. | Extent |

Full-time | Graded credit | 2+2 |

Part-time | Graded credit | 14+0 |

To introduce students to problem solving techniques using algorithms. Upon completion of the course, the student will be able to:
define and describe selected problem solving algortihmic techniques using,
demonstrate these techniques on sample problems
use these techniques to solve other problems,
work with combinations of several techniques together.

Lectures

Tutorials

This course is one of the introductory programming courses. The course aims to introduce students to problem solving techniques, strategies, using algorithms. The algorithms and data structures discussed will be demonstrated in C++. Students are encouraged to analyze algorithmic problems and to synthesize solutions from smaller units.

LEVITIN, Anany. Introduction to the design. 3rd ed. Boston: Pearson, 2012. ISBN 978-0-13-231681-1.
CORMEN, Thomas H. Introduction to algorithms. 2nd ed. Cambridge, Mass.: MIT Press, 2001. ISBN 02-620-3293-7.
SEDGEWICK, Robert. Algorithms in C. 3rd ed. Reading, Mass: Addison-Wesley, 1998. ISBN 978-020-1350-883.

STROUSTRUP, Bjarne. The C++ programming language. Fourth edition. Upper Saddle River, NJ: Addison-Wesley, 2013. ISBN 978-0321563842.
SCHILDT, Herbert. Teach yourself C++. 3rd ed. Berkeley: Osborne McGraw-Hill, 1998. ISBN 978-0078823923.

Conditions for granting credit
Implementation and presentation of the project.
Programming applications to simple exercises.
Attendance on exercises.

Students are expected to have the basic C++ knowledge and high school math knowledge.

Subject code | Abbreviation | Title | Requirement |
---|---|---|---|

460-2052 | UPR | Introduction to Programming | Recommended |

460-2054 | FPR | Functional Programming | Recommended |

Subject has no co-requisities.

Algorithm. Algorithmic problem solving strategies. Important problem types.
Analysis of complexity of algorithms.
Brute force strategy. SelectSort. BubbleSort. Sequential search. Convex hull problem. Closest pair problem.
Complete search strategy. Traveling salesman problem. Knapsack problem. Graph traversal.
Decrease and conquer strategy. InsertSort. Generate permutations and subsets. Binary search algorithm. Finding the median. Interpolation search. Searching and insertion in a binary search tree.
Divide and conquer strategy. QuickSort. MergeSort. Convex hull problem. Closest pair problem.
Computer seminars
Iterative algorithms complexity analysis.
Recursive algorithms complexity analysis.
Implementation of convex hull problem, closest pair problem.
Traveling salesman problem - experiments with complete search solution.
Graph traversal algorithms usage.
Generate permutations and subsets.
Implementation of binary search algorithm, interpolation search algorithm and median finding.
Binary search tree implementation.
Implementation of divide and conquer strategy solutions.

Task name | Type of task | Max. number of points
(act. for subtasks) | Min. number of points | Max. počet pokusů |
---|---|---|---|---|

Graded credit | Graded credit | 100 (100) | 51 | 3 |

Průběžná aktivita | Other task type | 30 | 15 | 1 |

Obhajoba projektu | Project | 30 | 15 | 1 |

Závěrečná písemná práce | Written test | 40 | 21 | 2 |

Show history

Conditions for subject completion and attendance at the exercises within ISP: Course completion requirements - Completion of all mandatory tasks within individually agreed deadlines. Attendance at exercises - The level of attendance at exercises is agreed by the student with the course supervisor at the beginning of the semester.

Show history

Academic year | Programme | Field of study | Spec. | Zaměření | Form | Study language | Tut. centre | Year | W | S | Type of duty | |
---|---|---|---|---|---|---|---|---|---|---|---|---|

2023/2024 | (B0714A060018) Biomedical Assistive Technology | EaI | P | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2023/2024 | (B0714A060018) Biomedical Assistive Technology | EaI | K | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2023/2024 | (B0714A150003) Computer Systems for the Industry of the 21st. Century | INF | P | Czech | Ostrava | 2 | Compulsory | study plan | ||||

2023/2024 | (B0713A060007) Automotive Electronic Systems | SPA | P | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2023/2024 | (B0541A170008) Computational and Applied Mathematics | P | Czech | Ostrava | 1 | Compulsory | study plan | |||||

2023/2024 | (B0541A170008) Computational and Applied Mathematics | K | Czech | Ostrava | 1 | Compulsory | study plan | |||||

2023/2024 | (B0714A060023) Communication and Information Technology | P | Czech | Ostrava | 1 | Compulsory | study plan | |||||

2023/2024 | (B0714A060023) Communication and Information Technology | K | Czech | Ostrava | 1 | Compulsory | study plan | |||||

2022/2023 | (B0613A140014) Computer Science | TZI | K | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2022/2023 | (B0613A140014) Computer Science | TZI | P | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2022/2023 | (B0714A060018) Biomedical Assistive Technology | EaI | P | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2022/2023 | (B0714A060018) Biomedical Assistive Technology | EaI | K | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2022/2023 | (B0714A150003) Computer Systems for the Industry of the 21st. Century | INF | P | Czech | Ostrava | 2 | Compulsory | study plan | ||||

2022/2023 | (B0713A060007) Automotive Electronic Systems | SPA | P | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2022/2023 | (B0714A060023) Communication and Information Technology | K | Czech | Ostrava | 1 | Compulsory | study plan | |||||

2022/2023 | (B0714A060023) Communication and Information Technology | P | Czech | Ostrava | 1 | Compulsory | study plan | |||||

2022/2023 | (B0541A170008) Computational and Applied Mathematics | K | Czech | Ostrava | 1 | Compulsory | study plan | |||||

2022/2023 | (B0541A170008) Computational and Applied Mathematics | P | Czech | Ostrava | 1 | Compulsory | study plan | |||||

2021/2022 | (B0613A140014) Computer Science | TZI | P | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2021/2022 | (B0613A140014) Computer Science | TZI | K | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2021/2022 | (B0714A060018) Biomedical Assistive Technology | EaI | P | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2021/2022 | (B0714A060018) Biomedical Assistive Technology | EaI | K | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2021/2022 | (B0714A150003) Computer Systems for the Industry of the 21st. Century | INF | P | Czech | Ostrava | 2 | Compulsory | study plan | ||||

2021/2022 | (B0713A060007) Automotive Electronic Systems | SPA | P | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2021/2022 | (B0541A170008) Computational and Applied Mathematics | P | Czech | Ostrava | 1 | Compulsory | study plan | |||||

2021/2022 | (B0541A170008) Computational and Applied Mathematics | K | Czech | Ostrava | 1 | Compulsory | study plan | |||||

2021/2022 | (B3973) Automotive Electronic Systems | P | Czech | Ostrava | 1 | Compulsory | study plan | |||||

2020/2021 | (B0714A150003) Computer Systems for the Industry of the 21st. Century | INF | P | Czech | Ostrava | 2 | Compulsory | study plan | ||||

2020/2021 | (B0714A060018) Biomedical Assistive Technology | EaI | K | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2020/2021 | (B0714A060018) Biomedical Assistive Technology | EaI | P | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2020/2021 | (B0613A140014) Computer Science | TZI | K | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2020/2021 | (B0613A140014) Computer Science | TZI | P | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2020/2021 | (B3973) Automotive Electronic Systems | P | Czech | Ostrava | 1 | Compulsory | study plan | |||||

2020/2021 | (B0541A170008) Computational and Applied Mathematics | P | Czech | Ostrava | 1 | Compulsory | study plan | |||||

2020/2021 | (B0541A170008) Computational and Applied Mathematics | K | Czech | Ostrava | 1 | Compulsory | study plan | |||||

2020/2021 | (B0713A060007) Automotive Electronic Systems | SPA | P | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2019/2020 | (B0714A150003) Computer Systems for the Industry of the 21st. Century | INF | P | Czech | Ostrava | 2 | Compulsory | study plan | ||||

2019/2020 | (B3973) Automotive Electronic Systems | P | Czech | Ostrava | 1 | Compulsory | study plan | |||||

2019/2020 | (B0541A170008) Computational and Applied Mathematics | P | Czech | Ostrava | 1 | Compulsory | study plan | |||||

2019/2020 | (B0541A170008) Computational and Applied Mathematics | K | Czech | Ostrava | 1 | Compulsory | study plan | |||||

2019/2020 | (B0613A140014) Computer Science | TZI | P | Czech | Ostrava | 1 | Compulsory | study plan | ||||

2019/2020 | (B0613A140014) Computer Science | TZI | K | Czech | Ostrava | 1 | Compulsory | study plan |

Block name | Academic year | Form of study | Study language | Year | W | S | Type of block | Block owner |
---|

2021/2022 Summer |

2020/2021 Summer |

2019/2020 Summer |