GATE | GATE-CS-2007 | Question 85
Let Graph(x) be a predicate which denotes that x is a graph. Let Connected(x) be a predicate which denotes that x is connected. Which of the following first order logic sentences DOES NOT represent the statement: “Not every graph is connected”?
Explanation: Option A and option C are same G(x)–>C(x) can also be written as ~G(x) or C(x), and they are the correct representation.
Option C says :There exists a graph and graph is not connected ,which is equivalent to given sentence.
Option D: Every x which is graph is not connected.
Option D is correct choice
Quiz of this Question
Attention reader! Don’t stop learning now. Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.
Learn all GATE CS concepts with Free Live Classes on our youtube channel.