FI:PB161 C++ Programming - Course Information
PB161 C++ Programming
Faculty of InformaticsAutumn 2015
- Extent and Intensity
- 2/2. 4 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).
- Teacher(s)
- RNDr. Nikola Beneš, Ph.D. (lecturer)
doc. RNDr. Petr Švenda, Ph.D. (lecturer)
Mgr. Tomáš Brukner (seminar tutor)
RNDr. Jiří Glozar (seminar tutor)
Miroslav Jaroš (seminar tutor)
Mgr. Jan Juráň (seminar tutor)
Mgr. Roman Lacko (seminar tutor)
Mgr. Michal Mikloš (seminar tutor)
RNDr. Jaromír Plhák, Ph.D. (seminar tutor)
RNDr. Lukáš Ručka (seminar tutor)
Mgr. Jiří Weiser (seminar tutor)
Mgr. Jiří Novotný (assistant)
Mgr. Marek Osvald (assistant)
Mgr. Peter Stanko (assistant)
Mgr. Desana Daxnerová (assistant)
Mgr. Ján Bella (assistant)
Mgr. Pavel Kajaba (assistant)
Mgr. Matej Evin (assistant) - Guaranteed by
- doc. RNDr. Eva Hladká, Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics
Supplier department: Department of Computer Systems and Communications – Faculty of Informatics - Timetable
- Mon 12:00–13:50 D3
- Timetable of Seminar Groups:
PB161/01: Mon 16:00–17:50 A219, N. Beneš
PB161/02: Thu 16:00–17:50 A219, M. Jaroš
PB161/03: Wed 10:00–11:50 A219, T. Brukner
PB161/04: Fri 8:00–9:50 B117, J. Plhák
PB161/05: Thu 18:00–19:50 A219, M. Jaroš
PB161/06: Thu 12:00–13:50 B117, L. Ručka
PB161/07: Tue 14:00–15:50 B116, R. Lacko
PB161/08: Wed 18:00–19:50 B117, J. Weiser
PB161/09: Wed 12:00–13:50 B116, J. Weiser
PB161/10: Thu 18:00–19:50 B117, L. Ručka
PB161/11: Tue 16:00–17:50 A219, R. Lacko
PB161/12: Thu 8:00–9:50 A215, M. Mikloš
PB161/13: Thu 10:00–11:50 A215, J. Juráň
PB161/14: Thu 14:00–15:50 B117, J. Juráň - Prerequisites
- PB071 Introduction to the C language || SOUHLAS
Students are also required to have user experience with Unix OS, as homework is submitted and tested on a Unix server. - Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
- fields of study / plans the course is directly associated with
- Applied Informatics (programme FI, B-AP)
- Bioinformatics (programme FI, B-AP)
- Economic Information Systems (programme ESF, B-SI)
- Informatics with another discipline (programme FI, B-BI)
- Informatics with another discipline (programme FI, B-EB)
- Informatics with another discipline (programme FI, B-FY)
- Informatics with another discipline (programme FI, B-GE)
- Informatics with another discipline (programme FI, B-GK)
- Informatics with another discipline (programme FI, B-CH)
- Informatics with another discipline (programme FI, B-IO)
- Informatics with another discipline (programme FI, B-MA)
- Informatics with another discipline (programme FI, B-TV)
- Public Administration Informatics (programme FI, B-AP)
- Mathematical Informatics (programme FI, B-IN)
- Mathematics for Multi-Branches Study (programme PřF, B-MA)
- Mathematics with Informatics (programme PřF, N-MA)
- Mathematics (programme PřF, B-MA)
- Parallel and Distributed Systems (programme FI, B-IN)
- Computer Graphics and Image Processing (programme FI, B-IN)
- Computer Networks and Communication (programme FI, B-IN)
- Computer Systems and Data Processing (programme FI, B-IN)
- Profesional Mathematics (programme PřF, B-MA)
- Programmable Technical Structures (programme FI, B-IN)
- Embedded Systems (programme FI, N-IN)
- Service Science, Management and Engineering (programme FI, N-AP)
- Social Informatics (programme FI, B-AP)
- Artificial Intelligence and Natural Language Processing (programme FI, B-IN)
- Course objectives
- At the end of the course students should be able to:
Understand to principles of object oriented programming.
Design simple object oriented architectures and implement them.
Understand and use basic C++ syntax according to ANSI norm.
Use common C++ libraries, especially STL.
Annotate source code with respect to automatically generated documentation.
Use modern development tools (IDE, debugger, version control...).
Follow best practices guidelines for C++ programming.
Compile programs both under Unix and Windows. - Syllabus
- Basic features of C++ (with respect to C). Standards, compilers.
- Basic principles of object oriented programming (OOP). Object programming methodologies.
- User defined data types. Classes in C++. Class components.
- OOP in C++. Encapsulation, Inheritance, Polymorphism.
- Dynamic memory allocation. Dynamic memory management. Automatic and class pointers.
- Input and output in C++.
- Exception handling. Defensive programming.
- Templates. Standard C++ library and standard template library. Libraries for numeric computing.
- Application of object oriented design and design patterns in C++.
- Other OOP languages. Java and C# as compared to C++.
- Literature
- STROUSTRUP, Bjarne. The C++ programming language. 3rd ed. Reading: Addison-Wesley, 1997, x, 910 s. ISBN 0-201-88954-4. info
- VIRIUS, Miroslav. Programování v C++. 1. vyd. Praha: ČVUT, 1998, 364 s. ISBN 8001018741. info
- VIRIUS, Miroslav. Pasti a propasti jazyka C++ : podrobný průvodce pokročilého uživatele. 1. vyd. Praha: Grada, 1997, 251 s. ISBN 8071696072. info
- VIRIUS, Miroslav. Od C k C++. 1. vyd. České Budějovice: KOPP, 2000, 227 s. ISBN 80-7232-110-2. info
- LOUIS, Dirk, Petr MEJZLÍK and Miroslav VIRIUS. Jazyky C a C++ podle normy ANSI/ISO: kompletní kapesní průvodce. 1. vyd. Praha: Grada Publishing, 1999, 644 s. ISBN 80-7169-631-5. info
- MEYERS, Scott. Effective C++ :50 specific ways to improve your programs and designs. 2nd ed. Reading: Addison-Wesley, 1998, xx, 256 s. ISBN 0-201-92488-9. info
- Bookmarks
- https://is.muni.cz/ln/tag/FI:PB161!
- Teaching methods
- Teaching consists from theoretical lectures combined with the practical exercises and programming homework selected to practice topics from lectures.
- Assessment methods
- During the whole semester, student will undertake 5 programming homework, one written tests and one final programming exercise. 95 points are required to pass the course in addition to successful completion of requirements of practical exercises.
The students are working on given homework (usually finalized at home or in computer lab). Homework are awarded by point according to given criteria. Recommended finalization is exam, which is maintained as test questionnaire on computer. Precondition for undertake exam is to have awarded credit from practical exercises and autonomously programmed final assignment. Classification is based on points gathered from exercises, test questionnaire and final assignment. Participation on practical exercises is mandatory, unless teacher allows for exception (e.g., based on student exceptional knowledge of the subject). - Language of instruction
- Czech
- Further comments (probably available only in Czech)
- Study Materials
The course is taught annually. - Listed among pre-requisites of other courses
- IB113 Introduction to Programming and Algorithms
!NOW(IB111) && !IB111 && !PB162 && !PB161 && !PB071 && !IB001 && !program(B-INF) && !program(B-PVA) && !program(B-CS) - PB007 Software Engineering I
PB160 || PB161 || PB162 || PB174 || PV178 || PB112 - PV255 Game Development I
PB009 && PV112 && (PB161 || PB162 || PV178) - PV294 Advanced C++
PB161
- IB113 Introduction to Programming and Algorithms
- Teacher's information
- http://cecko.eu/public/pb161
- Enrolment Statistics (Autumn 2015, recent)
- Permalink: https://is.muni.cz/course/fi/autumn2015/PB161