Professor
Sheila Greibach
1 of 1
Most Helpful Review
Information nowaday is in text. And this class teaches you to scan the data quickly. Class: I took this class with her and with Brian Tagiku as TA. She is very nice. Brian Tagiku is very good TA for this class. He is very nice. If you think she is a bad professor, then you has not see all professor yet. I must admit her lecture is slow and boring. That is the truth. Her course book is badly printed. The word on the printed slide is on very small and offers a summary of lecture. The information is delivering during lecture. The only thing I hate is that Brian Tagiku, till the final review, he finally offers vital explain and that is "the difference between nondeterministic and deterministic is that in nondeterministic machine, you have multiple choice or no choice at every stage. In a deterministic machine, you only have 1 choice at every stage." You can say I am slow at understanding. This class has homework, midterm, quiz, and final. yes, Quiz in discussion. Sometimes, given a machine, and course book says, it used to parse this grammar or something. If you look at the machine, you might not understand why. You should try to parse a string in the language with the machine, then you understand. Midterm and Final: There are example midterm and final in back of the course book. The real one will be in that EXACT format (same type of question, etc...). She is not that bad. There are worser professors.
Information nowaday is in text. And this class teaches you to scan the data quickly. Class: I took this class with her and with Brian Tagiku as TA. She is very nice. Brian Tagiku is very good TA for this class. He is very nice. If you think she is a bad professor, then you has not see all professor yet. I must admit her lecture is slow and boring. That is the truth. Her course book is badly printed. The word on the printed slide is on very small and offers a summary of lecture. The information is delivering during lecture. The only thing I hate is that Brian Tagiku, till the final review, he finally offers vital explain and that is "the difference between nondeterministic and deterministic is that in nondeterministic machine, you have multiple choice or no choice at every stage. In a deterministic machine, you only have 1 choice at every stage." You can say I am slow at understanding. This class has homework, midterm, quiz, and final. yes, Quiz in discussion. Sometimes, given a machine, and course book says, it used to parse this grammar or something. If you look at the machine, you might not understand why. You should try to parse a string in the language with the machine, then you understand. Midterm and Final: There are example midterm and final in back of the course book. The real one will be in that EXACT format (same type of question, etc...). She is not that bad. There are worser professors.
Most Helpful Review
She is the worst professor I've had at UCLA. It is clear that at one time, she was a preeminent mind in her field (around 8th week, you do a section on "Greibach Normal Form"). I would guess that she was at one point a pretty good teacher as well- she at least makes attempts at humor, she seems to understand the material pretty well, and she seemed to at least mildly prefer that we learn something. That being said, she should have retired 10+ years ago. I sat in the third row, and I couldn't hear a word she said. She somehow managed to mumble in a quiet monotone. We started with 40 people in the class, and by the time I stopped going (around 6th week) there were only 12 students still showing up. Her course reader is a collection of fragmented sentences giving vague psuedocode descriptions of algorithms you've never heard of. The savior of this course was Brian Taigku, the TA. If you have to take this class, don't bother going to lecture- just go to your discussion section and you'll be fine. Greibach seems like a nice person, and I have nothing against her personally, but it is clear that she is at UCLA for the sole reason that she is a big name in the field of automata theory. I was surprised her bruinwalk raitings were so high- I suspect that people gave her some leniency because she IS a sweet old woman. Just not a good professor.
She is the worst professor I've had at UCLA. It is clear that at one time, she was a preeminent mind in her field (around 8th week, you do a section on "Greibach Normal Form"). I would guess that she was at one point a pretty good teacher as well- she at least makes attempts at humor, she seems to understand the material pretty well, and she seemed to at least mildly prefer that we learn something. That being said, she should have retired 10+ years ago. I sat in the third row, and I couldn't hear a word she said. She somehow managed to mumble in a quiet monotone. We started with 40 people in the class, and by the time I stopped going (around 6th week) there were only 12 students still showing up. Her course reader is a collection of fragmented sentences giving vague psuedocode descriptions of algorithms you've never heard of. The savior of this course was Brian Taigku, the TA. If you have to take this class, don't bother going to lecture- just go to your discussion section and you'll be fine. Greibach seems like a nice person, and I have nothing against her personally, but it is clear that she is at UCLA for the sole reason that she is a big name in the field of automata theory. I was surprised her bruinwalk raitings were so high- I suspect that people gave her some leniency because she IS a sweet old woman. Just not a good professor.
AD
1 of 1
