Programming and Algorithmics 2
Code | Completion | Credits | Range | Language |
---|---|---|---|---|
BI-PA2 | Z,ZK | 7 | 2+3 | Czech |
- Lecturer:
- Josef Vogel (gar.), Ladislav Vagner
- Tutor:
- Josef Vogel (gar.), Jan Baier, Jiří Hunka, Jiří Chludil, Robert Kessl, Mikuláš Krupička, Antonín Procházka, Radek Richtr, Miroslav Sikora, Tomáš Srna, Jan Trávníček, Ladislav Vagner
- Supervisor:
- Department of Computer Science
- Synopsis:
-
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 with all C++ features needed to achieve the main objective (operator overloading, templates).
- Requirements:
-
Fundamentals of algorithmics and C.
- Syllabus of lectures:
-
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.
- Syllabus of tutorials:
-
1. At the 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.
- Study Objective:
-
This is a mandatory course; many other courses build upon it.
- Study materials:
-
1.
2.
- 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:
-
- Computer Science, Version for Students who Enrolled in 2009 and 2010, Presented in Czech (compulsory course in the program)
- Computer engineering, Version for Students who Enrolled in 2009 and 2010, in Czech (compulsory course in the program)
- Software Engineering, Version for Students who Enrolled in 2009 and 2010, in Czech (compulsory course in the program)
- Web and Multimediac, Version for Students who Enrolled in 2009 and 2010, Presented in Czech (compulsory course in the program)
- Information Systems and Management, Version for Students who Enrolled in 2009 and 2010, in Czech (compulsory course in the program)
- Information Technology, Version for Students who Enrolled in 2009 and 2010, Presented in Czech (compulsory course in the program)
- Informatics, Version for Students who Enrolled in 2009 and 2010, Presented in Czech (compulsory course in the program)
- Informatics (Bachelor)- Version for those who Enrolled in 2011 and 2012 (in Czech) (compulsory course in the program)
- Information Systems and Management - Version for those who Enrolled in 2011 and 2012 (in Czech) (compulsory course in the program)
- Information Technology- Version for those who Enrolled in 2011 and 2012 (in Czech) (compulsory course in the program)
- Computer Engineering, Version for those who Enrolled in 2011 and 2012, in Czech (compulsory course in the program)
- Software Engineering- Version for those who Enrolled in 2011 and 2012 (in Czech) (compulsory course in the program)
- Computer Science - Version for those who Enrolled in 2011 and 2012 (in Czech) (compulsory course in the program)
- Web and Multimedia- Version for those who Enrolled in 2011 and 2012 (in Czech) (compulsory course in the program)