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 in automation technology or other electrical engineering fields. On the other hand, effective algorithms are needed to enable the computer-aided design, verification and testing of electronic systems. The lecture gives an introduction to the design and analysis of algorithms.

Contents

• Sorting algorithms
• Basic algorithms and data structures
• Graphs and graph algorithms
• Designing and analysing algorithms (problem complexity, runtime analysis, exact and 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

Examination

Written exam, date announced in the PANDA course and on our website

Lecture notes

More detailed information for students can be found directly in the panda course.

Module affiliation

Electrical Engineering (Bachelor): Information Technology

Electrical Systems Engineering (Master)

back to the course overview