UGC NET Paper II (10 July 2016) Part 1
This quiz consists of the UGC NET questions of paper 2 of Computer Science and Applications conducted on 10 July 2016. This quiz is helpful for aspiring candidates of UGC NET and other competitive exams.
Congratulations  you have completed .
You scored %%SCORE%% out of %%TOTAL%%.
Your performance has been rated as %%RATING%%
Your answers are highlighted below.
Question 1 
How many different equivalence relations with exactly three different equivalence classes are there on a set with five elements?
\(10\)  
\(15\)  
\(25\)  
\(30\) 
Question 2 
The number of different spanning trees in complete graph, \(K_4\) and bipartite graph, \(K_{2, 2}\) have ______ and _______ respectively.
\(14, 14\)  
\(16, 14\)  
\(16, 4\)  
\(14, 4\) 
Question 3 
Suppose that \(R_1\) and \(R_2\) are reflexive relations on a set \(A\). Which of the following statements is correct ?
\(R_1 \cap R_2\) is reflexive and \(R_1 \cup R_2\) is irreflexive.  
\(R_1 \cap R_2\) is irreflexive and \(R_1 \cup R_2\) is reflexive.  
Both \(R_1 \cap R_2\) and \(R_1 \cup R_2\) are reflexive.  
Both \(R_1 \cap R_2\) and \(R_1 \cup R_2\) are irreflexive.

Question 4 
There are three cards in a box. Both sides of one card are black, both sides of one card are red, and the third card has one black side and one red side. We pick a card at random and observe only one side. What is the probability that the opposite side is the same colour as the one side we observed?
\(\frac{3}{4}\)  
\(\frac{2}{3}\)  
\(\frac{1}{2}\)  
\(\frac{1}{3}\) 
Question 5 
A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How many cliques are there in the graph shown below?
\(2\)  
\(4\)  
\(5\)  
\(6\) 
Question 6 
Which of the following logic expressions is incorrect?
\( 1 \oplus 0 = 1\)  
\( 1 \oplus 1 \oplus 1 = 1\)  
\( 1 \oplus 1 \oplus 0 = 1\)  
\( 1 \oplus 1 = 0\) 
Question 7 
The IEEE754 doubleprecision format to represent floating point numbers, has a length of _____ bits.
\(16\)  
\(32\)  
\(48\)  
\(64\) 
Question 8 
Simplified Boolean equation for the following truth table is:
\(F = y \overline z + \overline y z\)  
\(F = x \overline y + \overline x y\)  
\(F = \overline x z + x \overline z\)  
\(F = \overline x z + x \overline z + xyz\) 
Question 9 
The simplified form of a Boolean equation \((A\overline B + A\overline B C + AC)(\overline A \overline C + \overline B)\) is :
\(A \overline B\)  
\(A \overline B C\)  
\(\overline A B\)  
\(ABC\) 
Question 10 
In a positiveedgetriggered JK flipflop, if J and K both are high then the output will be _____ on the rising edge of the clock.
No change  
Set  
Reset  
Toggle 
Once you are finished, click the button below. Any items you have not completed will be marked incorrect.
There are 10 questions to complete.
Part 2 Part 3 Part 4 Part 5