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.
BI-PA2.21 Programming and Algorithmics 2 Extent of teaching: 2P+1R+2C Instructor: Hušek R., Trávníček J., Vogel J. Completion: Z,ZK Department: 18101 Credits: 7 Semester: L Annotation:
Students know the instruments of object-oriented programming and are able to use them for specifying and implementing abstract data types (stack, queue, enlargeable array, list, set, table). They learn these skills using the C++ programming language and are introduced to all C++ features needed in object-oriented programming (e.g., template programming, copying/moving of objects, operator overloading, inheritance, polymorphism).
Lecture syllabus:
types stack and queue in C++.
1. From C to C++, non-object-oriented extensions. 2. Programming styles, introduction to object-oriented programming. 3. Classes and objects in the C++ language. 4. Overloaded operators in C++. 5. Copying, copy constructor in C++. 6. Selected STL components. 7. Inheritance, polymorphism in C++. 8. Abstract classes in C++. 9. Class and function templates in C++. 10. Exceptions and exception handling in C++. Abstract data
11. Abstract data types enlargeable array, list, set, and table in C++. 12. Associative data structures. 13. C++11 extensions. Seminar syllabus:
1. Introduction to C++ 2. OOP basics 3. Visibility, constructor, destructor, modules 4. Operator overloading 5. Shallow vs. deep copy 6. STL containers 7. Inheritance 8. Abstract methods 9. Fuction a class template 10. Exceptions and C++11 11. C++11 12. Practice (extra tasks) 12. Reserve Literature:
1. Cormen T. H., Leiserson C. E., Rivest R. L., Stein C. : Introduction to Algorithms (3rd Edition). MIT Press, 2016. ISBN 978-0262033848. 2. Brassard G., Bratley P. : Fundamentals of Algorithmics (3rd Edition). Pearson, 2015. ISBN 978-0133350685. 3. Sedgewick R. : Algorithms (4th Edition). Addison Wesley, 2011. ISBN 978-0321573513. 4. Sedgewick R. : Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching (3rd Edition). Addison-Wesley, 1998. ISBN 978-0201350883. 5. Virius M. : Programování v C++ - od základů k profesionálnímu použití. Grada, 2018. ISBN 978-80-271-0502-1. Requirements:
Fundamentals of algorithmics and C.
Informace o předmětu a výukové materiály naleznete na https://courses.fit.cvut.cz/BI-PA2/ The course is also part of the following Study plans:
Page updated 28. 3. 2024, semester: Z/2023-4, L/2019-20, L/2022-3, Z/2019-20, Z/2022-3, L/2020-1, L/2023-4, Z/2020-1, Z,L/2021-2, Send comments to the content presented here to Administrator of study plans Design and implementation: J. Novák, I. Halaška