CSC236 at a Glance

I did not walk into this course with much enthusiasm given the fact that courses tend to get more strict and less fun when they are continuation of previous courses(In this case, CSC165). Induction flavors provided the basics for proving formal statements throughout this course. Then we learned about iterative and recursive programs. At first, proving programs correctness seemed unnecessary, but it proved me wrong since we can not always run our programs. Regular expressions introduced another way of presenting formal languages along with finite state automata. Overall, I am happy we skipped predicate logic, spent less time on formal structures and more time solving and proving mathematical puzzles.