Week 10

We continue with regular expressions. Monday we discussed the laws for regular expressions, and were introduced to DFSA. The computer program I saw was clear to understand. All the laws such as associativity, distributivity, and commutivity were logical since we witnessed them in other courses as well as CSC165, so there was nothing surprising about them.

Week 9

Started Formal languages. In the two lectures of this week, the amount of new terms we learned suprised me. Alphabet, languages, Kleene Star, all the operations of regular expressions, and even regular expressions as a topic of its own was new to me. I had to go through the lecture notes several times and do the proofs many times over and over in order to understand everything. The test on Friday I thought was ok, it was reasonable in difficulty for those who did the assignment and problem sets.

Week 8

In class, we looked at examples of loops and how to prove them using induction. First it was basic, then got brutal.

Week 7

A2 was due. This Assignment was brutal!! Oh my god, I spent countless hours on question 1, 2, and 3. Question 4 was very similar to the example we did in class, if not identical. In class, we did examples of precondition implies postcondition type proofs.

Week 6

Problem set 4 was due. When I saw the question, I had an impression that, that question came right from the final of CSC165; the python reversed string function. In class, we discussed several more method of divide and conquer strategy.

Week 5

Term Test 1 happened. I thought it was a good test. I felt good after writing, but did not do as good as I thought. Also, I felt silly when I realized just how simple question 3 was and how similar it was to the Assignment 1. In class, we discussed closed forms and incorporated that into the induction systems of vice versa that we saw earlier.

Week 4

Assignment 1 was due. I found it difficult without help from TAs and the instructor. Question 2 was the one I had trouble figuring out the algorithm for it. Question 1 I thought I understood, and probably got the best marks for. Question 3 was also confusing, I couldn't understand the whole n1-n2 and why we continue this sequence. At the end, I guess I got it. In class, we talked about Recursion, Fibonnaci sequence, and unwinding. I have to admit, I did not understand unwinding at first, but after some help from friends and TAs, I got it. Also, since this is the only course this term where we still see Python, the recursion algorithms that we saw reminded me of CSC148.

Week 3

Problem set 2 was due. This one was a also very similar to the questions we did in class. Considering each is only worth 1-1.8%, there is no reason why they should be hard, so that was good. In class, we discussed the principle of well ordering. I also bought the book, and found a really good explenation for all three of them: PSI, PCI, and PWO. We also did some more problems with trees. Received my PS#1 back, and was happy with the result.

Week 2

Problem set 1 was due. I found this set to be pretty easy and solved it with little trouble, considering we did questions almost idential in class. In class, we continued to use PSI and PCI in several problems, and also saw some trees.