Subjects

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

Programming for descriptive geometry I - NDGE024

Title:	Programování pro deskriptivní geometrii I
Guaranteed by:	Department of Mathematics Education (32-KDM)
Faculty:	Faculty of Mathematics and Physics
Actual:	from 2016
Semester:	winter
E-Credits:	5
Hours per week, examination:	winter s.:1/2, C [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 :	NMUG103
Is incompatible with:	NMUE022, NMUG103, NPRM044
Is interchangeable with:	NPRM044

Opinion survey results Examination dates Schedule Noticeboard

Annotation -

Last update: T_KDM (17.03.2011)

The aim of this course is to provide a brief introduction to the principles of computers, practice algorithmic thinking, learn simple algorithms and basic principles of procedural programming.

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)

Brief history of computers

Fundamental hardware and its functionality

Operating systems

Programming languages

Using IDE

Elementary statements

Variables and constants

Basic data structures

Input and output

Procedures and functions

Algorithm and its efficiency

Elementary algorithms - divisibility, Euclid's algorithm, Sieve of Eratosthenes, Horner's scheme, long numbers, searching in arrays, etc.