{"id":544,"date":"2020-04-15T14:18:18","date_gmt":"2020-04-15T14:18:18","guid":{"rendered":"https:\/\/temp.ashkerala.com\/?p=544"},"modified":"2020-04-15T14:18:18","modified_gmt":"2020-04-15T14:18:18","slug":"ugc-net-computer-science-solved-paper-ii-december-2019-part-4","status":"publish","type":"post","link":"https:\/\/temp.ashkerala.com\/?p=544","title":{"rendered":"UGC NET Computer Science Solved Paper II December 2019 – Part 4"},"content":{"rendered":"
    \n
  1. Which of the following methods are used to pass any number of parameters to the operating system through system calls?<\/li>\n<\/ol>\n

    (1) Registers\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) Block or table in main memory<\/p>\n

    (3) Stack\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) Block in main memory and stack<\/p>\n

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

      \n
    1. Match the Agile Process models with the task performed during the model:<\/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\u00a0 List-II<\/strong><\/p>\n

      (a) Scrum\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\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) CRC cards<\/p>\n

      (b) Adaptive software development\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (ii) Sprint backlog<\/p>\n

      (c) Extreme programming\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) <action> the <result> <by\/for\/of\/to> a(n)<\/p>\n

      <object><\/p>\n

      (d) Feature-driven development\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (iv) Time box release plan<\/p>\n

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

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

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

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

        (a) Physical layer\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (i) Provide token management service<\/p>\n

        (b) Transport layer\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (ii) Concerned with transmitting raw bits over a<\/p>\n

        communication channel<\/p>\n

        (c) Session layer\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (iii) Concerned with the syntax and semantics of the<\/p>\n

        information transmitted<\/p>\n

        (d) Presentation layer\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (iv) True end-to-end layer from source to destination<\/p>\n

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

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

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

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

          \n
        1. According to Dempster-Shafer theory for uncertainty management,<\/li>\n<\/ol>\n

          (1) Bel<\/em>(A<\/em>) + Bel<\/em>(\u252c\u00bcA<\/em>)\u0393\u00eb\u00f11\u00a0\u00a0\u00a0\u00a0\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) Bel<\/em>(A<\/em>) + Bel<\/em>(\u252c\u00bcA<\/em>)\u0393\u00eb\u00d11<\/p>\n

          (3) Bel<\/em>(A<\/em>) + Bel<\/em>(\u252c\u00bcA<\/em>)=1\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) Bel<\/em>(A<\/em>) + Bel<\/em>(\u252c\u00bcA<\/em>)=0<\/p>\n

          Where Bel<\/em>(A<\/em>) denotes Belief of event A.<\/p>\n

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

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

            G1<\/sub>: S\u0393\u00e5\u00c6aSb | bSa | aa<\/p>\n

            G2<\/sub>: S\u0393\u00e5\u00c6aSb | bSa | SS | \u256c\u2557<\/p>\n

            G3<\/sub>: S\u0393\u00e5\u00c6aSb | bSa | SS | a<\/p>\n

            G4<\/sub>: S\u0393\u00e5\u00c6aSb | bSa | SS | SSS | \u256c\u2557<\/p>\n

            Which of the following is correct w.r.t. the above grammars?<\/p>\n

            (1) G1<\/sub> and G3<\/sub> are equivalent\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) G2<\/sub> and G3<\/sub> are equivalent<\/p>\n

            (3) G2<\/sub> and G4<\/sub> are equivalent\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) G3<\/sub> and G4<\/sub> are equivalent<\/p>\n

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

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

              (a) Trapping at local maxima<\/p>\n

              (b) Reaching a plateau<\/p>\n

              (c) Traversal along the ridge.<\/p>\n

              Which of the following option represents shortcomings of the hill climbing algorithm?<\/p>\n

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

              (3) (b) and (c) only\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. Consider the following statements with respect to the language L = {an<\/sup>bn<\/sup> | n \u0393\u00eb\u00d1 0}<\/li>\n<\/ol>\n

                \"\"<\/p>\n

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

                (1) only S1 and S2\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) only S1 and S3<\/p>\n

                (3) only S2 and S3\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) S1, S2 and S3<\/p>\n

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

                  \n
                1. According to the ISO-9126 Standard Quality Model, match the attributes given in List-I<\/strong> with their definitions in 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) Functionality\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (i) Relationship between level of performance and amount<\/p>\n

                  of resources<\/p>\n

                  (b) Reliability\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (ii) Characteristics related with achievement of purpose<\/p>\n

                  (c) Efficiency\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (iii) Effort needed to make for improvement<\/p>\n

                  (d) Maintainability\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (iv) Capability of software to maintain performance of<\/p>\n

                  software<\/p>\n

                  Choose the correct option from the ones 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)-(iv), (d)-(iii)<\/p>\n

                  (3) (a)-(ii), (b)-(iv), (c)-(i), (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. Consider the following statements:<\/li>\n<\/ol>\n

                    \"\"<\/p>\n

                    Which of the following 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. Which of the following binary codes for decimal digits are self-complementing?<\/li>\n<\/ol>\n

                      (a) 8421 code\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (b) 2421 code<\/p>\n

                      (c) excess-3 code\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (d) excess-3 gray code<\/p>\n

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

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

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

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

                        \n
                      1. How many reflexive relations are there on a set with 4 elements?<\/li>\n<\/ol>\n

                        (1) 24<\/sup>\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) 212\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 <\/sup>(3) 42<\/sup>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) 2<\/p>\n

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

                          \n
                        1. Which of the following is not needed by an encryption algorithm used in Cryptography?<\/li>\n<\/ol>\n

                          (1) KEY\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) Message<\/p>\n

                          (3) Ciphertext\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) User details<\/p>\n

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

                            \n
                          1. Which of the component module of DBMS does rearrangement and possible ordering of operations, eliminate redundancy in query and use efficient algorithms and indexes during the execution of a query?<\/li>\n<\/ol>\n

                            (1) query compiler\u00a0\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) query optimizer<\/p>\n

                            (3) Stored data manager\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) Database processor<\/p>\n

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

                              \n
                            1. Consider a weighted directed graph. The current shortest distance from source S to node x is represented by d[x]. Let d[v] = 29, d[u] = 15, w[u, v] = 12. What is the updated value of d[v] based on current information<\/li>\n<\/ol>\n

                              (1) 29\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 (3) 25\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) 17<\/p>\n

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

                                \n
                              1. A rectangle is bounded by the lines x = 0; y = 0, x = 5 and y = 3. The line segment joining (\u0393\u00c7\u00f41, 0) and (4, 5), if clipped against this window will connect the points \u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa..<\/li>\n<\/ol>\n

                                (1) (0, 1) and (3, 3)\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) (0, 1) and (2, 3)<\/p>\n

                                (3) (0, 1) and (4, 5)\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) (0, 1) and (3, 5)<\/p>\n

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

                                  \n
                                1. The following program is stored in the memory unit of the basic computer. Give the content of accumulator register in hexadecimal after the execution of the program.<\/li>\n<\/ol>\n

                                  \"\"<\/p>\n

                                  (1) A1B4\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) 81B4<\/p>\n

                                  (3) A184\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) 8184<\/p>\n

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

                                    \n
                                  1. Let a2c<\/sup> mod n = (ac<\/sup>)2<\/sup> mod n and a2c+1<\/sup> mod n = a.(ac<\/sup>)2<\/sup> mod n. For a=7, b=17 and n=561, what is the value of ab<\/sup>(mod n)?<\/li>\n<\/ol>\n

                                    (1) 160\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) 166\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (3) 157\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) 67<\/p>\n

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

                                      \n
                                    1. The order of schema?10?101? and ???0??1 are \u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa. and \u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa.. respectively.<\/li>\n<\/ol>\n

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

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

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

                                        S1: These exists no algorithm for deciding if any two Turning machine M1<\/sub> and M2<\/sub> accept<\/p>\n

                                        the same language.<\/p>\n

                                        S2: Let M1<\/sub> and M2<\/sub> be arbitrary Turing machines. The problem to determine<\/p>\n

                                        L<\/em>(M<\/em>1<\/sub>)\u0393\u00e8\u00e5L<\/em>(M<\/em>2<\/sub>)is undecidable.<\/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 S1<\/p>\n

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

                                          \n
                                        1. Find minimum number of tables required for converting the following entity relationship diagram into relational database?<\/li>\n<\/ol>\n

                                          \"\"<\/p>\n

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

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

                                          Which of the following methods are used to pass any number of parameters to the operating system through system calls? (1) Registers\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) Block or table in main memory (3) Stack\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) Block in main memory and stack Answer: 4 Match the Agile Process models with the task performed during the model: 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\u00a0 List-II (a)…<\/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-544","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\/544","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=544"}],"version-history":[{"count":0,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts\/544\/revisions"}],"wp:attachment":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=544"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=544"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=544"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}