course: Data Structure

number:
150322
teaching methods:
lecture with tutorials
media:
overhead transparencies, black board and chalk
responsible person:
Prof. Dr. Hans Ulrich Simon
lecturer:
Prof. Dr. Hans Ulrich Simon (Mathematik)
language:
german
HWS:
6
CP:
9
offered in:
summer term

dates in summer term

  • lecture Tuesdays: from 14:00 to 16.00 o'clock in HNC 30
  • lecture Thursdays: from 14:00 to 16.00 o'clock in HNC 30
  • tutorial (alternativ) Tuesdays: from 12:00 to 14.00 o'clock in NB 3/99
  • tutorial (alternativ) Tuesdays: from 12:00 to 14.00 o'clock in NC 2/99
  • tutorial (alternativ) Tuesdays: from 16:00 to 18.00 o'clock in NB 02/99

Exam

Termin wird vom Dozenten bekannt gegeben

Form of exam:written
Registration for exam:FlexNow
Duration:180min

goals

This lecture aims at providing the ability to professionally employ different existing data structures, to design new data structures, to proof the correctness of algorithms, and to analyze their runtime.

content

After introducing different data types (like lists, stacks, queues, and trees) different data types will be discussed which allow to represent sets and support different kind of set operations (like dictionaries, priority queries, and UNION-FIND-data structures). Moreover, the lecture will cover the representation of trees and tree algorithms (like depth first and breadth first search, shortest path, transitive closure, strongly connected components, and minimal spanning tress) as well as different sorting algorithms (Mergesort, Heapsort, Quicksort, Bucketsort, Radixsort).

requirements

keine

recommended knowledge

  • Elementare Sprachmerkmale der Programmiersprache Java ™,
  • Mathematik-Kenntnisse im Umfang von „Höhere Mathematik I und II“

literature

  1. Drake, Peter "Data Structures and Algorithms in Java", Prentice Hall, 2005
  2. Dieker, Stefan, Güting, Ralf H. "Datenstrukturen und Algorithmen", Teubner Verlag, 2004