Sunday, November 30, 2008
5th Week - SLOG
First term test was done, but not satisfied at all. I couldn't make much improvement on finshing a question within a limited amount of time. I was keep rushing during the test, worring whether if i can finish it on time or not. I had to leave many blanks as I read through out the questions, because I knew for sure that I can't finish it within a time limit. I was mainly focused on writing the structure down first and think about the algorithms later on. The difficulty of the test was a fair game and may be that is a reason why I am still regreting.
4th Week - SLOG
This week, we have covered materials on recursion. Although the concept of recursion in which a function is repeating within its own definition, was not new to me, because of CSC148, Its relation to induction was very interesting. In the lecture, various examples were covered, including the Fibonacci sequence and the golden ratio.
Test 1 is scheduled in next Friday's lecture, and since we don't have any problem sets or assignments to finish, It is a good time for study and review the materials that we have covered in the course over this weekend. I am still worried that I take too long to finish up a question, but hopfully I will be improved before the test.
Test 1 is scheduled in next Friday's lecture, and since we don't have any problem sets or assignments to finish, It is a good time for study and review the materials that we have covered in the course over this weekend. I am still worried that I take too long to finish up a question, but hopfully I will be improved before the test.
Saturday, November 29, 2008
3rd Week - SLOG
It is already been three weeks from the first day of the lecture.
Now I feel more comfort on the concepts of both inductions,
but the new topic from this week bothers me very much.
By using the round-robin domino example from the lecture notes, It wasn't very hard to understand the definition of the well-ordering principle: every "non-empty set" of positive elements contains a minimal element. but its approach to solving a problem is still a mystery to me. because to me, it is a common sense to know that there is always a smallest element in a set, if the set is non-empty, but questions always asks me to prove "logically" this type of thing...
but I believe that like I couldn't find anything in common between binary tree and inductions,
I will find in someday the connection between well-ordering and the logic as I move along the course.
Now I feel more comfort on the concepts of both inductions,
but the new topic from this week bothers me very much.
By using the round-robin domino example from the lecture notes, It wasn't very hard to understand the definition of the well-ordering principle: every "non-empty set" of positive elements contains a minimal element. but its approach to solving a problem is still a mystery to me. because to me, it is a common sense to know that there is always a smallest element in a set, if the set is non-empty, but questions always asks me to prove "logically" this type of thing...
but I believe that like I couldn't find anything in common between binary tree and inductions,
I will find in someday the connection between well-ordering and the logic as I move along the course.
Second Week - SLOG
On the second week of the class, the first problem set was due.
The questions were very straight forward, especially the first question about the proof of unit digits.
Since it wasn't the first time introducing the concept of induction, it was not a hard task to write down a proof following a proper structure. Although I still required plenty of time to think the logic neccesary for a given question to write more precise and neat proof.
But I strongly believe that I will overcome this in someday by trying out more questions.
In the lecture, a concept of complete induction had introduced. the concept was very similar to the ones that are simple inductions, but instead of proving p(n+1) from p(n), we assumed all the cases before n are true, and prove p(n) by using those cases.
I assume this will be used for the upcomming problem set #2 and assignemnt #1.
The questions were very straight forward, especially the first question about the proof of unit digits.
Since it wasn't the first time introducing the concept of induction, it was not a hard task to write down a proof following a proper structure. Although I still required plenty of time to think the logic neccesary for a given question to write more precise and neat proof.
But I strongly believe that I will overcome this in someday by trying out more questions.
In the lecture, a concept of complete induction had introduced. the concept was very similar to the ones that are simple inductions, but instead of proving p(n+1) from p(n), we assumed all the cases before n are true, and prove p(n) by using those cases.
I assume this will be used for the upcomming problem set #2 and assignemnt #1.
Friday, September 19, 2008
First Week - SLOG
It's already been a second year, since I was here at the U of T.
CSC165 that I took previously for this course, was definately not a course for me.
I had a rough time to finish up proofs; that was just a nightmare...
Now, I am in CSC236, with more course load, with more difficult concepts of proof.
However, the first week of lectures were much better than what I had expected.
For the first two days, the prof. spent much of the time on reviewing the concepts of induction proofs. Light and Bold; these are the words that I would define the examples from the lectures.
The examples help me a lot on making me go on track, thoroughly understanding basic procedures of induction proofs and refreshing my memory.
On the last day of the class, the 'real' one had been arrived. New material was introduced, and
It was interesting in a way that the induction proofs can be done by cases.
I am still bit blurrly , in what cases do we required to use this concept,
but i will find it out while i work on the assignments or problem sets.
In general, the first week of classes went fairly well.
Thanks to the prof. for smooth lecturing :)
CSC165 that I took previously for this course, was definately not a course for me.
I had a rough time to finish up proofs; that was just a nightmare...
Now, I am in CSC236, with more course load, with more difficult concepts of proof.
However, the first week of lectures were much better than what I had expected.
For the first two days, the prof. spent much of the time on reviewing the concepts of induction proofs. Light and Bold; these are the words that I would define the examples from the lectures.
The examples help me a lot on making me go on track, thoroughly understanding basic procedures of induction proofs and refreshing my memory.
On the last day of the class, the 'real' one had been arrived. New material was introduced, and
It was interesting in a way that the induction proofs can be done by cases.
I am still bit blurrly , in what cases do we required to use this concept,
but i will find it out while i work on the assignments or problem sets.
In general, the first week of classes went fairly well.
Thanks to the prof. for smooth lecturing :)
Subscribe to:
Posts (Atom)