Title:

# Algorithms and Data Structures

Ac.Year:ukončen 2002/2003
Term:Summer
Study plans:
ProgramBranchYearDuty
EI-BC-3VTB1st Stage/2nd YearCompulsory
EI-MSC-5VTI1st Stage/2nd YearCompulsory
Language:Czech
Credits:7
Completion:examination (written)
Type of
instruction:
Hour/semLecturesSem. ExercisesLab. exercisesComp. exercisesOther
Hours:3900039
ExaminationTestsExercisesLaboratoriesOther
Points:00000
Guarantee:Honzík Jan M., prof. Ing., CSc., DIFS
Lecturer:Honzík Jan M., prof. Ing., CSc., DIFS
Instructor:Cvrček Daniel, doc. Ing., Ph.D., DITS
Křena Bohuslav, Ing., Ph.D., DITS
Vojta Tomáš, Ing., DIFS
Faculty:Faculty of Information Technology BUT

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.
Description:
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.
Syllabus of lectures:
1. Introduction
2. Abstract data structures
3. Principles of memory allocation
4. Abstract data types, specification and implementation
5. Searching algorithms
6. Sorting algorithms
7. Text processing algorithms
8. Recursive and non recursive notation of algorithms
9. Verification and proving correctness of algorithms
Syllabus of laboratory exercises:
1. 4 home assignments
2. 1 project with short presentation and defence
Fundamental literature:
1. Honzík,J. a kolektiv: Programovací techniky. Skriptum VUT v Brně
2. Honzík,J.,Hruška,T.,Máčel,M.: Vybrané kapitoly z rogamovacích technik
Study literature:
1. Complete set of texts on the internet address of departmental courses available to students enroled to the course.
Progress assessment:
• Mid-term examination
• 4 home assignment (project in Pascal) sent electronically