UGC NET Computer Science Solved Paper -II June 2014

UGC NET Computer Science Solved Paper -II June 2014

1. Infrared signals can be used for short range communication in a closed area using propagation.
(A) ground            (B) sky
(C) line of sight     (D) space

2. A bridge has access to address in the same network.
(A) Physical           (B) Network
(C) Datalink           (D) Application

3. The minimum frame length for 10 Mbps Ethernet is _____ bytes. and maximum is____ bytes
(A) 64 & 128                (B) 128 & 1518
(C) 1518 & 3036          (D) 64 & 1518

4. The bit rate of a signal is 3000 bps. If each signal unit carries 6 bits, the baud rate of the signal is .
(A) 500 baud/sec
(B) 1000 baud/sec
(C) 3000 baud/sec
(D) 18000 baud/sec.

5. Match the following:
List-I                       List – II
a. Physical layer                 i Allow resources to network access
b. Datalink layer                ii Move packets from one destination to other
c. Network layer               iii. Process to process message delivery
d. Transport layer            iv. Transmission of bit stream
e. Application Layer          v. Formation of frames
a b c d e
(A) iv v ii iii i
(B) v iv i ii iii
(C) i iii ii v iv
(D) i ii iv iii v

6. A grammar G is LL(1) if and only if the following conditions hold for two distinct productions
A α | β
I. First (α) ∩ First (β) ≠ {a} where a is some terminal symbol of the grammar.
II. First (α) ∩ First (β) λ
III. First (α) ∩ Follow (A) = Φ if λ ∈ First (P)
(A) I and II                   (B) I and III
(C) II and III                (D) I, II and III

7. Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar ?
(A) Removing left recursion alone
(B) Removing the grammar alone
(C) Removing left recursion and factoring the grammar
(D) None of the above

8. A shift reduce parser suffers from
(A) shift reduce conflict only
(B) reduce reduce conflict only
(C) both shift reduce conflict and reduce reduce conflict
(D) shift handle and reduce handle conflicts

9. The context free grammar, for the language L = {anbmck | k = |n – m|, n ≥0, m≥0,k≥0} is
(A) S S1S3, S1 aS1c | S2 | λ,
S2 aS2b|λ., S3 aS3b| S4 | λ,
S4 bS4c|λ
(B) S S1S3, S1 aS1S2c | λ,
S2 aS2b|λ, S3 aS3b| S4 |λ,
S4 bS4c|λ
(C) S S1|S2, S, aS1S2c | λ,
S2 aS2b | λ, S3 aS3b | S4 |λ,
S4 bS4c|λ
(D) S → S1 | S3, S1 → aS1c|S2 | λ,
S2 → aS2b | λ, S3 → a S3b| S4 | λ,
S4 → bS4c |λ

10. The regular grammar for the language L = {w|na(w) and nb(w) are both even,
∈{a, b}*} is given by : (Assume, p, q, r and s are states)
(A) p
→ aq | br | λ, q → bs | ap r → as | bp, s → ar | bq, p and s are initial and final states.
(B) p
→ aq | br, q → bs | ap r → as | bp, s → ar | bq, p and s are initial and final states.
(C) p
→ aq | br | λ, q → bs | ap r → as | bp, s → ar | bq p is both initial and final states.
(D) p
→ aq | br, q → bs | ap r → as | bp, s → ar | bq p is both initial and final states.

11. KPA in CMM stands for
(A) Key Process Area
(B) Key Product Area
(C) Key Principal Area
(D) Key Performance Area

12. Which one of the following is not a risk management technique for managing the risk due to unrealistic schedules and budgets ?
(A) Detailed multi source cost and schedule estimation.
(B) Design cost
(C) Incremental development
(D) Information hiding

13. ________of a system is the structure or structures of the system which comprise software elements, the externally visible properties of these elements and the relationship amongst them.
(A) Software construction
(B) Software evolution
(C) Software architecture
(D) Software reuse

14. In function point analysis, the number of complexity adjustment factors is
(A) 10            (B) 12              (C) 14             (D) 20

15. Regression testing is primarily related to
(A) Functional testing
(B) Development testing
(C) Data flow testing
(D) Maintenance testing

16. How many different truth tables of the compound propositions are there that involve the propositions p & q ?
(A) 2               (B) 4        (C) 8               (D) 16

17. A Boolean function F is called self- dual if and only if
F(X1, X2, … .Xn) = F(X1‘, X2‘,……Xn‘)
How many Boolean functions of degree n are self-dual ?
(A) 2n                  (B) (2)2n                (C) (2)n2                          (D) (2)2n-1

18. Which of the following statement(s) is (are) not correct ?
i. The 2′ s complement of 0 is 0.
ii. In 2’s complement, the left most bit cannot be used to express a quantity.
iii. For an n-bit word (2’s complement) which includes the sign bit, there are 2n-1 positive integers, 2n+1 negative integers and one 0 for a total of 2n unique states.
iv. In 2’s complement the significant information is contained in the 1’s of positive numbers and 0’s of the negative numbers.
(A) i & iv            (B) i & ii           (C) iii              (D) iv

19. The notation ∃!xP(x) denotes the proposition “there exists a unique x such that P(x) is true”.
Give the truth values of the following statements :
I. ∃!xP(x) ∃xP(x)
II. ∃!x ¬P(x) ¬∀xP(x)
(A) Both I & II are true.
(B) Both I & II are false.
(C) I – false, II – true
(D) I – true, II – false

20. Give a compound proposition involving propositions p, q and r that is true when exactly two of p, q and r are true and is false otherwise.
(A) (p∨q∧¬ r) ∧ (p∧¬q∧ r) ∧ (¬p∧q∧ r)
(B) (p∧q∧¬ r) (p∨q∧¬ r) (¬p∧q∧ r)
(C) (p∧q∧¬ r) (p∧¬q∧ r) ∧ (¬p∧q∧ r)
(D) (p∧q∧¬ r) ∨ (p∧¬q∧ r) ∨ (¬p∧q∧ r)

21. Consider the graph given below as

Ans : C

22. The upper bound and lower bound for the number of leaves in a B-tree of degree K with height h is given by:
(A) K
h and 2⌈K/2⌉h-1
(B) K*h and 2⌊K/2h-1
(C) Kh and 2⌊K/2h-1
(D) K*h and 2⌈K/2h-1

23. Consider a complete bipartite graph Km,n For which values of m and n does this, complete graph have a Hamilton circuit
(A) m = 3. n = 2               (B) m = 2, n = 3
(C) m = n
≥ 2                    (D) m = n 3

24. Big-0 estimates for the factorial function and the logarithm of the factorial function i.e. n! and log n! is given by
(A) 0(n!)andO(nlogn)
(B) 0(nn) and 0(n log n)
(C) 0(n!)andO(logn!)
(D) 0(n”) and 0(Iog n!)

25. How many cards must be chosen from a deck to guarantee that at least
i. two aces of two kinds are chosen.
ii. two aces are chosen.
iii. two cards of the same kind are chosen.
iv. two cards of two different kinds are chosen.
(A) 50.50.14,5                   (B) 51.51.15,7              (C) 52.52.14,5                (D) 51,51,14,5

Comments are closed.