Assignment 3 is due on next Wednesday; we have finished the first four questions without any trouble. For the last quetion, I do not quite understand the question. My partner and I decide to go to tomorrow's office hour and ask about it.
We started a new topic this week, which was about proving non-computable function. To be honest, I had a lot of trouble understanding it, especially for the part that navel_gaze passed in itself as a parameter. Even though this chapter was not long, I believed that it was the most difficult part in this course. However, after reviewing Monday's notes, I was kind of getting it.
The exams are getting closer and this may be my last SLOG entry. This course really helps me a lot on writing assignments for CSC148. And I believe that it will be more useful to my future CSC courses.
Sunday, March 31, 2013
Sunday, March 24, 2013
Week 10 (MAR 18 - MAR 22) - Big O Proofs
We did more big O proofs this week. I learned the difference between big O, big omega and big theta, which confused me a lot when the professor first mentioned them. We also learned how to disprove a big O statement. There was one question we did in class that used L'Hopital Rule. I thought it was a good review for MAT137. I realized that chapter 3 was a great prepare for this chapter; writing big O proofs were not that hard for me after wrting various types of proofs.
We got our test back on Wednesday, and I did quite well in this test. I realized that this test was out of 19, which meant a small mistake would make a huge difference in percentages.
The questions we did on Friday were quite interesting; they were about proving whether the addition/multiplication of two functions is bouned by another function, which was a little bit different than the questions we did before.
We got our test back on Wednesday, and I did quite well in this test. I realized that this test was out of 19, which meant a small mistake would make a huge difference in percentages.
The questions we did on Friday were quite interesting; they were about proving whether the addition/multiplication of two functions is bouned by another function, which was a little bit different than the questions we did before.
Sunday, March 17, 2013
Week 9 (MAR 11 - MAR 15) - Term Test 2
At the beginning of this week, we did some big O proofs by using the definition of big O. Then on Wednesday, we tried another problem-solving question. I was busy preparing the test at the time, so I had not figured it out yet. The test was fairly straightforward and the questions were very similar to what we had been taught in class. For the first question, I remembered that we did a similar one in the tutorial and it was easier than the quiz question.
Since it is approaching the end of the term, I am going to be very busy for the following weeks. However, I probably will find some time to do another problem-solving type of questions before the term ends.
Since it is approaching the end of the term, I am going to be very busy for the following weeks. However, I probably will find some time to do another problem-solving type of questions before the term ends.
Sunday, March 10, 2013
Week 8 (MAR 4 - MAR 8) - A2 and Big O Proofs
We went to the help centre on this Monday. Our solution was okay but there was one line that was not obvious how we got to there, so we took the TA's suggestion and added a comment to that line. Later this week, I got an email about the A2's sample solution. Our proof for question 6 was different from the prof's sample solution, so I started wondering whether we could get full mark for that question. Overall, I believed that we did okay for A2.
This week we did some big O proofs together in class. I was okay with proving the upper bound, but I was not so sure about how to prove the lower bound, especially for the last example that we did on this Friday. I noticed that many of my classmates did not get it either. I would reviewed this part of the notes, and if I still did not get it, I would go to the prof's office hour.
Next week we are going to have our second test. I am a little nervous because I am still not confident in writing proofs. I am planning to review the lecture slides and do the sample test next week. Hopefully I can get a better result for this test.
This week we did some big O proofs together in class. I was okay with proving the upper bound, but I was not so sure about how to prove the lower bound, especially for the last example that we did on this Friday. I noticed that many of my classmates did not get it either. I would reviewed this part of the notes, and if I still did not get it, I would go to the prof's office hour.
Next week we are going to have our second test. I am a little nervous because I am still not confident in writing proofs. I am planning to review the lecture slides and do the sample test next week. Hopefully I can get a better result for this test.
Friday, March 1, 2013
Week 6 & 7 (FEB 11 - FEB 15 & FEB 25 - MAR1) - Assignment 2 and Test Result
Back from the break!
I just realized that I forgot to write my
SLOG for the week before the reading week. We got our tests back during that week.
And I did quite well; the only mistake I had made was that I forgot to give an
example of delta. Also, we tried to solve a problem about diagonals.
Because the question was much more complicated compared to the previous
"folding" question, we had not got a solution yet. I decided to find
some time later after the class to figure it out
We started a new topic this week, which was
about the big O and efficiency. This was not the first time I had heard these
words. I had learned some basics in both
grade 12 computer science and CSC108. However, since these courses focused more
on programming, the teachers taught very briefly on this topic. Therefore, I
was not very confident in determining the running time before today.
My friend and I finished the second assignment
yesterday. The last question was a little difficult to prove; it took us a lot
of time to figure it out. However, we were still not sure about whether our
proof was correct. We were planning to go to the office hour next week.
Subscribe to:
Posts (Atom)