In the two weeks study of MAT165, I learned many new things and also reviewed some. In the beginning I thought this course is easy, but after the class on Wednesday I feel it’s hard and confused.
Last week I got the schedule of this course and I found out that the final exam is only 40% of the total grade, which is quite different from the ECO100 course. I learned about how to be precise, since the ambiguity always exist in the daily language and computer cannot understand words with doulbe-meanings. Some math samples such as for all and there exists are made the questions become shorter. Then I learned about some computer language: python. The basic structure for python, which I learned, is given two sequences: S1 a d S2. Then define q1, which is a header. Based on the python code the venn diagram could be draw. The other type of code I learned is ‘return all’ and ‘return any’. ‘Return all’ means all the elements in the sequence need to be true or all the elements are false. ‘Return any’ means that if there is one element, which satisfy the condition, exists then the code will be true. The computer codes need to be super precise to run the program. The last part of the course was problem. Professor gave us a piece to dialogue about an discussion on three children’s ages. We used the 4 steps to solve the problem. The four steps are: understand the problem, plan solutions, carry out your plan, and review your solution. By following the four steps, the problem was easy to solve.
In the lecture of week 2, the topic about quantifiers showed again. I was amazed by the length of the sentence could be by using the math samples. Some new samples about sets were also been taught by professor. We first used those samples to answer the problems, then use quantifying functions to answer the questions such as q4( M, O). The expression for the quantifications are in four ways: quantifiers, venn diagrams, set relations, and quantifying functions. The second part the the lecture is about identifying the sentence and statements. Statement is specified. The conception of prediction could basic conclude in a function. The topic of implication is interesting. I need to distinguish the P and Q in a sentence. P implies Q. The converse of P and Q could be either right or wrong, but the contrapositive of P and Q must be right. There are some rules of finding P and Q:
1. If P, [then] Q.
2. When [ever] P, [then] Q.
3. P is sufficient/enough for Q.
4. Can’t have P without Q.
5. P requires Q.
6. For P to be true, Q must/ need to be true/ is necessary.
7. P only if/ only when Q.
8. Not P unless/ if not Q.
Then I learned about Equivalence. P is sufficient for Q, and Q is necessary for Q. The last part of the lecture is idiom, which is just saying the different ways to express same meaning by using math sample.
I found out I have learned too much material, however by writing this Slog I think I could understand the material better. My tutorial went well I think, some of the tutorial questions are hard, such as the drawing of venn diagram. But after the practice I feel less confused. I am thinking about reviewing the powerpoint if I have further more questions.
