Subjects

Your browser does not support JavaScript, or its support is disabled. Some features may not be available.

Programming for descriptive geometry II - NDGE025

Title:	Programování pro deskriptivní geometrii II
Guaranteed by:	Department of Mathematics Education (32-KDM)
Faculty:	Faculty of Mathematics and Physics
Actual:	from 2016
Semester:	summer
E-Credits:	5
Hours per week, examination:	summer s.:2/2, C+Ex [HT]
Capacity:	unlimited
Min. number of students:	unlimited
4EU+:	no
Virtual mobility / capacity:	no
State of the course:	cancelled
Language:	Czech
Teaching methods:	full-time
Teaching methods:	full-time
Note:	course can be enrolled in outside the study plan enabled for web enrollment

Guarantor:	RNDr. Luboš Moravec doc. RNDr. Pavel Töpfer, CSc.
Classification:	Mathematics > Geometry Teaching > Descriptive Geometry
Interchangeability :	NMUG104
Is incompatible with:	NPRM045, NMUG104
Is interchangeable with:	NPRM045

Opinion survey results Examination dates Schedule Noticeboard

Annotation -

Last update: T_KDM (17.03.2011)

The course is a continuation of Programming for descriptive geometry I. The aim is to improve programming abilities, learn various standard algorithms, data structures and the creation of larger projects.

Literature -

Last update: T_KDM (17.03.2011)

Töpfer, P. Algoritmy a programovací techniky, Prometheus, Praha 1995.

Wróblewski, P. Algoritmy - Datové struktury a programovací techniky, Computer Press, Praha, 2004.

Syllabus -

Last update: T_KDM (17.03.2011)

Time and memory complexity

Queue and stack

Basic methods of internal sorting

Recursion

Dynamically allocated variables

Work with linked lists

Evaluation of arithmetic expressions

Basic algorithms for computer graphics

Using libraries

Principles of creating larger projects

Object programming