ENEE351 | PlanetTerp

Information	Review
Sujeong Kim ENEE351 Expecting an A Anonymous 05/31/2025	I thought she was very nice. The class is very dense so lectures are slide heavy but we went through them at a reasonable pace. She was very open to answering questions and going back to look at things. There were easy daily quizzes that came from the slides which acted like attendance points (you can time them and do them online from home if you want). The discussion and lab sections weren't too bad, each lab assignment was a data structure we learned in class (not always well timed if you like to turn stuff in early). They could be completed in the lab if you took it seriously. Homework's were tough but infrequent and lightly graded. The exams were very dense since the course is dense, but curved fairly. The final project was actually fun as you could pick your own and it wasn't too demanding. Overall I actually learned a lot and it wasn't too stressful. I am writing this review because I think Prof Kim deserves a better rating.
Dinesh Manocha ENEE351 Expecting a B+ Anonymous 02/05/2024	Homeworks were terrible, way more proof and math heavy than you would expect from an EE dept. take on a CS class. In fact, I'm certain the hw for this class is harder than CMSC351, simply because of the amount of stuff crammed into a few homeworks. Assuming you can do a linked list in C confidently and have heard the phrase "malloc" before, you'll be fine for the labs and projects in this class, which were the saving grace because its so heavily project graded. You can literally get <50% on the midterm in this class and pass with a B if you complete all the projects, labs, hw's, and give the final a decent try. Teaching wasn't terrible, but the jump from the lectures to the exams is insane... you would probably be better off just reading the clrs textbook. 5/10 would take again.
Dinesh Manocha ENEE351 Expecting an A Anonymous 05/11/2021	Do not take this class with professor Manocha. He does an even worse job than Kruskal for CMSC351 in terms of lecturing. He just reads off of slides and just expects you to be able to magically visualize extremely difficult topics on the fly. He even reads off complex time complexity derivations from the slides and expect you to understand. He mentions concepts in complete abstractions and whenever you ask him to show an example or draw the concept out to get a better understanding, he does not do it. For those who have a little bit of knowledge about learning algorithms, you will realize how important it is to draw things out when talking about graphs and recursion trees; he does none of it. You need to spend a lot of time outside of class to teach the material. His homeworks are incredibly long and tedious, and students in class mentioned how they spent 20 hours on average on each homework. The math and proof that is involved in those problems is something that the prerequisite classes do not teach, and which he expects you to know.

Sujeong Kim
ENEE351

Expecting an A
Anonymous
05/31/2025

I thought she was very nice. The class is very dense so lectures are slide heavy but we went through them at a reasonable pace. She was very open to answering questions and going back to look at things. There were easy daily quizzes that came from the slides which acted like attendance points (you can time them and do them online from home if you want). The discussion and lab sections weren't too bad, each lab assignment was a data structure we learned in class (not always well timed if you like to turn stuff in early). They could be completed in the lab if you took it seriously. Homework's were tough but infrequent and lightly graded. The exams were very dense since the course is dense, but curved fairly. The final project was actually fun as you could pick your own and it wasn't too demanding. Overall I actually learned a lot and it wasn't too stressful. I am writing this review because I think Prof Kim deserves a better rating.

Dinesh Manocha
ENEE351

Expecting a B+
Anonymous
02/05/2024

Homeworks were terrible, way more proof and math heavy than you would expect from an EE dept. take on a CS class. In fact, I'm certain the hw for this class is harder than CMSC351, simply because of the amount of stuff crammed into a few homeworks. Assuming you can do a linked list in C confidently and have heard the phrase "malloc" before, you'll be fine for the labs and projects in this class, which were the saving grace because its so heavily project graded. You can literally get <50% on the midterm in this class and pass with a B if you complete all the projects, labs, hw's, and give the final a decent try. Teaching wasn't terrible, but the jump from the lectures to the exams is insane... you would probably be better off just reading the clrs textbook. 5/10 would take again.

Dinesh Manocha
ENEE351

Expecting an A
Anonymous
05/11/2021

Do not take this class with professor Manocha. He does an even worse job than Kruskal for CMSC351 in terms of lecturing. He just reads off of slides and just expects you to be able to magically visualize extremely difficult topics on the fly. He even reads off complex time complexity derivations from the slides and expect you to understand. He mentions concepts in complete abstractions and whenever you ask him to show an example or draw the concept out to get a better understanding, he does not do it. For those who have a little bit of knowledge about learning algorithms, you will realize how important it is to draw things out when talking about graphs and recursion trees; he does none of it. You need to spend a lot of time outside of class to teach the material. His homeworks are incredibly long and tedious, and students in class mentioned how they spent 20 hours on average on each homework. The math and proof that is involved in those problems is something that the prerequisite classes do not teach, and which he expects you to know.

Reviews for ENEE351