UGC – NET Computer Science June 2012 Question Paper– Paper – III
UGC – NET Computer Science June 2012 Question Paper– Paper – III Read More »
UGC – NET Computers Previous Papers
UGC – NET Computer Science June 2012 – Paper – II
1. The postfix expression AB + CD – * can be evaluated using a 2. The post order traversal of a binary tree is DEBFCA. Find out the pre-order traversal. 3. The branch logic that provides making capabilities in the control unit is known as 4. The number of colours required to properly colour the
UGC – NET Computer Science June 2012 – Paper – II Read More »
UGC – NET Computer Science December 2011 – Paper – II
1. Which of the following data structure is Non – linear type? 2. The total number of comparisons in a bubble sort is 3. Which of the following is a bad example of recursion? 4. Domain and Range of the function 5. Maximum number of edges in a n-Node undirected graph without self loop is
UGC – NET Computer Science December 2011 – Paper – II Read More »
UGC – NET Computer Science June 2011 – Paper – II
1. Any integer composed of 3n identical digits divisible by 2. The circumference of the two concentric disks are divided into 100 sections each. For the outer disk, 100 sections each. For the outer disk, 100 of the sections are painted red and 100 of the section are painted blue. for the inner disk, the
UGC – NET Computer Science June 2011 – Paper – II Read More »
UGC – NET Computer Science December 2010 – Paper – II
1. The number of integers between 1 and 250 that are divisible by 2,5 and 7 is 2. An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices are 3. A partially ordered set is said to be a lattice if every two elements in the set have
UGC – NET Computer Science December 2010 – Paper – II Read More »
UGC – NET Computer Science June 2010 – Paper-II
1 . “x1 is a clone of x” means x1 is identical to x in terms of the physical attributes namely, height, weight and complexion. Given height, weight and complexion only form a complete set of attributes for an entity, cloning is an equivalence relation. What is your impression about this statement ? 2. ‘R
UGC – NET Computer Science June 2010 – Paper-II Read More »
UGC – NET Computer Science December 2009 – Paper-II
1. If she is my friend and you are her friend, then we are friends. Given this, the friend relationship in this context is __.(i) commutative (ii) transitive (iii) implicative (iv) equivalence 2. Circle has____ 3. If in an error detection and correction code a message M: “You are good students” is stored as M’
UGC – NET Computer Science December 2009 – Paper-II Read More »
UGC – NET Computer Science June 2009 – Paper – II
1. If x and y are independent Gaussian random variables with average value 0 and with same variance, their joint probability density function is given by: 2. In order that a code is ‘t’ error correcting, the minimum Hamming distance should be: 3. The Boolean expression is equivalent to: 4. The characteristic equation of a
UGC – NET Computer Science June 2009 – Paper – II Read More »