1. SylabUZ
2. Faculty of Computer Science, Electrical Engineering and Automatics
3. winter term 2017/2018
4. Electrical Engineering - First-cycle Erasmus programme
5. Programming languages

Generate PDF for this page

Programming languages - course description

Aim of the course

The goal of the subject is to teach programmining in C/C++ luguages. In the first place the learning consists in teaching syntax and semantics of C language and some selected C++ language structures. Next, students are instructed how to implement simple computational algorithms. Apart from that some elements of object oriented programming, such as classes are introduced, in order students to be able to implement calcualtions of electrical systems.

Prerequisites

Save changes

fundamentals of mathematics

Scope

Introductory information: a program and its components
Pogramming environment. Source files. Compilation. Basic elements of program and its structure. Main function. Functions and procedures.
Basic types. Variables. In/out operations. Operators.
Iterative loops: for, while, do-while
Decision instructions.
Creation of own Functions.
Arrays and character strings.
Pointers.
Sorting algorithms: buble sort, selection sort, quick sort.
Classes, objects, inheritance, operator overloading.
Complex numbers.

Teaching methods

Lecture, laboratory exercises

Learning outcomes and methods of theirs verification

Outcome description	Outcome symbols	Methods of verification	The class form

Assignment conditions

Lecture - exam - in order to get a credit it is necessary to pass all of the required tests (oral or written)
Laboratory - the main condition to get a pass are sufficient marks for all exercises and tests conducted during the semester
Calculation of the final Grade: lecture 50% + laboratory 50%

Recommended reading

1. Kernighan B. W., Ritchie D. M.: Język Ansi C, WNT, Warszawa, 1994.
2. Sielicki A.: Laboratorium programowania w języku Pascal, Oficyna Wydawnicza Politechniki Wrocławskiej, Wrocław, 1994.
3. Stroustrup B.: Język C++, WNT 2002

Further reading

1. Aho A. V., Hopcroft J. E., Ullman J. D.: Projektowanie i analiza algorytmów, Helion, Warszawa, 2003.
2. Banachowski L., Diks K., Rytter W.: Algorytmy i struktury danych, WNT Warszawa, 2001.
3. Roszkowski J.: Analiza i projektowanie strukturalne, Helion, Gliwice, 2002.
4. Wirth N.: Algorytmy + struktury danych = programy, WNT, Warszawa,1989.

Notes

Modified by dr hab. inż. Radosław Kłosiński, prof. UZ (last modification: 02-05-2017 18:32)