Advanced Algorithms and Data Structures
Faculty
Mikhail Mirzayanov
Founder & CEO of Codeforces, ICPC 2006 World Champions Coach
Course length
Duration
Total hours
Credits
Language
Course type
Fee for single course
Fee for degree students
Skills you’ll learn
Overview
This module focuses on key and in-depth algorithms and data structures that form the toolkit of a modern computer specialist. Computational complexity of algorithms and their comparative analysis will also be discussed. Students will be extensively trained on the implementation of data structures and algorithms on many problems reducible to the discussed data structures and techniques. Your programmes will be tested against carefully prepared test cases using an automated testing system.
Learning highlights
- Get acquainted with in-depth algorithms and data structures
- To some extent be able to apply in-depth algorithms and data structures to solve new problems that may arise in various applications
- Have practice in problem solving and programming on the topics of the discussed algorithms data structures
Course outline
4 classes
Session 1
Heap data structure, heap properties and operations. HeapSort. Priority queue. Other heap applications. Mergeable heaps: binomial heap, pairing heap, randomised meldable heap.
Session 2
Fenwick tree. Description and motivation. Implementation of Fenwick tree. Generalisation for higher dimensions. Skip list data structure. Implementation details. Indexable skiplist.
Session 3
Segment trees. Top-down implementation. Bottom-up implementation. Segment trees applications. Persistent data structures. Persistent stack, persistent array. Persistent Fenwick and segment trees.
Session 4
Cartesian trees, treap data structure. Merge and split operations. Treap implementation in detail. Treap applications.
Prerequisites
This course is one of three in a wholistic series.
Students that have already taken MSL-111 and those with prior experience with HTML, CSS, and Javascript building simple web pages will be good candidates for this module.
Mikhail graduated from Saratov State University in 2004. During his study at the university, Mikhail took part in programming contests: he won two silver medals at the ACM-ICPC World Finals and many times advanced to the finals of prestigious world programming contests. As a coach of Saratov State University ACM-ICPC, his teams won ACM-ICPC World Cup in 2006, All-Russia Cup in 2008, gold and silver medals at ACM-ICPC World Finals. His high-school students won medals at IOI. He teached Algorithms and Data Structures at Saratov State University for 5 years. He was the head of the Programming Competitions Training Center at Saratov State University. He was chairman and jury member of many programming competitions. In 2010 Mikhail founded the website Codeforces, now it is the world’s largest competitive programming community.
See full profileApply for this course
Advanced Algorithms and Data Structures
by Mikhail Mirzayanov
Total hours
45 Hours
Dates
Jan 07 - Jan 25, 2019
Fee for single course
€1500
Fee for degree students
€750
How to secure your spot
Complete the form below to kickstart your application
Schedule your Harbour.Space interview
If successful, get ready to join us on campus
FAQ
Will I receive a certificate after completion?
Yes. Upon completion of the course, you will receive a certificate signed by the director of the program your course belonged to.
Do I need a visa?
This depends on your case. Please check with the Spanish or Thai consulate in your country of residence about visa requirements. We will do our part to provide you with the necessary documents, such as the Certificate of Enrollment.
Can I get a discount?
Yes. The easiest way to enroll in a course at a discounted price is to register for multiple courses. Registering for multiple courses will reduce the cost per individual course. Please ask the Admissions Office for more information about the other kinds of discounts we offer and what you can do to receive one.