Professor
Mark Burgin
1 of 1
Most Helpful Review
Summer 2018 - I am writing this to extend my heartiest appreciation towards professor Burgin for delivering such a wonderful class of algorithm. His knowledge on the subject is vast and has cleared lots of my doubts. I had a chance to interact with him personally for discussing my queries. I am sure that the lecture given by him will definitely be helpful to us during our exams. He's a great professor, and very, very fair in grading. He also gives student s chances to earn extra credits in class. As long as you pay attention in lecture, do the homework and go to his office hours, you should be getting the grade you desired. He always makes the subject interesting, and I really love taking his class and learned so much through his lecture. Not only he teaches in a different way to make us interested in learning, but he also understands our problems and helps us find the best way to solve. I am going to graduate soon but I will surely miss you and things you thought me. Thanks again,
Summer 2018 - I am writing this to extend my heartiest appreciation towards professor Burgin for delivering such a wonderful class of algorithm. His knowledge on the subject is vast and has cleared lots of my doubts. I had a chance to interact with him personally for discussing my queries. I am sure that the lecture given by him will definitely be helpful to us during our exams. He's a great professor, and very, very fair in grading. He also gives student s chances to earn extra credits in class. As long as you pay attention in lecture, do the homework and go to his office hours, you should be getting the grade you desired. He always makes the subject interesting, and I really love taking his class and learned so much through his lecture. Not only he teaches in a different way to make us interested in learning, but he also understands our problems and helps us find the best way to solve. I am going to graduate soon but I will surely miss you and things you thought me. Thanks again,
Most Helpful Review
So first off i will say that I took computer Science 181 two times, i took it with sherestov (he is great) but i had to retake the class and i took it with burgin. So for sherestov he tested x4 and had 80% tests 20% hw and about no partial credit, straight scale with a little curve, i didn't end up so good. He did teach really well though! But the tests were just not good for me. I took this class with burgin and from the knowledge from the previous class, i can say he is a good guy and an ok lecturer, he goes over more of the proofs and more in depth. He also goes into some other topics that were not covered in the other class. He talks very slow and sometimes may be a little hard to understand, but he is always open to questions. If any topics don't make sense I just read the book, or went on youtube to review.(EXCEPT THE LAST TOPICS which i will mention in a bit) So i got a F with Sherestov and a B with Burgin. Burgin grading is 0-30 F 30-49 D 50-74 C 75-90 B 90-100 A I can say passing this class will be easy, getting a B is completely doable, but A is a little tough to get since it is straight scale. Our grading break down was ----- Hw 30% (3 hw assignments) Midterm 30% Final 40% i got about 87% on Hw's 85% on Midterm and the final Score i don't know but IT WAS HARD His hws are a bit hard, and you want to work on it, but they were really close to what was asked on the midterm and final. The midterm was fairly easy but the final was REALLY hard. However, if he sees that your trying and you understand the concepts and elaborate he does give partial credit. (MUCH MORE THAN SHERESTOV) He also gives EXTRA CREDIT that is not 1-to-1 but a percentage of how much extra credit you get, but these points help your grade and let you retake your midterm and choose what grade was higher if you accumulated enough points!!! All you have to do is answer his questions in his class which range from easy to hard. We did not have a TA so all questions and discussion was run by the prof as more lecture/discussion. Don't miss out the last few lectures he was the one that "invented" or "researched" these topics and you will not find anything really on super recursive things so go to class ALSO OPEN NOTES ON TESTS FOR US AT LEAST YAYY!!!! Overal he is a great guy, sometimes a bit hard in lecture but he is always open to questions, if you need more help or just want the basics without the proof just read the book or watch some youtube stuff, simple enough. TLDR: I got F then got B in his class, grading is nice (EXPECT getting B, HARD TO GET A)(straight curve modified ), extra credit and open notes for us, midterm: easy->medium, final: hard, hw :medium->hard, not the best lecturer but nice and will answer your questions. need more help read the book or go on youtube. Overall give him like a 8.1/10
So first off i will say that I took computer Science 181 two times, i took it with sherestov (he is great) but i had to retake the class and i took it with burgin. So for sherestov he tested x4 and had 80% tests 20% hw and about no partial credit, straight scale with a little curve, i didn't end up so good. He did teach really well though! But the tests were just not good for me. I took this class with burgin and from the knowledge from the previous class, i can say he is a good guy and an ok lecturer, he goes over more of the proofs and more in depth. He also goes into some other topics that were not covered in the other class. He talks very slow and sometimes may be a little hard to understand, but he is always open to questions. If any topics don't make sense I just read the book, or went on youtube to review.(EXCEPT THE LAST TOPICS which i will mention in a bit) So i got a F with Sherestov and a B with Burgin. Burgin grading is 0-30 F 30-49 D 50-74 C 75-90 B 90-100 A I can say passing this class will be easy, getting a B is completely doable, but A is a little tough to get since it is straight scale. Our grading break down was ----- Hw 30% (3 hw assignments) Midterm 30% Final 40% i got about 87% on Hw's 85% on Midterm and the final Score i don't know but IT WAS HARD His hws are a bit hard, and you want to work on it, but they were really close to what was asked on the midterm and final. The midterm was fairly easy but the final was REALLY hard. However, if he sees that your trying and you understand the concepts and elaborate he does give partial credit. (MUCH MORE THAN SHERESTOV) He also gives EXTRA CREDIT that is not 1-to-1 but a percentage of how much extra credit you get, but these points help your grade and let you retake your midterm and choose what grade was higher if you accumulated enough points!!! All you have to do is answer his questions in his class which range from easy to hard. We did not have a TA so all questions and discussion was run by the prof as more lecture/discussion. Don't miss out the last few lectures he was the one that "invented" or "researched" these topics and you will not find anything really on super recursive things so go to class ALSO OPEN NOTES ON TESTS FOR US AT LEAST YAYY!!!! Overal he is a great guy, sometimes a bit hard in lecture but he is always open to questions, if you need more help or just want the basics without the proof just read the book or watch some youtube stuff, simple enough. TLDR: I got F then got B in his class, grading is nice (EXPECT getting B, HARD TO GET A)(straight curve modified ), extra credit and open notes for us, midterm: easy->medium, final: hard, hw :medium->hard, not the best lecturer but nice and will answer your questions. need more help read the book or go on youtube. Overall give him like a 8.1/10
AD
1 of 1
