Budapest University of Technology and Economics, Faculty of Electrical Engineering and Informatics

A kötelező előtanulmányi rend az adott szak honlapján és képzési programjában található.

1. Lecture: Summary of the previous semester. "Repair" of the C language: value type struct, enum, bool type. Low-level Function call. The need for prototypes, the introduction of a reference type. Using function as by left value. Introduction to isostream.
   
   Lab: Summary of Basic Operating System knowledge. Practice with the development environment - usage of the development tools.
2. Lecture: Function name overloading. Default function parameters, inline functions, namespaces. A short introduction to memory allocation and the exception handling mechanism of C++
   
   Lab: Exercising with const and reference. Rewriting code written in C to C++ using C++ elements. Discovery of memory leaking.

Fundamentals of the object-oriented programming.

3. Lecture: Object-oriented programming: Basic concepts, principles, object definition. Classes, encapsulation, concept of information hiding and visibility. Member variables and member functions. Getters and setters. The „this" pointer. Constructors, destructors.
   
   Lab: A simple class implementation. Getter/setter functions.

4. Lecture: Constructors and destructors. Copy constructor, assignment operator. The initialisation of member variables. Constant and static members.
   
   Lab: Constructors, destructors, operator<< overload.
5. Lecture: Visibility. The concept of operator overload. The realisation of operation overload by the member and global functions. Restrictions.
   
   Lab: Classes width dynamic data. Copy constructor, assignment operator.
   
   
6. Lecture: The role of the inheritance in object-oriented programming. Inheritance, derived class, base class. Influence of inheritance on visibility. Constructors and inheritance.
   
   Lab: Implementation of more complex objects (e.g. Dynamic array). Operator overload., Homework specification.
   
   
7. Lecture: Virtual functions, abstract classes. Restricting inheritance. Virtual destructors. Heterogeneous collections.
   
   Lab: Inheritance, Impact of inheritance on visibility and overloading.
   
   
8. Lecture: Multiple inheritance, virtual base classes. Concept and implementation of persistence.
   
   Lab: Heterogeneous collections. Homework: skeleton
   
   
9. Lecture: Type conversion, conversion (cast) operators, exception handling.
   
   Lab: Multiple inheritance and persistence related tasks.

10. Lecture: The role of the generic data structures. Function and class templates.
    
    Lab: Type conversion (cast), and exception handling exercises.
    
    
11. Lecture: Introduction of Standard Template Library (STL).
    
    Lab: Generic data structures and algorithms.
    
    
12. Lecture: STL containers and algorithms, iterators.
    
    Lab: STL containers and algorithms. Homework presentation.
    
    
13. Lecture: Presentation of complex example. Language tools.
    
    Lab: Homework presentation.
    
    
14. Lecture: Summary. Introduction to design patterns.
    
    Lab: Spare lab
    

During the semester:

• Presence: It is compulsory to visit lectures and lab practices. The presence is checked every time. The absence of a student at the lectures and laboratory practices must be less than 30%, for each type individually. Reaching this limit in either of the lecture or lab practice results in an incomplete. Tutors are entitled to check the required knowledge of the students prior to the lab, or during the lab. The lab is registered as absence for students failing this check.
• Small tests. There are three small tests on laboratory practices. Two of the tests score must reach 40%. A missed test is treated as 0 points.
  
• Mid-semester tests. There are two mid-semester tests. These have no minimum limit one by one, but the sum of the score of the two tests must reach 50%. A missed test is treated as 0.
• Beside the small tests, there is a long-term individual homework assignment for each student to solve. The specification is published on week 6, the solution is to be delivered on week 13.

Mid-semester mark is given to those students who completed all assessments. The mark is based on the sum of the score of the two mid-semester tests (2×40), and the score of the best two small tests (2×10). The maximum, therefore, is 110 points. If the assessments are completed, the student passes the course.

There is no repeat possibility neither for the presence.

The small tests are repeated during the semester, as the maximum score of two is taken automatically.

The mid-term tests can be repeated at the repeat week. Only one of the two mid-term tests can be repeated, and it must be the one with the lower score. The new score will overwrite the old one.

For the homework assessment, late delivery is accepted by 12:00 of the last day of the semester (Friday of week 14) while paying a late delivery fee. Beyond week 14 there is no way to deliver homework.

• Bjarne Stroustrup "The C++ Programming Language", Addison-Wesley. Available in many languages.
• Scott Meyers "Effective C++", Addison-Wesley. In English.
• Tóth Bertalan "Programozzunk C++ nyelven", ComputerBooks, 2003. In Hungarian.
• Programming problems with solutions: http://www.aut.bme.hu/cpppeldatar. In Hungarian.
• C and C++ programming resources: http://www.cprogramming.com/. In English.