## UGC NET Computer Science : June 2012 – Paper 3 (Solved Papers)

Question 1 |

The feasible region represented by the constraints

x1–x2<=1, x1+x2>=3, x1>=0, x2>=0of the objective function

Max Z=3x1+2x2is

A polygon | |

Unbounded feasible region | |

A point | |

None of these |

Question 2 |

The color of an object is largely determined by its diffuse reflection coefficient. If Kd = (0.8, 0.4, 0), then what shall be the colour of the object, if the light used is blue and magenta ?

Red and Blue | |

White and Red | |

Black and Red | |

Black and White |

Question 3 |

If an instruction takes ‘i’ microseconds and a page fault takes an additional ‘j’ microseconds. The effective instruction time, if on the average a page fault occurs every k instructions, is

(i + j ) / k | |

i + j / k | |

(i + j) * k | |

i + j * k |

Question 4 |

In any simplex table, if corresponding to any negative Dj, all elements of the column are negative or zero, the solution under the test is

alternative solution | |

non-existing solution | |

unbounded solution | |

degenerate solution |

Question 5 |

How many relations are there on a set with n elements that are symmetric and a set with n elements that are reflexive and symmetric ?

2 ^{n(n+1)/2} and 3^{n(n–1)/2} | |

3 ^{n(n–1)/2} and 2^{n(n–1)} | |

2 ^{n(n+1)/2} and 2^{n(n–1)/2} | |

2 ^{n(n+1)/2} and 2^{n.3n(n–1)/2} |