CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2022/2023
UPOZORNĚNÍ: Jsou dostupné studijní plány pro následující akademický rok.

# Interactive Graphical Systems 1

Code Completion Credits Range Language
155IGS1 KZ 4 1P+2C Czech
Garant předmětu:
Lecturer:
Petr Soukup
Tutor:
Petr Soukup
Supervisor:
Department of Geomatics
Synopsis:

The subject of practical training is the Kokeš system - an interactive graphic editor for working with digital maps.

The exercises consist of solving practical tasks in a number of areas of the system's use.

Lectures are focused on an introduction to algorithmization of (geodetic) tasks.

Flow charts are used to write the algorithms.

The functionality of the algorithms is demonstrated using Matlab.

A web-based course in the Moodle system is used for teaching.

Requirements:

no prerequisities

Syllabus of lectures:

Introduction to the theory of algorithms - basic properties, methods of writing, flowcharts, connection to graphical systems.

Simple calculations - application of branching, looping, recursion.

Sorting - direct insertion, bubble sort, quick sort.

Raster files - histogram, rotation, mirroring, negation, thresholding.

Set of points in a plane - minimum circumscribed rectangle, area, center of gravity, pair of nearest and farthest points, closest point to a given point.

Finding strings in text - brute force method, KMP algorithm, Boyer-Moore algorithm.

Algorithms - repetition, practice of selected problems.

Syllabus of tutorials:

Introduction to the theory of algorithms - basic properties, methods of writing, flowcharts, connection to graphical systems.

Simple calculations - application of branching, looping, recursion.

Sorting - direct insertion, bubble sort, quick sort.

Raster files - histogram, rotation, mirroring, negation, thresholding.

Set of points in a plane - minimum circumscribed rectangle, area, center of gravity, pair of nearest and farthest points, closest point to a given point.

Finding strings in text - brute force method, KMP algorithm, Boyer-Moore algorithm.

Algorithms - repetition, practice of selected problems.

Study Objective:

The aim is to get acquainted with the basics of algorithmization.

Study materials:

!Knuth, Donald Ervin. The art of computer programming. Upper Saddle River, NJ: Addison-Wesley, 2011. ISBN 0-201-85392-2.

!Wróbleski, Piotr. Algoritmy. Brno: Computer Press, 2015. ISBN 978-80-251-4126-7.

!Pelánek, Radek. Programátorská cvičebnice: [algoritmy v příkladech]. Brno: Computer Press, 2012. ISBN 978-80-251-3751-2.

Note:
Further information: