Algorithms and Data Structures/sk: Rozdiel medzi revíziami
(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 ...) |
|||
| Riadok 1: | Riadok 1: | ||
| − | {{ | + | {{Predmet |
| name = Algorithms and Data Structures | | name = Algorithms and Data Structures | ||
| code = 1-AIN-210 | | code = 1-AIN-210 | ||
| − | | prerequisites = 1-AIN-170 ( | + | | prerequisites = 1-AIN-170 (povinný) |
| − | | semester = | + | | semester = Zimný |
| year = 2 | | year = 2 | ||
| credits = 5 | | credits = 5 | ||
| − | | form = | + | | form = K - kurz (4) |
| evaluation = 0/100 | | evaluation = 0/100 | ||
| − | | webpage = | + | | webpage = chýba |
| teacher = RNDr. Zuzana Kubincová | | teacher = RNDr. Zuzana Kubincová | ||
| email = kubincova[[Image:zavinac.gif|@]]fmph.uniba.sk | | email = kubincova[[Image:zavinac.gif|@]]fmph.uniba.sk | ||
| homepage = http://www.edi.fmph.uniba.sk/kubincova | | homepage = http://www.edi.fmph.uniba.sk/kubincova | ||
| 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. | | 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 = Povinný v [[Bachelor program in Applied Informatics|Bakálarskom programe Aplikovaná informatika]] |
| − | | recommendations = | + | | recommendations = žiadne |
}} | }} | ||
Verzia zo dňa a času 17:30, 20. august 2008
Algorithms and Data Structures 1-AIN-210
choď na zoznam všetkých predmetov...
| Názov a kód predmetu: | Algorithms and Data Structures (1-AIN-210) |
| Prerekvizity: | 1-AIN-170 (povinný) |
| Vyučuje sa/odporúčaný ročník: | Zimný semester / 2 |
| Forma a # hodín/týždeň: | K - kurz (4) |
| Kredity: | 5 |
| Hodnotenie (semester/skúška): | 0/100 |
| Webstránka predmetu: | chýba |
| Informačný list: | Informačný list 1-AIN-210 (fakultná služba) |
| Vyučujúci: | RNDr. Zuzana Kubincová |
| E-mail: | kubincova fmph.uniba.sk
|
| Domovská stránka: | http://www.edi.fmph.uniba.sk/kubincova |
Popis predmetu:
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.
Je časťou študijného programu: Povinný v Bakálarskom programe Aplikovaná informatika
Odporúčania: žiadne