Hi all,
Just posting to give an update. I think my problem is too easy I had it pretty much figured out in my head, it would take me not too long to write it out after that. I think I need a new idea (Danny, any ideas?).
I seem to be understanding the course work. I haven't had much time to commit to it as life has gotten in the way. When I'm in class it all falls into place in my head. I didn't do so great on the midterm, but it's due to a common problem with me, things seem so obvious to me that I don't write them down and then I lose marks for not writing them down. But I am doing really well on the quizzes so it's not so bad.
So long for now,
Wendy
Showing posts with label tutorials. Show all posts
Showing posts with label tutorials. Show all posts
Saturday, 27 October 2012
Monday, 1 October 2012
Week 4 Begins
A quarter of the way through the semester ALREADY. It always goes so fast.
Last week I got my first assignment for this course done. I didn't have a lot of difficulty with it.
I was impressed with myself with the way I solved question 4. Instead of combining the two related claims about binary strings, I proved only the claim about strings beginning and ending with the same bit. I accomplished this through my induction step. I went to the next string by inserting an arbitrary bit in the center (or Ceil(n/2)), thus preserving the same bit at each end. I thought this was clever.
I can see how one would prove this using the combined claim, but I wanted to see if my way would work and it did!
My plans for this week are to start the tutorial #2 problems. I have looked them over, I just haven't sat down to work them out. This is assuming my CSC209 assignment won't hog all my time. At least I got the assignment for this course finished so I'm not rushing on that.
On a side note, I wish my door didn't let in so much noise so I could still be asleep.
So long.
Last week I got my first assignment for this course done. I didn't have a lot of difficulty with it.
I was impressed with myself with the way I solved question 4. Instead of combining the two related claims about binary strings, I proved only the claim about strings beginning and ending with the same bit. I accomplished this through my induction step. I went to the next string by inserting an arbitrary bit in the center (or Ceil(n/2)), thus preserving the same bit at each end. I thought this was clever.
I can see how one would prove this using the combined claim, but I wanted to see if my way would work and it did!
My plans for this week are to start the tutorial #2 problems. I have looked them over, I just haven't sat down to work them out. This is assuming my CSC209 assignment won't hog all my time. At least I got the assignment for this course finished so I'm not rushing on that.
On a side note, I wish my door didn't let in so much noise so I could still be asleep.
So long.
Subscribe to:
Posts (Atom)