MVŠO:AALG Algorithms and Data Structures

AALG Algorithms and Data Structures

Moravian Business College Olomouc
summer 2022

Extent and Intensity

2/2/0. 3 credit(s). Type of Completion: zk (examination).

Teacher(s)

Guaranteed by

Timetable

Tue 1. 3. to Fri 13. 5. Tue 8:00–9:30 B2.332, except Tue 5. 4.

AALG/01: Tue 1. 3. to Fri 13. 5. Wed 8:00–9:30 B2.332, except Wed 6. 4., J. Martinů, D. Princ

Course Enrolment Limitations

The course is offered to students of any study field.

Course objectives

After the course, students are able to understand algorithm principles as well as to use gained knowledge in practical tasks.

Syllabus

1. Algorithm, complexity of algorithms.
2. Divide and conquer, recursion.
3. Sorting: Bubble sort, insertion sort, selection sort, merge sort, quick sort and others
4. Elementary structures: set, array, searching in array, stack, queue, linked list (singly linked, doubly linked)
5. More data structures: Binary search tree. Dictionaries, hash table.

Literature

required literature

CORMEN T. H., LEISERSON C. E., RIEVEST R. L. STEIN C. Introduction to Algorithms. 3.vyd. MIT Press, 2009. ISBN 0262033844. info

recommended literature

DASGUPTA S. - PAPADIMITROU C. - VAZIRANI U. Algorithms. McGraw-Hill, 2006. ISBN 0073523402. info
HARRIS S., ROSS J. Beginning Algorithms. Wrox / Wiley Publishing, 2006. ISBN 0-7645-9674-8. info
SEDGEWICK R. Algorithms in Java. Addison-Wesley, 2002. ISBN 0-201-36120-5. info
LAFORE R. Teach Yourself Data Structures and Algorithms in 24 Hours. Sams, 1999. ISBN 0-672-31633-1. info
WOOD D. Data Structures, Algorithms and Performance. Addison-Wesley, 1993. info
WIRTH N. Algorithms and Data Structures. 2.vyd. 1985. info

not specified

SEDGEWICK, R. - WAYNE, K. Algorithms. 4.vyd. Addison-Wesley Professional, 2011. ISBN 032157351X. info

Language of instruction

English

Further Comments

The course can also be completed outside the examination period.
The course is taught annually.

The course is also listed under the following terms summer 2021, summer 2023.