Material

The following materials are available:

• Weekly video-lectures and their accompanying lecture-questions

• The video-lecture slides (???)

• Weekly discussion sessions

• Links to other sources connected to the topics of the week. Other material can be, for example, links to internet articles etc.

The following books are good references:

• Introduction to Algorithms; Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein. MIT Press. This is “the reference” and has also been the bases for this course. You can find this book (e-license) via Tuni library’s website.

• Introduction to the Design and Analysis of Algorithms; Anany Levitin. Addison Wesley. Clear basic book.

You can access Tuni library’s large book selection. Here are some other books suitable for this course:

• Data Structures and Algorithmns in Javascript

• Introduction to Algorithms (Cuantum Tech LLC)

• Data Structures and Algorithms in Java

Other useful links

• How algorithms shape our world - Kevin Slavin (youtube)

• Datastructures and algorithms study material in OpenDSA

• Big O cheatsheet

• Scott Chacon, Ben Straub: Pro Git

• Splendid visualization video about sorting algorithms: 15 Sorting Algorithms in 6 Minutes.

• Many visualizations about the course topics: Algorithm visualizations.

• More Algorithm visualisazations.

• Awesome Algorithms list

Other material

• Graph drawn for the previous course, to depict O, Ω and Θ in the same image (can be used to study different types of curves of asymptotic efficiency) download here

• Summary slide about STL container efficiecies download here

• Breadth-First Search,

• Depth-First Search,

• Dijkstra Shortest Path,

• Kruskal Minimum Cost Spanning Tree.

• Article, summarising well the different situations when iterators and pointers to items inside of C++ STL container become invalid. About the same topic see cppreference.com.

• You can find more about STL from the C++ reference cppreference.com

Posting submission...