NEW**UGC NET Solved Papers Held On June 2015

Download Admit Card
                                Important Dates      Schedule Of Examination       Eligibility      

December 25, 2013

Question Paper of Ugc Net June 2013 Computer Science And Applications Paper-II

<<<BACK                                                  Answer Key
1.   COCOMO stand 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 the functional and non functional requirements
(d)  Reliable           (iv) Process is under statistical control 

3.   While estimating the cost of software, lines Of Codes(LOC) and Functional 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, Low module cohesion
(d)  Low module coupling, Low module cohesion

5.   Cyclometric complexity of a flow  graph 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=1,   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+1)    (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++)
          printf("print/n")
(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.   Managers 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)  store Data in a Realtion

13.   Which normal form is considered as adequate for usual database design?
(a)   2NF       (b)   3NF      (c)    4NF        (d)     5NF

14.   If    are domains in a relational model, then the relation is a table,which is a subset of
(a)

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 ciphertaxt, regardless of its position in the text.
(a)  polyalphabetic     (b)  monoalphabetic
(c)  transalphabetic    (d)  multialphabetic

17.   In classful addressing, the IP address 190.255.254.254 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 choosen to minimize the size of routing table for a three layer 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 = L1/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 G1 as
         S1  -->  AB | aaB
         A  --> a | Aa
         B -->  b
      and the  production rules of a grammar G2 as
         S2  --> aS2bS2 |
Which of the following is a correct statement ?
(a)  G1 is ambiguous and G2 is not ambiguous
(b)  G1 is ambiguous and G2 is  ambiguous
(c)  G1 is not ambiguous and G2 is ambiguous
(d)  G1 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 sequential form , and its handke is
(a)   SaS       (b)    bc      (c)     Sbc         (d)    aSb

23. The equivalent  production rules corrosponding rules

24.  Given a Non-deterministic Finite Automation (NFA) with statesp and r  as initial and final states respectively and 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 of the following is the correct statement  for Non Recursive predictive parser?
s1:

(a) Both statements S1 and S2 are incorrect
(b) S1 is incorrect and S2 is correct.
(c) S1 is correct and S2 is incorrect.
(d) Both statements S1 and S2 are correct.


No comments:

Post a Comment