Computer Science A
Algorithm Design
Prof. Dr. Oliver Vornberger
University of Osnabrueck (UOS), Winter Semester 2003/2004
Course Homepage • Exams
| Assignment Sheet |
Solution Archive |
| introduction |
Blatt01.rar |
| switch/case, loops, and greatest common factor |
Blatt02.rar |
| prime numbers, 32bit float and double operations |
Blatt03.rar |
| palindromes, arrays and matrices |
Blatt04.rar |
| morse code, methods, integrals, binary number representation |
Blatt05.rar |
| variable visibility, binary search, recursion |
Blatt06.rar |
| termination, o-notation, unefficient sorting algorithms |
Blatt07.rar |
| efficient sorting algorithms
(QuickSort, MergeSort, ...) |
Blatt08.rar |
| efficient sorting algorithms (QuickSort, BucketSort, ...) |
Blatt09.rar |
| Object-Oriented Programming, class inheritage |
Blatt10.rar |
| abstract data types, pointers |
Blatt11.rar |
| abstract data types, pointers, trees |
Blatt12.rar |
| SearchTrees, AVLTrees |
not completed |
Page Last Modified on: 2010-04-25, 10:08:28am