{"id":541,"date":"2020-04-15T14:01:52","date_gmt":"2020-04-15T14:01:52","guid":{"rendered":"https:\/\/temp.ashkerala.com\/?p=541"},"modified":"2020-04-15T14:01:52","modified_gmt":"2020-04-15T14:01:52","slug":"ugc-net-computer-science-solved-paper-ii-december-2019-part-1","status":"publish","type":"post","link":"https:\/\/temp.ashkerala.com\/?p=541","title":{"rendered":"UGC NET Computer Science Solved Paper II December 2019 – Part 1"},"content":{"rendered":"<\/p>\n
    \n
  1. Consider the language L = <\/em>{an<\/sup>bn-3<\/sup> | n>2<\/em>} on \u256c\u00fa = {a, b<\/em>}. Which one of the following grammars generates the language L<\/em>?<\/li>\n<\/ol>\n

    (1) S \u0393\u00e5\u00c6 aA | a, A \u0393\u00e5\u00c6 aAb | b\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 <\/em>(2) S \u0393\u00e5\u00c6 aaA | \u256c\u2557, A \u0393\u00e5\u00c6 aAb | \u256c\u2557<\/em><\/p>\n

    (3) S \u0393\u00e5\u00c6 aaaA | a, A \u0393\u00e5\u00c6 aAb | \u256c\u2557\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 <\/em>(4) S \u0393\u00e5\u00c6 aaaA | \u256c\u2557, A \u0393\u00e5\u00c6 aAb | \u256c\u2557<\/em><\/p>\n

    Answer: 4<\/strong><\/p>\n

      \n
    1. A computer uses a memory unit of 512 K words of 32 bits each. A binary instruction code is stored in one word of the memory. The instruction has four parts: an addressing mode field to specify one of the two-addressing mode (direct and indirect), an operation code, a register code part to specify one of the 256 registers and an address part. How many bits are there in addressing mode part, opcode part, register code part and the address part?<\/li>\n<\/ol>\n

      (1) 1, 3, 9, 19\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) 1, 4, 9, 18<\/p>\n

      (3) 1, 4, 8, 19\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) 1, 3, 8, 20<\/p>\n

      Answer: 3<\/strong><\/p>\n

        \n
      1. What is the output of following C program?<\/li>\n<\/ol>\n

        # include<stdio.h><\/p>\n

        main( )<\/p>\n

        {<\/p>\n

        int i, j, x = 0;<\/p>\n

        for (i = 0; i < 5; ++i)<\/p>\n

        for (j = 0; j < i; ++j)<\/p>\n

        {<\/p>\n

        x + = (i + j \u0393\u00c7\u00f4 1);<\/p>\n

        break;<\/p>\n

        }<\/p>\n

        printf (\u0393\u00c7\u00a3%d\u0393\u00c7\u00a5,x) ;<\/p>\n

        }<\/p>\n

        (1) 6\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) 5\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (3) 4\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) 3<\/p>\n

        Answer: 1<\/strong><\/p>\n

          \n
        1. Consider the following languages:<\/li>\n<\/ol>\n

          L1<\/em> = {an<\/sup>bn<\/sup>cm<\/sup><\/em>} \u0393\u00ea\u00ac {an<\/sup> bm<\/sup> cm<\/sup><\/em>}, n, m \u0393\u00eb\u00d1 0<\/em><\/p>\n

          L2<\/em> = {\u2567\u00eb\u2567\u00ebR<\/sup> | \u2567\u00eb\u0393\u00ea\u00ea{a, b}*} Where R represents reversible operation.<\/p>\n

          Which one of the following is (are) inherently ambiguous language(s)?<\/p>\n

          (1) only L1<\/em>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) only L2<\/em><\/p>\n

          (3) both L1<\/em> and L2<\/em>\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) neither L1<\/em> nor L2<\/em><\/p>\n

          Answer: 1<\/strong><\/p>\n

            \n
          1. A fuzzy conjunction operators, t(x,y), and a fuzzy disjunction operator, s(x,y), from a pair if they satisfy:<\/li>\n<\/ol>\n

            t(x,y) = 1 – s(1 – x, 1 – y).<\/p>\n

            \"\"<\/p>\n

            Answer: 2<\/strong><\/p>\n

              \n
            1. Which of the following statements are true regarding C++?<\/li>\n<\/ol>\n

              (a) Overloading gives the capability to an existing operator to operate on other data types.<\/p>\n

              (b) Inheritance in object oriented programming provides support to reusability.<\/p>\n

              (c) When object of a derived class is defined, first the constructor of derived class is executed then constructor of a base class is executed.<\/p>\n

              (d) Overloading is a type of polymorphism.<\/p>\n

              Choose the correct option from those given below:<\/p>\n

              (1) (a) and (b) only\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) (a), (b) and (c) only<\/p>\n

              (3) (a), (b) and (d) only\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) (b), (c) and (d) only<\/p>\n

              Answer: 3<\/strong><\/p>\n

                \n
              1. Which of the following class of IP address has the last address as 223.255.255.255?<\/li>\n<\/ol>\n

                (1) Class A\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) Class B<\/p>\n

                (3) Class C\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) Class D<\/p>\n

                Answer: 3<\/p>\n

                  \n
                1. Let A = (001, 0011, 11, 101} and B = (01, 111, 111, 010}. Similarly, let C = {00, 001, 1000} and D = {0, 11, 011}.<\/li>\n<\/ol>\n

                  Which of the following pairs have a post-correspondence solution?<\/p>\n

                  (1) Only pair (A, B)\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) Only pair (C, D)<\/p>\n

                  (3) Both (A, B) and (C, D)\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) Neither (A, B) nor (C, D)<\/p>\n

                  Answer: 1<\/strong><\/p>\n

                    \n
                  1. The sequence diagram given in Figure 1 for the Weather Information System takes place when an external system requests the summarized data from the weather station.<\/li>\n<\/ol>\n

                    \"\"<\/p>\n

                    The increasing order of lifeline for the objects in the system are:<\/p>\n

                    (1) Sat comms \u0393\u00e5\u00c6 Weather station \u0393\u00e5\u00c6 Comms link \u0393\u00e5\u00c6 Weather data<\/p>\n

                    (2) Sat comms \u0393\u00e5\u00c6 Comms link \u0393\u00e5\u00c6 Weather station \u0393\u00e5\u00c6 Weather data<\/p>\n

                    (3) Weather data \u0393\u00e5\u00c6 Comms link \u0393\u00e5\u00c6 Weather station \u0393\u00e5\u00c6 Sat Comms<\/p>\n

                    (4) Weather data \u0393\u00e5\u00c6 Weather station \u0393\u00e5\u00c6 Comms link \u0393\u00e5\u00c6 Sat Comms<\/p>\n

                    Answer: Marks to all<\/p>\n

                      \n
                    1. A counting semaphore is initialized to 8. 3 wait() operations and 4 signal() operations are applied. Find the current value of semaphore variable.<\/li>\n<\/ol>\n

                      (1) 9\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) 5\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (3) 1\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) 4<\/p>\n

                      Answer: 1<\/strong><\/p>\n

                        \n
                      1. Consider the following Linear programming problem (LPP):<\/li>\n<\/ol>\n

                        Maximize z = x1<\/sub> + x2<\/sub><\/p>\n

                        Subject to the constraints:<\/p>\n

                        x1<\/sub>+2x2<\/sub> \u0393\u00eb\u00f1 2000<\/p>\n

                        x1<\/sub>+x2<\/sub> \u0393\u00eb\u00f1 1500<\/p>\n

                        x2<\/sub> \u0393\u00eb\u00f1 600<\/p>\n

                        and x1<\/sub>, x2<\/sub> \u0393\u00eb\u00d1 0<\/p>\n

                        The solution of the above LPP is:<\/p>\n

                        (1) x1<\/sub>=750, x2<\/sub>=750, z=1500\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) x1<\/sub>=500, x2<\/sub>=1000, z=1500<\/p>\n

                        (3) x1<\/sub>=1000, x2<\/sub>=500, z=1500\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) x1<\/sub>=900, x2<\/sub>=600, z=1500<\/p>\n

                        Answer: 3<\/strong><\/p>\n

                          \n
                        1. Which of the following CPU scheduling algorithms is\/are supported by LINUX operating system?<\/li>\n<\/ol>\n

                          (1) Non-preemptive priority scheduling<\/p>\n

                          (2) Preemptive priority scheduling and time sharing CPU scheduling<\/p>\n

                          (3) Time sharing scheduling only<\/p>\n

                          (4) Priority scheduling only<\/p>\n

                          Answer: 2<\/strong><\/p>\n

                            \n
                          1. Which tag is used to enclose any number of javascript statements in HTML document?<\/li>\n<\/ol>\n

                            (1) <code>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) <script><\/p>\n

                            (3) <title>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) <body><\/p>\n

                            Answer: 2<\/p>\n

                              \n
                            1. When using Dijkstra\u0393\u00c7\u00d6s algorithm to find shortest path in a graph, which of the following statement is not<\/u> true?<\/li>\n<\/ol>\n

                              (1) It can find shortest path within the same graph data structure<\/p>\n

                              (2) Every time a new node is visited, we choose the node with smallest known<\/p>\n

                              distance\/cost (weight) to visit first<\/p>\n

                              (3) Shortest path always passes through least number of vertices<\/p>\n

                              (4) The graph needs to have a non-negative weight on every edge<\/p>\n

                              Answer: 3<\/strong><\/p>\n

                                \n
                              1. Consider the following statements with respect to duality in LPP:<\/li>\n<\/ol>\n

                                (a) The final simplex table giving optimal solution of the primal also contains optimal<\/p>\n

                                solution of its dual in itself.<\/p>\n

                                (b) If either the primal or the dual problem has a finite optimal solution, then the other<\/p>\n

                                problem also has a finite optimal solution.<\/p>\n

                                (c) If either problem has an unbounded optimum solution, then the other problem has no<\/p>\n

                                feasible solution at all.<\/p>\n

                                Which of the statements is (are) correct?<\/p>\n

                                (1) only (a) and (b)\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) only (a) and (c)<\/p>\n

                                (3) only (b) and (c)\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) (a), (b) and (c)<\/p>\n

                                Answer: 4<\/strong><\/p>\n

                                  \n
                                1. Given two tables EMPLOYEE (EID, ENAME, DEPTNO)<\/li>\n<\/ol>\n

                                  DEPARTMENT (DEPTNO. DEPTNAME)<\/p>\n

                                  Find the most appropriate statement of the given query:<\/p>\n

                                  Select count (*) \u0393\u00c7\u00fftotal\u0393\u00c7\u00d6<\/p>\n

                                  from EMPLOYEE<\/p>\n

                                  where DEPTNO IN (D1, D2)<\/p>\n

                                  group by DEPTNO<\/p>\n

                                  having count (*) > 5<\/p>\n

                                  (1) Total number of employees in each department D1 and D2<\/p>\n

                                  (2) Total number of employees of department D1 and D2 if their total is >5<\/p>\n

                                  (3) Display total number of employees in both departments D1 and D2<\/p>\n

                                  (4) The output of the query must have atleast two rows<\/p>\n

                                  Answer: 2<\/strong><\/p>\n

                                    \n
                                  1. In a B-Tree, each node represents a disk block. Suppose one block holds 8192 bytes. Each key uses 32 bytes. In a B-tree of order M there are M \u0393\u00c7\u00f4 1 keys. Since each branch is on another disk block, we assume a branch is of 4 bytes. The total memory requirement for a non-leaf node is<\/li>\n<\/ol>\n

                                    (1) 32 M \u0393\u00c7\u00f4 32\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) 36 M \u0393\u00c7\u00f4 32<\/p>\n

                                    (3) 36 M \u0393\u00c7\u00f4 36\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) 32 M \u0393\u00c7\u00f4 36<\/p>\n

                                    Answer: 2<\/p>\n

                                      \n
                                    1. Let G = (V, T, S, P) be any context-free grammar without any \u256c\u2557-productions or unit productions. Let K be the maximum number of symbols on the right of any production in P. The maximum number of production rules for any equivalent grammar in Chomsky normal form is given by:<\/li>\n<\/ol>\n

                                      (1) (K \u0393\u00c7\u00f4 1) |P| + |T| – 1\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) (K \u0393\u00c7\u00f4 1) |P| +|T|<\/p>\n

                                      (3) K |P| + |T| – 1\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) K |P| + |T|<\/p>\n

                                      Where | | denotes the cardinality of the set.<\/p>\n

                                      Answer: 2<\/strong><\/p>\n

                                        \n
                                      1. Given following equation:<\/li>\n<\/ol>\n

                                        (142)b<\/sub> + (112)b-2<\/sub> = (75)8<\/sub>. Find base b.<\/p>\n

                                        (1) 3\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) 6\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (3) 7\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) 5<\/p>\n

                                        Answer: 4<\/strong><\/p>\n

                                          \n
                                        1. A micro instruction format has micro operation field which is divided into 2 subfields F1 and F2, each having 15 distinct micro operations, condition field CD for four status bits, branch field BR having four options used in conjunction with address field AD. The address space is of 128 memory words. The size of micro instruction is:<\/li>\n<\/ol>\n

                                          (1) 19\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) 18\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (3) 17\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) 20<\/p>\n

                                          Answer: 1<\/strong><\/p>\n","protected":false},"excerpt":{"rendered":"

                                          Consider the language L = {anbn-3 | n>2} on \u256c\u00fa = {a, b}. Which one of the following grammars generates the language L? (1) S \u0393\u00e5\u00c6 aA | a, A \u0393\u00e5\u00c6 aAb | b\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) S \u0393\u00e5\u00c6 aaA | \u256c\u2557, A \u0393\u00e5\u00c6 aAb | \u256c\u2557 (3) S \u0393\u00e5\u00c6 aaaA | a, A \u0393\u00e5\u00c6 aAb |…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"footnotes":""},"categories":[6],"tags":[],"class_list":["post-541","post","type-post","status-publish","format-standard","hentry","category-ugc-computer"],"_links":{"self":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts\/541","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=541"}],"version-history":[{"count":0,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts\/541\/revisions"}],"wp:attachment":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=541"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=541"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=541"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}