Inhalt
[ MEBPFUEPIN2 ] UE Data Structures
|
|
|
|
| (*) Unfortunately this information is not available in english. |
 |
| Workload |
Education level |
Study areas |
Responsible person |
Hours per week |
Coordinating university |
| 1,25 ECTS |
B3 - Bachelor's programme 3. year |
Computer Science |
Reinhard Wolfinger |
1 hpw |
Johannes Kepler University Linz |
|
|
|
| Detailed information |
| Original study plan |
Bachelor's programme Mechatronics 2015W |
| Objectives |
Practice and consolidation of the lecture contents using weekly programming assignments.
|
| Subject |
- Lists (singly linked/doubly linked, sorted/unsorted, linear lists/ring lists)
- trees (binary search trees, tree balancing, 234 trees, red-black trees, B-trees, heaps)
- graphs (representation, depth-first-search, breadth-first-search, minimal spanning trees, shortest paths, transitive closure of graphs, input/output of graphs)
- Hash tables
- string search (brute force, Boyer-Moore algorithm, searching with regular expressions)
- advances sorting algorithms (heap sort, sorting of linked lists, sorting of external files, topological sorting)
- overview of the Java class library
|
| Criteria for evaluation |
Correction and marking of the submitted programming assignments; final test at the end of the semester.
|
| Methods |
Autonomous work on programming assignments in Java; discussion of sample solutions in the practical hours.
|
| Language |
German |
| Study material |
see http://ssw.jku.at/Teaching/Lectures/PI2/VL/
|
| Changing subject? |
No |
| Further information |
none
|
| Corresponding lecture |
(*)ME1PEUEPIDS: UE Praktische Informatik: Datenstrukturen (1 ECTS)
|
|
|
|
| On-site course |
| Maximum number of participants |
35 |
| Assignment procedure |
Assignment according to sequence |
|
|
|
