Algorithms and Data Structures 1-AIN-210
Algorithms and Data Structures 1-AIN-210
| Course name and code: | Algorithms and Data Structures (1-AIN-210) |
| Prerequisite courses: | 1-AIN-170 (obligatory) |
| Available in/recommended study year: | Winter semester / 2 |
| Form and # of hours/week: | C - course (4) |
| Credits: | 5 |
| Evaluation (semester/exam): | 0/100 |
| Course webpage: | not available |
| Information sheet: | 1-AIN-210 information sheet |
| Teacher(s): | RNDr. Zuzana Kubincová |
| E-mail: | kubincova fmph.uniba.sk
|
| Homepage(s): | http://www.edi.fmph.uniba.sk/kubincova |
Short description:
Introduction to problems. Matematical foundations: symbolism, combinatorial identities. Sorting analysis: heapsort, quicksort; linear time sorting. Data structures: basic, hash tables, bináry searching trees, red-black and balanced trees. Design and analysis technics: dynamic programming, greedy algorithms.
Offered in these study programs: Obligatory in Bachelor program in Applied Informatics
Recommendations: none
(Redirected from Introduction to Theoretical Computer Science)