Efficient Programming 2

Lecturer:

Martin Kačer (gar.)

Tutor:

Martin Kačer (gar.)

Supervisor:

Department of 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 2011/2012:

Time-table is not available yet

Time-table for summer semester 2011/2012:

	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
Mon
Tue
Fri	roomT9:349 Kačer M. 12:45–14:15 (lecture parallel1) Dejvice NBFIT místnostroomT9:351 Kačer M. 14:30–16:00 (lecture parallel1 parallel nr.101) Dejvice NBFIT PC ucebna
Thu
Fri

The course is a part of the following study plans: