Introduction to Theoretical Computer Science/en: Rozdiel medzi revíziami
d (Created page with '{{Predmet | name = Úvod do teoretickej informatiky | code = 1-AIN-211 | prerequisites = | semester = Zimný | year = 2 | credits = 6 | form = P - prednáška (2),…') |
d |
||
| Riadok 1: | Riadok 1: | ||
| − | {{ | + | {{Course |
| − | | name = | + | | name = Algorithms and Data Structures |
| − | | code = 1-AIN- | + | | code = 1-AIN-210 |
| − | | prerequisites = | + | | prerequisites = 1-AIN-170 (obligatory) |
| − | | semester = | + | | semester = Winter |
| year = 2 | | year = 2 | ||
| − | | credits = | + | | credits = 5 |
| − | | form = | + | | form = C - course (4) |
| − | | evaluation = | + | | evaluation = 0/100 |
| − | | webpage = | + | | webpage = not available |
| − | | teacher = RNDr. | + | | teacher = RNDr. Zuzana Kubincová |
| − | | email = | + | | email = kubincova[[Image:zavinac.gif|@]]fmph.uniba.sk |
| − | | homepage = http://www.edi.fmph.uniba.sk/ | + | | homepage = http://www.edi.fmph.uniba.sk/kubincova |
| − | | description = | + | | 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 = | + | | offered_in = Obligatory in [[Bachelor program in Applied Informatics]] |
| − | | recommendations = | + | | recommendations = none |
}} | }} | ||
Aktuálna revízia z 19:00, 3. august 2010
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