Algorithms
| Code | Completion | Credits | Range | Language |
|---|---|---|---|---|
| A4B33ALG | Z,ZK | 6 | 2+2c | Czech |
- Enrollement in the course requires an assessment of the following courses:
- Programming (A0B36PRI)
Programming 1 (A0B36PR1) - Lecturer:
- Marko Genyk-Berezovskyj (gar.), Radek Mařík
- Tutor:
- Marko Genyk-Berezovskyj (gar.), Karel Bartoš, Michal Čáp, Petr Kalina, Radek Mařík, Přemysl Volf
- Supervisor:
- Department of Cybernetics
- Synopsis:
-
In the course, the algorithms development is constructed with minimum dependency to programming language; nevertheless the lectures and seminars are based on Java. Basic data types a data structures, basic algorithms, recursive functions, abstract data types, stack, queues, trees, searching, sorting, special application algorithms. Students are able to design and construct non-trivial algorithms and to evaluate their affectivity.
- Requirements:
-
Programming 1
- Syllabus of lectures:
-
1. Algorithms, programs, programming languages, introduction to problems solving
2. One-dimensional array, simple problems v 1-D array
3. Sorting in 1-D array pole (mergesort, quicksort, heapsort),
4. Searching in 1-D array
5. 2-D array, simple tasks in 2-D array
6. Strings, simple problems in string processing, text files
7. Asymptotic complexity, evaluation of space and complexity of algorithms from lectures No. 3.-6.
8. Simple recursion, recursive functions, advanced techniques
9. File conception, sequential files, conception of the record, file of records
10. Data types, list, stack, queue, examples of application
11. Linked lists, linearly-linked list, other types of linked list, trees
12. Trees, their properties, binary trees, basic algorithms of tree search.
13. Basic algorithms of linear algebra and mathematical analysis
14. Reserve
- Syllabus of tutorials:
-
1.Introductory test, repeating of the ways of program construction in development environment, examples of functions and procedures, parameters, simple classes, assignment of semester task
2.One-dimensional array processing
3.Sorting and searching in 1D array algorithms
4.Multidimensional array processing algorithms
5.Text and string algorithms
6.Experimentation with space and complexity of algorithms
7.Sequential files
8.Implementation of abstract data types
9.Recursion and iteration
10.Linked lists, linearly-linked list
11.Tree construction, tree search
12.Test, consultation to semester task
13. Algorithms of linear algebra and geometry, mathematical analysis
14.Credit
- Study Objective:
-
Semester project consists from empirical evaluation of searching and sorting algorithms, comparison of iterative and recursive algorithms and debugging of graphical output of selected algorithms of linear algebra and mathematical analysis. Three phases of supervision associated to constituted subtask of project with closing demonstration and defense
- Study materials:
-
[1] Sedgewick, R: Algorithms (Fundamentals, Data structures, Sorting,
Searching), Addison Wesley, 2003
[2] Weiss, M: Data structures and Algorithm Analysis in Java, Addison Wesley, 1999
[3] Keogh, J: Data Structures Demystified, McGraw-Hill, 2004
[4] Wróblevski, P: Algorytmy, Helion, 2003
- Note:
- Time-table for winter semester 2011/2012:
- Time-table is not available yet
- Time-table for summer semester 2011/2012:
-
06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00
Mon Tue Fri Thu Fri - The course is a part of the following study plans:
-
- Otevřená informatika - Počítačové systémy (compulsory course in the program)
- Otevřená informatika - Informatika a počítačové vědy (compulsory course in the program)
- Otevřená informatika - Softwarové systémy (compulsory course in the program)
- Otevřená informatika - před rozřazením do oborů (compulsory course in the program)