Course detail

Programming Techniques

FSI-DPT-KAcad. year: 2009/2010

Object oriented programming and basics programming principles are presented through the C# programming language. These principles are closely linked to systematic design of inherited classes.

Language of instruction

Czech

Number of ECTS credits

6

Mode of study

Not applicable.

Guarantor

prof. RNDr. Ing. Tomáš Březina, CSc.

Department

Institute of Automation and Computer Science (ÚAI)

Learning outcomes of the course unit

Students will learn the methodology of program development based on the object-oriented programming and will acquire skills to solve a problem through object technologies.

Prerequisites

The standard high school computer literacy is expected.

Co-requisites

Not applicable.

Planned learning activities and teaching methods

Teaching methods depend on the type of course unit as specified in the article 7 of BUT Rules for Studies and Examinations.

Assesment methods and criteria linked to learning outcomes

Course-unit credit requirements: active participation in seminars and individual elaboration of an assigned project. The examination comprises written and oral parts. The written part is represented by a test with four questions. Oral part consists of discussion on the written part with possible complementary questions. The evaluation is fully in competence of a tutor according to the valid directives of BUT.

Course curriculum

Not applicable.

Work placements

Not applicable.

Aims

The introduction to the object oriented methodology of work with a computer. The algorithmic thinking extent and structured approach to problem solving. The development of computer creativity and a structured approach to problem solving.

Specification of controlled education, way of implementation and compensation for absences

The attendance at lectures is recommended while at seminars it is obligatory. Education runs according to week schedules. The form of compensation of missed seminars is fully in the competence of a tutor.

Recommended optional programme components

Not applicable.

Prerequisites and corequisites

Not applicable.

Basic literature

Cantú, M.: Mistrovství v Delphi 6.,7.

Recommended reading

Cantú, M.: Mistrovství v Delphi 6.,7.

Classification of course in study plans

  • Programme B3S-K Bachelor's

    branch B-AIŘ , 2. year of study, summer semester, compulsory

Type of course unit

 

Guided consultation

17 hours, optionally

Teacher / Lecturer

doc. Ing. Stanislav Věchet, Ph.D.

Syllabus

1. Introduction, integrated development environment, the principles of object oriented programming.
2. Basics object oriented programming in C#, encapsulation, inheritance, polymorphism.
3. Static and virtual methods, constructors and destructors.
4. Polymorphism, realization and practical application.
5. Object design, programming interface, code security.
6. Code security based on system exceptions.
7. Systematic project design and design of inheritors through modification of existing classes.
8. Dynamic array, work with dynamic arrays.
9. Access to text files, content modification, creation and erasing.
10. Basics graphics, graphics context, bitmap.
11. Recursion and its use.
12. System information usage, timer, multithreading.
13. Code factorization and its use.

Controlled Self-study

35 hours, compulsory

Teacher / Lecturer

prof. RNDr. Ing. Tomáš Březina, CSc.

Syllabus

1. Repetition – work with pointers, recursion. Object as generalised record.
2. Static and dynamic instance of class. Systematic design of constructor and destructor.
3. Philosophy of virtual methods use.
4. Principles of code security increasing.
5. Classes design philosophy with use of inheritance, classes compatibility.
6. Class design and top down method. Use of classes compatibility for condensation and generalization of code. Overhead and data classes separation.
7. Philosophy of project structuralization in, support in Delphi.
8. Dynamic array, work with dynamic arrays.
9. Text files usage, content modification.
10. Graphics output of user application.
11. Internal timer usage.
12. Recursion usage.
13. Accreditation.

Exercises cover and develop typical examples.