- Home
- Search
- Raghu Meka
- COM SCI 181
AD
Based on 19 Users
TOP TAGS
- Engaging Lectures
- Would Take Again
Grade distributions are collected using data from the UCLA Registrar’s Office.
Grade distributions are collected using data from the UCLA Registrar’s Office.
Grade distributions are collected using data from the UCLA Registrar’s Office.
Sorry, no enrollment data is available.
AD
meka is amazing. his lectures are super insightful and genuinely thought provoking. i came in expecting to hate 181 but it ended up being one my favorite ucla cs classes. his exams aren't necessarily easy but i felt that they were fair.
biggest tips for success in the class:
1. do all of the practice exams since your exams will have a similar structure
2. do the practice problems on the hw to the best of your ability. even if you can't do them completely on your own, make sure you understand the solutions. a similar problem usually comes up on the exam!
One time I asked a question after class and the next class he brought up my question to the whole class, saying that it was a good question and sharing the answer with the entire class. I'm still living on that high. Anyways, Prof Meka is great and presented the material of this class very well. His explanations are very clear and he welcomes student questions. Definitely take this class if you are even slightly interested in the more theoretical side of CS!
Professor Meka was one of the BEST professors I have had in the CS department! I think he did a great job teaching this class remotely. The course structure was changed this quarter and was more about "Theoretical Computer Science" than what it was before. The content was always very interesting and often times mind blowing, especially near the end of the quarter when we covered uncomputability, TM, and proved Godel's Incompleteness Theorem!! Coming into this course, I had no idea what TCS is about and even though I am not that interested in the field, I still find the class very interesting.
This class is full of proofs and you won't write a single line of actual code (aside from pseudo-code). Proofs are difficult, but with Professor Meka's great explanations, it becomes somewhat manageable. All the HW are proof-style questions that re-empahsizes concepts taught in class. About half of the questions will be somewhat doable if you attended lecture, but there will always be VERY HARD questions on the HW that I couldn't figure out on my own even if I were to stare at the question the whole day. Even so, the TAs were extremely helpful!! They would often give hints to difficult HW questions during discussion and if you need more help, you could always go to OH where they go over the HW questions in detail until you understand them. S/o to TA Hadley and Shawn!
There were 3 non-cumulative exams throughout the quarter (including the final). The exams were increasing more difficult and I would say that the final was really hard (but still doable imo). Even though, I only did well on the first exam, and scored about average on the latter two exams, I was still able to get an A. I think there is a nice curve.
Compare to my friends who took it in previous quarters with the old course structure, I would say this class is definitely **harder than before**, but you will definitely learn A LOT more than ppl in previous quarters did. So, I 100% recommend taking this class with Meka!! You will have a great time and learn a lot :)
Prof Meka is a legend. Dude is super passionate about Theoretical Computer Science, and does a fantastic job of channeling that passion every lecture. Theoretical CS is kind of an oddity among the rest of the CS classes, so the material can be difficult to grasp at times. However, Meka goes slowly and methodically, and makes it much easier on the class.
Homeworks were easy for the first half of the quarter and got kinda obscure towards the end, but overall not super time consuming. He uses a 3 midterm approach, with each midterm considerably more difficult than the last. I know everybody wants this class with Sherstov but I have no regrets taking it with Meka.
Prof. Meka, while not necessarily being the most charismatic man in the world, is a very competent lecturer who definitely has a lot of passion for what he teaches. He lectures using an interactive whiteboard, the contents of which are later posted as slides. Those slides are helpful if you attended lecture and somewhat confusing if you didn't. Honestly, go to lecture if you can. Yeah, I know everyone says that, but keeping up with this course dramatically reduces the amount of time you need to study.
For the most part, honestly the material is pretty easy (focus on pumping lemma proofs and reductions from the goated HALTONZERO algorithm), but it's really important and interesting from a theoretical perspective, and it sort of provides an insight into the abstract design of systems with very limited resources. Exams are usually just slightly harder versions of homework questions, and the homework assignments were 1-2 hour long problem sets assigned every week or two; very doable.
Amazing class. Workload was manageable and content was clear. There were 3 exams and they were not cumulative, so it was easy to study for the tests. Would take again
I initially thought Meka would be a pretty boring lecturer based on the first class but I was happily surprised. The lectures ended up being really interesting and it was easy to tell that he was passionate about what he was teaching. His tests were fair and he provided 3 yrs of practice exams and additional hw problems which were very helpful for the exams (many problems were similar to the practice). There were 3 non-cumulative exams (instead of a midterm and a final) so if you didn't do well on one of them you could still make it up on the next ones. HW was manageable and lectures were recorded. The content was occasionally dense but it's a theory class so that's to be expected. Overall, Meka was a great prof to take this class with.
Meka is a great professor. 181 is definitely a hard class but somehow Meka made this class extremely enjoyable. His OHs are great and he explains everything really well. For the midterms and final, the best way to study is literally just going to his OH and do the practice problems with him. Or just simply be there and listen to what other people are asking. The 1 hr OH is somehow the most productive studying sesh ever.
Super interesting class, Meka is a great lecturer and really good about answering questions. The homeworks are pretty difficult and are mostly graded on completion, but definitely manageable. We had two midterms and one final, all non-cumulative. He's pretty lenient on grading for these-- I basically skipped a question and still got one point for "attempting" it. Overall, would definitely recommend taking this class with Prof. Meka.
meka is amazing. his lectures are super insightful and genuinely thought provoking. i came in expecting to hate 181 but it ended up being one my favorite ucla cs classes. his exams aren't necessarily easy but i felt that they were fair.
biggest tips for success in the class:
1. do all of the practice exams since your exams will have a similar structure
2. do the practice problems on the hw to the best of your ability. even if you can't do them completely on your own, make sure you understand the solutions. a similar problem usually comes up on the exam!
One time I asked a question after class and the next class he brought up my question to the whole class, saying that it was a good question and sharing the answer with the entire class. I'm still living on that high. Anyways, Prof Meka is great and presented the material of this class very well. His explanations are very clear and he welcomes student questions. Definitely take this class if you are even slightly interested in the more theoretical side of CS!
Professor Meka was one of the BEST professors I have had in the CS department! I think he did a great job teaching this class remotely. The course structure was changed this quarter and was more about "Theoretical Computer Science" than what it was before. The content was always very interesting and often times mind blowing, especially near the end of the quarter when we covered uncomputability, TM, and proved Godel's Incompleteness Theorem!! Coming into this course, I had no idea what TCS is about and even though I am not that interested in the field, I still find the class very interesting.
This class is full of proofs and you won't write a single line of actual code (aside from pseudo-code). Proofs are difficult, but with Professor Meka's great explanations, it becomes somewhat manageable. All the HW are proof-style questions that re-empahsizes concepts taught in class. About half of the questions will be somewhat doable if you attended lecture, but there will always be VERY HARD questions on the HW that I couldn't figure out on my own even if I were to stare at the question the whole day. Even so, the TAs were extremely helpful!! They would often give hints to difficult HW questions during discussion and if you need more help, you could always go to OH where they go over the HW questions in detail until you understand them. S/o to TA Hadley and Shawn!
There were 3 non-cumulative exams throughout the quarter (including the final). The exams were increasing more difficult and I would say that the final was really hard (but still doable imo). Even though, I only did well on the first exam, and scored about average on the latter two exams, I was still able to get an A. I think there is a nice curve.
Compare to my friends who took it in previous quarters with the old course structure, I would say this class is definitely **harder than before**, but you will definitely learn A LOT more than ppl in previous quarters did. So, I 100% recommend taking this class with Meka!! You will have a great time and learn a lot :)
Prof Meka is a legend. Dude is super passionate about Theoretical Computer Science, and does a fantastic job of channeling that passion every lecture. Theoretical CS is kind of an oddity among the rest of the CS classes, so the material can be difficult to grasp at times. However, Meka goes slowly and methodically, and makes it much easier on the class.
Homeworks were easy for the first half of the quarter and got kinda obscure towards the end, but overall not super time consuming. He uses a 3 midterm approach, with each midterm considerably more difficult than the last. I know everybody wants this class with Sherstov but I have no regrets taking it with Meka.
Prof. Meka, while not necessarily being the most charismatic man in the world, is a very competent lecturer who definitely has a lot of passion for what he teaches. He lectures using an interactive whiteboard, the contents of which are later posted as slides. Those slides are helpful if you attended lecture and somewhat confusing if you didn't. Honestly, go to lecture if you can. Yeah, I know everyone says that, but keeping up with this course dramatically reduces the amount of time you need to study.
For the most part, honestly the material is pretty easy (focus on pumping lemma proofs and reductions from the goated HALTONZERO algorithm), but it's really important and interesting from a theoretical perspective, and it sort of provides an insight into the abstract design of systems with very limited resources. Exams are usually just slightly harder versions of homework questions, and the homework assignments were 1-2 hour long problem sets assigned every week or two; very doable.
Amazing class. Workload was manageable and content was clear. There were 3 exams and they were not cumulative, so it was easy to study for the tests. Would take again
I initially thought Meka would be a pretty boring lecturer based on the first class but I was happily surprised. The lectures ended up being really interesting and it was easy to tell that he was passionate about what he was teaching. His tests were fair and he provided 3 yrs of practice exams and additional hw problems which were very helpful for the exams (many problems were similar to the practice). There were 3 non-cumulative exams (instead of a midterm and a final) so if you didn't do well on one of them you could still make it up on the next ones. HW was manageable and lectures were recorded. The content was occasionally dense but it's a theory class so that's to be expected. Overall, Meka was a great prof to take this class with.
Meka is a great professor. 181 is definitely a hard class but somehow Meka made this class extremely enjoyable. His OHs are great and he explains everything really well. For the midterms and final, the best way to study is literally just going to his OH and do the practice problems with him. Or just simply be there and listen to what other people are asking. The 1 hr OH is somehow the most productive studying sesh ever.
Super interesting class, Meka is a great lecturer and really good about answering questions. The homeworks are pretty difficult and are mostly graded on completion, but definitely manageable. We had two midterms and one final, all non-cumulative. He's pretty lenient on grading for these-- I basically skipped a question and still got one point for "attempting" it. Overall, would definitely recommend taking this class with Prof. Meka.
Based on 19 Users
TOP TAGS
- Engaging Lectures (9)
- Would Take Again (10)