This is my last CSC165 lecture. We talked more on computability, did a precise review and mentioned something about the exam. I found this course is interesting since I learned lots of new things about computer science, and the course also gave me a basic concept of mathematical logic.
I spent a long time struggling with assignment 3. It is more frustrated than the previous two. The proofs need not only CSC165 but also calculus knowledge. The computability question is the most challenging one. I failed answer this question though I've read The Hitchhiker's Guide to the Galaxy.
From the assigment, I found that there are still some points I am not so confirm with. I will start reviewing from now and hopefully I can do well on the final:)
Tuesday, December 2, 2014
Week 10
I had a test at 6 so I missed half of the lecture,so I only listened the computability part.I learned how to use halt to prove something is non-computable by computer. I am really interested in this topic as a future computer science student.
Week 9
Test week.
The test questions are challenging but not overly difficult.The question types are similar to what we have done on tutorials and assignments. I did the previous test and review all the tutorial exercises but still did not feel so confident.
The test questions are challenging but not overly difficult.The question types are similar to what we have done on tutorials and assignments. I did the previous test and review all the tutorial exercises but still did not feel so confident.
Week 8
This week I learned something about big-Oh, big-omega and sorting algorithm. Also I was finishing assignment 2.All prove questions.
Monday, October 27, 2014
Week 7
Something learned:
proofs(again!), something about algorithms (bubble sort, merge sort, running time, etc.)
Something confused:
We talked about the four colour theorem in the lecture. This is a really interesting problem and I can not stop thinking about it. What if there is a country borders four or more other countries? In this situation there will be two adjacent regions in the same colour.
Frankly, the algorithm part is totally new to me. Accepting new concepts is a time consuming work.
proofs(again!), something about algorithms (bubble sort, merge sort, running time, etc.)
Something confused:
We talked about the four colour theorem in the lecture. This is a really interesting problem and I can not stop thinking about it. What if there is a country borders four or more other countries? In this situation there will be two adjacent regions in the same colour.
Frankly, the algorithm part is totally new to me. Accepting new concepts is a time consuming work.
Subscribe to:
Posts (Atom)