Formal languages; finite automata and regular expressions; properties of regular languages; pushdown automata and context-free grammars; properties of context-free languages; introduction to Turing machines and computability.
4
UnitsLetter
Grading1, 2, 3
PasstimeNone
Level LimitEngineering
CollegeA pretty solid prof who is excited about the material, gives good examples, and is very responsive to questions during lecture. Attending lecture is very important though, and I made the final much harder for myself by missing the last few.
Take thorough notes in class, especially about examples and proofs, as they often show up on tests. The tests are challenging, but not unfair or unreasonable. However, the TAs that graded the homework when I took his class were hopeless. I had to get every single assignment regraded because of mistakes, but it worked out fine in the end.
Great lectures. Homework was difficult and needed the help of TA's to complete. Tests were not hard.
Great lectures. Clear and to the point. Homework was graded hard, go to TA office hours for homework help to get full credit. Midterm was not hard, final was alright. Test did not have things not covered in lecture or incredibly hard problems.
Professor El Abbadi is a joy to have a class with. He genuinely cares about the material and is great at answering questions. His lectures are quite interesting, and the class is mainly project based which helps you learn. TAKE HIM IF YOU ARE ABLE!!!
please please please take this class with Professor El Abbadi before he stops teaching it. It is incredibly clear how much he cares for his students and his material - the class is interesting, and you can expect fair (not too hard) items on his quizzes. He is passionate when teaching and responds very quickly on piazza. Great guy, great class!!!