GATE CSE 2005 | GATE CSE Year Wise Previous Years Questions

GATE CSE 2005

MCQ (Single Correct Answer)

-0.6

What is the first order predicate calculus statement equivalent to the following?
Every teacher is liked by some student

$$\forall \left( x \right)\left[ {teacher\left( x \right) \to \exists \left( y \right)\left[ {student\left( y \right) \to likes\left( {y,\,x} \right)} \right]} \right]$$

$$\forall \left( x \right)\left[ {teacher\left( x \right) \to \exists \left( y \right)\left[ {student\left( y \right) \wedge likes\left( {y,\,x} \right)} \right]} \right]$$

$$\exists \left( y \right)\forall \left( x \right)\left[ {teacher\left( x \right) \to \left[ {student\left( y \right) \wedge likes\left( {y,x} \right)} \right]} \right]$$

$$\forall \left( x \right)\left[ {teacher\left( x \right) \wedge \exists \left( y \right)\left[ {student\left( y \right) \to likes\left( {y,\,x} \right)} \right]} \right]$$

GATE CSE 2005

MCQ (Single Correct Answer)

-0.3

What is the swap space in the disk used for?

Saving temporary html pages

Saving process data

Storing the super-block

Storing device drivers

GATE CSE 2005

MCQ (Single Correct Answer)

-0.6

Suppose n processes, P₁,......., P_n share m identical resource units, which can be reserved and released one at a time. The maximum resource requirement of process P_i is S_i, where S_i > 0. Which one of the following is a sufficient condition for ensuring that deadlock does not occur?

$$\forall i,{s_i} < m$$

$$\forall i,{s_i} < n$$

$$\sum\limits_{i = 1}^n {{s_i}} < \left( {m + n} \right)$$

$$\sum\limits_{i = 1}^n {{s_i}} < \left( {m \times n} \right)$$

GATE CSE 2005

MCQ (Single Correct Answer)

-0.6

Consider a disk drive with the following specifications:
$$16$$ surfaces, $$512$$ tracks/surface, $$512$$ sectors/track, $$1$$KB/Sector, rotation speed $$3000$$ rpm. The disk is operated in cycle stealing mode whereby whenever one $$4$$ byte word is ready it it's sent to memory; similarly, for writing, the disk interface reads a $$4$$ byte word from the memory in each $$DMA$$ cycle Memory cycle time is $$40$$nsec. The maximum percentage of time that the $$CPU$$ gets blocked during $$DMA$$ operation is:

$$10$$

$$25$$

$$40$$

$$50$$

PREVIOUS NEXT

GATE CSE Papers

2024