{"id":543,"date":"2020-04-15T14:12:29","date_gmt":"2020-04-15T14:12:29","guid":{"rendered":"https:\/\/temp.ashkerala.com\/?p=543"},"modified":"2020-04-15T14:12:29","modified_gmt":"2020-04-15T14:12:29","slug":"ugc-net-computer-science-solved-paper-ii-december-2019-part-3","status":"publish","type":"post","link":"https:\/\/temp.ashkerala.com\/?p=543","title":{"rendered":"UGC NET Computer Science Solved Paper II December 2019 – Part 3"},"content":{"rendered":"
    \n
  1. Match List-I<\/strong> with List-II<\/strong>:<\/li>\n<\/ol>\n

    List-I\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\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 List-II<\/strong><\/p>\n

    (a) Frame attribute\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (i) to create link in HTML<\/p>\n

    (b) <tr> tag\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 (ii) for vertical alignment of content in cell<\/p>\n

    (c) valign attribute\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (iii) to enclose each row in table<\/p>\n

    (d) <a> tag\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 (iv) to specify the side of the table frame that display<\/p>\n

    border<\/p>\n

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

    (1) (a)-(i), (b)-(ii), (c)-(iii), (d)-(iv)\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) (a)-(ii), (b)-(i), (c)-(iii), (d)-(iv)<\/p>\n

    (3) (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) (a)-(iii), (b)-(iv), (c)-(ii), (d)-(i)<\/p>\n

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

      \n
    1. The time complexity to multiply two polynomials of degree n using Fast Fourier transform method is:<\/li>\n<\/ol>\n

      (1) \u256c\u2555(n lg n)\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) \u256c\u2555(n2<\/sup>)<\/p>\n

      (3) \u256c\u2555(n)\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\u00a0\u00a0\u00a0 (4) \u256c\u2555(lg n )<\/p>\n

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

        \n
      1. Let Wij<\/sub> represents weight between node i<\/em> at layer k<\/em> and node j<\/em> at layer (k<\/em> \u0393\u00c7\u00f4 1) of a given multilayer perceptron. The weight updation using gradient descent method is given by<\/li>\n<\/ol>\n

        \"\"<\/p>\n

        Where \u256c\u2592 and E represents learning rate and Error in the output respectively.<\/p>\n

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

          \n
        1. A clique in an undirected graph G = (V, E) is a subset V\u0393\u00c7\u00d6 \u0393\u00e8\u00e5 V of vertices, such that<\/li>\n<\/ol>\n

          (1) If (u, v) \u0393\u00ea\u00ea E then u \u0393\u00ea\u00ea V\u0393\u00c7\u00d6 and v \u0393\u00ea\u00ea V\u0393\u00c7\u00d6<\/p>\n

          (2) If (u, v) \u0393\u00ea\u00ea E then u \u0393\u00ea\u00ea V\u0393\u00c7\u00d6 or v \u0393\u00ea\u00ea V\u0393\u00c7\u00d6<\/p>\n

          (3) Each pair of vertices in V\u0393\u00c7\u00d6 is connected by an edge<\/p>\n

          (4) All pairs of vertices in V\u0393\u00c7\u00d6 are not connected by an edge<\/p>\n

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

            \n
          1. What is the worst case running time of Insert and Extract-min, in an implementation of a priority queue using an unsorted array? Assume that all insertions can be accommodated.<\/li>\n<\/ol>\n

            (1) \u256c\u2555<\/em>(1), \u256c\u2555<\/em>(n)\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) \u256c\u2555<\/em>(n), \u256c\u2555<\/em>(1)<\/p>\n

            (3) \u256c\u2555<\/em>(1), \u256c\u2555<\/em>(1)\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) \u256c\u2555<\/em>(n), \u256c\u2555<\/em>(n)<\/p>\n

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

              \n
            1. Match List-I<\/strong> and List-II<\/strong>:<\/li>\n<\/ol>\n

              List-I\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\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 List-II<\/strong><\/p>\n

              (a) Isolated I\/O\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\u00a0\u00a0 (i) same set of control signal for I\/O and memory<\/p>\n

              communication<\/p>\n

              (b) Memory mapped I\/O\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (ii) separate instructions for I\/O and memory<\/p>\n

              communication<\/p>\n

              (c) I\/O interface\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\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (iii) requires control signals to be transmitted<\/p>\n

              between the communicating units<\/p>\n

              (d) Asynchronous data trandfer\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (iv) resolve the differences in central computer and<\/p>\n

              peripherals<\/p>\n

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

              (1) (a)-(ii), (b)-(iii), (c)-(iv), (d)-(i)\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) (a)-(i), (b)-(ii), (c)-(iii), (d)-(iv)<\/p>\n

              (3) (a)-(ii), (b)-(i), (c)-(iv), (d)-(iii)\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) (a)-(i), (b)-(ii), (c)-(iv), (d)-(iii)<\/p>\n

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

                \n
              1. A network with a bandwidth of 10 Mbps can pass only an average of 12,000 frames per minute with each frame carrying an average of 10,000 bits. What is the throughput of this network?<\/li>\n<\/ol>\n

                (1) 1,000,000 bps\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) 2,000,000 bps<\/p>\n

                (3) 12,000,000 bps\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) 1,200,00,000 bps<\/p>\n

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

                  \n
                1. What are the greatest lower bound (GLB) and the least upper bound (LUB) of the sets A={3, 9, 12} and B={1, 2, 4, 5, 10} if they exist in poset (z*,\/)?<\/li>\n<\/ol>\n

                  (1) A(GLB \u0393\u00c7\u00f4 3, LUB \u0393\u00c7\u00f4 36); B(GLB \u0393\u00c7\u00f4 1, LUB \u0393\u00c7\u00f4 20)<\/p>\n

                  (2) A(GLB \u0393\u00c7\u00f4 3, LUB \u0393\u00c7\u00f4 12); B(GLB \u0393\u00c7\u00f41, LUB \u0393\u00c7\u00f4 10)<\/p>\n

                  (3) A(GLB \u0393\u00c7\u00f41, LUB \u0393\u00c7\u00f4 36); B(GLB \u0393\u00c7\u00f4 2, LUB \u0393\u00c7\u00f4 20)<\/p>\n

                  (4) A(GLB \u0393\u00c7\u00f4 1, LUB \u0393\u00c7\u00f4 12); B (GLB \u0393\u00c7\u00f4 2, LUB \u0393\u00c7\u00f4 10)<\/p>\n

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

                    \n
                  1. A basic feasible solution of an m<\/em> x n<\/em> transportation problem is said to be non-degenerate, if basic feasible solution contains exactly \u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa. number of individual allocation in \u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa positions.<\/li>\n<\/ol>\n

                    (1) m+n+1, independent\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) m+n-1, independent<\/p>\n

                    (3) m+n-1, appropriate\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) m-n+1, independent<\/p>\n

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

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

                      L1 = The context \u0393\u00c7\u00f4 free languages<\/p>\n

                      L2 = The context \u0393\u00c7\u00f4 sensitive languages<\/p>\n

                      L3 = The recursively enumerable languages<\/p>\n

                      L4 = The recursive languages<\/p>\n

                      Which one of the following options is correct?<\/p>\n

                      (1) L1 \u0393\u00e8\u00e5 L2 \u0393\u00e8\u00e5 L3 \u0393\u00e8\u00e5 L4\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\u00a0 (2) L2 \u0393\u00e8\u00e5 L1 \u0393\u00e8\u00e5 L3 \u0393\u00e8\u00e5 L4<\/p>\n

                      (3) L1 \u0393\u00e8\u00e5 L2 \u0393\u00e8\u00e5 L4 \u0393\u00e8\u00e5 L3\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\u00a0 (4) L2 \u0393\u00e8\u00e5 L1 \u0393\u00e8\u00e5 L4 \u0393\u00e8\u00e5 L3<\/p>\n

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

                        \n
                      1. Identify the circumstances under which pre-emptive CPU scheduling is used:<\/li>\n<\/ol>\n

                        (a) A process switches from Running state to Ready state<\/p>\n

                        (b) A process switches from Waiting state to Ready state<\/p>\n

                        (c) A process completes its execution<\/p>\n

                        (d) A process switches from Ready to Waiting state<\/p>\n

                        Choose the correct option:<\/p>\n

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

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

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

                          \n
                        1. Consider the game tree given below<\/li>\n<\/ol>\n

                          \"\"<\/p>\n

                          (1) 14\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) 17\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (3) 111\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) 112<\/p>\n

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

                            \n
                          1. Consider a subnet with 720 routers. If a three-level hierarchy is chosen, with eight clusters, each containing 9 regions of 10 routers, then total number of entries in hierarchical table of each router is<\/li>\n<\/ol>\n

                            (1) 25\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) 27\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (3) 53\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) 72<\/p>\n

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

                              \n
                            1. An \u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa chart is a project schedule representation that presents project plan as a directed graph. The critical path is the \u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa.. sequence of \u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa. tasks and it defines project \u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa…<\/li>\n<\/ol>\n

                              (1) Activity, Shortest, Independent, Cost<\/p>\n

                              (2) Activity, Longest, Dependent, Duration<\/p>\n

                              (3) Activity, Longest, Independent, Duration<\/p>\n

                              (4) Activity, Shortest, Dependent, Duration<\/p>\n

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

                                \n
                              1. Piconet is a basic unit of a Bluetooth system consisting of \u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa.. master node and up to \u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa.. active salve nodes.<\/li>\n<\/ol>\n

                                (1) one, five\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) one, seven<\/p>\n

                                (3) two, eight\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) one, eight<\/p>\n

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

                                  \n
                                1. Which of the following interprocess communication model is used to exchange messages among co-operative processes?<\/li>\n<\/ol>\n

                                  (1) Shared memory model\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/p>\n

                                  (2) Message passing model<\/p>\n

                                  (3) Shared memory and message passing model.<\/p>\n

                                  (4) Queues<\/p>\n

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

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

                                    S1:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 If a group (G,*) is of order n, and a \u0393\u00ea\u00ea G is such that am<\/sup> = e for some integer m\u0393\u00eb\u00f1n, then m must divide n.<\/p>\n

                                    S2: \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 If a group (G,*) is of even order, then there must be an element and a \u0393\u00ea\u00ea G is such that a \u0393\u00eb\u00e1 e and a * a = e.<\/p>\n

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

                                    (1) Only S1\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 S2<\/p>\n

                                    (3) Both S1 and S2\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) Neither S1 nor S2<\/p>\n

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

                                      \n
                                    1. Consider \u256c\u00fa={w,x<\/em>} and T<\/em>={x,y,z<\/em>}. Define homomorphism h<\/em> by:<\/li>\n<\/ol>\n

                                      h(x)=xzy<\/em><\/p>\n

                                      h(w)=zxyy<\/em><\/p>\n

                                      If L<\/em> is the regular language denoted by r = (w + x*)(ww)*<\/em>, then the regular language h(L)<\/em> is given by<\/p>\n

                                      (1) (zxyy + xzy)(zxyy)<\/em>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) (zxyy + (xzy)*)(zxyy zxyy)*<\/em><\/p>\n

                                      (3) (zxyy + xzy)(zxyy)*<\/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\u00a0\u00a0\u00a0\u00a0 (4) (zxyy + (xzy)* (zxyy zxyy)<\/em><\/p>\n

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

                                        \n
                                      1. Consider a paging system where translation look aside buffer (TLB) a special type of associative memory is used with hit ratio of 80%.<\/li>\n<\/ol>\n

                                        Assume that memory reference takes 80 nanoseconds and reference time to TLB is 20 nanoseconds. What will be the effective memory access time given 80% hit ratio?<\/p>\n

                                        (1) 110 nanoseconds\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) 116 nanoseconds<\/p>\n

                                        (3) 200 nanoseconds\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) 100 nanoseconds<\/p>\n

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

                                          \n
                                        1. Consider the following statement with respect to approaches to fill area on raster systems:<\/li>\n<\/ol>\n

                                          P:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 To determine the overlap intervals for scan lines that cross the area.<\/p>\n

                                          Q: \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 To start from a given interior position and paint outward from this point until we encounter the specified boundary conditions.<\/p>\n

                                          Select the correct answer from the options given below:<\/p>\n

                                          (1) P only\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 (2) Q only<\/p>\n

                                          (3) Both P and Q\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) Neither P nor Q<\/p>\n

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

                                          Match List-I with List-II: List-I\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\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 List-II (a) Frame attribute\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (i) to create link in HTML (b) <tr> tag\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 (ii) for vertical alignment of content in cell (c) valign attribute\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (iii) to enclose each row in table (d) <a> tag\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 (iv) to specify the side of the table frame that display border Choose the correct option…<\/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-543","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\/543","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=543"}],"version-history":[{"count":0,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts\/543\/revisions"}],"wp:attachment":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=543"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=543"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=543"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}