# CBSE NET COMPUTER SCIENCE NOV 2017 PAPER 2 PART 1

Pages : 1    2     3    4     5

1. If the time is now 4 O’clock, what will be the time after 101 hours from now?

(1) 9 O’clock

(2) 8 O’clock

(3) 5 O’clock

(4) 4 O’clock

1. Let m = (313)4 and n = (322)4. Find the base 4 expansion of m + n.

(1) (635)4

(2) (32312)4

(3) (21323)4

(4) (1301)4

1. Let Find the boolean product AʘB of the two matrices. 1. How many distinguishable permutations of the letters in the word BANANA are there?

(1) 720

(2) 120

(3) 60

(4) 360

1. Consider the graph given below : Use Kruskal’s algorithm to find a minimal spanning tree for the graph. The List of the edges of the tree in the order in which they are chosen is?

(1) AD, AE, AG, GC, GB, BF

(2) GC, GB, BF, GA, AD, AE

(3) GC, AD, GB, GA, BF, AE

(4) AD, AG, GC, AE, GB, BF

1. The Boolean function with the Karnaugh map is : (1) (A + C).D + B

(2) (A + B).C + D

(3) (A + D).C + B

(4) (A + C).B + D

1. The Octal equivalent of the binary number 1011101011 is:

(1) 7353

(2) 1353

(3) 5651

(4) 5657

1. Let P and Q be two propositions, ⌐(P ↔ Q) is equivalent to:

(1) P ↔ ⌐ Q

(2) ⌐P↔ Q

(3) ⌐P↔ ⌐Q

(4) Q → P

1. Negation of the proposition Ǝ x H(x) is:

(1) Ǝ x ⌐H(x)

(2) ∀ x ⌐H(x)

(3) ∀ x H(x)

(4) ⌐ x H(x)

1. The output of the following combinational circuit is F. The value of F is :

(1) P1+P2’P3

(2) P1+P2’P3

(3) P1+P2P3

(4) P1’+P2P3