In­tro­duc­tion to Al­gorithms

Description

Algorithms play a major role in electrical engineering. On the one hand, electronic systems implement algorithms in hardware or software to cope with complex tasks e.g. in automation technology. On the other hand, effective algorithms are needed to enable the computer-aided design, the implementation, and the testing of electronic systems. The lecture gives an introduction to the design and analysis of algorithms.

Content

• sorting algorithms
• basic data structures
• graphs and graph algorithms
• design and anlaysis of algorithms (problem complexity, run time and storage complexity, exact vs. heuristic solutions, probabilistic approaches)

Literature

• T. Cormen, C. Leiserson, R. Rivest, C. Stein: Introduction to Algorithms. 2nd Edition, MIT Press, 2002.
• E. Horowitz, S. Sahni, B. Rajasekaran: Computer Algorithms – C++, 2nd Edition, Computer Science Press, 1998
• A. V. Aho, J. E. Hopcroft, and J. Ullman, Data Structures and Algorithms. 1st Edition Addison-Wesley, 1983
• R. Sedgewick: Algorithms in C++, Addison-Wesley, 2001.
• M. R. Garey and D. S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co Ltd., 1979

Exam

written exam, date announcement on panda and our website

Module group

Elektrotechnik (Bachelor): Informationstechnik

Electrical Systems Engineering (Master): Fundamentals of Electrical Systems Engineering

back to course list