Версия 17:02, 10 ноября 2024

About

This page contains basic information for the course Algorithms and Data Structures in 2024/2025 academic year at Bachelor’s Programme in Data Science and Business Analytics (DSBA).

The full syllabus can be accessed at this page.

In case you find any inconsistencies on this page, please, contact @l_AnnaPronina_l.

Teachers and assistants

Grading

You may find your grades here.

Formula

Final Grade = M1 * 0.3 + M4 * 0.7

Mi = E * 0.4 + HW * 0.2 + Q * 0.2 + S * 0.2

• E - exam grade: rational number [0, 10] = sum of the grade for the oral and written parts, out of 5 each
• HW - homework grade: rational number [0, 10]
• Q - lecture quizzes grade: rational number [0, 10]
• S - seminar practice grade: rational number [0, 10]

rounding: each element in the formulae is rounded up

Plagiarism policy

If plagiarism is detected, the assessment element will be assigned a score of 0.

If the student is suspected of preparing the task not on his own, the teacher has the right to initiate additional verification or defense of this particular assessment element. Then such an assessment element will be graded based on the additional verification or the defense.

Home assignments

Lectures

Lectures are held on Saturdays from 14:40 till 17:40.

Lecture Materials

Sep 7

• Introduction to the course
• Asymptotic notation
• Sorting algorithms: insertion sort, merge sort, heap sort (including building a heap)
• Lower bounds of sorting
• Counting sort
• Radix sort

Bibliography: Cormen, ch. 2, 3, 6, 8

Sep 14

• Basic data structures: array, stack, queue, deque, linked list, tree; basic operations: search, insert, delete
• Binary search trees, main operations (insert, delete, rotate)
• AVL-trees, main operations
• Red-black trees, main definitions

Bibliography: Cormen, ch. 12, 13

Sep 21

• Red-black trees, main operations
• Treaps, main operations
• Tries, main operations

Bibliography: Cormen, ch. 13, Mehta, ch. 28

Sep 28

• Tries, compact tries, PATRICIA trie, main operations
• 2-3-4 trees, main operations
• B-trees, main operations

Bibliography: Mehta, ch. 28, Cormen, ch. 18

Oct 5

• Quiz #1
• Exact string matching: naive method, Z algorithm, Knuth-Morris-Pratt algorithm

Bibliography: Gusfield, ch. 1, 2

Oct 12

• Exact string matching: Knuth-Morris-Pratt algorithm, preprocessing for real-time string matching, Boyer-Moore algorithm

Bibliography: Gusfield, ch. 2

Oct 19

• Exact matching with a set of patterns: Aho-Corasick algorithm
• Exact string matching: Apostolico-Giancarlo algorithm
• Suffix trees: basic definition, naive algorithm to build

Bibliography: Gusfield, ch. 3, 5

Oct 26

• Module 1 Exam

Nov 9

• Suffix trees: basic definition, naive algorithm to build
• Suffix trees: Ukkonen's algorithm, applications
• Suffix arrays: building using suffix tree, exact string matching

Bibliography: Gusfield, ch. 5, 6, 7

Nov 16(preliminarily)

• Suffix arrays: building without suffix tree
• Dynamic programming

Bibliography: Cormen, ch. 15

List of topics for exam in module 1

• Asymptotic notation
• Sorting algorithms: insertion sort, merge sort, heap sort (including building a heap), counting sort, radix sort
• Lower bounds of sorting using comparisons
• Basic data structures: array, stack, queue, deque, linked list, tree; basic operations: search, insert, delete
• Binary search trees, main operations (search, insert, delete, rotate)
• AVL-trees, main operations (search, insert, delete)
• Red-black trees, main operations (search, insert)
• Treaps, main operations (search, insert, delete, split, merge)
• Tries, compact tries, main operations (search, insert, delete)
• 2-3-4 trees, main operations (search, insert, delete), transformation into red-black tree
• B-trees, main operations (search, insert, delete)
• Exact string matching: naive method, Z algorithm, Knuth-Morris-Pratt algorithm, Boyer-Moore algorithm
• Exact matching with a set of patterns: Aho-Corasick algorithm

List of topics for exam in module 4