Discrete Mathematics MCQs (Part-4)

What is the main property of a bipartite graph?

A Vertices are divided into two sets
B Contains multiple edges
C All edges are directed
D Contains cycles

Which of the following is the correct formula for the number of edges in a complete graph with n vertices?

A n² – 1
B n(n+1)/2
C n(n-1)/2
D

What is the result of a set intersection?

A Difference between sets
B All elements in A
C All elements in both sets
D Common elements of sets

What is the value of the expression: (A OR B) AND (NOT A)?

A NOT A
B B
C A
D A AND B

What is the degree of a vertex in a graph?

A Length of edges
B Number of edges
C Number of paths
D Number of adjacent vertices

Which of the following is true for a tree in graph theory?

A It is a connected graph with no cycles
B It contains exactly one cycle
C It is a disconnected graph
D It contains cycles

What is the characteristic of a recurrence relation?

A Describes paths in graphs
B Defines sets of values
C Defines terms by previous terms
D Solves linear equations

What is the Boolean expression for “NOT A AND (B OR C)”?

A (NOT A OR B) AND C
B (NOT A) AND (B OR C)
C A AND (B OR C)
D (NOT A) AND B AND C

In graph theory, what is the concept of an Eulerian path?

A A path that visits every edge exactly once
B A cycle that visits every vertex
C A path with no cycles
D A path that visits every vertex

What is the result of a logical NOR operation?

A True if both inputs are true
B True if any input is true
C False if any input is true
D False if both inputs are false

In combinatorics, how many ways can 3 objects be arranged in a row?

A 6
B 3!
C 9
D 3

Which operation is used to combine two sets to form a new set of all distinct elements?

A Difference
B Complement
C Union
D Intersection

What is the primary characteristic of a directed acyclic graph (DAG)?

A All vertices are connected
B Contains cycles
C Edges have no direction
D Edges have a direction

What is the result of the set difference A – B?

A Elements in A but not in B
B Elements in B but not in A
C Elements in neither A nor B
D Elements in both A and B

Which of the following is true for a complete bipartite graph K₍ₘ,ₙ₎?

A It contains exactly m edges
B It contains no edges
C Every vertex is connected to every other vertex
D Vertices are divided into two disjoint sets