This was the second last week and I found that fewer and fewer people come to class everyday. This week we didn't cover anything related to Dr.Racket, instead, we learnt slides about network and working with computers.
The use of internet is worldwide today and it is a mutual trust between the website and the browser. Also, whether computer reduce our work hour or increase it is controversial. We discussed this in this week's class.
2013年3月24日星期日
week 10
This week we continued to learn the recursion of images. It was not hard because we've already learnt it last week. When you enter a number into the function, the first thing is to check if it satisfy the first condition which is greater than 0. If it's not, then just skip the definition and go straight to "else". If it is greater than 0, then we replace all the "d"s inside of the function and to see what would happen. A tip of this is that you assume the computer has known what would be produced in the previous number under the function. I think it was really fun because when you enter a large number, you will see a amazing pattern.
Also, in terms of computer history, we learnt the operating systems. In the past, one computer can only run one program at one time. But nowadays computers can run several programs at the same time.
Wikipedia Part III should be done at the end of this week. I found it easy to add new content to the article but I actually didn't know how to engage in the wikipedia community. I sent an email to professor to ask him about it, then he told me to go to the talk page. I found some wikipedians who also worked on the same article with me, and talked to them.
Also, in terms of computer history, we learnt the operating systems. In the past, one computer can only run one program at one time. But nowadays computers can run several programs at the same time.
Wikipedia Part III should be done at the end of this week. I found it easy to add new content to the article but I actually didn't know how to engage in the wikipedia community. I sent an email to professor to ask him about it, then he told me to go to the talk page. I found some wikipedians who also worked on the same article with me, and talked to them.
2013年3月15日星期五
week 9
This week we had the second mid-term so I reviewed a lot. On tuesdays's class we learnt the recursion of images. Although this have shown in last week's schedule as well but I didn't quite get it last week. I just watched the video of recursion images last week, but this week I wrote the recipe for this. It was not very hard though, but it requires logical thinking. I think when we define a function, not only we need to think about the orders of the definition, but also need to relate to other functions that we already learnt. Sometimes the parentheses can be confusing too. When I do this function, I just need to have an image inside of my brain and think about what it will look like after I press "run".
The test was not very hard but I'm not sure about the second question which was to explain why computer designers don't just put all the memory in CPU. I thought maybe put some of the memory in Main Memory and some in CPU can make computers run faster and the space in CPU is limited. Other parts were covered by classes so I'm not very worried about the test mark.
I just found out that the aid sheet is useful only when you understand what it talks about. If I didn't read all the notes about computer history, even if I have the aid sheet, I would be very frustrated during the test because I don't know where to find the answer. I didn't put a lot of effort on history part, and I felt a little bit unsure about it. So next time I'll listen to lectures more carefully and review it.
The test was not very hard but I'm not sure about the second question which was to explain why computer designers don't just put all the memory in CPU. I thought maybe put some of the memory in Main Memory and some in CPU can make computers run faster and the space in CPU is limited. Other parts were covered by classes so I'm not very worried about the test mark.
I just found out that the aid sheet is useful only when you understand what it talks about. If I didn't read all the notes about computer history, even if I have the aid sheet, I would be very frustrated during the test because I don't know where to find the answer. I didn't put a lot of effort on history part, and I felt a little bit unsure about it. So next time I'll listen to lectures more carefully and review it.
2013年3月9日星期六
week 8
This week's content was hard for me. Honestly, I don't remember what we learnt about Dr.Racket on Tuesday's class. I watched the videos on the website and it was about recursion of triangles.
It is normal that on tuesday's class we have Dr.Racket and on thursday's class we have computer history. We learnt how to reverse a string using Dr.Racket and some applications of rot13. We wrote the recipe for those. There were some confusions. For example, I think I forgot what "substring" means and when I looked at the definition I just got confused. Also, the definition for "palindrome" was so complex and I need to understand it.
The computer history of this week was about hardwares and operating systems. First, we talked about what Von Neumann was. It was a computer architecture design. The hardware is consist of CPU and memory stick.
The project of ecosystem and ball were due this week on Friday. I and my teammate Emily Luo put a lot of effort into it. The "ball" was easy to finish but there was a confusing problem in "ecosystem" which was that the pictures of foxes and mice are constant in sizes. There was no change of size for both of the two species. I didn't know what to put after eaten-mice and dead-foxes, but after asking my TA, I figured it out. It should not be a constant value. It was the quantity of mice and foxes in the ecosystem. We stared the project on Wednesday and we fixed the problem on Friday. We both felt very accomplished. I hope that our project could get a high mark.
It is normal that on tuesday's class we have Dr.Racket and on thursday's class we have computer history. We learnt how to reverse a string using Dr.Racket and some applications of rot13. We wrote the recipe for those. There were some confusions. For example, I think I forgot what "substring" means and when I looked at the definition I just got confused. Also, the definition for "palindrome" was so complex and I need to understand it.
The computer history of this week was about hardwares and operating systems. First, we talked about what Von Neumann was. It was a computer architecture design. The hardware is consist of CPU and memory stick.
The project of ecosystem and ball were due this week on Friday. I and my teammate Emily Luo put a lot of effort into it. The "ball" was easy to finish but there was a confusing problem in "ecosystem" which was that the pictures of foxes and mice are constant in sizes. There was no change of size for both of the two species. I didn't know what to put after eaten-mice and dead-foxes, but after asking my TA, I figured it out. It should not be a constant value. It was the quantity of mice and foxes in the ecosystem. We stared the project on Wednesday and we fixed the problem on Friday. We both felt very accomplished. I hope that our project could get a high mark.
2013年3月8日星期五
week 7
This week was the first week after reading week. I felt like I didn't prepare for classes begin. I was too relaxed during reading week because I had four midterms before it so there was nothing left to study.
This week I learnt something new which was how to convert numbers into binary. It was really interesting to learn. If a number is odd, it is obvious that it cannot be divided by 2. So the last bit on the right is 1. It gives you a small chart to guide you when you are doing some multiplications and adding. I think the calculation for binary is similar to base 10. You just need to remember the result for several conditions, such as adding 1 and 0 or multiply 1 and 0. The only thing that is distinct from base 10 is the representation of decimal place. In base 10, if we move the decimal left by one digit, the number will be 10 times smaller whereas in binary, the number is reduced by its 1/2.
Binary can also apply to image colors, and sound. Because the color list of one image can be expressed by four main elements, which are red, green, blue, and opacity, there are 2 to the power of 32 kinds of colors exist.
This week I also learnt how to use other letters to represent a string. For letters are from A-M, you add 13 to find the corresponding letters, and for letters from N- Z, you basically subtract 13. You can get a new string using this algorithm.
This week I needed to finish the second part of Wikipedia assignment. I spend a lot of time on reading the wikipedia practices and conventions.
This week I learnt something new which was how to convert numbers into binary. It was really interesting to learn. If a number is odd, it is obvious that it cannot be divided by 2. So the last bit on the right is 1. It gives you a small chart to guide you when you are doing some multiplications and adding. I think the calculation for binary is similar to base 10. You just need to remember the result for several conditions, such as adding 1 and 0 or multiply 1 and 0. The only thing that is distinct from base 10 is the representation of decimal place. In base 10, if we move the decimal left by one digit, the number will be 10 times smaller whereas in binary, the number is reduced by its 1/2.
Binary can also apply to image colors, and sound. Because the color list of one image can be expressed by four main elements, which are red, green, blue, and opacity, there are 2 to the power of 32 kinds of colors exist.
This week I also learnt how to use other letters to represent a string. For letters are from A-M, you add 13 to find the corresponding letters, and for letters from N- Z, you basically subtract 13. You can get a new string using this algorithm.
This week I needed to finish the second part of Wikipedia assignment. I spend a lot of time on reading the wikipedia practices and conventions.
订阅：
博文 (Atom)