Data structures and applications with proofs of correctness and analysis. Hash Tables, Priority Queues (heaps); Balanced Search Trees. Graph Traversal techniques and their applications.
4
UnitsLetter
Grading1, 2, 3
PasstimeNone
Level LimitEngineering
CollegeIDK why he's rated so low. He's a nice guy and a pretty good lecturer. Tests are hard, but based off lectures and homework. He also allows a cheat sheet and curves the class at the end. DSA can be hard because there's a lot of material, but he's a solid professor. Worst part was the 2 programming assignments which are very time consuming.
Super nice Professor. You have to really pay attention in the lectures, because the hw/tests are often on the proofs that are covered in lecture. Really generous curve as well, 85 above was an A- or above. Ask lots of questions to the professor, he really enjoys academically motivated students.
He's just okay. His lectures and slides were just okay. He was pretty nice and seemed really passionate about what he was teaching. The homework and programming assignments really weren't that bad. Just be ready for the midterm and final. They were extremely hard, much more difficult than the reviews or the homework. Overall not as bad as I thought
Please don't take this class unless you enjoy being miserable. Hw and programming assignments are fair except the last HW. He did throw a curveball for midterm where the practice was so much easier than the actual exam.
His slides cover only few parts, so you must go to class. Projects and exams are extremely hard. You'll not get any ideas or tips of projects until you go to OH. Lowest grade I ever got.
Low key he reminds me of my dad, but decent teacher.
Subhash Suri
4.6
Ben Hardekopf
4.7
Tao Yang
2.8
Yekaterina Kate Kharitonova
2.5
Jonathan Balkind
3.6