Thanks sir for informing. I will update it.
30 Mar 2020 - 12:40am
The related question has been discussed here:
8 Jul 2019 - 7:00pm
We are working on the same.
25 Jan 2019 - 8:58pm
Solution updated.
24 Sep 2018 - 11:23am
Gaurav, as per GATE standard such statements are not required.
Apart from Preposition and First order logic, there are Temporal logic, Second Order logic and Fuzzy logic, that are not in GATE syllabus. You will study these things in Masters.
If you want to go deeper, there is advance method named Resolution Refutation that works for such statements.
16 Sep 2018 - 6:58pm
let's assume the following:
speed of slowest runner = x m/m
speed of fastest runner = 2x m/m
fastest runner will run with a relative speed of 2x - x = x with respect to slowest runner.
They meet after 6th minute. That means this is the 2nd round of fastest runner and it's the 1st round of slowest runner.
so the relative distance covered by fastest runner in 6 minutes will be 400m with respect to slowest runner.
we know, distance = speed * time
400 = x * 6
x = 400/6.
Hence speed of fastest runner = 2 x = 400 / 3.
Hence time taken to cover 1600 metres:
time = distance / speed
time = 1600/ (400/3)
time = 12 minutes.
30 Jan 2018 - 12:13am
You need to unsort as per given in the question. It's for every element.
29 Jan 2018 - 3:41pm

c stands for Complement here.

13 Jan 2018 - 9:02pm

@vikash957 at x= -3, function is not defind ( devide by zero).

13 Jan 2018 - 4:36am

There few grammars where you can not remove ambiguity by applying anything.
An example of an inherently ambiguous language is the union of \{a^{n}b^{m}c^{m}d^{n}|n,m>0\} with \{a^{n}b^{n}c^{m}d^{m}|n,m>0\}. This set is context-free, since the union of two context-free languages is always context-free. But it is  proved that there is no way to unambiguously parse strings in the (non-context-free) common subset \{a^{n}b^{n}c^{n}d^{n}|n>0\}.

11 Jan 2018 - 11:12am