0% found this document useful (0 votes)
86 views4 pages

Mid Term Exam 2023

The document contains a midterm exam for a discrete structures course. The exam consists of 20 multiple choice questions testing concepts in propositional and predicate logic, including logical connectives, rules of inference, truth tables, and quantifiers. It also contains 6 short answer/essay questions involving writing logical expressions, constructing truth tables, translating statements using predicates with one and two variables, and identifying rules of inference used in arguments. The exam tests students' understanding of key concepts and ability to apply logic in different problem solving contexts.

Uploaded by

faizakhan6611
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
86 views4 pages

Mid Term Exam 2023

The document contains a midterm exam for a discrete structures course. The exam consists of 20 multiple choice questions testing concepts in propositional and predicate logic, including logical connectives, rules of inference, truth tables, and quantifiers. It also contains 6 short answer/essay questions involving writing logical expressions, constructing truth tables, translating statements using predicates with one and two variables, and identifying rules of inference used in arguments. The exam tests students' understanding of key concepts and ability to apply logic in different problem solving contexts.

Uploaded by

faizakhan6611
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

NISA GIRLS COLLEGE

Mid Term Examination Semester Fall 2023


GC University Faisalabad T. Marks : 100
Course Title: Discrete Structures Code: CSI-304
Name: _________

Objective

Choose The best option. [20 Marks]

1. Which of the following is a valid rule of inference in propositional logic?

a) Modus Ponens b) Exclusive Or

c) Biconditional d) Conjunction

2. In propositional logic, what is the contrapositive of the statement "If it is raining, then the
ground is wet"?

a) If the ground is wet, then it is raining. b) If it is not raining, then the ground is not wet.

c) If the ground is not wet, then it is not raining. d) If it is raining, then the ground is not wet.

3. Which rule of inference is used to make conclusions from a conjunction in propositional logic?

a) Modus Ponens b) Modus Tollens

c) Simplification d) Disjunctive Syllogism

4. Which rule of inference allows you to conclude that if "A implies B" is true and "B implies C" is
true, then "A implies C" is also true?

a) Modus Ponens b) Hypothetical Syllogism

c) Disjunctive Syllogism d) Modus Tollens

5. In propositional logic, what is the rule of inference that allows you to infer the negation of the
conclusion if you know the negation of the consequent in a conditional statement?

a) Modus Ponens b) Modus Tollens

c) Simplification d) Contradiction

6. In propositional logic, which of the following is a tautology?

a) p ∨ ~ p b) p ∧ ~ p

c) p ⊕ ~ p d) p → ~ p

7. If p is true and q is false, what is the truth value of the expression (p ∧ ~q)?

a) True b) False

c) Undefined d) Cannot be determined


8. Which logical operator represents the exclusive or (XOR) in propositional logic?

a) ∧ (Conjunction) b) ∨ (Disjunction)

c) ⊕ (Exclusive Or) d) ¬ (Negation)

9. If you have the statements "p ∧ q" and "¬q," which rule of inference allows you to conclude "p"?

a) Modus Ponens b) Modus Tollens

c) Simplification d) Hypothetical Syllogism

10. Which of the following logical equivalences is known as De Morgan's law in propositional logic?

a) ¬(p ∧ q) ≡ ¬p ∧ ¬q b) ¬(p ∨ q) ≡ ¬p ∨ ¬q

c) ¬(p → q) ≡ ¬p → ¬q d) ¬(p ⊕ q) ≡ ¬p ⊕ ¬q

11. In predicate logic, what is the role of quantifiers like "∀" and "∃"?

a) They represent logical operations. b) They represent logical equivalence.

c) They represent variable names. d) They represent quantification over variables.

12. Which of the following is an example of a universal quantification statement?

a) "There exists a number x such that x > 5." b) "For every student s, s studies diligently."

c) "Either A or B is true." d) "If p is true, then q is true."

13. In predicate logic, what does the symbol "→" represent?

a) Disjunction b) Conjunction

c) Implication d) Negation

14. Which of the following is an example of a predicate in predicate logic?

a) "∧" b) "∃x (x > 5)"

c) "∨" d) "∀x (Px → Qx)"

15. What is the purpose of quantifying variables in predicate logic?

a) To represent logical constants. b) To make statements more complex.

c) To specify the scope of variables. d) To eliminate the need for variables.

16. Which rule of inference allows you to conclude that "If it is not raining, then the ground is not
wet"?

a) Modus Ponens b) Modus Tollens

