You are on page 1of 1

Notiuni fundamentale de teoria grafurilor: 1b, 2a, 3c, 4d, 5d, 6d.

Arbori binari: 1c, 2a, 3d, 4b, 5a, 6b, 7c, 8b, 9b
Complexitate: 1c, 2c, 3C, 4c, 5c, 6a, 7d, 8c, 9d, 10c, 11d, 12c, 13d
Recursivitate: 1c, 2d, 3d, 4a, 5b, 6a, 7B, 8d, 9c
Metoda greedy:1b, 2a, 3a, 4b, 5d
Divide et impera: 1c, 2b, 3c, 4d, 5c, 6b, 7C, 8a, 9c, 10a
Backtracking: 1b, 2a, 3a, 4c, 5b, 6a, 7a, 8b, 9d, 10d, 11a, 12b, 13d,
14c, 15b, 16c, 17a, 18a, 19c, 20b, 21a, 22c, 23a, 24a, 25d
Metoda programarii dinamice: 1c, 2b, 3b, 4c, 5c, 6b, 7b, 8b

You might also like