Course details

Algorithms and Data Structures

ADS Acad. year 2003/2004 Summer semester 7 credits

Current academic year

Introduction to algorithms. Fundamentals of the program complexity. Abstract data structures. Principles of dynamic memory allocation. Abstract data types, specification and implementation. Searching algorithms. Sorting algorithms. Text processing algorithms. Recursive and non recursive notation of algorithms. Verification and proving correctness of algorithms.

Details ...

Guarantor

Honzík Jan M., prof. Ing., CSc. (DIFS)

Language of instruction

Czech

Completion

Examination

Time span

Department

Faculty of Information Technology (FIT)

Learning objectives

To command the design, specification and implementation of abstract data types. To acquaint and command the most important searching algorithms. To acquaint the most inportant sorting. algorithms.To acquaint with the fundamentals of proving of the correnctness of algorithms.

Progress assessment

Mid-term examination 4 home assignment (project in Pascal) sent electronically

Course inclusion in study plans

Back to top