Data-structure

project 2:

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

project 4:

  1. Backtracking in B-Trees – Programming and Theoretical section
  2. Backtracking in AVL-Trees - Programming and Theoretical section