Logo ČVUT
Loading...
CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2011/2012

Data Structures and Algorithms

Login to KOS for course enrollment Display time-table
Code Completion Credits Range Language
AD7B36DSA Z,ZK 6 14+6s Czech
Enrollement in the course requires an successful completion of the following courses:
Logika (AD7B01LOG)
Matematická analýza (AD7B01MAA)
Pravděpodobnost a statistika (AD7B01PST)
The course cannot be taken simultaneously with:
Data Structures and Algorithms (YD36DSA)
Lecturer:
Michal Píše (gar.), Petr Matyáš
Tutor:
Michal Píše (gar.), Petr Matyáš
Supervisor:
Department of Computer Science and Engineering
Synopsis:

Correctness and complexity of algorithms; sequences; hashing (associative arrays); sorting and searching; priority queues; generic optimization; software engineering perspective on algorithmics.

Requirements:

Basic knowledge of programming; exact thinking.

Syllabus of lectures:

1. Complexity of algorithms

2. Correctness of algorithms

3. Average complexity

4. Randomized algorithms

5. Sequences

6. Hashing

7. Sorting and searching

8. Priority queues

9. Sorted sequences

10. Generic optimization

11. Software engineering perspective on algorithmics

Syllabus of tutorials:

1. Complexity of algorithms

2. Correctness of algorithms

3. Average complexity

4. Randomized algorithms

5. Sequences

6. Hashing

7. Sorting and searching

8. Priority queues

9. Sorted sequences

10. Generic optimization

11. Software engineering perspective on algorithmics

Study Objective:

Students of this course should learn:

- a library of fundamental algorithms,

- to tweak these algorithms according to the problem at hand,

- to recognize situations in which these algorithms are applicable,

- to analyze effectiveness of algorithms,

- to formally reason about the correctness of algorithms and

- to exercise exact thinking and expressing.

Study materials:

1. K. Mehlhorn, P. Sanders: Algorithms and Data Structures: The Basic Toolbox

2. K. Weihe: A Software Engineering Perspective on Algorithmics

3. Course webpage: http://edux.feld.cvut.cz/courses/A7B36DSA/

Note:
Time-table for winter 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
Thu
Fri
roomKN:E-126
Matyáš P.
11:00–12:30
ODD WEEK

(lecture parallel1)
Karlovo nám.
Trnkova posluchárna K5
Time-table for summer semester 2011/2012:
Time-table is not available yet
The course is a part of the following study plans:
Generated on 2012-7-9
For updated information see http://bilakniha.cvut.cz/en/predmet1392206.html