Term Test 3

Term Test 3 was easy...especially Q#1...although I am so not sure about my solution to Q#2..Well anyway it is over now...Let's study for the finals now :)

The last Assignment!!!

Sounds nice typing in topics like the last Assignment or the last Problem Set...Yaaaay the school is almost over and I am already striving for some holidays...I guess most of the students are...sooo that may be the reason that the last assignment was waaay more easier than all the previous ones..Thnx Danny! So next week we are having this LAST termtest and just one final waiting ahead...

The last problem set???

Yaaaay!!! We have come to the end of the semester!!! The last problem set and the last assignment are due very very soon :))) The assignment doesnt seem to be very difficult :) At least the first two questions are similar to those we did in lecture...Soooo hope there will be no problems with that...

So this week we were learning the regular expressions and languages...and proving that languages have regExes...

I have just read the problem set 6...hope to start on it tomorrow...right now dont have the mood :S sooo tired...

Wake me up when November ends...

OMG this month is crazy with all the assignments one has to do and all the midterms...And marks for the A2 were like a balm for the soul...I expected much worse :) Thnx TA's :)))))

So last week we had this second TermTest and it was decent although I couldn't find the loop invariant for the last question, because of my stupid mistake assuming that m=n/2 (int div) from the beginning and sticking to that :(

This week I just have the problem Set 5 to be done, but much much more from other courses I am taking... Just wish December comes quickly... :S 

Well meanwhile lets get to work...

Problem Set 4

Think I am done with problem set 4...It is so strange proving programs...:^) 

When I read the program code for PS4, all I could say "It is obvious that it works..." and still you have to prove it...Feels like as if smb asked you to prove that 2^2=4...Obvious thing but the proof makes you do some work...

Anyway back to Assignment 2...

Assignment 2

Having looked at Assignment 2 I think it is not that easy...

Question 1 makes me feel bad :S...the formula I derived is too long and contains Summation...OMG hope I will figure smth out by the deadline...

Question 3 is OK...I have the formula...now I need to prove that this formula works...Tired of proving everything :S

I guess I need some coffee...

Recursion & TermTest 1

Last week was too busy with all the assignments and Tests so couldn't write anything on the blog...

Previous week we had Term Test 1... It was decent... All the questions were familiar although I had problems with having not enough time..

Also we studied recursion and now I am about to start the second Assignment..

Hope there will be no problems on that :)

Hmmm well-ordering...

This week we learned more on induction and saw some false induction proofs...Also we found the connection between WOP, SIP, and CIP...

The thing is that Well-Ordering Principle seems a bit tricky to me...I understand the theorem that every non-empty set has got a least element and all that, but I didn't understand the example of round-robin tournament... Basically because I don't know the rules of a domino tournament, I don't know what happens when a player beats another player and in what order do players play...so I felt lost on that example... :S Sooo today when I was doing my assignment the question# 3 gave me a hard time but in the end I think I understood that by WOP if you can always find an element which is a bit less than the element already in the set it creates a contradiction..Is that right? :)

Everything else is quite clear... 

First weeks of classes...

Soooo...The second week of classes is about to end but it already feels like I have been studying for ages :) 

Till now we have learned two flavors of induction : 

1) Simple induction

   2) Complete induction

The topics are not really difficult..In fact I seem to like induction... Especially the simple one :) 

There you need to define a base case first.. You may as well have several base cases although professor told that you had better get along with as few as you can, preferably just one so that you don't make your proof too long... After that you take inductive step which is actually where all the fun is... You assume that a statement is true for N and then prove that it is also true for N+1 basing your proof on the assumption you made earlier... I don't know why but I just like this step (:

As for the complete induction you don't need the base step at all... As I got it, complete induction uses the assumption that a statement is true for all previous cases to prove the truthfulness of the current case.. For Example you take the current case and decompose it into several smaller cases which are true by your assumption... So this completes your proof... 

Anyway soon I will post some examples that I find interesting and worth posting...