UGC NET Computer Science Paper II Solved Question Paper

UGC NET Computer Science June 2015 solved question paper, Answer Key are available here. You can also download the pdf of UGC NET computer science solved papers from here.
1. How many strings of 5 digit have the property that the sum of their digits is 7 ?
[A] 66
[B] 330
[C] 495
[D] 99
Loading...
2. Consider an experiment of tossing two fair dice, one black and one red. What is the probability that the number on the black die divides the number on red die ?
[A] 22/36
[B] 12/36
[C] 14/36
[D] 6/36
Loading...
3. In how many ways can 15 indistinguishable fish be placed into 5 different ponds, so that each pond consist atleast one fish ?
[A] 1001
[B] 3876
[C] 775
[D] 200
Loading...
4. Consider the following statements:

(a) Depth-first search is used to traverse a rooted tree
(b) Pre-order, Post-order and Inorder are used to list the vertices of an ordered rooted tree.
(c) Huffman's algorithm is used to find an optimal binary tree with given weights.
(d) Topological sorting provides a labelling such that the parents have larger labels than their children.

Which of the above statements are true ?
[A] (a) and (b)
[B] (c) and (d)
[C] (a), (b) and (c)
[D] (a), (b), (c) and (d)
Loading...
5. Consider the Hamiltonian Graph (G) with no loops and parallel edges. Which of the following is true with respect to this graph (G) ?

deg(v) ≥ n/2 for each vertex of G
|E(G)| ≥ 1/2 (n-1)(n-2) + 2 edges
deg(v) + deg(w) ≥ n for every v and w not connected by an edge
[A] (a) and (b)
[B] (b) and (c)
[C] (a) and (c)
[D] (a), (b) and (c)
Loading...
6. Consider the following statements:

(a) Boolean expression and logic networks correspond to labelled acyclic digraphs.
(b) Optimal boolean expression may not correspond to simplest networks
(c) Choosing essential blocks first in a Karnaugh map and then greedily choosing the largest remaining blocks to cover may not give an optimal expression.

Which of these statement(s) is/are correct ?
[A] (a) only
[B] (b) only
[C] (a) and (b)
[D] (a), (b) and (c)
Loading...
7. Consider a full-adder with the following input values:

(a) x=1, y=0 and Ci(carry input) = 0
(b) x=0, y=1 and Ci =1

Compute the values of S(sum) and C0(carry output) for the above input values.
[A] S=1, CO=0 and S=0, C = 1
[B] S=0, C0 = 0 and S =1, C0 =1
[C] S = 1, C0 = 1 and S = 0, C0 = 0
[D] S = 0, C0 = 1 and S = 1, C0 = 0
Loading...
8. "If my computations are correct and I pay the electric bill, then i will run out of money. If i don't pay the electric bill, the power will be turned off. Therefore, if I don't run out of money and power is still on, then my computations are incorrect"

Convert this argument into logical notation using the variables c,b,r,p for propositions of computations, electric bills, out of money and power respectively. where ~ means NOT)
[A] if (c^b) ~ r and ~b -> ~p, then (~r ^ p) -> ~c
[B] if (cvb) -> r and ~b -> ~p, then (r^p) -> c
[C] if (c^b) -> r and ~p -> ~b, then (~rvp) -> ~c
[D] if(cvb) -> r and ~b -> ~p, then (~r^p) -> ~c
Loading...
9. Match the Following:






























List I
List II
(a) (p->q) <=> (~q -> ~p) (i) Contrapositive
(b) [(p^q)->r]<=>[p->(q->r)] (ii) Exportation law
(c) (p->q) <=> [(p^~q) ->0] (iii) Reductio ad absurdum
(d) (p<->q) <=> [(p->q)^(q->p)] (iv) Equivalence

      (a)   (b)     (c)    (d)
(1)  (i)   (ii)   (iii)  (iv)
(2)  (ii)  (iii)  (i)    (iv)
(3)  (iii)  (ii)  (iv)   (i)
(4)  (iv)   (ii)  (iii)  (i)
[A] A
[B] B
[C] C
[D] D
Loading...
10. Consider a proposition  given as :
"x≥6, if x2≥25 and its proof as:
if x≥6, then x2=x.x≥6.6=36≥25
Which of the following is correct w.r.to the given proposition and its proof ?

The proof shows the converse of what is to be proved
The proof stats by assuming what is to be shown
The proof is correct and there is nothing wrong
[A] (a) only
[B] (c) only
[C] (a) and (b)
[D] (b) only
Loading...
Are these questions helpful for you?

Comments: (Your feedback is valuable to us)

manpreet 4 years ago Reply

How to solve question no. 13 please explain it sir...