April 4

This is the last week of my first year in U of T, and I am very nervous because final exams are approaching so fast.

For my last entry, I would like to talk about how I solved Project 1 assignment by using Polya's method.
1. Understanding the problem.
Project 1 asks to download two DrRacket files and complete the missing comments. Therefore I could clearly see that the unknown are the missing comments while the data are the given comments. 
2. Devising a plan.
I easily found the connection between data and the unknown by looking at the similar comments. For example, while the project asks to fill in the comment of rotating left, I could compare it to the comment of rotating right and therefore figured out the solution. Also, for the check-expect questions, since they are related to the questions I solved before, I compared them and found out they have the similar unknown.
3. Carrying out the plan.
I carried the plan for both DrRacket files.
4. Looking back.
I checked the result by simply clicked the "run" button. 

My last entry on SLOG! I had a wonderful time in CSC104!

March 29

I just realized there is only one week left for my first year in university; I cannot believe time went so fast, it feels like just yesterday I got my U of T offer and everyone was happy about that.

This week we learnt about computer and works, privacy, and other things related to the history and development of computer science. Basically everything is paper-based and we have to remember it for final exam.

Right now I am working on the project 2 and I wish we could have an office hours just like last time.

March 24

This week we continually learnt recursion, and there were more things about operating system. Also, Wikipedia III was due on Friday and hopefully I did it fine.

Only two more weeks left for this semester! Need to work hard for final exams! 

March 20

In the past week, we learnt recursion. I understand it pretty well so I really have nothing to say in this post.

Also, test 2 on Thursday was not as hard as what I expected since there were not so many things relating to the project. Hopefully I did it well.

March 11

During the past week, we talked about operating system, personal computer OS, OS wars, and DrRacket triangle recursion.

Also, project 1 was handed in.

March 2

So far I have learnt many things about DrRacket, such as group values into lists, reverse the list, define a new structure, deconstruct images, etc.

To be honest, everything is getting difficult. For the lists of values, map lists, decompose and reconstruct images parts, although they are hard, they are still understandable through watching the videos; however, I am really having trouble with the timer. For the timer we did on Tuesday, I cannot find the racket timer code on CSC104 page, or is it the same one that was posted before reading week? Personally speaking, I think it would be really helpful if there is a timer video.

February 17

In this week, we learnt many interesting things in CSC104 such as the comparison between digital and analog, how binary system works, and how to convert a based 10 number into a based 2 number.

At the beginning, I had some troubles with binary, for example, when converting 1011 into a based 2 number, I did not know where did 8, 4, 2, and 1 (1 x 8 +0 x 4 + 1 x 2 + 1 x 1) came from. However, after I looked at the based 10 calculation, and I found that we were just multiplying each digit by the power of 2. In the previous example, 1011, 1 is just 2^0, 2 is 2^1, 4 is 2^2, and 8 is 2^3. 

On the other hand, DrRacket is really not as straightforward as binary, and it makes me very confused. For example, when typing in "rest menagerie", why the word "list" comes before the pictures all the time? Also, what is "map" and when should I use it? There are just so many functions to remember!

Anyway reading week is coming, and hopefully I would do a lot of "reading"!