Test 2 made me realize that I have no idea how to prove that loops will execute. Luckily there was only one question about loops on this test but it is something that I will really have to focus on for the exam. I don't really have any problems doing proofs on recursive code though. Recursion and induction seem to go hand in hand so although the proofs are usually quite long they are also much more intuitive compared to proofs involving loops.
I like regular expressions so far although I don't really understand how to prove that a particular regular expression, expresses a language. We started regular expressions in CSC207 around the same time as this class so I have been getting lots of practice with them. I'm glad we can use finite state automata instead of regular expressions in some cases because they are often easier to come up with.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment