{"id":542,"date":"2020-04-15T14:05:42","date_gmt":"2020-04-15T14:05:42","guid":{"rendered":"https:\/\/temp.ashkerala.com\/?p=542"},"modified":"2020-04-15T14:05:42","modified_gmt":"2020-04-15T14:05:42","slug":"net-computer-science-solved-paper-ii-december-2019-part-2","status":"publish","type":"post","link":"https:\/\/temp.ashkerala.com\/?p=542","title":{"rendered":"NET Computer Science Solved Paper II December 2019 – Part 2"},"content":{"rendered":"
    \n
  1. Consider the following statements with respect to network security:<\/li>\n<\/ol>\n

    (a) Message confidentiality means that the sender and the receiver expect privacy.<\/p>\n

    (b) Message integrity means that the data must arrive at the receiver exactly as they<\/p>\n

    were sent.<\/p>\n

    (c) Message authentication means the receiver is ensured that the message is coming<\/p>\n

    from the intended sender.<\/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: 4<\/strong><\/p>\n

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

      (a) Windows Azure is a cloud-based operating system.<\/p>\n

      (b) Google App Engine is an integrated set of online services for consumers to<\/p>\n

      communicate and share with others.<\/p>\n

      (c) Amazon Cloud Front is a web service for content delivery.<\/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: 2<\/strong><\/p>\n

        \n
      1. Two concurrent executing transactions T1 and T2 are allowed to update same stock item say \u0393\u00c7\u00ffA\u0393\u00c7\u00d6 in an uncontrolled manner. In such a scenario, following problems may occur:<\/li>\n<\/ol>\n

        (a) Dirty read problem\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (b) Lost update problem<\/p>\n

        (c) Transaction failure\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (d) Inconsistent database state<\/p>\n

        Which of the following option is correct if database system has no concurrency module and allow concurrent execution of above two transactions?<\/p>\n

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

        (3) (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\u00a0 (4) (a), (b) and (d) only<\/p>\n

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

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

          (a) Logistic repression\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (b) Back propagation\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (c) Linear repression<\/p>\n

          Which of the following option represents classification algorithms?<\/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\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\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) (a), (b) and (c)<\/p>\n

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

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

            S\u0393\u00e5\u00c60A|0BB<\/p>\n

            A\u0393\u00e5\u00c600A|\u256c\u2557<\/p>\n

            B\u0393\u00e5\u00c61B|11C<\/p>\n

            C\u0393\u00e5\u00c6B<\/p>\n

            Which language does this grammar generate?<\/p>\n

            (1) L((00) * 0+(11)*1)\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) L(0(11)* + 1(00)*)<\/p>\n

            (3) L((00)*0)\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\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) L(0(11) *1)<\/p>\n

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

              \n
            1. The weight of minimum spanning tree in graph G, calculated using Kruskal\u0393\u00c7\u00d6s algorithm is:<\/li>\n<\/ol>\n

              \"\"<\/p>\n

              (1) 14\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) 15\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (3) 17\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) 18<\/p>\n

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

                \n
              1. The reduced Instruction Set Computer (RISC) characteristics are:<\/li>\n<\/ol>\n

                (a) Single cycle instruction execution<\/p>\n

                (b) Variable length instruction formats<\/p>\n

                (c) Instructions that manipulates operands in memory<\/p>\n

                (d) Efficient instruction pipeline<\/p>\n

                Choose the correct characteristics from the options given below:<\/p>\n

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

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

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

                  \n
                1. Let the population of chromosomes in genetic algorithm is represented in terms of binary number. The strength of fitness of a chromosome in decimal form, x, is given by<\/li>\n<\/ol>\n

                  \"\"<\/p>\n

                  The population is given by P where:<\/p>\n

                  P = {(01101), (11000), (01000), (10011)}<\/p>\n

                  The strength of fitness of chromosome (11000) is \u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa\u0393\u00c7\u00aa..<\/p>\n

                  (1) 24\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) 576\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (3) 14.4\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) 49.2<\/p>\n

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

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

                    (a) The running time of dynamic programming algorithm is always \u256c\u2555(\u2567\u00fc) where \u2567\u00fc is<\/p>\n

                    number of subproblems.<\/p>\n

                    (b) When a recurrence relation has cyclic dependency, it is impossible to use that<\/p>\n

                    recurrence relation (unmodified) in a correct dynamic program.<\/p>\n

                    (c) For a dynamic programming algorithm, computing all values in a bottom-up fashion<\/p>\n

                    is asymptotically faster than using recursion and memorization.<\/p>\n

                    (d) If a problem X can be reduced to a known NP-hard problem, then X must be NP-<\/p>\n

                    hard.<\/p>\n

                    Which of the statement(s) is (are) true?<\/p>\n

                    (1) Only (b) and (a)\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 (b)<\/p>\n

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

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

                      \n
                    1. Which of the following are legal statements in C programming language?<\/li>\n<\/ol>\n

                      (a) int *P = &44;<\/p>\n

                      (b) int *P = &r;<\/p>\n

                      (c) int P = &a;<\/p>\n

                      (d) int P = a:<\/p>\n

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

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

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

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

                        \n
                      1. Let P be the set of all people. Let R be a binary relation on P such that (a, b) is in R if a<\/em><\/strong> is a brother of b<\/em><\/strong>. Is R symmetric transitive, an equivalence relation, a partial order relation?<\/li>\n<\/ol>\n

                        (1) NO,NO,NO,NO\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) NO,NO,YES,NO<\/p>\n

                        (3) NO,YES,NO,NO\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) NO,YES,YES,NO<\/p>\n

                        Answer: 3<\/p>\n

                          \n
                        1. Which of the following algorithms is not<\/u> used for line clipping?<\/li>\n<\/ol>\n

                          (1) Cohen-Sutherland algorithm\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) Sutherland-Hodgeman algorithm<\/p>\n

                          (3) Liang-barsky algorithm\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) Nicholl-Lee-Nicholl algorithm<\/p>\n

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

                            \n
                          1. The following multithreaded algorithm computes transpose of a matrix in parallel:<\/li>\n<\/ol>\n

                            p Trans (X, Y, N)<\/p>\n

                            if N = 1<\/p>\n

                            then Y[1, 1] \u0393\u00e5\u00c9 X[1, 1]<\/p>\n

                            else \u00a0\u00a0\u00a0\u00a0\u00a0 partition X into four (N\/2) \u251c\u00f9 (N\/2) submatrices X11<\/sub>, X12<\/sub>, X21<\/sub>, X22<\/sub><\/p>\n

                            partition Y into four (N\/2) \u251c\u00f9 (N\/2) submatrices Y11<\/sub>, Y12<\/sub>, Y21<\/sub>, Y22<\/sub><\/p>\n

                            spawn p Trans (X11<\/sub>, Y11<\/sub>, N\/2)<\/p>\n

                            spawn p Trans (X12<\/sub>, Y12<\/sub>, N\/2)<\/p>\n

                            spawn p Trans (X21<\/sub>, Y21<\/sub>, N\/2)<\/p>\n

                            spawn p Trans (X22<\/sub>, Y22<\/sub>, N\/2)<\/p>\n

                            What is the asymptotic parallelism of the algorithm?<\/p>\n

                            (1) T1<\/sub><\/em>\/T\u0393\u00ea\u20a7<\/sub> <\/em>or \u256c\u2555(N2 <\/sup><\/em>\/ lg N)<\/em>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) T1<\/sub><\/em>\/T\u0393\u00ea\u20a7<\/sub> <\/em>or \u256c\u2555(N <\/em>\/ lg N)<\/em><\/p>\n

                            (3) T1<\/sub><\/em>\/T\u0393\u00ea\u20a7<\/sub> <\/em>or \u256c\u2555(<\/em>lg N <\/em>\/ N2<\/sup>)\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 <\/em>(4) T1<\/sub><\/em>\/T\u0393\u00ea\u20a7<\/sub> <\/em>or \u256c\u2555(<\/em>lg N <\/em>\/ N)<\/em><\/p>\n

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

                              \n
                            1. A non-pipelined system takes 30ns to process a task. The same task can be processed in a four-segment pipeline with a clock cycle of 10ns. Determine the speed up of the pipeline for 100 tasks.<\/li>\n<\/ol>\n

                              (1) 3\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.91\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) 2.91<\/p>\n

                              Answer: 4<\/p>\n

                                \n
                              1. Given CPU time slice of 2ms and following list of processes.<\/li>\n<\/ol>\n

                                Process\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Burst time\u00a0\u00a0\u00a0\u00a0 Arrival time<\/p>\n

                                \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0 (ms)<\/p>\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 P1\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0 3\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 0<\/p>\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 P2\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0 4\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 2<\/p>\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 P3\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0 5\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 5<\/p>\n

                                Find average turnaround time and average waiting time using round robin CPU scheduling?<\/p>\n

                                (1) 4, 0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\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) 5.66, 1.66<\/p>\n

                                (3) 5.66, 0\u00a0\u00a0\u00a0\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) 7, 2<\/p>\n

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

                                  \n
                                1. Java Virtual Machine (JVM) is used to execute architectural neutral byte code. Which of the following is needed by the JVM for execution of Java Code?<\/li>\n<\/ol>\n

                                  (1) Class loader only<\/p>\n

                                  (2) Class loader and Java Interpreter<\/p>\n

                                  (3) Class loader, Java Interpreter and API<\/p>\n

                                  (4) Java Interpreter only<\/p>\n

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

                                    \n
                                  1. In a system for a restaurant, the main scenario for placing order is given below:<\/li>\n<\/ol>\n

                                    (a) Customer reads menu<\/p>\n

                                    (b) Customer places order<\/p>\n

                                    (c) Order is sent to kitchen for preparation<\/p>\n

                                    (d) Ordered items are served<\/p>\n

                                    (e) Customer requests for a bill for the order<\/p>\n

                                    (f) Bill is prepared for this order<\/p>\n

                                    (g) Customer is given the bill<\/p>\n

                                    (h) Customer pays the bill<\/p>\n

                                    A sequence diagram for the scenario will have at least how many objects among whom the messages will be exchanged.<\/p>\n

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

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

                                      \n
                                    1. The full form of ICANN is<\/li>\n<\/ol>\n

                                      (1) Internet Corporation for Assigned Names and Numbers<\/p>\n

                                      (2) Internet Corporation for Assigned Numbers and Names<\/p>\n

                                      (3) Institute of Corporation for Assigned Names and Numbers<\/p>\n

                                      (4) Internet Connection for Assigned Names and Numbers<\/p>\n

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

                                        \n
                                      1. The Data Encryption Standard (DES) has a function consists of four steps. Which of the following is correct order of these four steps?<\/li>\n<\/ol>\n

                                        (1) an expansion permutation, S-boxes, an XOR operation, a straight permutation<\/p>\n

                                        (2) an expansion permutation, an XOR operation, S-boxes, a straight permutation<\/p>\n

                                        (3) a straight permutation, S-boxes, an XOR operation, an expansion permutation<\/p>\n

                                        (4) a straight permutation, an XOR operation, S-boxes, an expansion permutation<\/p>\n

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

                                          \n
                                        1. Given two tables R1(x, y) and R2(y, z) with 50 and 30 number of tuples respectively. Find maximum number of tuples in the output of natural join between tables R1 and R2 i.e. R1 * R2? (* – Natural Join)<\/li>\n<\/ol>\n

                                          (1) 30\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) 20\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (3) 50\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) 1500<\/p>\n

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

                                          Consider the following statements with respect to network security: (a) Message confidentiality means that the sender and the receiver expect privacy. (b) Message integrity means that the data must arrive at the receiver exactly as they were sent. (c) Message authentication means the receiver is ensured that the message is coming from the intended sender….<\/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-542","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\/542","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=542"}],"version-history":[{"count":0,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts\/542\/revisions"}],"wp:attachment":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=542"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=542"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=542"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}