1.

How many committees of five people can be chosen from 20 men and 12 women such that each
committee contains at least three women?
(A) 75240

(B) 52492

(C) 41800

(D) 9900

Answer: B
Explanation:
We must choose at least 3 women, so we calculate the case of 3 women, 4 women and 5 women and by
addition rule add the results.
12

C3 x 20C2 + 12C4 x 20C1 + 12C5 x 20C0 = (12x11x10/3x2x1) x (20x19/2x1)

+ (12x11x10x9/4x3x2x1) x 20
+ (12x11x10x9x8/5x4x3x2x1) x 1
= 220 x 190 + 495 x 20 + 792
= 52492

2.

Which of the following statement(s) is/are false?

(a) A connected multigraph has an Euler Circuit if and only if each of its vertices has even degree.
(b) A connected multigraph has an Euler Path but not an Euler Circuit if and only if it has exactly two
vertices of odd degree.
(c) A complete graph (Kn) has a Hamilton Circuit whenever n3
(d) A cycle over six vertices (C6) is not a bipartite graph but a complete graph over 3 vertices is bipartite.
Codes:
(A) (a) only

(B) (b) and (c)

(C) (c) only

(D) (d) only

Answer: D
Explanation:
EulerCircuits
HamiltonCircuit
Bipartite Graph
From the above definitions, we can see that (d) is false. So answer is (D).
3.

Which of the following is/are not true?

(a) The set of negative integers is countable.
(b) The set of integers that are multiples of 7 is countable.
(c) The set of even integers is countable.
(d) The set of real numbers between 0 and 1/2 is countable.
(A) (a) and (c)

(B) (b) and (d)

(C) (b) only

(D) (d) only

Answer: D
4.

Consider the graph given below:

The two distinct sets of vertices, which make the graph bipartite are:
(A) (v1, v4, v6); (v2, v3, v5, v7, v8)

(B) (v1, v7, v8); (v2, v3, v5, v6)

(C) (v1, v4, v6, v7); (v2, v3, v5, v8)

(D) (v1, v4, v6, v7, v8); (v2, v3, v5)

Answer: C
Explanation:
A simple graph G=(V,E) is called bipartite if its vertex set can be partitioned into two disjoint subsets
V=V1V2, such that every edge has the form e=(a,b) where aV 1 and bV2.
Bipartite graphs are equivalent to two-colorable graphs.

1.

Assign Red color to the source vertex (putting into set V 1).

2.

Color all the neighbours with Black color (putting into set V2).

3.

Color all neighbours neighbour with Red color (putting into set V 1).

4.

This way, assign color to all vertices such that it satisfies all the constraints of m way coloring

problem where m = 2.
5. While assigning colors, if we find a neighbour which is colored with same color as current vertex, then
the graph cannot be colored with 2 colors (ie., graph is not Bipartite).
So answer is option (C).
5.

A tree with n vertices is called graceful, if its vertices can be labelled with integers 1, 2, ...,n such that the
absolute value of the difference of the labels of adjacent vertices are all different. Which of the following
trees are graceful?

Codes:
(A) (a) and (b)

(B) (b) and (c)

(C) (a) and (c)

(D) (a), (b) and (c)

Answer: D

From the above figure, we can see that (a), (b) and (c) are graceful.
6.

Which of the following arguments are not valid?

(a) If Gora gets the job and works hard, then he will be promoted. If Gora gets promotion, then he will be
happy. He will not be happy, therefore, either he will not get the job or he will not work hard.
(b) Either Puneet is not guilty or Pankaj is telling the truth. Pankaj is not telling the truth, therefore,
Puneet is not guilty.
(c) If n is a real number such that n>1, then n2>1. Suppose that n2>1, then n>1.
Codes:
(A) (a) and (c)

(B) (b) and (c)

(C) (a), (b) and (c)

(D) (a) and (b)

Answer: B
Explanation:
(a)

P: Gora gets the job

Q: Gora works hard

R: Gora gets promotion
S: Gora will be happy
The argument can bet written as
(PQ)R
RS
S
Therefore
(b)

Let

PQ
P: Puneet is not guilty
Q: Pankaj is telling the truth

The argument can bet written as

PQ
~Q
Therefore,

Thus by disjunctive syllogism, the argument is valid.

Disjunctive Syllogism:
The disjunctive syllogism rule may be written as:
PQ, P Q
It may also be written as:
((PQ)P)Q
where P, and Q are propositions expressed in some formal system.
7.

