ComputerSciencepaper II june-2014

UGC NET Previous Year Papers

COMPUTER SCIENCE AND APPLICATIONS

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

Ans: (C)

 

2. A bridge has access to _______ address in the same network.

(A) Physical

(B) Network

(C) Datalink

(D) Application

Ans: (A)

 

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

Ans: (D)

 

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.

Ans: (A)

 

5. Match the following :

List – I

List – II

a. Physical layer

b. Datalink layer

c. Network layer

d. Transport layer

e. Application Layer

i. Allow resources to network access

ii. Move packets from one destination to other

iii. Process to process message delivery

iv. Transmission of bit stream

v. Formation of frames

Codes :

                 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

Ans: (A)

 

6.   A grammar G is LL(1) if and only if the following conditions hold for two distinct productions A →a | β

I.    First (a) ∩ First (β) ≠ {a} where a is some terminal symbol of the grammar.

II.   First (a) ∩ First (β) ≠ λ

III.  First (a) ∩ Follow (A) = ϕ if λ∈ First (β)

(A) I and II

(B) I and III

(C) II and III 

(D) I, II and III 

Ans: (D)

 

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

Ans: (D)

 

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

Ans: (C)

 

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, S1→ aS1S2c | λ,

  S2 → aS2b | λ S3 → aS3b | S4 |λ,

  S4 → bS4c|λ

(D)   S → S1 | S3, S1→ aS1c|S2 | λ,

  S2 → aS2b | λS3 → a S3b| S4 | λ,

  S4 → bS4c | λ

 Ans: (D)

 

10. The regular grammar for the language

L = {w|na(w) and nb(w) are both even, w ∈ {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.

Ans: (C)

 

Pages: 1 2 3 4 5