CS 2305 Study Guide - Comprehensive Final Exam Guide - Yamaha Xg, X Window System, Xcb

• School: UT-Dallas
• Department: Computer Science
• Course: CS 2305
• Professor: Ashkan Yousefpour

Document Summary

Discretemath deals w discrete objects ex setsintegers stepstakento win a chessgame differentpathsto go from citya to cityb. 2 combinatorial analysis combination e or 8 s77. Preposition a declarative sentence that is either true or false. Ex p i am at home q it is raining bothmustbe the. T p q ian at home and it is raining ifhome but not raining f if rainingbut nothome. Pfalseso q false exception p true but q false. P if only q cit pneedsto hold q musthold. Q is necessary for p happeningof q is necessary for happening of p. 8123118 find converse inverse contrapositive of the followingimplication. P q it is raining is a sufficientcondition formy not going to town converse if i"m notgoing to town it is raining it isn"t raining i"m going to town inverse. Biconditional s pesce pq p is necessary sufficient for q ifp then q tconversely. Using truth table show p q isequivalent to pvq.