Foreign students. Data Structures and Algorithms I 2025 — различия между версиями
Irinaiv (обсуждение | вклад) |
Irinaiv (обсуждение | вклад) (→Links) |
||
| (не показаны 2 промежуточные версии этого же участника) | |||
| Строка 1: | Строка 1: | ||
==General information== | ==General information== | ||
'''Teacher''' | '''Teacher''' | ||
| − | * | + | * Galanov Ilia Iurevich |
==Course program== | ==Course program== | ||
| Строка 25: | Строка 25: | ||
==Links== | ==Links== | ||
| − | *[https://t.me/+9t8KrAtjYwA2YzEy | + | *[https://t.me/+9t8KrAtjYwA2YzEy Telegram] |
*[https://github.com/kosh90/DataStructuresAndAlgorithms-I Materials (will be updated during the course)] | *[https://github.com/kosh90/DataStructuresAndAlgorithms-I Materials (will be updated during the course)] | ||
*[https://youtube.com/playlist?list=PLrzKg1mBoYrcGPFJ_Oyt5PMQ8FqEt2JzQ&si=rEAPsguB5AZ6275Y Lectures from previous years] | *[https://youtube.com/playlist?list=PLrzKg1mBoYrcGPFJ_Oyt5PMQ8FqEt2JzQ&si=rEAPsguB5AZ6275Y Lectures from previous years] | ||
| + | *[https://docs.google.com/forms/d/e/1FAIpQLSeJVzkrl_QADUkLhzF8rkbXY3hWggnFw4Xlq9i0uwsAxeT37g/viewform?usp=header Registration form] | ||
==Literature== | ==Literature== | ||
Текущая версия на 13:17, 25 февраля 2025
Содержание
[убрать]General information
Teacher
- Galanov Ilia Iurevich
Course program
Unit 1: Introduction 1. Introduction. Complexity. RAM-model. 2. Linked Lists. Stack implementation using a linked list or an array. Keeping minimum in a stack. Correct brackets sequence checking. Monotonic stack
Unit 2: Sorting 1. Sortings. Lower bound for comparisons in the sort. Insertion sort. Bubble Sort. Selection Sort. 2. Quick Sort. 3. Merge Sort. Master Theorem. 4. Binary Heap. Sift Up, Sift Down, Insert, GetMin, ExtractMin and DecreaseKey. Heap Sort
Unit 3: Trees 1. Binary Search Trees. Insert & Delete & BST Sort. 2. Balanced Binary search Trees. AVL Tree. Height of AVL Tree on n nodes.
Unit 4: Hashing 1. Hash Table Chaining. Insert & Delete & Search 2. Hash Table Open Addressing. Insert & Delete & Search 3. Bloom Filter. Insert & Search. Applications
Links
- Telegram
- Materials (will be updated during the course)
- Lectures from previous years
- Registration form
Literature
- Introduction to Algorithms, 4th Edition by Thomas H. Corman
- The C++ Programming Language, 4th Edition by Bjarne Stroustrup
