## Discussion Forum

Interative Forum for discussing any query literally to UGC-NET Computer Science, GATE Computer Science and Computer Sciene and Technology in general.

## UGC-NET Computer Science

Correspondence Courses and Test Series to prepare for UGC-NET computer science and applications

## GATE

MCQs, Lecture Notes, Ebooks for GATE preparation

## Jobs Newsfeed

Timely information of various Recruitments.

NextPrev

## Solved Questions Paper-2 UGC-NET Computer Science July 2016

 1. how many different equivalence relations with exactly three different equivalence classes are there on a set with five elements A. 10 B. 15 C. 25 D. 30 View/Hide Ans Explanation 2. The number of different spanning trees in complete graph, K4 and bipartite graph, K2,2 have ____ and ____ respectively. A. 14,14 B. 16,14 C. 16,4 D. 14,4 View/Hide Ans Explanation 3. Suppose that R1 and R2 are reflexive relations on a set A. Which of the following statements is correct ? A. R1 ∩R2 is Reflexive and R1 ∪R2 is irreflexive B. R1 ∩R2 is irReflexive and R1 ∪R2 is reflexive C. Both R1 ∩R2 and R1 ∪R2 are reflexive D. Both R1 ∩R2 and R1 ∪R2 are irreflexive View/Hide Ans Explanation 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 ? A. 3/4 B. 2/3 C. 1/2 D. 1/3 View/Hide Ans Explanation 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. A. 2 B. 4 C. 5 D. 6 View/Hide Ans Explanation 6. Which of the following logic expressions is incorrect ? A. 1⊕0 = 1 B. 1⊕1⊕1 = 1 C. 1⊕1⊕0 = 1 D. 1⊕1 = 0 View/Hide Ans Explanation 7. The IEEE-754 double precision format to represent floating point numbers, has a length of _____ bits. A. 16 B. 32 C. 48 D. 64 View/Hide Ans Explanation 8. The Simplified form of a Boolean equation for the following truth table is A. F = yz' + y'z B. F = xy' + x'y C. F = x'z + xz' D. F = X'z + xz' + xyz View/Hide Ans Explanation 9. The Simplified form of a Boolean equation (AB'+AB'C+Ac)(A'C' +B') is A. AB' B. AB'C C. A'B D. ABC View/Hide Ans Explanation 10. In a Positive edge triggered JK flip-flop, if J and K both are high then the output will be _______ on the rising edge of the clock. A. No Change B. Set C. Reset D. Toggle View/Hide Ans Explanation

Author Does Not claim of any answer these answers are as per expert opinion

Pages: 1 2 3 4 5