near the end of the semester

There are something new for the proof strategy, which is structural proof.
We have proved several statements about binary string with certain properties.
At first I was not comfortable with the idea of binary string and now I find
it easier and it has create a new world for proofs.
Assignment 3 is done and there is only one test left until the final.
This semester is going really fast. However I had a good time with lectures
and fair marking. I would love to take this course even if it's not the program
requirement. I hope we can have some practice test or past tests for the final
to decrease the stress of having 3finals consecutively.

Hope all of us will do fine.

we have to learn self study....

I feel strongly that even though we are learning the same knowledge about regular expression in both courses csc207 and csc236, I understand better on csc236 than on csc207.
Hence, I believe instructors and the strategy for teaching matter a lot when it comes to learning new knowledge. As I go from elementary school, middle school, high school and now university, I feel that we have more abilities to learn, but the instructor has less strategies to teach.

Though I don't prefer this situation, I have to admit that this process is necessary to make people learn to self study. No one will teach you forever. It's yourself who learns the knowledge.
CSC236 is one of the course that I can mostly understand during the lecture.
So I recommend this course to all the CS students.....(though it's a program requirment)

Term Test2 is done

We just had term test 2 and it's not hard.
I found that the past test helps for the question
of termination of loops.
I just need to study the lecture notes and
assignments to prepare for the test.

The test content and assignment content is fit
to what we have learned.
I have another course MAT237 which the assignment
and the test is mostly out of range.
Also, the lecture is hard to understand, so is the textbook!

I feel the course CSC236 is a good course since
I can understand on the lecture and prepare well
for the tests. It's very straight forward and clear.

If all courses are like CSC236, the university would be
much funnier.

Invariant...

I kind of find it hard to find the loop invariant.
It's not very clear that what are the algorithms
to find the loop invariant.
Also, how to prove the correctness of loops
seems more difficult than the recursion....
Nested loop is even worse......
I hope I can figure it out by next week and
I hope I can do well on Test 2!~

Assignment2 done!

Fortunately, I have figured out most of assignment 2.
I found that "if you were frustrated yesterday, it doesn't mean
there is no hope everafter".
5 minuts ago, it was a bit trouble, and now it becomes all clear.

People need think. In this way, they can realize how much they
actually know. Or people will never know they can do such
things...

Though the road is full of challenges, we can go through it if
we believe we can..

Assignment 2....headache

I just started assignment 2 and I feel that it's alot harder than the first one.

The first question, I feel that we have met the hardest question about a tree.
I have a little bit insight about small part of the formula,
but I still feel headache about drawing trees.

The second was easy to unwind the expression. However the closed form is
not easy. I'm not sure whether we should let it smaller than certain number
or let it equal to an expression. Also, the constant ting annoys me.

I didn't start reviewing the next 2 quesion but I hope they will be easier.

after the first test

I have just wrote the first midterm test and
I found it easy since it's all about induction.

The first time I new the technique of proving using induction,
I thought it doesn't make sense, because we can have many flaws.
However now, I feel that for some specific proofs, induction is great!

For one of the question in the test,
I am wondering if we need a lemma....

anyway~ hope this one is the worst, and hope I can do better and better. ^ ^