d
Riadok 8: Riadok 8:
 
   | form = C - course (4)
 
   | form = C - course (4)
 
   | evaluation = 0/100
 
   | evaluation = 0/100
   | webpage = not available
+
   | webpage = http://ads.input.sk/
   | teacher = RNDr. Zuzana Kubincová
+
   | teacher = [[Andrej Blaho|RNDr. Andrej Blaho, PhD.]]
   | email = kubincova[[Image:zavinac.gif|@]]fmph.uniba.sk
+
   | email =  
   | homepage = http://www.edi.fmph.uniba.sk/kubincova
+
   | 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 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. 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
 
}}
 
}}

Verzia zo dňa a času 15:08, 27. august 2013

Algorithms and Data Structures 1-AIN-210

go to list of all courses...

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://ads.input.sk/
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