My name is Árpád Gellért. I teach Alghoritm Analysis, Algorithm Complexity and Advances in Computer Vision at Lucian Blaga University from Sibiu since 2003. I also know a lot of Java Programming and I am expert there. I am usually a chill teacher at courses and try to be nice, but I am very strict at the exam of Alghoritm Analysis, because I made the exam in the following way: first 4 exercises are quite easy, with recurrence with Master Method, Binary Tree, Huffman code and Complexities, but they make just 5 out of 10 and have to be correct at perfection to be at least 4,5. Also, exercise 5 is hard, because you have to memorize around 13-14 alghoritms, like QUICKSORT, HEAP INSERT, HEAP EXTRACT or BUBBLESORT and one of them will be at exam. And exercise 6 is the hardest and has 3 ponts, where you have to make your own Alghoritm from 0 and 99% of students don't solve it. And because of my method to add the points, a lot of students fail Alghoritm Analysis.