Machine-translated by Google. Questions are authored in English.
Top

UGC NET 2016: July, Paper II, Computer Science and Applications

  • Date: 10 July 2016
  • Paper code: subject 87, Paper II
  • Language: English
  • 16 pages
UGC NET 2016 question paper, July 2016, Paper II, Computer Science and Applications, page 1 of 16
Page 1 of 16
Text of page 1
PAPER-II
                          COMPUTER SCIENCE & APPLICATIONS
Signature and Name of Invigilator
1. (Signature) __________________________                                      OMR Sheet No. : ...............................................
     (Name) ____________________________                                                                     (To be filled by the Candidate)

2. (Signature) __________________________                                      Roll No.
     (Name) ____________________________                                                                   (In figures as per admission card)
                                                                              Roll No.________________________________
  J 8 7 1 6                                                                                  (In words)

Time : 1 1/4 hours]                                                                                           [Maximum Marks : 100
Number of Pages in this Booklet : 16                                                            Number of Questions in this Booklet : 50
        Instructions for the Candidates                                                                 ¯Ö¸üßõÖÖÙ£ÖμÖÖë Ûêú ×»Ö‹ ×®Ö¤ìü¿Ö
1. Write your roll number in the space provided on the top of               1. ‡ÃÖ ¯Öéšü Ûêú ‰ú¯Ö¸ü ×®ÖμÖŸÖ Ã£ÖÖ®Ö ¯Ö¸ü †¯Ö®ÖÖ ¸üÖê»Ö ®Ö´²Ö¸ü ×»Ö×ÜÖ‹ …
    this page.                                                              2. ‡ÃÖ ¯ÖÏ¿®Ö-¯Ö¡Ö ´Öë ¯Ö“ÖÖÃÖ ²ÖÆãü×¾ÖÛú»¯ÖßμÖ ¯ÖÏ¿®Ö Æïü …
2. This paper consists of fifty multiple-choice type of questions.          3. ¯Ö¸üßõÖÖ ¯ÖÏÖ¸ü´³Ö ÆüÖê®Öê ¯Ö¸ü, ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ †Ö¯ÖÛúÖê ¤êü ¤üß •ÖÖμÖêÝÖß … ¯ÖÆü»Öê
3. At the commencement of examination, the question booklet                     ¯ÖÖÑ“Ö ×´Ö®Ö™ü †Ö¯ÖÛúÖê ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ ÜÖÖê»Ö®Öê ŸÖ£ÖÖ ˆÃÖÛúß ×®Ö´®Ö×»Ö×ÜÖŸÖ
    will be given to you. In the first 5 minutes, you are requested             •ÖÖÑ“Ö Ûêú ×»Ö‹ פüμÖê •ÖÖμÖëÝÖê, וÖÃÖÛúß •ÖÖÑ“Ö †Ö¯ÖÛúÖê †¾Ö¿μÖ Ûú¸ü®Öß Æîü :
    to open the booklet and compulsorily examine it as below :                  (i) ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ ÜÖÖê»Ö®Öê Ûêú ×»Ö‹ ¯Öã×ßÖÛúÖ ¯Ö¸ü »ÖÝÖß ÛúÖÝÖ•Ö Ûúß ÃÖß»Ö
    (i) To have access to the Question Booklet, tear off the                             ÛúÖê ±úÖ›Ìü »Öë … ÜÖã»Öß Æãü‡Ô μÖÖ ×²Ö®ÖÖ Ã™üßÛú¸ü-ÃÖᯙ Ûúß ¯Öã×ßÖÛúÖ
          paper seal on the edge of this cover page. Do not accept                       þÖßÛúÖ¸ü ®Ö Ûú¸ëü …
          a booklet without sticker-seal and do not accept an open              (ii) Ûú¾Ö¸ü ¯Öéšü ¯Ö¸ü ”û¯Öê ×®Ö¤ìü¿ÖÖ®ÖãÃÖÖ¸ü ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ Ûêú ¯Öéšü ŸÖ£ÖÖ
          booklet.                                                                       ¯ÖÏ¿®ÖÖë Ûúß ÃÖÓÜμÖÖ ÛúÖê †“”ûß ŸÖ¸üÆü “ÖîÛú Ûú¸ü »Öë ×Ûú μÖê ¯Öæ¸êü
    (ii) Tally the number of pages and number of questions                               Æïü … ¤üÖêÂÖ¯ÖæÞÖÔ ¯Öã×ßÖÛúÖ ×•Ö®Ö´Öë ¯Öéšü/¯ÖÏ¿®Ö Ûú´Ö ÆüÖë μÖÖ ¤ãü²ÖÖ¸üÖ †Ö
          in the booklet with the information printed on the                             ÝÖμÖê ÆüÖë μÖÖ ÃÖß׸üμÖ»Ö ´Öë ®Ö ÆüÖë †£ÖÖÔŸÖË ×ÛúÃÖß ³Öß ¯ÖÏÛúÖ¸ü Ûúß
          cover page. Faulty booklets due to pages/questions                             ¡Öã×™ü¯ÖæÞÖÔ ¯Öã×ßÖÛúÖ Ã¾ÖßÛúÖ¸ü ®Ö Ûú¸ëü ŸÖ£ÖÖ ˆÃÖß ÃÖ´ÖμÖ ˆÃÖê
          missing or duplicate or not in serial order or any                             »ÖÖî™üÖÛú¸ü ˆÃÖÛêú ãÖÖ®Ö ¯Ö¸ü ¤æüÃÖ¸üß ÃÖÆüß ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ »Öê »Öë …
          other discrepancy should be got replaced immediately                           ‡ÃÖÛêú ×»Ö‹ †Ö¯ÖÛúÖê ¯ÖÖÑ“Ö ×´Ö®Ö™ü פüμÖê •ÖÖμÖëÝÖê … ˆÃÖÛêú ²ÖÖ¤ü ®Ö
          by a correct booklet from the invigilator within the                           ŸÖÖê †Ö¯ÖÛúß ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ ¾ÖÖ¯ÖÃÖ »Öß •ÖÖμÖêÝÖß †Öî¸ü ®Ö Æüß †Ö¯ÖÛúÖê
          period of 5 minutes. Afterwards, neither the Question                          †×ŸÖ׸üŒŸÖ ÃÖ´ÖμÖ ×¤üμÖÖ •ÖÖμÖêÝÖÖ …
          Booklet will be replaced nor any extra time will be                   (iii) ‡ÃÖ •ÖÖÑ“Ö Ûêú ²ÖÖ¤ü ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ ÛúÖ ®ÖÓ²Ö¸ü OMR ¯Ö¡ÖÛú ¯Ö¸ü †Ó×ÛúŸÖ Ûú¸ëü
          given.                                                                         †Öî¸ü OMR ¯Ö¡ÖÛú ÛúÖ ®ÖÓ²Ö¸ü ‡ÃÖ ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ ¯Ö¸ü †Ó×ÛúŸÖ Ûú¸ü ¤ëü …
    (iii) After this verification is over, the Test Booklet Number          4. ¯ÖÏŸμÖêÛú ¯ÖÏ¿®Ö Ûêú ×»Ö‹ “ÖÖ¸ü ˆ¢Ö¸ü ×¾ÖÛú»¯Ö (1), (2), (3) ŸÖ£ÖÖ (4) פüμÖê ÝÖμÖê
          should be entered on the OMR Sheet and the OMR                        Æïü … †Ö¯ÖÛúÖê ÃÖÆüß ˆ¢Ö¸ü Ûêú ¾Öé¢Ö ÛúÖê ¯Öê®Ö ÃÖê ³Ö¸üÛú¸ü ÛúÖ»ÖÖ Ûú¸ü®ÖÖ Æîü •ÖîÃÖÖ
          Sheet Number should be entered on this Test Booklet.
4. Each item has four alternative responses marked (1), (2), (3)                ×Ûú ®Öß“Öê פüÜÖÖμÖÖ ÝÖμÖÖ Æîü :
    and (4). You have to darken the circle as indicated below on                ˆ¤üÖÆü¸üÞÖ :
    the correct response against each item.                                     •Ö²Ö×Ûúú(3) ÃÖÆüß ˆ¢Ö¸ü Æîü …
    Example :                                                               5. ¯ÖÏ¿®ÖÖë Ûêú ˆ¢Ö¸ü Ûêú¾Ö»Ö ¯ÖÏ¿®Ö ¯Öã×ßÖÛúÖ Ûêú †®¤ü¸ü פüμÖê ÝÖμÖê OMR ¯Ö¡ÖÛú ¯Ö¸ü
    where (3) is the correct response.                                          Æüß †Ó×ÛúŸÖ Ûú¸ü®Öê Æïü … μÖפü †Ö¯Ö OMR ¯Ö¡ÖÛú ¯Ö¸ü פüμÖê ÝÖμÖê ¾Öé¢Ö Ûêú †»ÖÖ¾ÖÖ
5. Your responses to the items are to be indicated in the OMR                   ×ÛúÃÖß †®μÖ Ã£ÖÖ®Ö ¯Ö¸ü ˆ¢Ö¸ü דÖÅ®ÖÖÓ×ÛúŸÖ Ûú¸üŸÖê Æïü, ŸÖÖê ˆÃÖÛúÖ ´Öæ»μÖÖÓÛú®Ö
    Sheet given inside the Booklet only. If you mark your                       ®ÖÆüà ÆüÖêÝÖÖ …
    response at any place other than in the circle in the OMR               6. †®¤ü¸ü פüμÖê ÝÖμÖê ×®Ö¤ìü¿ÖÖë ÛúÖê ¬μÖÖ®Ö¯Öæ¾ÖÔÛú ¯ÖœÌëü …
    Sheet, it will not be evaluated.                                        7. Ûú““ÖÖ ÛúÖ´Ö (Rough Work) ‡ÃÖ ¯Öã×ßÖÛúÖ Ûêú †×®ŸÖ´Ö ¯Öéšü ¯Ö¸ü Ûú¸ëü …
6. Read instructions given inside carefully.                                8. μÖפü †Ö¯Ö OMR ¯Ö¡ÖÛú ¯Ö¸ü ×®ÖμÖŸÖ Ã£ÖÖ®Ö Ûêú †»ÖÖ¾ÖÖ †¯Ö®ÖÖ ®ÖÖ´Ö, ¸üÖê»Ö
7. Rough Work is to be done in the end of this booklet.                         ®Ö´²Ö¸ü, ±úÖê®Ö ®Ö´²Ö¸ü μÖÖ ÛúÖê‡Ô ³Öß ‹êÃÖÖ ×“ÖÅ®Ö ×•ÖÃÖÃÖê †Ö¯ÖÛúß ¯ÖÆü“ÖÖ®Ö ÆüÖê
8. If you write your Name, Roll Number, Phone Number or put                     ÃÖÛêú, †Ó×ÛúŸÖ Ûú¸üŸÖê Æïü †£Ö¾ÖÖ †³Ö¦ü ³ÖÖÂÖÖ ÛúÖ ¯ÖÏμÖÖêÝÖ Ûú¸üŸÖê Æïü, μÖÖ ÛúÖê‡Ô
    any mark on any part of the OMR Sheet, except for the space                 †®μÖ †®Öã×“ÖŸÖ ÃÖÖ¬Ö®Ö ÛúÖ ¯ÖÏμÖÖêÝÖ Ûú¸üŸÖê Æïü, •ÖîÃÖê ×Ûú †Ó×ÛúŸÖ ×ÛúμÖê ÝÖμÖê
    allotted for the relevant entries, which may disclose your                  ˆ¢Ö¸ü ÛúÖê ×´Ö™üÖ®ÖÖ μÖÖ ÃÖ±êú¤ü ÃμÖÖÆüß ÃÖê ²Ö¤ü»Ö®ÖÖ ŸÖÖê ¯Ö¸üßõÖÖ Ûêú ×»ÖμÖê
    identity, or use abusive language or employ any other unfair                †μÖÖêÝμÖ ‘ÖÖê×ÂÖŸÖ ×ÛúμÖê •ÖÖ ÃÖÛúŸÖê Æïü …
    means, such as change of response by scratching or using                9. †Ö¯ÖÛúÖê ¯Ö¸üßõÖÖ ÃÖ´ÖÖ¯ŸÖ ÆüÖê®Öê ¯Ö¸ü ´Öæ»Ö OMR ¯Ö¡ÖÛú ×®Ö¸üßõÖÛú ´ÖÆüÖê¤üμÖ ÛúÖê
    white fluid, you will render yourself liable to disqualification.
9. You have to return the Original OMR Sheet to the invigilators                »ÖÖî™üÖ®ÖÖ †Ö¾Ö¿μÖÛú Æîü †Öî¸ü ¯Ö¸üßõÖÖ ÃÖ´ÖÖׯŸÖ Ûêú ²ÖÖ¤ü ˆÃÖê †¯Ö®Öê ÃÖÖ£Ö ¯Ö¸üßõÖÖ ³Ö¾Ö®Ö
    at the end of the examination compulsorily and must not                     ÃÖê ²ÖÖÆü¸ü ®Ö »ÖêÛú¸ü •ÖÖμÖë … ÆüÖ»ÖÖÓ×Ûú †Ö¯Ö ¯Ö¸üßõÖÖ ÃÖ´ÖÖׯŸÖ ¯Ö¸ü ´Öæ»Ö ¯ÖÏ¿®Ö-¯Öã×ßÖÛúÖ
    carry it with you outside the Examination Hall. You are,                    ŸÖ£ÖÖ OMR ¯Ö¡ÖÛú Ûúß ›ãü¯»ÖßÛêú™ü ¯ÖÏ×ŸÖ †¯Ö®Öê ÃÖÖ£Ö »Öê •ÖÖ ÃÖÛúŸÖê Æïü …
    however, allowed to carry original question booklet and                 10. Ûêú¾Ö»Ö C.B.S.E. «üÖ¸üÖ ¯ÖϤüÖ®Ö ×ÛúμÖê ÝÖμÖê ÛúÖ»Öê ²ÖÖ»Ö ¯¾ÖÖ‡Õ™ü ¯Öê®Ö ÛúÖ
    duplicate copy of OMR Sheet on conclusion of examination.                   Æüß ‡ÃŸÖê´ÖÖ»Ö Ûú¸ëü …
10. Use only Black Ball point pen provided by C.B.S.E.                      11. ×ÛúÃÖß ³Öß ¯ÖÏÛúÖ¸ü ÛúÖ ÃÖÓÝÖÞÖÛú (Ûîú»ÖÛãú»Öê™ü¸ü) μÖÖ »ÖÖÝÖ ™êü²Ö»Ö †Öפü ÛúÖ
11. Use of any calculator or log table etc., is prohibited.                     ¯ÖÏμÖÖêÝÖ ¾ÖÙ•ÖŸÖ Æîü …
12. There is no negative marks for incorrect answers.                       12. ÝÖ»ÖŸÖ ˆ¢Ö¸üÖë Ûêú ×»Ö‹ ÛúÖê‡Ô ®ÖÛúÖ¸üÖŸ´ÖÛú †ÓÛú ®ÖÆüà Æïü …
13. In case of any discrepancy in the English and Hindi versions,           13. μÖפü †ÓÝÖÏê•Öß μÖÖ ØÆü¤üß ×¾Ö¾Ö¸üÞÖ ´Öë ÛúÖê‡Ô ×¾ÖÃÖÓÝÖ×ŸÖ ÆüÖê, ŸÖÖê †ÓÝÖÏê•Öß ×¾Ö¾Ö¸üÞÖ
    English version will be taken as final.                                     †Ó×ŸÖ´Ö ´ÖÖ®ÖÖ •ÖÖ‹ÝÖÖ …
    J-87-16                                                             1                                                                                 P.T.O.
UGC NET 2016 question paper, July 2016, Paper II, Computer Science and Applications, page 2 of 16
Page 2 of 16
Text of page 2
COMPUTER SCIENCE & APPLICATIONS

                                           Paper – II


Note : This paper contains fifty (50) objective type questions of two (2) marks each. All
       questions are compulsory.

1.   How many different equivalence relations with exactly three different equivalence classes
     are there on a set with five elements ?
     (1)   10                                       (2)   15
     (3)   25                                       (4)   30


2.   The number of different spanning trees in complete graph, K4 and bipartite graph, K2, 2
     have ______ and _______ respectively.
     (1)   14, 14                                   (2)   16, 14
     (3)   16, 4                                    (4)   14, 4


3.   Suppose that R1 and R2 are reflexive relations on a set A.

     Which of the following statements is correct ?
     (1)   R1 ∩ R2 is reflexive and R1 ∪ R2 is irreflexive.

     (2)   R1 ∩ R2 is irreflexive and R1 ∪ R2 is reflexive.

     (3)   Both R1 ∩ R2 and R1 ∪ R2 are reflexive.

     (4)   Both R1 ∩ R2 and R1 ∪ R2 are irreflexive.


4.   There are three cards in a box. Both sides of one card are black, both sides of one card are
     red, and the third card has one black side and one red side. We pick a card at random and
     observe only one side.
     What is the probability that the opposite side is the same colour as the one side we
     observed ?
     (1)   3/4                                      (2)   2/3
     (3)   1/2                                      (4)   1/3

Paper-II                                        2                                         J-87-16
UGC NET 2016 question paper, July 2016, Paper II, Computer Science and Applications, page 3 of 16
Page 3 of 16
Text of page 3
5.   A clique in a simple undirected graph is a complete subgraph that is not contained in any
     larger complete subgraph. How many cliques are there in the graph shown below ?




     (1)   2

     (2)   4

     (3)   5

     (4)   6



6.   Which of the following logic expressions is incorrect ?

     (1)   1⊕0=1

     (2)   1⊕1⊕1=1

     (3)   1⊕1⊕0=1

     (4)   1⊕1=0



7.   The IEEE-754 double-precision format to represent floating point numbers, has a length
     of _____ bits.

     (1)   16                                      (2)   32

     (3)   48                                      (4)   64



J-87-16                                        3                                      Paper-II
UGC NET 2016 question paper, July 2016, Paper II, Computer Science and Applications, page 4 of 16
Page 4 of 16
Text of page 4
8.    Simplified Boolean equation for the following truth table is :

                    x       y     z   F

                    0       0     0   0

                    0       0     1   1

                    0       1     0   0

                    0       1     1   1

                    1       0     0   1

                    1       0     1   0

                    1       1     0   1

                    1       1     1   0

      (1)   F = y–z + –yz

      (2)   F = x–y + –xy

      (3)   F = –xz + x–z

      (4)   F = –xz + x–z + xyz



                                                  –    –         –– –
9.    The simplified form of a Boolean equation (AB + ABC + AC) (AC + B) is :

             –                                              –
      (1)   AB                                       (2)   ABC

            –
      (3)   AB                                       (4)   ABC



10.   In a positive-edge-triggered JK flip-flop, if J and K both are high then the output will be
      _____ on the rising edge of the clock.

      (1)   No change                                (2)   Set

      (3)   Reset                                    (4)   Toggle


Paper-II                                         4                                        J-87-16
UGC NET 2016 question paper, July 2016, Paper II, Computer Science and Applications, page 5 of 16
Page 5 of 16
Text of page 5
11.   Given i = 0, j = 1, k = –1

             x = 0.5, y = 0.0

      What is the output of the following expression in C language ?

      x * y < i + j || k

      (1)    –1                                        (2)   0

      (3)    1                                         (4)   2



12.   The following statement in ‘C’

             int (*f())[ ];

      declares

      (1)    a function returning a pointer to an array of integers.

      (2)    a function returning an array of pointers to integers.

      (3)    array of functions returning pointers to integers.

      (4)    an illegal statement.



13.   Which one of the following is correct, when a class grants friend status to another class ?

      (1)    The member functions of the class generating friendship can access the members of
             the friend class.

      (2)    All member functions of the class granted friendship have unrestricted access to the
             members of the class granting the friendship.

      (3)    Class friendship is reciprocal to each other.

      (4)    There is no such concept.



14.   When a method in a subclass has the same name and type signatures as a method in the
      superclass, then the method in the subclass _____ the method in the superclass.

      (1)    Overloads                                 (2)   Friendships

      (3)    Inherits                                  (4)   Overrides

J-87-16                                            5                                      Paper-II
UGC NET 2016 question paper, July 2016, Paper II, Computer Science and Applications, page 6 of 16
Page 6 of 16
Text of page 6
15.   What is the value returned by the function f given below when n = 100 ?

      int f (int n)

             { if (n = = 0) then return n;

                 else

                 return n + f(n-2);

             }

      (1)    2550                                    (2)   2556

      (3)    5220                                    (4)   5520



16.   In RDBMS, the constraint that no key attribute (column) may be NULL is referred to as :

      (1)    Referential integrity

      (2)    Multi-valued dependency

      (3)    Entity Integrity

      (4)    Functional dependency



17.   Which of the following statement(s) is/are FALSE in the context of Relational DBMS ?

      I.     Views in a database system are important because they help with access control by
             allowing users to see only a particular subset of the data in the database.

      II.    E-R diagrams are useful to logically model concepts.

      III.   An update anomaly is when it is not possible to store information unless some other,
             unrelated information is stored as well.

      IV.    SQL is a procedural language.

      (1)    I and IV only                           (2)   III and IV only

      (3)    I, II and III only                      (4)   II, III and IV only

Paper-II                                         6                                        J-87-16
UGC NET 2016 question paper, July 2016, Paper II, Computer Science and Applications, page 7 of 16
Page 7 of 16
Text of page 7
18.   In a relational database model, NULL values can be used for all but which one of the
      following ?
      (1)    To allow duplicate tuples in the table by filling the primary key column(s) with
             NULL.
      (2)    To avoid confusion with actual legitimate data values like 0 (zero) for integer
             columns and ’’ (the empty string) for string columns.
      (3)    To leave columns in a tuple marked as ’’unknown’’ when the actual value is
             unknown.
      (4)    To fill a column in a tuple when that column does not really ”exist” for that
             particular tuple.


19.   Consider the following two commands C1 and C2 on the relation R from an SQL database :
      C1 : drop table R;
      C2 : delete from R;
      Which of the following statements is TRUE ?
      I.     Both C1 and C2 delete the schema for R.
      II.    C2 retains relation R, but deletes all tuples in R.
      III.   C1 deletes not only all tuples of R, but also the schema for R.
      (1)    I only                                     (2)   I and II only
      (3)    II and III only                            (4)   I, II and III


20.   Consider the following database table having A, B, C and D as its four attributes and four
      possible candidate keys (I, II, III and IV) for this table :
                         A      B     C      D
                         a1     b1    c1     d1

                         a2     b3    c3     d1

                         a1     b2    c1     d2

      I : {B}    II : {B, C} III : {A, D}    IV : {C, D}
      If different symbols stand for different values in the table (e.g., d1 is definitely not equal to
      d2), then which of the above could not be the candidate key for the database table ?
      (1)    I and III only                             (2)   III and IV only
      (3)    II only                                    (4)   I only

J-87-16                                             7                                         Paper-II
UGC NET 2016 question paper, July 2016, Paper II, Computer Science and Applications, page 8 of 16
Page 8 of 16
Text of page 8
21.   Consider the following binary search tree :




      If we remove the root node, which of the node from the left subtree will be the new root ?

      (1)   11                                          (2)   12

      (3)   13                                          (4)   16



22.   Consider the following operations performed on a stack of size 5 :

      Push (a); Pop() ; Push(b); Push(c); Pop();

      Push(d); Pop();Pop(); Push (e)

      Which of the following statements is correct ?

      (1)   Underflow occurs

      (2)   Stack operations are performed smoothly

      (3)   Overflow occurs

      (4)   None of the above



23.   Suppose you are given a binary tree with n nodes, such that each node has exactly either
      zero or two children. The maximum height of the tree will be

            n                                                 n
      (1)     –                                                 +
            2 1                                         (2)   2 1

      (3)   (n – 1)/2                                   (4)   (n + 1)/2

Paper-II                                            8                                     J-87-16
UGC NET 2016 question paper, July 2016, Paper II, Computer Science and Applications, page 9 of 16
Page 9 of 16
Text of page 9
24.   Which of the following is not an inherent application of stack ?

      (1)   Implementation of recursion

      (2)   Evaluation of a postfix expression

      (3)   Job scheduling

      (4)   Reverse a string



25.   In how many ways can the string

            A∩B–A∩B–A

      be fully parenthesized to yield an infix expression ?

      (1)   15                                       (2)   14

      (3)   13                                       (4)   12



26.   A multiplexer combines four 100-Kbps channels using a time slot of 2 bits. What is the bit
      rate ?

      (1)   100 Kbps                                 (2)   200 Kbps

      (3)   400 Kbps                                 (4)   1000 Kbps



27.   In a fully-connected mesh network with 10 computers, total ______ number of cables are
      required and ______ number of ports are required for each device.

      (1)   40, 9                                    (2)   45, 10

      (3)   45, 9                                    (4)   50, 10



28.   In TCP/IP Reference model, the job of _______ layer is to permit hosts to inject packets
      into any network and travel them independently to the destination.

      (1)   Physical                                 (2)   Transport

      (3)   Application                              (4)   Host-to-network

J-87-16                                          9                                      Paper-II
UGC NET 2016 question paper, July 2016, Paper II, Computer Science and Applications, page 10 of 16
Page 10 of 16
Text of page 10
29.   If there are N people in the world and are using secret key encryption/decryption for
      privacy purpose, then number of secret keys required will be :

      (1)   N                                        (2)   (N – 1)

            N(N – 1)                                       N(N + 1)
      (3)      2                                     (4)      2



30.   Optical fiber uses reflection to guide light through a channel, in which angle of incidence
      is ________ the critical angle.

      (1)   equal to                                 (2)   less than

      (3)   greater than                             (4)   less than or equal to



31.   The number of strings of length 4 that are generated by the regular expression
      (0|∈)1+2* (3|∈), where | is an alternation character, {+, *} are quantification characters,
      and ∈ is the null string, is :

      (1)   08                                       (2)   10

      (3)   11                                       (4)   12



32.   The content of the accumulator after the execution of the following 8085 assembly
      language program, is :

                 MVI A, 42H

                 MVI B, 05H

      UGC:       ADD B

                 DCR B

                 JNZ UGC

                 ADI 25H

                 HLT

      (1)   82 H                                     (2)   78 H

      (3)   76 H                                     (4)   47 H

Paper-II                                        10                                        J-87-16
UGC NET 2016 question paper, July 2016, Paper II, Computer Science and Applications, page 11 of 16
Page 11 of 16
Text of page 11
33.   In _______, the bodies of the two loops are merged together to form a single loop
      provided that they do not make any references to each other.

      (1)    Loop unrolling                           (2)   Strength reduction

      (3)    Loop concatenation                       (4)   Loop jamming



34.   Which of the following is not typically a benefit of dynamic linking ?

      I.     Reduction in overall program execution time.

      II.    Reduction in overall space consumption in memory.

      III.   Reduction in overall space consumption on disk.

      IV.    Reduction in the cost of software updates.

      (1)    I and IV                                 (2)   I only

      (3)    II and III                               (4)   IV only



35.   Which of the following is FALSE ?

      (1)    The grammar S → a Sb |bSa|SS|∈, where S is the only non-terminal symbol and ∈
             is the null string, is ambiguous.

      (2)    SLR is powerful than LALR.

      (3)    An LL(1) parser is a top-down parser.

      (4)    YACC tool is an LALR(1) parser generator.


36.   Consider the reference string

      0 1 2 3 0 1 4 0 1 2 3 4

      If FIFO page replacement algorithm is used, then the number of page faults with three
      page frames and four page frames are _______ and ______ respectively.

      (1)    10, 9                                    (2)   9, 9

      (3)    10, 10                                   (4)   9, 10


J-87-16                                          11                                Paper-II
UGC NET 2016 question paper, July 2016, Paper II, Computer Science and Applications, page 12 of 16
Page 12 of 16
Text of page 12
37.   Suppose there are four processes in execution with 12 instances of a Resource R in a
      system.

      The maximum need of each process and current allocation are given below :

            Process         Max. Need          Current
                                              Allocation

              P1                8                  3

              P2                9                  4

              P3                5                  2

              P4                3                  1

      With reference to current allocation, is system safe ? If so, what is the safe sequence ?

      (1)   No                                        (2)   Yes, P1P2P3P4

      (3)   Yes, P4P3P1P2                             (4)   Yes, P2P1P3P4



38.   If the Disk head is located initially at track 32, find the number of disk moves required
      with FCFS scheduling criteria if the disk queue of I/O blocks requests are :

      98, 37, 14, 124, 65, 67

      (1)   320                                       (2)   322

      (3)   321                                       (4)   319



39.   In UNIX, _________ creates three subdirectories : ‘PIS’ and two subdirectories ‘progs’
      and ‘data’ from just created subdirectory ‘PIS’.

      (1)    mkdir PIS/progs PIS/data PIS

      (2)    mkdir PIS progs data

      (3)    mkdir PIS PIS/progs PIS/data

      (4)    mkdir PIS/progs data


Paper-II                                         12                                          J-87-16
UGC NET 2016 question paper, July 2016, Paper II, Computer Science and Applications, page 13 of 16
Page 13 of 16
Text of page 13
40.   A scheduling Algorithm assigns priority proportional to the waiting time of a process.
      Every process starts with priority zero (lowest priority). The scheduler reevaluates the
      process priority for every ‘T’ time units and decides next process to be scheduled. If the
      process have no I/O operations and all arrive at time zero, then the scheduler implements
      _________ criteria.

      (1)   Priority scheduling

      (2)   Round Robin Scheduling

      (3)   Shortest Job First

      (4)   FCFS



41.   If S1 is total number of modules defined in the program architecture, S3 is the number of
      modules whose correct function depends on prior processing then the number of modules
      not dependent on prior processing is :

              S3                                            S3
      (1)   1+S                                     (2)   1–S
                 1                                             1

              S1                                            S1
      (3)   1+S                                     (4)   1–S
                 3                                             3




42.   The ________ model is preferred for software development when the requirements are not
      clear.

      (1)   Rapid Application Development

      (2)   Rational Unified Process

      (3)   Evolutionary Model

      (4)   Waterfall Model



43.   Which of the following is not included in waterfall model ?

      (1)   Requirement analysis                    (2)   Risk analysis

      (3)   Design                                  (4)   Coding
J-87-16                                        13                                       Paper-II
UGC NET 2016 question paper, July 2016, Paper II, Computer Science and Applications, page 14 of 16
Page 14 of 16
Text of page 14
44.   The cyclomatic complexity of a flow graph V(G), in terms of predicate nodes is :

      (1)   P+1                                      (2)   P–1

      (3)   P–2                                      (4)   P+2

      Where P is number of predicate nodes in flow graph V(G).



45.   The extent to which a software tolerates the unexpected problems, is termed as :

      (1)   Accuracy                                 (2)   Reliability

      (3)   Correctness                              (4)   Robustness



46.   An attacker sits between customer and Banker, and captures the information from the
      customer and retransmits to the banker by altering the information. This attack is called as
      ______.

      (1)   Masquerade Attack

      (2)   Replay Attack

      (3)   Passive Attack

      (4)   Denial of Service Attack



47.   Consider the following two statements :

      (A) Business intelligence and Data warehousing is used for forecasting and Data mining.

      (B)   Business intelligence and Data warehousing is used for analysis of large volumes of
            sales data.

      Which one of the following options is correct ?

      (1)   (A) is true, (B) is false.

      (2)   Both (A) and (B) are true.

      (3)   (A) is false, (B) is true.

      (4)   Both (A) and (B) are false.

Paper-II                                        14                                         J-87-16
UGC NET 2016 question paper, July 2016, Paper II, Computer Science and Applications, page 15 of 16
Page 15 of 16
Text of page 15
48.   Pipelining improves performance by :

      (1)   decreasing instruction latency

      (2)   eliminating data hazards

      (3)   exploiting instruction level parallelism

      (4)   decreasing the cache miss rate



49.   Consider the following two statements :

      (A) Data scrubling is a process to upgrade the quality of data, before it is moved into
          Data warehouse.

      (B)   Data scrubling is a process of rejecting data from data warehouse to create indexes.

      Which one of the following options is correct ?

      (1)   (A) is true, (B) is false.

      (2)   (A) is false, (B) is true.

      (3)   Both (A) and (B) are false.

      (4)   Both (A) and (B) are true.



50.   Given the following statements :

      (A) Strategic value of data mining is timestamping.

      (B)   Information collection is an expensive process in building an expert system.

      Which of the following options is correct ?

      (1)   Both (A) and (B) are false.

      (2)   Both (A) and (B) are true.

      (3)   (A) is true, (B) is false.

      (4)   (A) is false, (B) is true.



                                             ____________
J-87-16                                           15                                       Paper-II
UGC NET 2016 question paper, July 2016, Paper II, Computer Science and Applications, page 16 of 16
Page 16 of 16
Text of page 16
Space For Rough Work




Paper-II           16             J-87-16
Page 1 of 16

Source: University Grants Commission. Question paper published by University Grants Commission.