WorksheetsPMIST-Discrete Mathematical Structures MCQs – U24MA203
Total questions: 50
Worksheet time: 25mins
Which of the following is a tautology?
p ∧ ¬p
p ∨ ¬p
p ⇒ q
¬p ∧ q
What is the negation of the statement p ∨ q?
¬p ∧ ¬q
¬p ∨ ¬q
p ∧ q
¬p ∨ q
Which connective represents 'if and only if' in logic?
∧
∨
→
↔
The dual of p ∧ (q ∨ r) is:
p ∨ (q ∧ r)
p ∧ (q ∧ r)
¬p ∨ ¬(q ∧ r)
¬p ∧ ¬(q ∨ r)
What is a well-formed formula?
A Formula with no connectives
Balanced parentheses and valid syntax
any statement including connectives
none of the above
Truth tables are primarily used to determine:
Number of propositions
Truth value of a compound statement
Notation of logic
Negation of statements
Which law states that p ∨ q ≡ ¬(¬p ∧ ¬q)?
Distributive
De Morgan’s
Associative
Commutative
The conditional statement p ⇒ q is logically equivalent to:
¬p ∨ q
p ∧ ¬q
¬q ⇒ ¬p
q ⇒ p
Disjunctive normal form means:
Conjunction of disjunctions
Disjunction of conjunctions
Negation of formulas
None of the above
Truth table value of p ∧ (p ∨ q) when p is true and q is false?
True
False
Undefined
The power set of {a,b} contains how many elements?
2
3
4
8
Which operation corresponds to A ∩ B?
Union
Intersection
Complement
Cartesian product
What is the Cartesian product A × B if A={1,2} and B={x,y}?
(1,2), (x,y)
(1,x), (1,y), (2,x), (2,y)
{1,2,x,y}
(x,1), (y,2)
Which is true?
A ⊆ A
A ⊆ ∅
∅ ⊆ A
Both a and c
The complement of the universal set U is:
U
∅
Uc
The power set of set S always contains:
S itself
The empty set
Both a and b
Only subsets of size 1
Using Venn diagrams, area representing A ∪ B:
Only A
Only B
A, B or both
Outside A and B
If A = {1,2}, B = {2,3}, what is A ∪ B?
{1,2}
{2,3}
{1,2,3}
{1,3}
An n-tuple is:
Unordered collection
Set with repeats
Ordered n elements
None
Principle of specification restricts:
Size of set
Formation by predicates
Basic operations
None
A relation from A to B is a subset of:
A
B
A × B
None
Which is NOT a binary relation property?
Reflexivity
Transitivity
Commutativity
Symmetry
The relation matrix represents:
Membership
Properties
Elements and relation
None
The relation 'is equal to' is:
Equivalence
Partial order
Compatibility
None
Partial ordering means:
Reflexive, antisymmetric, transitive
Reflexive, symmetric, transitive
Irreflexive
None
Which relation partitions into equivalence classes?
Reflexive only
Symmetric only
Equivalence
Partial order
Composition of R and S is:
R ∪ S
R ∩ S
{ (a,c) | ∃b, (a,b) ∈ R ∧ (b,c) ∈ S }
None
A partially ordered set is a:
Lattice
Poset
Group
None
Compatibility relations ensure:
Related to itself
If aRb, a and b compatible
Symmetry
None
Antisymmetric relation example:
Equality
Strict inequality
Subset relation
Both a and c
Which of the following does a graph consist of?
Vertices only
Edges only
Vertices and edges
None
In an Eulerian graph, every vertex has:
Even degree
Odd degree
Degree 1
Degree 0
What is a Hamiltonian path?
Visits every vertex once
Visits each edge once
Cycle without repetition
None
Traveling Salesman Problem relates to:
Euler paths
Shortest Hamiltonian cycle
Connected components
None
NOT a walk type:
Path
Circuit
Tour
Cycle
A connected graph has:
Isolated vertex
Path between every pair
Edge removal from graph:
Deletion
Contraction
Subdivision
None
Subgraphs contain:
All vertices/edges
Some vertices/edges
Only isolated vertices
None
Euler’s formula for planar graphs:
V - E + F = 2
V + E = F
E - V + F = 0
None
Operation merging two vertices by edge:
Deletion
Contraction
Subdivision
None
A tree is:
Connected graph with cycles
Connected acyclic graph
disconnected graph
none
Pendant vertices are:
Degree 1
Degree 2
Connected to all
None
The center of a tree is:
Minimize max distance
Highest degree
Root vertex
None
Rooted trees differ:
Special root vertex
Have cycles
Disconnected
None
Spanning trees of complete graph K_n:
nn−2
n!
2n
None
Kruskal's algorithm finds:
Eulerian paths
Minimal spanning trees
Detect cycles
Hamiltonian cycles
Weighted graph shortest spanning tree:
Min total weight
Max edges
Max weight sum
None
A binary tree has:
At most 2 children
2 parents
No children
None
Fundamental circuit is formed by:
Add edge to spanning tree
Remove edge
Cycle
None
Distance in a tree:
# edges in shortest path
Sum of degrees
# vertices
None
