CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2018/2019

# Efficient Programming 2

Code Completion Credits Range Language
BI-EP2 KZ 4 2P+2C Czech
Lecturer:
Martin Kačer (guarantor)
Tutor:
Martin Kačer (guarantor)
Supervisor:
Department of Theoretical Computer Science
Synopsis:

Continuation of Efficient Programming 1. Students will practice implementation of algorithms by solving typical problems. Various ways of solving individual problems are discussed, with the aim to choose the best one and avoid implementation errors.

Requirements:
Syllabus of lectures:

1. Meshes and matrices. Triangular and hexagonal meshes.

2. Strings, exact and approximative searching.

3. Basic graph algorithms: BFS, DFS, shortest paths.

4. State space and searching.

5. Advanced graph algorithms: network flows, pairing.

6. Operational complexity.

7. Computing geometry.

Syllabus of tutorials:

1. Meshes and matrices. Triangular and hexagonal meshes.

2. Strings, exact and approximative searching.

3. Basic graph algorithms: BFS, DFS, shortest paths.

4. State space and searching.

5. Advanced graph algorithms: network flows, pairing.

6. Operational complexity.

7. Computing geometry.

Study Objective:

Adopt techniques to design efficient and elegant solutions, to minimize possibilities of implementation errors.

Study materials:

Steven S. Skiena, Miguel Revilla: Programming Challenges.

Jon Bentley: Programming Pearls.

Note:
Time-table for winter semester 2018/2019:
Time-table is not available yet
Time-table for summer semester 2018/2019:
 06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00 roomTH:A-942Kačer M.11:00–12:30(lecture parallel1)Thákurova 7 (FSv-budova A)roomTH:A-942Kačer M.12:45–14:15(lecture parallel1parallel nr.101)Thákurova 7 (FSv-budova A)
The course is a part of the following study plans:
Data valid to 2019-05-23
For updated information see http://bilakniha.cvut.cz/en/predmet1684706.html