Algorithms I
| Type of study | Bachelor |
|---|---|
| Language of instruction | Czech |
| Code | 460-2001/05 |
| Abbreviation | ALG I |
| Course title | Algorithms I |
| Credits | 4 |
| Coordinating department | Department of Computer Science |
| Course coordinator | doc. Mgr. Jiří Dvorský, Ph.D. |
Subject syllabus
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.
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.
E-learning
Literature
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 .
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 .