1
GATE CSE 2014 Set 1
MCQ (Single Correct Answer)
+1
-0.3
Consider the statement
"Not all that glitters is gold"
Predicate glitters$$(x)$$ is true if $$x$$ glitters and
predicate gold$$(x)$$ is true if $$x$$ is gold.

Which one of the following logical formulae represents the above statement?

A
$$\forall x:\,glitters\,\left( x \right) \Rightarrow \neg gold\left( x \right)$$
B
$$\forall x:\,gold\left( x \right) \Rightarrow glitters\left( x \right)$$ v
C
$$\exists x:\,gold\left( x \right) \wedge \neg glitters\left( x \right)$$
D
$$\exists x:\,glitters\,\left( x \right) \wedge \neg gold\left( x \right)$$
2
GATE CSE 2014 Set 1
MCQ (Single Correct Answer)
+2
-0.6
A function $$f(x)$$ is continuous in the interval $$\left[ {0,2} \right]$$. It is known that $$f(0)$$ $$=$$ $$f(2)$$ $$= -1$$ and $$f(1)$$ $$ = 1$$. Which one of the following statements must be true?
A
There exists $$a$$ $$y$$ in the interval $$(0, 1)$$ such that $$f(y) = $$ $$f(y+1)$$
B
For every $$y$$ in the interval $$(0, 1)$$, $$f(y)$$ $$=$$ $$f(2 - y)$$
C
The maximum value of the function in the interval $$(0,2)$$ is $$1$$
D
There exists $$a$$ $$y$$ in the interval $$(0,1)$$ such that $$f(y)$$ $$=-$$$$f(2-y)$$
3
GATE CSE 2014 Set 1
Numerical
+2
-0
A pennant is a sequence of numbers, each number being 1 or 2. An n-pennant is a sequence of numbers with sum equal to n. For example, (1,1,2) is a 4-pennant. The set of all possible 1-pennants is {(1)}, the set of all possible 2-pennants is {(2), (1,1)} and the set of all 3-pennants is {(2,1),(1,1,1), (1,2)}. Note that the pennant (1,2) is not the same as the pennant (2,1). The number of 10-pennants is _________.
Your input ____
4
GATE CSE 2014 Set 1
Numerical
+1
-0
Suppose a disk has 201 cylinders, numbered from 0 to 200. At some time the disk arm is at cylinder 100, and there is a queue of disk access requests for cylinders 30, 85, 90, 100, 105, 110, 135 and 145. If Shortest-Seek Time First (SSTF) is being used for scheduling the disk access, the request for cylinder 90 is serviced after servicing ____________ number of requests.
Your input ____