project 2:
- Backtracking data structures and algorithms – Explanatory section
- Backtracking algorithms – Programming "warm-up" section
- Backtracking Dynamic Set ADT – Programming task section i. Unsorted array implementation ii. Sorted array implementation iii. BST implementation
- Runtime complexity analysis of chapters 2-3 – Theoretical task section
project 4:
- Backtracking in B-Trees – Programming and Theoretical section
- Backtracking in AVL-Trees - Programming and Theoretical section