Introduction to Data Structures and Algorithms



  • Semester: Summer term 2014
  • Type of lecture: Vorlesung + Übung
  • SWS: 2 + 2
  • ECTS Credits: 5 + 2,5
  • Language: English

Organizational (Vorlesung):


Summary (Vorlesung):

This course introduces basic data structures and algorithms which are necessary for virtually any programming task. We discuss elementary and structured data types such as lists, stacks, queues, trees and sets and review basic algorithms for searching, sorting, hashing and graph analysis. We study techniques for determining the efficiency of a given algorithm. In the last week we will give an introduction to Java.




Ch1_Introduction and motivation

Ch2_Calculating Fibonacci numbers

Ch3_Growth of functions


Ch5_Elementary Data Structures

Ch6_Binary Search Trees



Exercise 1

Exercise 2

Exercise 3

Exercise 4

Exercise 5

Exercise 6

Exercise 7

Exercise 8

Exercise 9


Time and place

  • Daily (2014-09-15 - 2014-10-03), 14:00 - 18:00, H4, (Tutorials to Introduction to Data Structures and Algorithms)

Field of studies

  • PF, CE-MA-OS

Additional information