c) Hypothetical Syllogism d) Simplification

17. What is the conclusion of the rule of inference known as "Modus Ponens" given the premises "If
it is sunny, then Jane goes for a walk" and "It is sunny"?

a) Jane goes for a walk b) Jane does not go for a walk

c) It is not sunny d) Not enough information to conclude


18. Which rule of inference is used to make conclusions from a conjunction in discrete mathematics?

a) Modus Ponens b) Modus Tollens

c) Simplification d) Disjunctive Syllogism

19. In discrete mathematics, if you have the premises "If A, then B" and "If B, then C," which rule of
inference allows you to conclude "If A, then C"?

a) Modus Ponens b) Modus Tollens

c) Hypothetical Syllogism d) Conjunction

20. What is the rule of inference that allows you to infer the negation of the conclusion when you
know the antecedent and the negation of the consequent in a conditional statement?

a) Modus Ponens b) Modus Tollens

c) Simplification d) Disjunctive Syllogism

Subjective

Q:1. Let p and q be the propositions where p : You drive over 65 miles per hour. q : You get a speeding
ticket. [10 Marks]

Write these propositions using p and q and logical connectives (including negations).

a) You do not drive over 65 miles per hour.

b) You drive over 65 miles per hour, but you do not get a speeding ticket.

c) You will get a speeding ticket if you drive over 65 miles per hour.

d) If you do not drive over 65 miles per hour, then you will not get a speeding ticket.

e) Driving over 65 miles per hour is sufficient for getting a speeding ticket

Q:2. Let p, q, and r be the propositions, p : Grizzly bears have been seen in the area. q : Hiking is safe on
the trail. r : Berries are ripe along the trail. [10 Marks]

Write these propositions using p, q, and r and logical connectives (including negations).

a) Grizzly bears have not been seen in the area and hiking on the trail is safe, but berries are ripe along
the trail.

b) If berries are ripe along the trail, hiking is safe if and only if grizzly bears have not been seen in the
area.

c) It is not safe to hike on the trail, but grizzly bears have not been seen in the area and the berries along
the trail are ripe.
d) For hiking on the trail to be safe, it is necessary but not sufficient that berries not be ripe along the
trail and for grizzly bears not to have been seen in the area.

e ) Hiking is not safe on the trail whenever grizzly bears have been seen in the area and berries are ripe
along the trail.

Q:3. Construct a truth table for each of these compound propositions. [10 Marks]

a) (p ↔ q) ∨ (¬q ↔ r) b) (¬p ↔ ¬q) ↔ (q ↔ r)

Q:4. Following given questions relate to inhabitants of an island on which there are three kinds of
people: [10 Marks]

knights who always tell the truth, knaves who always lie, and spies (called normals by Smullyan [Sm78])
who can either lie or tell the truth. You encounter three people, A, B, and C. You know one of these
people is a knight, one is a knave, and one is a spy. Each of the three people knows the type of person
each of other two is.

For each of these situations, if possible, determine whether there is a unique solution and determine
who the knave, knight, and spy are. When there is no unique solution, list all possible solutions or state
that there are no solutions.

a) A says “I am the knight,” B says “I am the knave,” and C says “B is the knight.”
b) A says “I am not the spy,” B says “I am not the spy,” and C says “I am not the spy.”

Q:5. Translate each of these statements into logical expressions in three different ways by varying the
domain and by using predicates with one and with two variables. [10 Marks]

a) A student in your school has lived in Vietnam.


b) There is a student in your school who cannot speak Hindi.
c) A student in your school knows Java, Prolog, and C++.
d) Everyone in your class enjoys Thai food.
e) Someone in your class does not play hockey.

Q:6. What rule of inference is used in each of these arguments? [10 Marks]

a) Alice is a mathematics major. Therefore, Alice is either a mathematics major or a computer


science major.
b) Jerry is a mathematics major and a computer science major. Therefore, Jerry is a
mathematics major.
c) If it is rainy, then the pool will be closed. It is rainy. Therefore, the pool is closed.
d) If it snows today, the university will close. The university is not closed today. Therefore, it did
not snow today.
e) If I go swimming, then I will stay in the sun too long. If I stay in the sun too long, then I will
sunburn. Therefore, if I go swimming, then I will sunburn

Q:7. a) Prove or disprove that the product of two irrational numbers is irrational. [5 Marks]

b) Prove that if n is a positive integer, then n is odd if and only if 5n + 6 is odd. [5 Marks]

Q:8. Graph Portion [10 Marks]

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy