# UGC NET Computer Science Paper II June 2013 (Re-test 8th Sept. 2013) - Part 3

21.       Consider the In-order and Post-order traversals of a tree as given below:
In-order: j e n k o p b f a c l g m d h i
Post-order: j n o p k e f b c l m g h i d a
The Pre-order traversal of the tree shall be
(A) a b f e j k n o p c d g l m h i
(B) a b c d e f j k n o p g l m h i
(C) a b e j k n o p f c d g l m h i
(D) j e n o p k f b c l m g h i d a
22.       A simple graph G with n-vertices is connected if the graph has
(A) (n – 1) (n – 2)/2 edges
(B) more than (n – 1) (n – 2)/2 edges
(C) less than (n – 1) (n – 2)/2 edges
(D) Σki=1 C(ni, 2) edges
23.       Which one of the following set of gates is best suited for ‘parity’ checking and ‘parity’ generation?
(A) AND, OR, NOT                  (B) NAND, NOR
(C) EX-OR, EX-NOR               (D) None of the above
24.       The quantification !x P(x) denotes the proposition “There exists a unique x such that P(x) is true”, express the quantification using universal and existential quantifications and logical operators:
(A) x P(x) xy ((P(x) P(y)) → x = y)
(B) x P(x) xy ((P(x) P(y)) → x = y)
(C) x P(x) xy ((P(x) P(y)) → x = y)
(D) x P(x) xy ((P(x) P(y)) → x = y)
25.       If F and G are Boolean functions of degree n. Then, which of the following is true?
(A) F ≤ F + G and F G ≤ F
(B) G ≤ F + G and F G ≥ G
(C) F ≥ F + G and F G ≤ F
(D) G ≥ F + G and F G ≤ F

26.       Match the following identities/laws to their corresponding name:
(a) x + x = x
x • x = x                      i. Dominance
(b) x + 0 = x
x • 1 = x                      ii. Absorption
(c) x + 1 = 1
x • 0 = 0                      iii. Idempotent
(d) x • (x + y) = x           iv. Identity
Codes:
(a)  (b)  (c)  (d)
(A) iii   iv     i     ii
(B) iv   iii     i     ii
(C) iv   iii    ii     i
(D) iii   iv    ii     i
27.       In which one of the following, continuous process improvement is done?
(A) ISO9001      (B) RMMM
(C) CMM            (D) None of the above
28.       The .................. of a program or computing system is the structure or structures of the system, which comprise software components, the externally visible properties of these components, and the relationship among them.
(A) E-R diagram                       (B) Data flow diagram
(C) Software architecture       (D) Software design
29.       Working software is not available until late in the process in
(A) Waterfall model                 (B) Prototyping model
(C) Incremental model                        (D) Evolutionary Development model