- 7 序列
- 等级 介绍
- 从30 九月 2019开始
- 以2 十二月 2019结束
How to Win Coding Competitions: Secrets of Champions
Archived
课程
en
英语
28 时
此内容评级为 0/5
你无法访问存档的 讲座
课程详情
教学大纲
Week 1: Welcome to competitive programming
Exploring different kinds of programming competitions and benefits of participating, as well as typical rules and challenges. An overview of algorithmic programming competitions. An introduction to community resources and online contests.Week 2: Computational complexity and linear data structures
An overview of computational complexity (Big O notation). Exploring linear data structures (array, list, stack, queue): operations, complexity, implementation and examples.Week 3: Sorting and search algorithms 1
An overview of sorting algorithms: insertion sort, quick sort, merge sort.Week 4: Sorting and search algorithms 2
Theoretical limitations and practical guidelines for sorting. Binary search. Binary heaps and priority queues.Week 5: Graph theory 1
Definition of graphs and examples of graph problems. Various ways of storing graphs in memory. Depth first search and its applications. Dynamic programming.Week 6: Graph theory 2
Breadth first search. Eulerian and Hamiltonian paths and tours. Shortest paths.Week 7: Final Exam
Solving a set of problems in limited time just like in a real programming competition.
Exploring different kinds of programming competitions and benefits of participating, as well as typical rules and challenges. An overview of algorithmic programming competitions. An introduction to community resources and online contests.Week 2: Computational complexity and linear data structures
An overview of computational complexity (Big O notation). Exploring linear data structures (array, list, stack, queue): operations, complexity, implementation and examples.Week 3: Sorting and search algorithms 1
An overview of sorting algorithms: insertion sort, quick sort, merge sort.Week 4: Sorting and search algorithms 2
Theoretical limitations and practical guidelines for sorting. Binary search. Binary heaps and priority queues.Week 5: Graph theory 1
Definition of graphs and examples of graph problems. Various ways of storing graphs in memory. Depth first search and its applications. Dynamic programming.Week 6: Graph theory 2
Breadth first search. Eulerian and Hamiltonian paths and tours. Shortest paths.Week 7: Final Exam
Solving a set of problems in limited time just like in a real programming competition.
先决条件
Basic knowledge of any common programming language (C++, Java, Python)
讲师
Maxim Buzdalov
Associate Professor, Chair of Computer Technologies
ITMO University
Pavel Krotkov
Programmer, Chair of Computer Technology
ITMO University
Daria Yakovleva
Assistant, Computer Technology Department
ITMO University
平台
EdX est une plateforme d'apprentissage en ligne (dite FLOT ou MOOC). Elle héberge et met gratuitement à disposition des cours en ligne de niveau universitaire à travers le monde entier. Elle mène également des recherches sur l'apprentissage en ligne et la façon dont les utilisateurs utilisent celle-ci. Elle est à but non lucratif et la plateforme utilise un logiciel open source.
EdX a été fondée par le Massachusetts Institute of Technology et par l'université Harvard en mai 2012. En 2014, environ 50 écoles, associations et organisations internationales offrent ou projettent d'offrir des cours sur EdX. En juillet 2014, elle avait plus de 2,5 millions d'utilisateurs suivant plus de 200 cours en ligne.
Les deux universités américaines qui financent la plateforme ont investi 60 millions USD dans son développement. La plateforme France Université Numérique utilise la technologie openedX, supportée par Google.
此内容评级为 4.5/5
(没有评论)此内容评级为 4.5/5
(没有评论)完成这个资源，写一篇评论