ICS0005 - Algorithms and Data Structures

Instructor: Jaanus Pöial, PhD

Syllabus (TalTech SIS)

Moodle

bitbucket (project Spring2021)

echo 2018

echo 2019

echo 2020

echo 2021

Software tools (jdk8, jdk15, IntelliJ, git, ...)

Lectures

  1. Introduction, Java

  2. Algorithms, Complexity 

  3. Searching and Sorting

  4. Abstract Data Types, Stack, Queue, Linked List

  5. Trees

  6. Graphs (Part 1)

  7. Graphs (Part2)

  8. Programming Techniques

  9. Binary Search Tree, Binary Heap

  10. AVL tree, B-Tree, Red-Black tree, ...

  11. String Algorithms: Exact Matching

  12. Coding, Compressing, Dynamic Programming

  13. Correctness of Algorithms

  14. Topics for Exam

Homework deadlines for spring term 2021:

Homework 1 - February, 10 (2 points)
Homework 2 - February, 17 (6 points)
Homework 3 - March, 3 (4 points)
Homework 4 - March, 17 (4 points)
Homework 5 - March, 31 (8 points)
Homework 6 program - April, 14 (graded together with the report)
Homework 6 report - April, 21 (16 points)
Homework 7 - May, 5 (10 points)

Slides from other courses

Youtube

Examples
Tests

Estonian course


Jaanus Pöial