GATE CSE 2020 National Champion Quiz: Discrete Maths (App update required to attempt this test)
Attempt now to get your rank among 267 students!
Question 1
1)
2)
3)
4)
Question 2
(a) The maximum number of edges in a bipartite graph with 10 vertices is 28.
(b) The maximum number of edges in a bipartite graph with 24 vertices is 143.
(c) The minimum number of edges in a complete bipartite graph with 10 vertices is 9.
(d) Every bipartite graph is 2 colorable.
The number of correct statements is _______________?
Question 3
Question 4
Question 5
Question 6
Question 7
Statement 1. G is bipartite and G is a 2 colorable and every cycle in G is even cycle. All these statements are equivalent.
Statement 2. If Dirac’s theorem and ore’s theorem is initially satisfied in graph then it is not hamiltonion graph.
Statement 3. Cycle graph do not contain articulation points.
Number of statement which are correct.
Question 8
Question 9
Now, consider the statement “There is a woman who has taken a flight on every airline in the world.”
Which of the following options best represent the above English statement into mathematical statement.
Question 10
P(x) : x is a professor
R(x) : x is vain
Q(x) : x is ignorant
Now consider the following two predicates :
S1 : denotes "All ignorant professors are vain. "
S2 : denotes "If a professor is ignorant then that professor is vain "
Which option is correct regarding the above two statements ?
Question 11
∀𝑥 [(∀𝑧 𝑧|𝑥⇒((𝑧=𝑥)∨(𝑧=1)))⇒∃𝑤 (𝑤>𝑥)∧(∀𝑧 𝑧|𝑤⇒((𝑤=𝑧)∨(𝑧=1)))]
Here ‘a|b’ denotes that ‘a divides b’, where a and b are integers. Consider the following sets:
S1 {1,2,3,…,100}
S2 Set of all positive integers
S3 Set of all integers
Which of the above sets satisfy 𝜑?
Question 12
- 267 attempts
- 0 upvotes
- 1 comment