Tiberiu Danet

Programming Techniques

Prof. dr. Horia Georgescu
2nd Year, 1st Semester

Each class will use this input/ouput class for reading data: IO.java.

Here is a list with solved problems.

TreesArbori.javaArbori.in
Binary treesArboriBinari.javaArboriBinari.in
? treesArboriInsailati.javaArboriBinari.in
And/or treesArboriSiSau.javaArboriSiSau.in
BacktrackingBack.javaBack.in
Biconnected componentsBiconexe.javaBiconexe.in
Cycles in graphsCicluri.javaCicluri.in
Dynamic programmingCompozitie.javaCompozitie.in
Disjoint setsDisjointSets.javaDisjointSets.in
Heap sortHeapSort.javaHeapSort.in
Merging, heapsInterclasare.javaInterclasare.in
JosephusJosephus.javaJosephus.in
N/APliere.javaPliere.in
Radix sortRadixSort.javaRadixSort.in
Dynamic programmingSplit.javaSplit.in
N/ATriplete.javaTriplete.in