Subjects

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

Algorithms M - ON2310201

Title:	Algoritmy M
Guaranteed by:	Katedra matematiky a didaktiky matematiky (41-KMDM)
Faculty:	Faculty of Education
Actual:	from 2012
Semester:	summer
E-Credits:	2
Examination process:	summer s.:combined
Hours per week, examination:	summer s.:0/2, MC [HT]
Capacity:	unknown / unknown (50)
Min. number of students:	unlimited
4EU+:	no
Virtual mobility / capacity:	no
State of the course:	not taught
Language:	Czech
Teaching methods:	full-time
Teaching methods:	full-time
Note:	course can be enrolled in outside the study plan enabled for web enrollment priority enrollment if the course is part of the study plan

Guarantor:	doc. RNDr. Antonín Jančařík, Ph.D.

Annotation -

Last update: STEHLIKO/PEDF.CUNI.CZ (21.05.2009)

Introduction into the theory of complexity and basic types of algorithms.

Aim of the course -

Last update: STEHLIKO/PEDF.CUNI.CZ (21.05.2009)

Introduction into the theory of complexity and algorithms.

Literature -

Last update: JANCARIK/PEDF.CUNI.CZ (16.04.2009)

CORMEN, T. H, LEISERSON, C. E., RIVEST, L. R., STEIN, C. Introduction to algorithms, Mc Graw Hill, 1990, ISBN 0072970545

Teaching methods -

Last update: STEHLIKO/PEDF.CUNI.CZ (21.05.2009)

Seminar.

Requirements to the exam - Czech

Last update: JANCARIK/PEDF.CUNI.CZ (16.04.2009)

Písemná práce.

Syllabus -

Last update: STEHLIKO/PEDF.CUNI.CZ (21.05.2009)

Basic algorithms used in practice.

Boxes and queues.

Graph algorithms.

Algorithms of numerical mathematics.