Saada aru arvutiteaduse põhiülesannete lahendamisel kasutatavate algoritmide arendamise ja analüüsimise erinevatest tehnikatest.

Understand the variety of techniques for development and analysis of algorithms for various fundamental problems in computer science.

Kursuse läbinu on võimeline:
* kasutama erinevaid algoritme, nt Fourier teisendus, maksimaalne voog võrkudes, lineaarne planeerimine, ligikaudsed algoritmid
* analüüsima algoritmide ajalist keerukust, tõestama nende korrektsust ja leidma ligikaudsuse hinnagut
* aru saama keskmise raskusega matemaatilisest ja arvutiteaduse alasest tekstidest
* välja töötama sobivaid algoritme mitmesuguste rakendusülesannete jaoks, analüüsima nende jõudlust ja tõestama nende korrektsust

After completing this course, the student will be able:
* to use various algorithmic techniques and concepts, such as fast Fourier transform, maximum flow in the networks, linear-programming, approximation algorithm techniques
* to be able to analyze the time complexity of the algorithms, to prove their correctness, and to show approximation factor (for approximation algorithms)
* to read and understand medium-difficulty mathematical and computer science texts in the area;
* to develop appropriate algorithms for a variety of applied problems, to analyze their performance and prove their correctness

Kursuses käsitletakse järgmisi teemasid: kiire Fourier teisendus (FFT), polünoomide kiire korrutamine kasutades FFT, efektiivne algoritm maksimaalse voo arvutamiseks võrgus, maksimaalne voog 0-1

fast Fourier transform (FFT), fast multiplication of polynomials using FFT, effective algorithm for calculating the maximal flow in the network, maximal flow.

Eristav (A, B, C, D, E, F, mi)

A, B, C, D, E, F, mi

-

-

- Introduction to Algorithms, Second Edition
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein
http://mitpress.mit.edu/algorithms/

Additional reading:
Lot’s of web links.
Wiki: http://en.wikipedia.org/wiki/Algorithm
Algorithmics: The Spirit of Computing, D. Harel, Addison-Wesley, Reading, MA, 1st edition, 1987; 2nd edition, 1992. 3rd edition (with Y. Feldman), 2004.
http://www.wisdom.weizmann.ac.il/~dharel/algorithmics.html
LEDA: A Platform for Combinatorial and Geometric Computing (Hardcover) by Kurt Mehlhorn (Author), Stefan Näher (Author)
Introduction to Algorithms and Java (Hardcover) by Thomas H Cormen (Author), Charles E Leiserson (Author), Ronald L Rivest (Author), Clifford Stein (Author) Publisher: McGraw-Hill Science/Engineering/Math; 2nd edition (December 16, 2003)
Programming Pearls (2nd Edition) (ACM Press) (Paperback) by Jon Bentley Paperback: 256 pages Addison-Wesley Professional; 2 edition 1999.

-