Mikhail graduated from Saratov State University in 2004. During his study at the university he 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 on ACM-ICPC World Finals. In 2010 Mikhail founded the website Codeforces, now it is the world’s largest competitive programming community. He also teaches Algorithms and Data Structures at Saratov State University.
• 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
SKILLS:
- Programming
- Algorithms
- Computer Science
- Distributed Systems
- Java
- Wed Development
DATE: 06 Jan - 24 Jan, 2020
DURATION: 3 Weeks
LECTURES: 3 Hours per day
LANGUAGE: English
LOCATION: Barcelona, Harbour.Space Campus
COURSE TYPE: Offline
WHAT YOU WILL LEARN
COURSE OUTLINE
ABOUT MIKHAIL
BIBLIOGRAPHY
HARBOUR.SPACE
This module focuses on key and in-depth algorithms and data structures that form the toolkit of a modern computer specialist. The 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 programs will be tested against carefully prepared test cases using an automated testing system.
MIKHAIL
MIRZAYANOV
HARBOUR.SPACE UNIVERSITY
DATE: 06 Jan – 24 Jan, 2020
DURATION: 3 Weeks
LECTURES: 3 Hours per day
LANGUAGE: English
LOCATION: Barcelona, Harbour.Space Campus
COURSE TYPE: Offline
Session 2
Heap data structure, heap properties and operations. HeapSort. Priority queue. Other heap applications. Mergeable heaps: binomial heap, pairing heap, randomized meldable heap.
Session 3
SQRT decomposition. Description and motivation. Implementation of SQRT decomposition. Its applications: RMQ, RSQ and its variations. Queries decomposition.
Session 4
Fenwick tree. Description and motivation. Implementation of Fenwick tree. Generalization for higher dimensions. Skip list data structure. Implementation details. Indexable skip list.
Session 1
Advanced Algorithms and Data Structures, Harbour.Space University: Introductory Contest.
All rights reserved. 2018