Algorithms and Data Structures/en: Rozdiel medzi revíziami
d (New page: {{Course | name = Algorithms and Data Structures | code = 1-AIN-210 | prerequisites = 1-AIN-170 (obligatory) | semester = Winter | year = 2 | credits = 5 | form = C - course ...) |
|||
| (2 medziľahlé úpravy od 2 ďalších používateľov nie sú zobrazené) | |||
| Riadok 8: | Riadok 8: | ||
| form = C - course (4) | | form = C - course (4) | ||
| evaluation = 0/100 | | evaluation = 0/100 | ||
| − | | webpage = | + | | webpage = http://input.sk/ads |
| − | | teacher = RNDr. | + | | teacher = [[Andrej Blaho|RNDr. Andrej Blaho, PhD.]] |
| − | | email = | + | | email = |
| − | | homepage = | + | | homepage = |
| − | | description = Introduction to problems. Matematical foundations: symbolism, combinatorial identities. Sorting analysis: heapsort, quicksort; linear time sorting. Data structures: basic, hash tables, bináry searching | + | | 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. Design and analysis technics: dynamic programming, greedy algorithms. |
| offered_in = Obligatory in [[Bachelor program in Applied Informatics]] | | offered_in = Obligatory in [[Bachelor program in Applied Informatics]] | ||
| recommendations = none | | recommendations = none | ||
}} | }} | ||
| − | |||
| − | |||
Aktuálna revízia z 10:08, 28. august 2013
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: | http://input.sk/ads |
| Information sheet: | 1-AIN-210 information sheet |
| Teacher(s): | RNDr. Andrej Blaho, PhD. |
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. Design and analysis technics: dynamic programming, greedy algorithms.
Offered in these study programs: Obligatory in Bachelor program in Applied Informatics
Recommendations: none