Clasa+a+11-a


 * 1. Metoda backtracking**
 * 2. Metoda Greedy**
 * 3. Programare dinamica**
 * 4. Combinatorica**
 * 5. Puncte laticeale**
 * 6. Teoria grafurilor**
 * 7. Arbori de intervale**
 * 8. Utilizarea STL**
 * 9. Geometrie computationala**
 * 10. Structuri de date**
 * 11. C# POO si Programare Vizuală**


 * Probleme de concurs: OLI**
 * 1. Cantina - 2012 P2: [[file:OLICluj2010 P2 1112 Cantina.pdf]]**
 * 2. ABC - 2011 P1: [[file:OLICluj2011_1112_P1_ABC.pdf]]**


 * 3. Sablon - 2009 P2: [[file:OLICluj2009 P2 1112 Sablon.pdf]]**


 * 4. Puncte - 2008 P1: [[file:OLICluj2008 P1 1112 Puncte.pdf]]**
 * 5. Maimuta - 2006 P2: [[file:OliLocInfoCluj2006 1112P2 Maimuta.pdf]]**
 * 6. Muzeu - 2005 P2: [[file:OLICluj_2005_1112_p2_Muzeu.pdf]]**