- Type
- Midterm past paper
- Course
- MTH202 Discrete Mathematics
- Size
- PDF 1.5 MB
- Updated
- 23 Oct 2026
You get 3 free files a day on the website. Add the Chrome extensionSign in with the extension for 30 a day.
Preview text
Text from pages 1, 2, 3 of 24. Download the file for all 24 pages.
You should never copy paste the same answer which we are providing. Please do make some changes in the solution file. If you appreciate our work, please share our website with your friends.
آپ کو کبھی بھی وہی جواب کاپی پیسٹ نہیں کرنا چاہیے جو ہم فراہم کر رہے ہیں۔ براہ کرم حل فائل میں کچھ تبدیلیاں کریں۔ اگر آپ ہمارے کام کی تعریف کرتے ہیں تو برا ہ کرم ہماری ویب ک و اپنے دوستوں کے
ساتھ شیئر کریں
Lecture No.1 Logic What is Discrete Mathematics? Discrete Mathematics concerns processes that consist of a sequence of individual steps. Define LOGIC: Logic is the study of the principles and methods that distinguish between a valid and an invalid argument. What is SIMPLE STATEMENT? A statement is a declarative sentence that is either true or false but not both. A statement is also referred to as a proposition. Define Logical Connective? There are five logical connectives A Logical Connective is a symbol which is used to connect two or more propositional or predicate logics in such a manner that resultant logic depends only on the input logics and the meaning of the connective used. Generally there are five connectives which are − OR (∨) AND
SYMBOLIC REPRESENTATION
Negation not Tilde Conjunction And/but Hat Disjunction or Vel If…then… Arrow if and only if Double arrow
EXAMPLE SENTENCE SYMBOLIC FORM
- It is not hot. ~ p
- It is hot and sunny. P ∧q
- It is hot or sunny. P ∨ q
- It is not hot but sunny. ~ P ∧q
- It is neither hot nor sunny. ~ P ∧ ~ q
Define Truth Table? A truth table specifies the truth value of a compound proposition for all possible truth values of its constituent propositions. Define NEGATION (~)? If p is a statement variable, then negation of p, “not p”, is denoted as “~p” TRUTH TABLE FOR ~ p p ~ p T F F T Define CONJUNCTION (∧)? If p and q are statements, then the conjunction of p and q is “p and q”, denoted as “p ∧ q”. TRUTH TABLE FOR p ∧ q. p q p ∧ q T T T T F F F T F F F F
What is DISJUNCTION (∨) or INCLUSIVE OR?
If p & q are statements, then the disjunction of p and q is “p or q”, denoted as “p ∨ q”. TRUTH TABLE FOR p ∨ q p q p v q T T T T F T F T T F F F
Related MTH202 files
All MTH202 files →- MTH202 Midterm Short Questions and Answers Midterm PDF 208 KB
- MTH202 Midterm Solved File 1 by Team Hadi Midterm PDF 3.8 MB
- MTH202 Midterm Past Papers by Mahar Afaq Midterm PDF 1.5 MB
- MTH202 Midterm Solved MCQs Set 2 Midterm PDF 358 KB
- MTH202 Highlighted Handouts by Asfand Yarr Highlighted PDF 2.6 MB
- MTH202 Lecture 21 Quiz DOCX 25 KB
Get more out of VUBuddy, for free
- Unlimited downloads
- The explanation behind every MCQ answer
- Study offline on slow data
- 30 downloads a day instead of 3
- Sign in and buy Pro Semester here
One Pro Semester membership works in both the extension and the app.