week 9

    Ya, this is the second one which take sooooooo long. The thing is, this term for me is really hard(i mean the course load of course.)
    In the past few weeks, we study things about prove.  Specific saying is about prove and disprove. Which is actually interesting. Makes me thinking about when i considering real life situation. When you trying to disprove sth(such as P->Q), it's not the case that you have to prove(P->NOT Q), and you have to prove P and not Q instead. Which make sense of lots of things.
    And this course teach us about python running times consideration. This help me to  writing code about python and know where the bug is.

Week 1 and 2 Journal

    Trying to make a minor in Computer Science, so i'm taking this course ------Csc165( Mathematical expression and reasoning for computer scientists). 

    In week 1, we study how to building sets in python. We distinguish all and any, questions such as all{x in S2 for x in S1} and any{x in S2 for x in S2}.This is not very complicated, but seems a little tricky to think. So use Venn diagram to help thinking.

   In week 2, we learned qualifiers and implications and how we use these symbols. There are exist and for all qualifiers. We learned implication,contrapositive and converse. In implication, there also has many "natural" language word that express this implication such as: If...then...;Whenever...;...is sufficient for...;...are enough for...;...without...;...requires...;...only if...;...unless....In all of these, only if is a tricky one, so just remember that the things after only if is always be result. One more thing about implication is that the only case this implication is False in (T -> F).

    Finally, There are conjunction, disjunction and negation. 

    In last two weeks, we studied many logic stuff. Since i'm a math major student. These stuff are kind of easy for me. But regarding the title of this course, i'm still afraid of if there will be many proof in this course.

    Ok, my first 165Slog.=v=