Let P(m,n) be the statement m divides n where the Universe of discourse for both the variables is the set
of positive integers. Determine the truth values of the following propositions.
(a) m n P(m,n)

(b) n P(1,n)

(c) m n P(m,n)

(A) (a)-True; (b)-True; (c)-False

(B) (a)-True; (b)-False; (c)-False

(C) (a)-False; (b)-False; (c)-False

(D) (a)-True; (b)-True; (c)-True

Answer: A
8.

Match the following terms:

List - I
(a) Vacuous proof

List - II
(i) A proof that the implication pq is true

based on the fact that p is false

(b) Trivial proof

(ii) A proof that the implication pq is true

based on the fact that q is true

(c) Direct proof

(iii) A proof that the implication pq is true

that proceeds by showing that q must be true when p is true.

(d) Indirect proof

(iv) A proof that the implication pq is true

that proceeds by showing that p must be false when q is false.

Codes:

(a) (b) (c)

(d)

(A) (i) (ii) (iii) (iv)

(B) (ii) (iii) (i) (iv)
(C) (iii) (ii) (iv) (i)
(D) (iv) (iii) (ii) (i)
Answer: A
9.

Consider the compound propositions given below as:

(a) p~(pq)

(b) (p~q)~(pq)

(c) p(qr)

Which of the above propositions are tautologies?

(A) (a) and (c)

(B) (b) and (c)

(C) (a) and (b)

(D) (a), (b) and (c)

Answer: Marks to all

Only (a)
10. Which of the following property/ies a Group G must hold, in order to be an Abelian group?
(a) The distributive property
(b) The commutative property
(c) The symmetric property
Codes:
(A) (a) and (b)

(B) (b) and (c)e

(C) (a) only

(D) (b) only

Answer: D
Part 1

Part 2

Part 3

Part 4

Part 5

Email ThisBlogThis!Share to TwitterShare to Facebook

Related Posts:

CBSE UGC NET Computer Science Paper III Solved December 2015 - Part
541.
Match the following in Unix file system : List - I
List - II (a) Boot block
(i)
Information abou Read More

CBSE UGC NET Computer Science Paper III Solved December 2015 - Part
761.
Consider the following three SQL queries (Assume the data in the people table) : (a) Select
Name from people where Age21; (b) Select N Read More

CBSE UGC NET Computer Science Paper III Solved December 2015 - Part
651.
Blind image deconvolution is ................ (A) Combination of blur identification and image
restoration (B) Combination of segmenta Read More

CBSE UGC NET Computer Science Paper III Solved December 2015 - Part
431.
In CRC based design, a CRC Team consists of : (a) one or two users representatives (b) several
programmers (c) project co-ordinators Read More

CBSE UGC NET Computer Science Paper III Solved December 2015 - Part
321.
Let n=4 and (a1, a2, a3, a4) = (do, if, int, while). Let p(1:4) = (3/8, 3/8, 1/8, 1/8) and q(1:4) = (2/8,
3/8, 1/8, 1/8, 1/8) where p(i) Read More
Newer PostOlder Post Home

1 comment:

1.
Chhavi2 July 2016 at 21:23
answer of q.6 is A
Reply

Search
Search

Popular

Computer General Knowledge Questions and Answers - Set 1

Tags
Blog Archives

1.
A parallel port is most often used by (A) Mouse
Answer: C 2. ...

(B) Monitor (C) Printer

(D) Keyboard


CBSE UGC NET Computer Science Paper II Solved December 2015 - Part 1
1.
How many committees of five people can be chosen from 20 men and 12 women such that each
committee contains at least three wome...

CBSE UGC NET Computer Science Paper II Solved June 2015 - Part 1
1.
How many strings of 5 digits have the property that the sum of their digits is 7 ? (A) 66
(C) 495 (D) 99 Ans...

(B) 330

Computer General Knowledge Questions and Answers - Set 2

1.
What would you do to highlight a word? You position the cursor next to the word, and then (A) Drag
mouse while holding butto...
Powered by Blogger.

Books

Like Us for Latest Updates

Follow by Email
Submit

FREE PAPER I DISCUSSION

FREE PAPER II AND III DISCUSSION

Read more: http://www.netcomputerscience.com/2016/01/cbse-ugc-net-computer-science-paper-ii-dec2015-p1.html#ixzz4I5ANYwHX