# UGC NET/JRF Computer Science December 2013 Paper II - Part 4

31.       The dual of a Boolean expression is obtained by interchanging
(A) Boolean sums and Boolean products
(B) Boolean sums and Boolean products or interchanging 0's and 1's
(C) Boolean sums and Boolean products and interchanging 0's & 1's
(D) Interchanging 0's and 1's
32.       Given that (292)10 = (1204)x in some number system x. The base x of that number system is
(A) 2                   (B) 8
(C) 10                 (D) None of the above
Explanation:
6|292
6|48| 4
6|8|   0
6|1|   2
6|1|   1
Solution: (1204)6
So here, x=6
33.       The sum of products expansion for the function
F(x, y, z) = (x + y)z’ is given as
(A) x’y’z + xyz’ + x’yz’
(B) xyz + xyz’ + xy’z’
(C) xy’z’ + x’y’z’ + xyz’
(D) xyz’ + xy’z’ + x’yz’
Explanation:
Use Boolean identities to expand the product and simplify.
F(x, y, z)=(x + y)z’
=xz’+yz’                                  Distributive law
=x1z’+1yz’                             Identity law
=x(y+y’)z’+(x+x’)yz’              Unit property
=xyz’+xy’z’+xyz’+x’yz’         Distributive law
=xyz’+xy’z’+x’yz’                  Idempotent law
34.       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 each of the following propositions:
I.  m n P(m,n),
II. m ∀n P(m, n)
(A) Both I and II are true
(B) Both I and II are false
(C) I - false & II - true
(D) I - true & II – false
35.       Big - O estimate for
f(x) = (x + 1) log(x2 + 1) + 3x2 is given as
(A) O(xlogx)      (B) O(x2)
(C) O(x3)            (D) O(x2logx)
Explanation:
Big-O notation of f(x)=(x+1) log(x2+1) + 3x2
Note (x+1) is O(x) and x2+1≤2x2 when x>1
So, log x2+1≤log(2x2)=log 2+ log x2=log 2+ 2 log x
≤ 3 log x if x >2
Thus, log x2+1 is O(log x)
The first part of f(x) is O(x log x)
Also, 3x2 is O(x2)
So, f(x) is O(max(x log x, x2))=O(x2) as  x log x ≤ x2 for x >1

36.       How many edges are there in a forest of t-trees containing a total of n vertices ?
(A) n+t                (B) n-t
(C) n*t                (D) nt
37.       Let f and g be the functions from the set of integers to the set integers defined by
f(x) = 2x + 3 and g(x) = 3x + 2
Then the composition of f and g and g and f is given as
(A) 6x + 7, 6x + 11
(B) 6x + 11, 6x + 7
(C) 5x + 5, 5x + 5
(D) None of the above
Explanation:
fog(x)=f(g(x))=f(3x+2)=2(3x+2)+3=6x+7
gof(x)=g(f(x))=g(2x+3)=3(2x+3)+2=6x+11
38.       If n and r are non-negative integers and n≥r, then p(n + 1, r) equals to
(A) P(n,r)(n+1) / (n+1-r)
(B) P(n,r)(n+1) / (n-1+r)
(C) p(n,r)(n-1) / (n+1-r)
(D) p(n,r)(n+1) / (n+1+r)
Explanation:
p(n, r) = n!/(n-r)!
p( n+1, r) = (n+1)!/(n+1-r)!
= (n+1) n! /(n+1-r) (n-r)!
= P(n, r)(n+1)/(n+1-r)
39.       A graph is non-planar if and only if it contains a subgraph homeomorphic to
(A) K3,2 or K5     (B) K3,3 and K6
(C) K3,3 or K5     (D) K2,3 and K5
Explanation:
Kuratowski’s Theorem: A graph is non-planar if and only if it contains a subgraph that is homeomorphic to either K5 or K3,3.
40.    Which of the following statements are true ?
I.   A circuit that adds two bits, producing a sum bit and a carry bit is called half adder.
II.  A circuit that adds two bits, producing a sum bit and a carry bit is called full adder.
III. A circuit that adds two bits and a carry bit producing a sum bit and a carry bit is called full adder.
IV.  A device that accepts the value of a Boolean variable as input and produces its complement is called an inverter.
(A) I & II              (B) II & III
(C) I, II, III           (D) I, III & IV
{"ft_lang_label":"__label__en","ft_lang_prob":0.68202347,"math_prob":0.9993416,"size":3353,"snap":"2021-43-2021-49","text_gpt3_token_len":1370,"char_repetition_ratio":0.10630039,"word_repetition_ratio":0.090771556,"special_character_ratio":0.3972562,"punctuation_ratio":0.100928076,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99993086,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-10-17T22:04:29Z\",\"WARC-Record-ID\":\"<urn:uuid:dcbed78c-a8b9-4d80-b5e7-2ac800700469>\",\"Content-Length\":\"310723\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:bbbf84fe-34a8-438d-b532-0353cd4f0589>\",\"WARC-Concurrent-To\":\"<urn:uuid:7cdab37f-6e8e-401a-b81c-c69ca1394d68>\",\"WARC-IP-Address\":\"142.250.65.83\",\"WARC-Target-URI\":\"https://www.netcomputerscience.com/2016/10/netjrf-computer-science-dec2013-paper2-p4.html\",\"WARC-Payload-Digest\":\"sha1:ESZUBIZ5LSC4ZKSF4Z7NBFFMO2VOQSRQ\",\"WARC-Block-Digest\":\"sha1:WXR6RHY643GYDSQHWSDUJSLNQBZ2RITI\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-43/CC-MAIN-2021-43_segments_1634323585183.47_warc_CC-MAIN-20211017210244-20211018000244-00613.warc.gz\"}"}