Main page | Study Branches/Specializations | Groups of Courses | All Courses | Roles                Instructions

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.

BIE-PA2 Programming and Algorithmics 2 Extent of teaching: 2P+1R+1C
Instructor: 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, set, table). They can implement linked structures. They learn these skills using the programming language C++. Although this is not a module of programming in C++, students are introduced to all C++ features needed to achieve the main objective (e.g., operator overloading, templates).

Lecture syllabus:
1. C++, non-object-oriented extensions.
2. Programming styles, object-oriented programming.
3. Operator overloading 1.
4. Operator overloading 2, shallow copy and deep copy.
5. Inheritance.
6. Polymorphism.
7. Abstract classes, exceptions.
8. Templates.
9. [3] Specification and implementation of abstract data types.
10. Stream library, serialization of objects.
11. Event-driven program, QT library.

Seminar syllabus:
1. In solved-problems sessions, the teacher presents the solutions for sample problems, comments the solution, and may add new pieces of information not mentioned in the lectures. Students follow the path to the solution on their own notebooks, take notes and ask questions.
2. In computer labs, students solve assigned tasks (follow-up to the lectures and solved-problems sessions), the TAs provide consultations and advice.

Literature:
1. Brassard, G., Bratley, P. ''Fundamentals of Algorithmics.'' Prentice Hall, 1995. ISBN 0133350681.
2. Sedgewick, R. ''Algorithms in C, Parts 1--5.'' Addison Wesley, 2001. ISBN 0201756080.

Requirements:
Fundamentals of algorithmics and C.

Information about the course and courseware are available at https://courses.fit.cvut.cz/BIE-PA2/

The course is also part of the following Study plans:
Study Plan Study Branch/Specialization Role Recommended semester
BIE-BIT.2015 Computer Security and Information technology (Bachelor, in English) PP 2
BIE-TI.2015 Computer Science (Bachelor, in English) PP 2
BIE-WSI-SI.2015 Software Engineering (Bachelor, in English) PP 2
BIE-TI.2015_ORIGINAL Computer Science (Bachelor, in English) PP 2


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