A course is the basic teaching unit, it's design as a medium for a student to acquire comprehensive knowledge and skills indispensable in the given field. A course guarantor is responsible for the factual content of the course.
For each course, there is a department responsible for the course organisation. A person responsible for timetabling for a given department sets a time schedule of teaching and for each class, s/he assigns an instructor and/or an examiner.
Expected time consumption of the course is expressed by a course attribute extent of teaching. For example, extent = 2 +2 indicates two teaching hours of lectures and two teaching hours of seminar (lab) per week.
At the end of each semester, the course instructor has to evaluate the extent to which a student has acquired the expected knowledge and skills. The type of this evaluation is indicated by the attribute completion. So, a course can be completed by just an assessment ('pouze zápočet'), by a graded assessment ('klasifikovaný zápočet'), or by just an examination ('pouze zkouška') or by an assessment and examination ('zápočet a zkouška') .
The difficulty of a given course is evaluated by the amount of ECTS credits.
The course is in session (cf. teaching is going on) during a semester. Each course is offered either in the winter ('zimní') or summer ('letní') semester of an academic year. Exceptionally, a course might be offered in both semesters.
The subject matter of a course is described in various texts.
BIK-EFA Efficient Algorithms Extent of teaching: 13KP+4KC Instructor: Completion: Z,ZK Department: 18101 Credits: 5 Semester: Z Annotation:
Students get a solid overview of efficient algorithms for solving classical algorithmic problems: selecting, searching, sorting, and other basic forms of reshaping and processing tree-like data structures. Students are able to design and implement such algorithms, to analyse their complexity, and to develop an optimised efficient algorithm under specific requirements or constraints. They are able to recognise a proper algorithm variant for any specific usage.
Lecture syllabus:
1. Mathematical foundation for the theory of algorithmic complexity. Sorting in n.log n, advanced analysis of QuickSort. 2. Heap, HeapSort, priority queue. Sorting in linear time, sorting in external memory. 3. Recursion, complexity of recursive algorithms. Search problem, 1D address search, mapping function. 4. Hash tables, open and chained addressing, hash functions. Associative search, binary search trees, string matching in a text. 5. Multidimensional search, multidimensional search trees. Balancing of search trees, RB-trees. 6. Binomial and Fibonnaci heaps. Seminar syllabus:
1. Recap of discrete and asymptotic mathematics. [2] Implementation, stabilization, and in-depth complexity analysis of sorting algorithms. Implementation and complexity analysis of sorting in external memory. Comparison of recursive and iterative algorithm design, mutual transformations. Recurrent equations solving techniques. Address search, design of mapping functions. 2. Hash table usage, open and chained addressing. Search, binary search trees, string matching. Multidimensional search trees, closest neighbor. Balanced search trees. Advanced heaps, operations, applications. Literature:
1. Cormen, T. H., Leiserson, C. E., Rivest, R. L. ''Introduction to Algorithms''. The MIT Press, 2001. ISBN 0262032937. 2. Sedgewick, R. ''Algorithms in Java, Parts 1-4 (3rd Edition)''. Addison-Wesley Professional, 2002. ISBN 0201361205. Requirements:
We assume an ability to actively solve basic algorithmic problems, to express the algorithmic solution in a high-level programming language (Java, C++) and knowledge of basic notions from a calculus and combinatorics.
Informace o předmětu a výukové materiály naleznete na https://courses.fit.cvut.cz/BI-EFA/
Dvojici předmětů EFA + GRA lze uznat, jestliže student úspěšně absolvuje dvojici předmětů AG1 + AG2.
Student, kterému chybí EFA si zapíše AG1 a dělá rozdílovou zkoušku.
Znovu přijatému studentu, kterému bude uznaný předmět EFA z minulého studia si zapíše předmět AG1 a může požádat o uznání zápočtu.The course is also part of the following Study plans:
Study Plan Study Branch/Specialization Role Recommended semester BIK-SPOL.2015 Unspecified Branch/Specialisation of Study VO 3 BIK-BIT.2015 Computer Security and Information technology V 3 BIK-BIT.2020 Computer Security and Information technology V 3 BIK-WSI-SI.2015 Web and Software Engineering V 3
Page updated 25. 4. 2024, semester: Z,L/2023-4, Z/2019-20, Z/2024-5, L/2022-3, Z/2020-1, Z,L/2021-2, L/2020-1, Z/2022-3, L/2019-20, Send comments to the content presented here to Administrator of study plans Design and implementation: J. Novák, I. Halaška