456-0080/01 – Introduction to algorithms (S) (ZALS)

Gurantor departmentDepartment of Computer ScienceCredits4
Subject guarantorRNDr. Daniela Szturcová, Ph.D.Subject version guarantorRNDr. Daniela Szturcová, Ph.D.
Study levelundergraduate or graduateRequirementCompulsory
Year1Semestersummer
Study languageCzech
Year of introduction1995/1996Year of cancellation2002/2003
Intended for the facultiesFEIIntended for study typesMaster
Extent of instruction for forms of study
Form of studyWay of compl.Extent
Full-time Credit and Examination 2+2

Subject aims expressed by acquired skills and competences

Teaching methods

Summary

Course goal is to gain an understanding of algorithms, data organization and data abstraction. Study of advanced programming techniques and data representations, including data structures, recursion, stacks and queues; packaging data abstraction; advanced searching, sorting and hashing; files; binary search trees; analysis of algorithms and computational complexity. The algorithms will be written in pseudocode, without details of a particular programming language.

Compulsory literature:

Recommended literature:

Way of continuous check of knowledge in the course of semester

Podmínky udělení zápočtu: Zápočtový test 2*20 bodů (minimum z každého testu 5, pro udělení zápočtu je požadováno minimálně 15 bodů)

E-learning

Další požadavky na studenta

Prerequisities

Subject has no prerequisities.

Co-requisities

Subject has no co-requisities.

Subject syllabus:

Přednášky: Pojem algoritmu. Jednoduché algoritmy. Proměnné. Krokovací tabulka. Řídící struktury. Základní datové struktury. Vlastnosti datových typů. Jednoduché datové typy (boolean, číselné typy) a operace nad nimi. Ukazatel.Strukturované datové typy a operace nad nimi. Pole, struktura. Abstraktní datové typy, zásobník, fronta, stream, strom. Implementace. Procedury a funkce. Složitost. Rekurze. Vnitřní třídění. Základní algoritmy vnitřního třídění. Vnější třídění. Slévání, Merge sort. Hashing. Hashovací funkce, řešení kolizí. Vyhledávání. Sekvenční, binární vyhledávání. Vyhledávání podřetězce (Pattern Matching). Binární stromy. Vyhledávání, vkládání, rušení uzlů. Zpracování aritmetických výrazů. Maticové algoritmy. Cvičení: Cvičení navazují na přednášky praktickými příklady.

Conditions for subject completion

Full-time form (validity from: 1960/1961 Summer semester)
Task nameType of taskMax. number of points
(act. for subtasks)
Min. number of points
Exercises evaluation and Examination Credit and Examination 100 (145) 51
        Examination Examination 100  0
        Exercises evaluation Credit 45  0
Mandatory attendence parzicipation:

Show history

Occurrence in study plans

Academic yearProgrammeField of studySpec.FormStudy language Tut. centreYearWSType of duty
2002/2003 (M2612) Electrical Engineering and Computer Science (2612T999) Common Base for FEI P Czech Ostrava 1 Compulsory study plan
2002/2003 (M2612) Electrical Engineering and Computer Science (2601T004) Measurement and Control Engineering P Czech Ostrava Choice-compulsory study plan
2002/2003 (M2612) Electrical Engineering and Computer Science (2612T018) Electronics and Communication Technology P Czech Ostrava Choice-compulsory study plan
2002/2003 (M2612) Electrical Engineering and Computer Science (2642T004) Electrical Machines, Apparatus and Drives (10) Elektrické stroje a přístroje P Czech Ostrava Choice-compulsory study plan
2002/2003 (M2612) Electrical Engineering and Computer Science (2642T004) Electrical Machines, Apparatus and Drives (20) Elektrické pohony a výkonová elektronika P Czech Ostrava Choice-compulsory study plan
2002/2003 (M2612) Electrical Engineering and Computer Science (3902T023) Computer Science P Czech Ostrava Choice-compulsory study plan
2002/2003 (M2612) Electrical Engineering and Computer Science (3907T001) Electrical Power Engineering P Czech Ostrava Choice-compulsory study plan
2001/2002 (M2612) Electrical Engineering and Computer Science (2601T004) Measurement and Control Engineering P Czech Ostrava 1 Compulsory study plan
2001/2002 (M2612) Electrical Engineering and Computer Science (2612T018) Electronics and Communication Technology P Czech Ostrava 1 Compulsory study plan
2001/2002 (M2612) Electrical Engineering and Computer Science (2612T999) Common Base for FEI P Czech Ostrava 1 Compulsory study plan
2001/2002 (M2612) Electrical Engineering and Computer Science (2642T004) Electrical Machines, Apparatus and Drives (10) Elektrické stroje a přístroje P Czech Ostrava 1 Compulsory study plan
2001/2002 (M2612) Electrical Engineering and Computer Science (2642T004) Electrical Machines, Apparatus and Drives (20) Elektrické pohony a výkonová elektronika P Czech Ostrava 1 Compulsory study plan
2001/2002 (M2612) Electrical Engineering and Computer Science (3902T023) Computer Science P Czech Ostrava 1 Compulsory study plan
2001/2002 (M2612) Electrical Engineering and Computer Science (3907T001) Electrical Power Engineering P Czech Ostrava 1 Compulsory study plan
2001/2002 (M2612) Electrical Engineering and Computer Science (2601T004) Measurement and Control Engineering P Czech Ostrava Choice-compulsory study plan
2001/2002 (M2612) Electrical Engineering and Computer Science (2612T018) Electronics and Communication Technology P Czech Ostrava Choice-compulsory study plan
2001/2002 (M2612) Electrical Engineering and Computer Science (2642T004) Electrical Machines, Apparatus and Drives (10) Elektrické stroje a přístroje P Czech Ostrava Choice-compulsory study plan
2001/2002 (M2612) Electrical Engineering and Computer Science (2642T004) Electrical Machines, Apparatus and Drives (20) Elektrické pohony a výkonová elektronika P Czech Ostrava Choice-compulsory study plan
2001/2002 (M2612) Electrical Engineering and Computer Science (3902T023) Computer Science P Czech Ostrava Choice-compulsory study plan
2001/2002 (M2612) Electrical Engineering and Computer Science (3907T001) Electrical Power Engineering P Czech Ostrava Choice-compulsory study plan
2000/2001 (M2612) Electrical Engineering and Computer Science (2612T999) Common Base for FEI P Czech Ostrava 1 Compulsory study plan

Occurrence in special blocks

Block nameAcademic yearForm of studyStudy language YearWSType of blockBlock owner