UGC NET Computer Science Solved Paper -II June2013

UGC NET Computer Science Solved Paper -II June2013

1. COCOMO stands for
(A) COmposite COst MOdel
(B) COnstructive COst MOdel
(C) COnstructive Composite MOdel
(D) COmprehensive Construction Model

2. Match the following:
a. Good quality        i. Program does not fail for a specified time in a given environment
b. Correctness        ii. Meets the functional requirements
c. Predictable         iii. Meets both functional and non-functional requirements
d. Reliable              iv. Process is under statistical control
a b c d
(A) iii ii iv i
(B) ii iii iv i
(C) i ii iv iii
(D) i ii iii iv

3. While estimating the cost of software, Lines of Code (LOC) and Function Points (FP) are used to measure which one of the following?
(A) Length of code
(B) Size of software
(C) Functionality of software
(D) None of the above

4. A good software design must have
(A) High module coupling, High module cohesion
(B) High module coupling, Low module cohesion
(C) Low module coupling, High module cohesion
(D) Low module coupling, Low module cohesion

5. Cyclometric complexity of a flow graph G with n vertices and e edges is
(A) V(G) = e+n-2
(B) V(G) = e-n+2
(C) V(G) = e+n+2
(D) V(G) = e-n-2

6. When the following code is executed what will be the value of x and y?
int x = l, y=0;
y = x++;
(A) 2,1
(B) 2,2
(C) 1,1
(D) 1,2

7. How many values can be held by an array A(-1,m;1 ,m) ?
(A) m
(B) m2
(C) m(m+l)
(D) m(m+2)

8. What is the result of the expression
(1 &2)+(3/4) ?
(A) 1
(B) 2
(C) 3
(D) 0

9. How many times the word ‘print’ shall be printed by the following program segment?
for(i=1, i≤2, i++)
for(j=1, J≤2, J++)
for(k=1, k≤2, k++)
(A) 1
(B) 3
(C) 6
(D) 8

10. Which of the following is not a type of Database Management System?
(A) Hierarchical
(B) Network
(C) Relational
(D) Sequential

11. Manager’s salary details are to be hidden from Employee Table. This Technique is called as
(A) Conceptual level Datahiding
(B) Physical level Datahiding
(C) External level Datahiding
(D) Logical level Datahiding

12. A Network Schema
(A) restricts to one to many relationship
(B) permits many to many relationship
(C) stores Data in a Database
(D) stores Data in a Relation

13. Which normal form is considered as adequate for usual database design ?
(A) 2NF
(B) 3NF
(C) 4NF
(D) 5NF

14. If D1, D2,…. Dn are domains in a relational model, then the relation is a table, which is a subset of
(A) D1+D2+…. + Dn
(B) D1x D2x… x Dn
(C) D1U D2U….U Dn
(D) D1- D2-….- Dn

15. Which of the following addresses is used to deliver a message to the correct application program running on a host?
(A) Port
(B) IP
(C) Logical
(D) Physical

16. In substitution, a character in the plaintext is always changed to the same character in the ciphertext, regardless of its position in the text.
(A) polyalphabetic
(B) monoalphabetic
(C) transpositional
(D) multialphabetic

17. In classful addressing, the IF address belongs to
(A) Class A
(B) Class B
(C) Class C
(D) Class D

18. In hierarchical routing with 4800 routers, what region and cluster sizes should be chosen to minimize the size of the routing table for a threelayer hierarchy?
(A) 10 clusters, 24 regions and 20 routers
(B) 12 clusters, 20 regions and 20 routers
(C) 16 clusters, 12 regions and 25 routers
(D) 15 clusters, 16 regions and 20 routers

19. In IPv4 header, the field is needed to allow the destination host to determine which datagram a newly arrived fragments belongs to.
(A) identification
(B) fragment offset
(C) time to live
(D) header checksum

20. Given L1 = L(a*baa*) and L2 = L(ab*)
The regular expression corresponding to language L3 = Ll/L2 (right quotient) is given by
(A) a*b
(B) a*baa*
(C) a*ba*
(D) None of the above

21. Given the production rules of a grammar GI as
S1 → AB | aaB
A → a | Aa
B → b
and the production rules of a grammar G2 as
S2 → aS2bS2 | bS2aS2 | λ
Which of the following is correct statement?
(A) G1 is ambiguous and G2 is not ambiguous.
(B) GI is ambiguous and G2 is ambiguous.
(C) GI is not ambiguous and G2 is ambiguous.
(D) GI is not ambiguous and G2 is not ambiguous.

22. Given a grammar : S1 → Sc, S →SA | A, A → aSb | ab, there is a rightmost derivation
S1 => Sc => SAC => SaSbc Thus, SaSbc is a right sentential form, and its handle is
(A) SaS
(B) be
(C) Sbe
(D) aSb

23. The equivalent production rules corresponding to the production rules
S → Sα1 | Sα2 | β1 | β2 is
(A) S → β1 | β2, A à α1A | α2A | λ
(B) S → β1 | β2 | β1A | β2A,
A→ α1A | α2A
(C) S→β1 | β2, A → α1A | α2A
(D) S → β1 | β2 | β1A | β2A,
       A → α1A | α2A | λ

24. Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively transition table as given below


The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is
(A) 5
(B) 4
(C) 3
(D) 2

25. Which is the correct statement(s) for Non Recursive predictive parser?
S1: First(α) = {t | α => * t β for some string β } => *tβ
S2: Follow(X) = { a | S => * αXa β for some strings α and β }
(A) Both statements S1 and S2 are incorrect.
(B) S1 is incorrect and 52 IS correct.
(C) S1 is correct and S2 IS incorrect.
(D) Both statements S I and S2 are correct.

Comments are closed.