{"id":545,"date":"2020-04-15T14:24:18","date_gmt":"2020-04-15T14:24:18","guid":{"rendered":"https:\/\/temp.ashkerala.com\/?p=545"},"modified":"2020-04-15T14:24:18","modified_gmt":"2020-04-15T14:24:18","slug":"ugc-net-computer-science-solved-paper-ii-december-2019-part-5","status":"publish","type":"post","link":"https:\/\/temp.ashkerala.com\/?p=545","title":{"rendered":"UGC NET Computer Science Solved Paper II December 2019 – Part 5"},"content":{"rendered":"
    \n
  1. If we want to resize a 1024 \u251c\u00f9 768 pixels image to one that is 640 pixels wide with the same aspect ratio, what would be the height of the resized image?<\/li>\n<\/ol>\n

    (1) 420 Pixels\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) 460 Pixels<\/p>\n

    (3) 480 Pixels\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) 540 Pixels<\/p>\n

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

      \n
    1. An instruction is stored at location 500 with its address field at location 501. The address field has the value 400. A processor register R1 contains the number 200. Match the addressing mode (List-I) given below with effective address (List-II) for the given instruction:<\/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\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 List-II<\/strong><\/p>\n

      (a) Direct\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\u00a0\u00a0\u00a0 (i) 200<\/p>\n

      (b) Register Indirect\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 (ii) 902<\/p>\n

      (c) Index with R1 as the index register\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (iii) 400<\/p>\n

      (d) Relative\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\u00a0 (iv) 600<\/p>\n

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

      (1) (a)-(iii), (b)-(i), (c)-(iv), (d)-(ii)\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)-(iv), (b)-(ii), (c)-(iii), (d)-(i)\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)<\/p>\n

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

        \n
      1. A tree has 2n vertices of degree 1, 3n vertices of degree 2, n vertices of degree 3. Determine the number of vertices and edges in tree.<\/li>\n<\/ol>\n

        (1) 12, 11\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) 11, 12<\/p>\n

        (3) 10, 11\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) 9, 10<\/p>\n

        Answer: 1<\/p>\n

          \n
        1. Match List-I with List-II:<\/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\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 List-II<\/strong><\/p>\n

          (a) Micro operation\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 (i) Specify micro operations<\/p>\n

          (b) Micro programmed control unit\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (ii) Improve CPU utilization<\/p>\n

          (c) Interrupts\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 (iii) Control memory<\/p>\n

          (d) Micro instruction\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 (iv) Elementary operation performed on data<\/p>\n

          stored in registers<\/p>\n

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

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

          (3) (a)-(iii), (b)-(iv), (c)-(i), (d)-(ii)\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: 1<\/strong><\/p>\n

            \n
          1. Suppose a system has 12 magnetic tape drives and at time t0<\/sub>, three processes are allotted tape drives out of their need as given below:<\/li>\n<\/ol>\n

            \"\"<\/p>\n

            At time t0<\/sub>, the system is in safe state. Which of the following is safe sequence so that deadlock is avoided?<\/p>\n

            (1) \u0393\u0192\u00bfp0<\/sub>, p1<\/sub>, p2<\/sub>\u0393\u0192\u2310\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) \u0393\u0192\u00bfp1<\/sub>, p0<\/sub>, p2<\/sub>\u0393\u0192\u2310<\/p>\n

            (3) \u0393\u0192\u00bfp2<\/sub>, p1<\/sub>, p0<\/sub>\u0393\u0192\u2310\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) \u0393\u0192\u00bfp0<\/sub>, p2<\/sub>, p1<\/sub>\u0393\u0192\u2310<\/p>\n

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

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

              (a) Fiber optic cable is much lighter than copper cable.<\/p>\n

              (b) Fiber optic cable is not affected by power surges or electromagnetic interference.<\/p>\n

              (c) Optical transmission is inherently bidirectional.<\/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 (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 (4) (a), (b) and (c)<\/p>\n

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

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

                M1<\/sub>: Mamdani model<\/p>\n

                M2<\/sub>: Takagi-Sugeno-Kang model<\/p>\n

                M3<\/sub>: Kosko’s additive model(SAM)<\/p>\n

                Which of the following option contains examples of additive rule model?<\/p>\n

                (1) Only M1<\/sub> and M2<\/sub>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) Only M2<\/sub> and M3<\/sub><\/p>\n

                (3) Only M1<\/sub> and M3<\/sub>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) M1<\/sub>, M2<\/sub> and M3<\/sub><\/p>\n

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

                  \n
                1. Give asymptotic upper and lower bound for T<\/em>(n<\/em>) given below. Assume T<\/em>(n<\/em>) is constant for n<\/em>\u0393\u00eb\u00f12.<\/li>\n<\/ol>\n

                  T<\/em>(n<\/em>)= 4T(\u0393\u00ea\u00dcn)+lg2<\/sup> n<\/p>\n

                  (1) T<\/em>(n<\/em>)= \u256c\u2555<\/em>(lg*(lg2<\/sup> n<\/em>)lg n<\/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 (2) T<\/em>(n<\/em>)= \u256c\u2555<\/em>(lg2<\/sup>n<\/em> lg n<\/em>)<\/p>\n

                  (3) T<\/em>(n<\/em>)= \u256c\u2555<\/em>(lg2<\/sup> n<\/em> lg lg n<\/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 (4) T<\/em>(n<\/em>)= \u256c\u2555<\/em>(lg (lg n<\/em>)lg n<\/em>)<\/p>\n

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

                    \n
                  1. The Boolean expression<\/li>\n<\/ol>\n

                    \"\"\u00a0<\/p>\n

                    is unaffected by the value of the Boolean variable \u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa.<\/p>\n

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

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

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

                      \n
                    1. Let A be the base class in C++ and B be the derived class from A with protected inheritance.<\/li>\n<\/ol>\n

                      Which of the following statement is false for class B?<\/p>\n

                      (1) Member function of class B can access protected data of class A<\/p>\n

                      (2) Member function of class B can access public data of class A<\/p>\n

                      (3) Member function of class B cannot access private data of class A<\/p>\n

                      (4) Object of derived class B can access public base class data<\/p>\n

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

                      Comprehension:<\/strong><\/p>\n

                      Answer the following questions (91 – 95) based on flow graph F.<\/strong><\/p>\n

                      A flow graph F with entry node (1) and exit node (11) is shown below:<\/p>\n

                        \n
                      1. How many nodes are there in the longest independent path?<\/li>\n<\/ol>\n

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

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

                          \n
                        1. How many regions are there in flow graph F?<\/li>\n<\/ol>\n

                          (1) 2\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) 3\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) 5<\/p>\n

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

                            \n
                          1. How many nodes are there in flow graph F?<\/li>\n<\/ol>\n

                            (1) 9\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) 10\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (3) 11\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) 12<\/p>\n

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

                              \n
                            1. What is the cyclomatic complexity of flow graph F?<\/li>\n<\/ol>\n

                              (1) 2\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) 3\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) 5<\/p>\n

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

                                \n
                              1. How many predicate nodes are there and what are their names?<\/li>\n<\/ol>\n

                                (1) Three: (1, (2,3), 6)\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) Three: (1, 4, 6)<\/p>\n

                                (3) Four: ((2,3), 6, 10, 11)\u00a0\u00a0\u00a0\u00a0 (4) Four: ((2,3), 6, 9, 10)<\/p>\n

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

                                Comprehension:<\/strong><\/p>\n

                                Answer question (96 – 100) based on the problem statement given below:<\/strong><\/p>\n<\/p>\n

                                An organization needs to maintain database having five attributes A, B, C, D, E. These attributes are functionally dependent on each other for which functionally dependency set F is given as: F:<\/p>\n

                                \"\"<\/p>\n

                                {A\u0393\u00e5\u00c6 BC, D \u0393\u00e5\u00c6 E, BC \u0393\u00e5\u00c6 D, A \u0393\u00e5\u00c6D}. Consider a universal relation R(A, B, C, D, E) with functional dependency set F. Also all attributes are simple and take atomic values only.<\/p>\n<\/p>\n

                                  \n
                                1. Minimal cover F\u0393\u00c7\u00d6 of functional dependency set F is<\/li>\n<\/ol>\n

                                  (1) F\u0393\u00c7\u00d6 = {A \u0393\u00e5\u00c6 B, A \u0393\u00e5\u00c6 C, BC \u0393\u00e5\u00c6 D, D \u0393\u00e5\u00c6E}<\/p>\n

                                  (2) F\u0393\u00c7\u00d6 = {A \u0393\u00e5\u00c6 BC, B \u0393\u00e5\u00c6 D, D \u0393\u00e5\u00c6 E}<\/p>\n

                                  (3) F\u0393\u00c7\u00d6 = {A \u0393\u00e5\u00c6 B, A \u0393\u00e5\u00c6 C, A \u0393\u00e5\u00c6 D, D \u0393\u00e5\u00c6 E}<\/p>\n

                                  (4) F\u0393\u00c7\u00d6 = {A \u0393\u00e5\u00c6 B, A \u0393\u00e5\u00c6 C, B \u0393\u00e5\u00c6 D, C \u0393\u00e5\u00c6 D, D \u0393\u00e5\u00c6 E}<\/p>\n

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

                                    \n
                                  1. Assume that given table R is decomposed in two tables.<\/li>\n<\/ol>\n

                                    R1<\/sub>(A,B,C) with functional dependency set F1<\/sub> = {A \u0393\u00e5\u00c6 B, A \u0393\u00e5\u00c6 C} and<\/p>\n

                                    R2<\/sub>(A,D,E) with FD set F2<\/sub> = {A \u0393\u00e5\u00c6 D, D \u0393\u00e5\u00c6 E}<\/p>\n

                                    Which of the following option is true w.r.t. given decomposition?<\/p>\n

                                    (1) Dependency preservation property is followed<\/p>\n

                                    (2) R1<\/sub> and R2<\/sub> are both in 2 NF<\/p>\n

                                    (3) R2<\/sub> is in 2 NF and R3<\/sub> is in 3 NF<\/p>\n

                                    (4) R1<\/sub> is in 3 NF and R2<\/sub> is in 2 NF<\/p>\n

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

                                      \n
                                    1. Identify the redundant functional dependency in F<\/li>\n<\/ol>\n

                                      (1) BC\u0393\u00e5\u00c6D\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) D\u0393\u00e5\u00c6E<\/p>\n

                                      (3) A\u0393\u00e5\u00c6D\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) A\u0393\u00e5\u00c6BC<\/p>\n

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

                                        \n
                                      1. Identify primary key of table R with functional dependency set F<\/li>\n<\/ol>\n

                                        (1) BC\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) AD<\/p>\n

                                        (3) A\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) AB<\/p>\n

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

                                          \n
                                        1. Identify the normal form in which relation R belong to<\/li>\n<\/ol>\n

                                          (1) 1 NF\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) 2 NF<\/p>\n

                                          (3) 3 NF\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) BCNF<\/p>\n

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

                                          If we want to resize a 1024 \u251c\u00f9 768 pixels image to one that is 640 pixels wide with the same aspect ratio, what would be the height of the resized image? (1) 420 Pixels\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) 460 Pixels (3) 480 Pixels\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) 540 Pixels Answer: 3 An instruction is stored at location 500 with its…<\/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-545","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\/545","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=545"}],"version-history":[{"count":0,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts\/545\/revisions"}],"wp:attachment":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=545"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=545"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=545"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}