UIT2201 (Spring 2008) 
Quiz 1  Fun Question

1.  10 is the (re)presentation of (2)10 in binary base.
2.  10 is the base 2 equivalent of decimal 2.
3.  Because 10 is equivalent to 2 in the base 10 number; (10)2 = (2)10.
      Thus, there are 2 types of mathematician....
4.  Because in binary 10 stands for 2. So there's only two type actually 
      "those who can, and those who can't"
5.  Binary mathematics 2, use 2 numbers (0 and 1) while the others use
      their 10 fingers and work from (0 to 9).
6.  10 in binary is 2 in decimal.
7.  ...empty...
8.  102 = 210. There are 210 types.
9.  10 think in base 10.
10. If you think binary you will understand. If you don't you don't.
11. 2 in binary is represented by 1 and 0 -- '10'.
12. (10)bin = (2)dec, therefore 2.
13. 1 refers to one kind; 0 refers to another kind.
14. (10)2 is binary for two.
15. This is vecause binary digits: (10)2 means (2)10.
16. Because you can't think binarily. If you can, you will say 2.
       You can't, therefore you give 10 which is as a result of
       having 10 fingers.
17. (10)2 = (2)10
18. Those who can, they think in 0 and 1; those who can't,
       they think in 1,2,3,4,5,6,7,8,9, there are 9 of them.
       Altogether 10.

Your Personal Favourite Analogy

1.  Origami and algorithm
2.  Origami to explain algorithms
3.  The analogy of origami to algorithms.
4.  Instructions to origami as an algorithm.
5.  Origami insturctions as an analogy of algorithm.
6.  Using origami as a stepping stone to learn algorithm.
7.  The use of origami, of course, to explain the concepts and
      mechanisms of algorithms. Even though origami has the 
      advantage of visual aid, but it is a certainly close enough
      an analogy to illustrate the step-to-step instructional 
      mechanism of an algorithm.

8.  The analogy of the instructions on a hair shampoo bottle used to
      explain algorithms. What I love about this analogy is the joke
      about computer scientists repeating the instructions endlessly
      because a termination condition was not specified.
9.  The ambiguity of the instructions on the shampoo bootle, which
      doesn't give instructions on how many 'loops' or times to wash
      the hair or when to stop, giving rise to an infinite loop or
      doesn't halt in a finite amount of time. This help to remind
      me the need of algorithm to halt in a finite amount of time.
 
10. I found the modes of transport analogy to be very helpful in
      understanding the different rates of growth for algorithms
      of different orders of magnitudes.
11.  The head start analogy where giving a head start to the person is
      futile if the other person at higher rate of growth will
      still catch up.

12. The executing of an algorithm is explained in way of following
      the instructions to cook some food.

13. Mine is the analogy of telling "points of place" when helping 
      someone find way from one place to another. This is used to
      illustrate the benefit of decomposition and using different
      levels of abstractions in algorithm.

14. I liked the story about the recursive halving problem between
      the mathematician, physicist and the engineer. It illustrate that
      although something seems impossible in theory, it may be possible
      in real life.

15. Analogy of CEO outsourcing some functions to others to explain
      modularisation of programmes and division of labour in
      software system.

16. When you have a hammer, everything looks like a nail.
      This is to illustrate that the way a person approaches a given
      problem is closely connected to is training and academic discipline.

17. The part about Enrico Fermi, ie. the piano tuner problem, in which
      he clearly guesstimated the number of piano tuners in a city!

18. The analogy of the four-minute mile probably struck me the most
      though it wasn't directly related to the concepts in the course.
      If the above is counted more as an example, then I must say 
      I like the simplified diagram of computer hardware likened to 
      a bus terminal the most.
LeongHW, Mar 2008