Chaos Camp 2019-2020 is a series of free courses for young people interested in gaining knowledge and skills in different aspects of coding. After successfully attending one of these courses, you will also have the opportunity to take part in our 2020 Chaos Internship program.
Chaos Camp 2019–2020 will start with a C++-based algorithmic course. Trainers will include Associate Professor Ph.D., Peter Armyanov from Sofia University/MNKnowledge and Lyubomir Koev, Software Developer at Chaos Group.
WHO IS IT FOR?
Chaos Camp 2019–2020 is suitable for students and junior professionals interested in mathematical algorithms.
WHAT ARE THE BENEFITS?
By successfully completing this course, you will gain highly valuable skills and knowledge and have the chance to participate in the 2020 Chaos Group Internship program.
The course will be held twice per week as an evening class from November 18, 2019, to February 4, 2020, in Sofia, Bulgaria. Classes take place every Monday and Tuesday at 6:30 PM.
HOW CAN I APPLY?
Entry is now closed. Thank you to all that took part!
|16 November||14.00||Entrance test: C++ theory and practical C++ programming tasks|
|18 November||18.30||Data types and their behaviors |
Dealing with floating-point numbers
Precision in floating-point calculations
|19 November||18.30||A high-level look at computer architectures|
Memory structure and why we need to know about it
Memory access patterns and data arrangement
|26 November||18.30||Statistical and probabilistic algorithms|
|2 December||18.30||Introduction to parallel calculations and algorithms|
Specifics and what to be aware of
A simple example with OpenMP
Examples with statistical algorithms
|3 December||18.30||Sorting algorithms|
Types and specifics
Generic algorithms: selection sort, insertion sort, bubble sort, shaker sort, shell sort, merge sort
|9 December||18.30||Data-dependent algorithms|
Counting sort and radix sort
|10 December||18.30||Searching: linear, binary, interpolation and parallel|
|16 December||18.30||Heap and Heap sort|
Hash functions and hash tables
|17 December||18.30||When we run out of memory — external searching and sorting|
|19–22 December||18.30||Mid-term exam|
|6 January||18.30||Some special linear data structures: Chunk array and Skip list|
|7 January||18.30||Non-linear data structures|
Trees, DFS and BFS
When to use it and when to avoid it
|13 January||18.30||How to fix the broken tree |
DSW algorithm for balancing
|14 January||18.30||Self-balancing trees|
|20 January||18.30||Shared access to the tree|
Parallel building and searching in a BST
|27 January||18.30||More on trees: Prefix trees and Automata|
|28 January||18.30||Interval trees|
Dynamic Order Statistics
|3 February||18.30||Regular trees with higher dimension|
|4 February||18.30||More on probabilities and statistics|
Monte Carlo and Las Vegas algorithms
|8 February||14:00||Final exam|