SUBMIT

RESERVE MY SPOT

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:

- Creative Copywriting

Brand Strategy

- Ideation

Blogging

- Online Marketing

- Content Strategy

- Web Content

DATE: 07 Jan - 25 Jan, 2019

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 

ADVANCED ALGORITHMS AND DATA STRUCTURES

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.

MIKHAIL

MIRZAYANOV

RESERVE MY SPOT

We offer innovative university degrees taught in English by industry leaders from around the world, aimed at giving our students meaningful and creatively satisfying top-level professional futures. We think the future is bright if you make it so.

HARBOUR.SPACE UNIVERSITY

DATE: 07 Jan – 25 Jan, 2019

DURATION:  3 Weeks

LECTURES: 3 Hours per day

LANGUAGE: English

LOCATION: Barcelona, Harbour.Space Campus

COURSE TYPE: Offline

ADVANCED ALGORITHMS AND DATA STRUCTURES

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.

SHOW MORE

Session 1

Heap data structure, heap properties and operations. HeapSort. Priority queue. Other heap applications. Mergeable heaps: binomial heap, pairing heap, randomised meldable heap.

All rights reserved. 2018

Harbour.Space University
Tech Heart
Fix the following errors:
Hide