Machine-translated by Google. Questions are authored in English.
Top

MH SET 2021: 26 September, Paper II, Computer Science and Applications

  • Date: 26 September 2021
  • Paper code: SEP37221
  • Series: A
  • Language: Bilingual
  • 28 pages
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 1 of 28
Page 1 of 28
Text of page 1
Test Booklet Code & Serial No.
                                                                                                                      A
                     COMPUTER SCIENCE AND APPLICATIONS
Signature and Name of Invigilator                                                         Seat No.
1. (Signature) .........................................                                                    (In figures as in Admit Card)
      (Name) ................................................                     Seat No. ..............................................................
2. (Signature) .........................................                                               (In words)

      (Name) ................................................                 OMR Sheet No.

SEP - 37221                                                                                                 (To be filled by the Candidate)
Time Allowed : 2 Hours]                                                                                 [Maximum Marks : 200
Number of Pages in this Booklet : 28                                                     Number of Questions in this Booklet : 100
                      Instructions for the Candidates
1.         Write your Seat No. and OMR Sheet No. in the space provided              1.
           on the top of this page.
2.         This paper consists of 100 objective type questions. Each question
           will carry two marks. All questions of Paper II will be compulsory.      2.
3.         At the commencement of examination, the question booklet
           will be given to the student. In the first 5 minutes, you are            3.
           requested to open the booklet and compulsorily examine it as
           follows :
           (i)      To have access to the Question Booklet, tear off the
                    paper seal on the edge of this cover page. Do not accept                (i)
                    a booklet without sticker-seal or open booklet.
           (ii)     Tally the number of pages and number of questions in
                    the booklet with the information printed on the cover                   (ii)
                    page. Faulty booklets due to missing pages/questions
                    or questions repeated or not in serial order or any
                    other discrepancy should not be accepted and correct
                    booklet should be obtained from the invigilator within
                    the period of 5 minutes. Afterwards, neither the Question
                    Booklet will be replaced nor any extra time will be
                    given. The same may please be noted.
           (iii)    After this verification is over, the OMR Sheet Number
                                                                                            (iii)
                    should be entered on this Test Booklet.
4.         Each question has four alternative responses marked (A), (B),
           (C) and (D). You have to darken the circle as indicated below on         4.                      (A), (B), (C)   (D)
           the correct response against each item.
           Example : where (C) is the correct response.

                              A        B                 D                                            (C)
5.         Your responses to the items are to be indicated in the OMR                                       A        B              D
           Sheet given inside the Booklet only. If you mark at any place
           other than in the circle in the OMR Sheet, it will not be evaluated.     5.
6.         Read instructions given inside carefully.
7.         Rough Work is to be done at the end of this booklet.                     6.
8.         If you write your Name, Seat Number, Phone Number or put                 7.
           any mark on any part of the OMR Sheet, except for the space
                                                                                    8.
           allotted for the relevant entries, which may disclose your
           identity, or use abusive language or employ any other unfair
           means, you will render yourself liable to disqualification.
9.         You have to return original OMR Sheet to the invigilator at the
           end of the examination compulsorily and must not carry it with           9.
           you outside the Examination Hall. You are, however, allowed
           to carry the Test Booklet and duplicate copy of OMR Sheet on
           conclusion of examination.
                                                                                    10.
10.        Use only Blue/Black Ball point pen.
                                                                                    11.
11.        Use of any calculator or log table, etc., is prohibited.
12.        There is no negative marking for incorrect answers.                      12.
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 2 of 28
Page 2 of 28
Text of page 2
SEP - 37221/II—A




2
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 3 of 28
Page 3 of 28
Text of page 3
SEP - 37221/II—A

                Computer Science and Applications
                                        Paper II
Time Allowed : 120 Minutes]                                        [Maximum Marks : 200
Note : This Paper contains Hundred (100) multiple choice questions. Each question
        carrying Two (2) marks. Attempt All questions.

1.                                                  2.   The code word ........................... sent
                                                         by the sender using the group
                                                         codes      words        generated         by

                                                               1 0 0 1 1 0
                                                         G     0 1 0 0 1 1 , which is
                                                               0 0 1 1 0 1

                                                         received as 001100 by the receiver.

     V = {A, B, C, D, E, F, G, H, I}                     (A) 000000

     E = {e1 = (A, B), e2 = (A, C), e3 =                 (B) 000111
     (A, D), e4 = (B, C), e5 = (B, F),
     e6 = (B, H), e7 = (C, D), e8 = (C, E),              (C) 101100
     e9 = (C, F), e10 = (D, E), e11 = (D, I),
                                                         (D) 101011
     e12 = (E, F), e13 = (E, G), e14 =
     (F, G), e15 = (F, H), e16 = (G, H),            3.   Hamming distance of the following
     e17 = (G, I), e18 = (H, I)}
                                                         code words A and B is ................ .
     W = {22, 9, 12, 35, 36, 34, 4, 33, 30,
         18, 23, 24, 39, 25, 21, 19}                     A = 001001001001 and
     The order of node (vertex)-edge
                                                         B = 110100100110
     incidence matrix for the undirected
     graph is .................. .                       (A) 4
     (A) 9×9
                                                         (B) 6
     (B) 9×18
                                                         (C) 10
     (C) 18×9
     (D) 18×18                                           (D) 12

                                                3                                             [P.T.O.
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 4 of 28
Page 4 of 28
Text of page 4
SEP - 37221/II—A

4.   Let X and Y be random variables
                                                6.   Notation :
     with joint distribution :
     Pr(X     i, Y   j)
                                                     C(n, r) = n!/(r!*(n-r)!))
            1 / 6 for i   5,6 and j 3,6,9
            0                 otherwise
                                                     n! is factorial n.
     Then the mutual information
     I (X, Y) = .................. .
     (A) 0                                           |A| cardinality of set A
     (B) log(2)
     (C) log(3)
                                                     s is negation of s
     (D) log(6)
5.   Let X and Y be random variable
     with the following distributions                The C(2n + 2, n + 1) = ................ .
     respectively :

      X 1   2   3   4   5                            (A) C(2n + 2, n + 1) + 2C(2n + 2, n)
      P 0.1 0.2 0.4 0.2 0.1
                                                          + C(2n + 2, n – 1)
      Y 10 20 35 50 60
      P 0.1 0.2 0.4 0.2 0.1
                                                     (B) C(2n + 1, n + 1) + 2C(2n + 1, n)
     (A) Entropy of distribution of X and
         Y are same, Coefficient of                       + C(2n + 1, n – 1)
         Variations are the same
     (B) Entropy of distribution of X and
         Y are not same, Coefficient of              (C) C(2n, n + 1) + 2C(2n, n) +
         Variations are the same
     (C) Entropy of distribution of X and                 C(2n, n – 1)
         Y are same, Coefficient of
         Variations are not same                     (D) C(2n, n + 1) + 2C(2n, n) +
     (D) Entropy of distribution of X and
         Y are not same, Coefficient of
                                                          C(2n, n – 1)
         Variations are not same
                                            4
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 5 of 28
Page 5 of 28
Text of page 5
SEP - 37221/II—A

7.   Consider the following Linear                (B) Maximize : Z' = 5x1 + 6x2 + 4x3
     Programming Problem :                            Subject to 3x1 + x2 + 4x3     60

     A company manufactures three                              2x1 + 3x2 + 3x3      75
     products P1, P2, P3. The sale of one                             x1, x2, x3     0
     unit of P1 results in profit of Rs. 5.           Dual : Minimize :
     For one unit of P2 and P3 the profit
                                                                   Z' = 60y1 + 75y2
     is Rs. 6 and Rs. 4 respectively. P1
                                                         Subject to   3y1 + 2y2      5
     requires 3 hours of machine work
     and 2 hours of labour. P2 requires                                y1 + 3y2     6
     1 hour of machine work and 3 hours                   4y1 + 3y2     4, y1, y2    0
     of labour and P3 needs 4 hours of            (C) Maximize : Z = 5x1 + 6x2 + 4x3
     machine work and 3 hours of labour.              Subject to 3x1 + x2 + 4x3     60
     In a week 60 machine hours and
                                                               2x1 + 3x2 + 3x3      75
     75 hours of labour is available. How
                                                                      x1, x2, x3     0
     many units of P1, P2, P3 should be
     produced per week to maximize the                Dual : Minimize :
     profit ?                                                      Z' = 60y1 + 75y2
     The primal and the dual of this                     Subject to   3y1 + 2y2      5
     problem are :                                                     y1 + 3y2     6
     (A) Maximize : Z = 5x1 + 6x2 + 4x3                   4y1 + 3y2     4, y1, y2    0

         Subject to 3x1 + x2 + 4x3      60        (D) Minimize : Z = 5x1 + 6x2 + 4x3
                                                      Subject to 3x1 + x2 + 4x3     60
                   2x1 + 3x2 + 3x3      75
                                                               2x1 + 3x2 + 3x3      75
                           x1, x2, x3    0
                                                                      x1, x2, x3     0
         Dual : Maximize :
                                                      Dual : Maximize :
                        Z' = 60y1 + 75y2
                                                                   Z' = 60y1 + 75y2
             Subject to    3y1 + 2y2     5               Subject to   3y1 + 2y2      5
                            y1 + 3y2     6                             y1 + 3y2     6
              4y1 + 3y2     4, y1, y2    0                4y1 + 3y3     4, y1, y2    0

                                              5                               [P.T.O.
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 6 of 28
Page 6 of 28
Text of page 6
SEP - 37221/II—A

8.   Which of the following statements             10. Compute the maximal flow through
     is true ?                                         the following network :
     (A) Simplex method is so robust
          that it is guaranteed to give
          the solution of any linear
          programming problem
     (B) Simplex method searches for
          the solution through interior of
          the feasible region
     (C) Karmarkar’s algorithm searches
          for the solution through corner              (A) 70 units
          points of the feasible region
     (D) Simplex method approaches the                 (B) 65 units
          solution by moving from corner
                                                       (C) 60 units
          to corner along the edges
9.   Consider the following trans-                     (D) 75 units
     portation problem :
                   Warehouse                       11. The tpd for each flip-flop is 50ns,

                     W1   W2    W3   W4                determine the maximum operating
            F1       1    2     3    4    6            frequency for MOD-32 ripple
           F2        4    3     2    0    8            counter :
Factory
           F3        0    2     2    1    10           (A) 4 MHz
                     4    6     8    6
                                                       (B) 3 MHz
     A solution to the problem is given
     below :                                           (C) 4 GHz
                                                       (D) 2 MHz
                      6
                          2 6                      12. The decimal equivalent of 8 DH in
                 4        6                            sign magnitude form is :
     Which of the following is true about              (A) 13
     the solution ?
     (A) Degenerate but not optimal                    (B) –13
     (B) Degenerate and optimal                        (C) –11
     (C) Non-degenerate and optimal
     (D) Optimality cannot be tested                   (D) 11

                                               6
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 7 of 28
Page 7 of 28
Text of page 7
SEP - 37221/II—A

13. If an even parity Hamming code              15. A t-state is measured from the

    0110011 is transmitted and that                 falling edge of one clock pulse to the
                                                    falling edge of the next clock pulse.
    0100011 is received. The receiver is
                                                    Fetch cycle and the execution cycle
    unaware of what was transmitted ?
                                                    take how many of the following
    Determine the bit location where
                                                    t-states ?
    error has occurred using received
                                                    (A) 2 and 1
    code.
                                                    (B) 3 and 4
    (A) Bit in 3rd location is wrong
                                                    (C) 4 and 3
    (B) Bit in 4th location is wrong
                                                    (D) 2 and 3
    (C) Bit in 5th location is wrong
                                                16. XLAT instruction in assembly is
    (D) Bit in 1st location is wrong                used to :

14. The word size of memory IC can be               (A) Perform string conversions

    increased by connecting 2 memory                (B) Perform character conversions
    ICs in such a way that their :
                                                    (C) Improve performance
    (A) Data bus is in series and address           (D) None of the above
        bus in parallel
                                                17. Individual control words in a
    (B) Data bus is in parallel and                 micro-programmed control unit is
        address bus in parallel                     known as :

    (C) Data bus is in series and address           (A) Micro-routine

        bus in series                               (B) Micro-program

    (D) Data bus is in parallel and                 (C) Micro-word

        address bus in series                       (D) Micro-instruction

                                            7                                     [P.T.O.
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 8 of 28
Page 8 of 28
Text of page 8
SEP - 37221/II—A

18. Vector processing eliminates the           20. One of the following is not a key
    overhead associated with time it
                                                   characteristic of NUMA machines :
    takes to fetch and execute the
    instructions in the :                          (i)   There is a single address space
    (A) Program
                                                         visible to all CPUs
    (B) Function
                                                   (ii) Access to remote memory is via
    (C) Control structures

    (D) Sub-routines                                     LOAD and STORE instructions

19. The amount of time required to read
                                                   (iii) Access to remote memory is
    a block of data from a disk into
    memory is composed of transfer time,                 faster than access to local

    seek time and rotational latency.
                                                         memory
    Rotational latency refers to :

    (A) Time required by the platter to            (iv) Access to remote memory is

        rotate the correct sector under                  slower than access to local
        the head
                                                         memory
    (B) Time required by the read-write
        head to move to the position               (A) (i)
        over the appropriate track
                                                   (B) (ii)
    (C) The time required by the platter
        to make a full rotation
                                                   (C) (iii)
    (D) The time required by the r/w
        head to come under a cylinder              (D) (iv)

                                           8
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 9 of 28
Page 9 of 28
Text of page 9
SEP - 37221/II—A

21. The syntax of expression in a                 23. Consider the following ‘C’ program

   language can be characterised by :                 fragment :

   (i)   a table giving associativity and                   if(tPTR ! = NULL)
         precedence
                                                               * tPTR = NULL;
   (ii) a grammar for expression
                                                            else
   (iii) expression are always to be
         written in infix notation                             * tPTR = NULL;

   (iv) use of terminal per precedence                Select the following statements that
         level
                                                      are having same effect :
   (A) (i) and (ii)
                                                      (i)   if (tPTR) * tPTR = NULL;
   (B) (ii) and (iii)
                                                               else * tPTR = NULL
   (C) (iii) and (iv)
                                                      (ii) *tPTR = NULL;
   (D) (i), (ii) and (iii)

22. Which        of   the   following   are           (iii) if (!tPTR) * tPTR = NULL;

   fundamental operation on pointers ?                         else * tPTR = NULL;
   (i)   implicit dereferencing
                                                      (iv) if (tPTR = = NULL) * tPTR =
   (ii) indirection                                         NULL;
   (iii) explicit referencing
                                                               else * tPTR = NULL;
   (iv) addressing
                                                      (A) (i) and (ii)
   (A) (i), (ii) and (iii)
                                                      (B) (i), (ii), (iii) and (iv)
   (B) (i) and (ii)
                                                      (C) (ii), (iii) and (iv)
   (C) (ii) and (iii)

   (D) (iv) only                                      (D) (ii) only

                                              9                                       [P.T.O.
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 10 of 28
Page 10 of 28
Text of page 10
SEP - 37221/II—A

24. Which prevents programmer from                26. Which of the following defines a
    using a program component in                      family of functions in the same way
    inappropriate ways and by limiting                a class templates defines as family
    the portion of a program text in                  of classes ?
    which a given component can be                    (A) Function templates
    used, thereby limiting the portion                (B) Generic functions
    that must be considered when
                                                      (C) Virtual function
    searching for the cause of bug :
                                                      (D) Friend function
    (A) conceptual load
                                                  27. The status line of servlet, which
    (B) fault containment                             consist of the HTTP version, a status
    (C) independence                                  code and short message corresponding
                                                      to status code, which statement from
    (D) extension
                                                      the following correctly signifies the
25. The pointer to base classes are                   purpose of using status code ?
    commonly used in design of                        (i)   General method of setting
    container classes such as set, vector                   status code is simply to call
    and lists. In this case which of the                    response-set status (int)
    following solution exists ?
                                                      (ii) Setting status code does not
    (i)   yields homogeneous list                          necessarily mean that you don’t
                                                           need to return document
    (ii) yields heterogeneous list
                                                      (iii) In most cases headers are
    (iii) special type of secure variation
                                                            optional
          of heterogeneous list
                                                      (iv) They are more reliable to use
    (iv) homogeneous and heterogeneous
                                                           constant defined in Http Servlet
         list                                              Response
    (A) (i) only                                      (A) (i), (ii) and (iii)
    (B) (ii) only                                     (B) (ii), (iii) and (iv)
    (C) (i), (ii), (iii) and (iv)                     (C) (i), (ii) and (iv)
    (D) (iv) only                                     (D) (i) and (ii) only
                                             10
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 11 of 28
Page 11 of 28
Text of page 11
SEP - 37221/II—A

28. The beam penetration method for               31. Which of the following statements

    displaying color pictures are used                is not true for Relational Algebra ?

    in .................... .                         (A) Relational        Algebra     is   a
                                                            procedural query language
    (A) Refresh cathode ray tube
           monitors                                   (B) Natural join is a fundamental
                                                            operation in relational algebra
    (B) Random scan monitors
                                                      (C) The symbol        is used for select
    (C) Raster scan monitors
                                                            operation in relational algebra
    (D) Direct view storage tube monitors
                                                      (D) In relational algebra, for select
29. In general pivot point rotation                         operation, predicates appear in
    what is the correct sequence of                         the subscript
    transformations ?                             32. Which of the following statement(s)
    (A) Rotation, translation, rotation               is/are true for weak entity ?

    (B) Rotation, scaling, rotation                   (i)   Weak entity is existence
                                                            dependent on strong entity
    (C) Scaling, rotation, translation
                                                      (ii) Weak entity does not have
    (D) Translation, rotation, translation
                                                            primary key of its own
30. Which of the following is not part
                                                      (iii) Attributes of weak entity are
    of geometric tables used to represent                   derived from attributes of
    the polygon surfaces ?                                  strong entity
    (A) Polygon surface table                         (A) (i) only

    (B) Vertex table                                  (B) (i) and (ii)

    (C) Point table                                   (C) (i) and (iii)

    (D) Edge table                                    (D) (i), (ii) and (iii)

                                             11                                       [P.T.O.
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 12 of 28
Page 12 of 28
Text of page 12
SEP - 37221/II—A

33. To get a database in 3NF, which of            35. Which command is used to remove
    the following steps are essential ?
                                                      a relation from an SQL database ?
    (i)   Converting composite attributes
          to individual attributes                    (A) Drop
    (ii) Removal          of      partial
          dependencies                                (B) Delete

    (iii) Removal        of    transitive
                                                      (C) Purge
          dependencies

    (A) (i) and (ii)                                  (D) Remove

    (B) (iii) only
                                                  36. On which of the following, the events
    (C) (ii) and (iii)
                                                      in a trigger can be fired ?
    (D) (i), (ii) and (iii)

34. Database contains the relation                    (i)   Select
    Student (rollno, name, marks),
    Which of the following is an incorrect            (ii) Update
    SQL query ?
                                                      (iii) Delete
    (A) Select * from student where
          marks between 60 and 80;                    (iv) Insert
    (B) Select * from student where
          marks > = 60 and marks < = 80;              (A) (i), (ii) and (iii)

    (C) Select * from student where
                                                      (B) (ii) and (iii)
          marks < = 60 and marks > = 80;

    (D) Select * from student where                   (C) (ii), (iii) and (iv)
          marks > = 60 and rollno
          < = 80;                                     (D) (i), (ii), (iii) and (iv)

                                             12
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 13 of 28
Page 13 of 28
Text of page 13
SEP - 37221/II—A

37. Which of the following statement(s)          39. What is the default Hadoop dfs block
                                                     size ?
    is/are true ?
                                                     (A) 32 MB/64 MB
    (i)   Dimension tables of star
                                                     (B) 64 MB/128 MB
          schema models are brought to

          normalized form to reduce                  (C) 32 MB/128 MB

          redundancy.                                (D) 128 MB/256 MB

    (ii) Snowflake structure can reduce          40. Which of the following statement(s)
                                                     is/are correct ?
          the effectiveness of browsing

          since more joins are needed for            (i)   Documents can contain many
                                                           different key value pairs, or key
          query.
                                                           array pairs but not nested
    (A) (i) only                                           documents

    (B) (ii) only                                    (ii) Mango DB was official drivers
                                                           for a variety of popular
    (C) (i) and (ii)
                                                           programming languages and
    (D) None of the above                                  development environments

38. Which of the following form ordinal              (iii) When compared to relational
    variables ?                                            databases, No SQL databases
                                                           are more scalable and provide
    (A) Apple, Orange, Grape
                                                           superior performance
    (B) Branch      manager,     Deputy
                                                     (A) (i) and (ii)
          manager, General manager
                                                     (B) (i) and (iii)
    (C) Pen, Ball, Tea
                                                     (C) (ii) and (iii)
    (D) Both (A) and (B)                             (D) (i), (ii) and (iii)

                                            13                                       [P.T.O.
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 14 of 28
Page 14 of 28
Text of page 14
SEP - 37221/II—A

41. An application has to modify 34th               43. Which of the following is not a valid
                                                        kernel data structure in Linux ?
    byte in sector number 4 (on first
    track present on first side of the first            (A) File descriptor table
    plate) on a conventional hard disk.                 (B) File table
    Operating system will copy how
                                                        (C) I-node table
    many bytes from that sector into
    primary memory to enable this                       (D) Sector table

    operation to be performed ?                     44. What is the most appropriate

    (A) 1                                               purpose of ‘nice’ command in
                                                        Linux ?
    (B) 34
                                                        (A) Send real-time messages among
    (C) 136
                                                             the users
    (D) 512
                                                        (B) Check the status of memory
42. What is the most appropriate
                                                        (C) Set execution priority level for
    description       for    the      term
                                                             a process
    ‘confidentiality’ ?
                                                        (D) Verify the availability of enough
    (A) A set of rules to limit access to
                                                             memory space for a process
        data
                                                    45. A 32-bit X86 system with Windows
    (B) Maintenance of and assurance
                                                        operating system will have .................
        of the accuracy and consistency
                                                        GB as theoretical maximum size of
        of data over its entire life-cycle
                                                        virtual address space.
    (C) A guarantee of reliable access
                                                        (A) 4
        to the data by authorized people
                                                        (B) 8
    (D) The process or action of
        verifying the identity of a user                (C) 16

        or process                                      (D) 32
                                               14
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 15 of 28
Page 15 of 28
Text of page 15
SEP - 37221/II—A

46. Consider a system with seven                48. Consider a disk queue with I/O
    processes A through G and six                   requests on the following cylinders
    resources R through W. Resource                 in their arriving order 6, 10, 12, 54,
    ownership is as follows :                       97, 73, 128, 15, 44, 110, 34, 45. The
    Process A holds R and wants T                   disk head is assumed to be at
    Process B holds nothing but wants T
                                                    cylinder 23 and moving in the
    Process C holds nothing but wants S
                                                    direction of decreasing number of
    Process D holds U and wants S
                                                    cylinders. Total number of cylinders
    and T
                                                    in the disk is 150. The disk head
    Process E holds T and wants V
                                                    movement using SCAN-scheduling
    Process F holds W and wants S
                                                    algorithm is :
    Process G holds V and wants U
    Are there any processes deadlocked ?            (A) 172
    (A) No process
                                                    (B) 173
    (B) Yes, A, B, C
    (C) Yes, D, E, G                                (C) 151

    (D) Yes, A, B, F                                (D) 228
47. An operating system (OS) crashes
                                                49. A specific editor has 200 K of
    on the average once in 30 days, that
                                                    program text, 15 K of initial stack,
    is , the Mean Time Between Failures
    (MTBF) = 30 days. When this                     50 K of initialized data, and 70 K
    happens, it takes 10 minutes to                 of bootstrap code. If five editors are
    recover the OS, that is, the Mean               started simultaneously and shared
    Time To Repair (MTTR) = 10                      text is used, how much physical
    minutes. The availability of the OS             memory will be needed ?
    with these reliability figures is
    approximately :                                 (A) 1135 K
    (A) 96.97%                                      (B) 335 K
    (B) 97.97%
                                                    (C) 1065 K
    (C) 99.009%
    (D) 99.97%                                      (D) 320 K

                                           15                                     [P.T.O.
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 16 of 28
Page 16 of 28
Text of page 16
SEP - 37221/II—A

                                                        52. What are the four framework
50. The ‘read’ system call returns :
                                                            activities found in the Extreme
                                                            Programming (XP) process model ?
    (A) Total number of bytes
                                                            (A) analysis, design, coding, testing
    (B) File descriptor of the file                         (B) planning, analysis, design,
                                                                coding
    (C) Successful read flag
                                                            (C) planning, analysis, coding,

    (D) Address of the file                                     testing

                                                            (D) planning,     design,     coding,
51. In software development process,                            testing

    ...................... is based on iterative        53. A report generation application
                                                            prepares required reports from the
    incremental delivery as a response                      data gathered from databases. Even
                                                            though the application provides
    to    changing        and      emergent
                                                            required output for given input,
    requirements.                                           customer rejected the application.
                                                            What may be the most appropriate
    (A) Agile development model                             reason for this rejection ?

                                                            (A) Failure to meet functional
    (B) Evolutionary          development
                                                                requirements

         model                                              (B) Failure to meet non-functional
                                                                requirements
    (C) Rapid application development
                                                            (C) Failure to meet verification of

         model                                                  output

                                                            (D) Failure to meet validation of
    (D) Open source development model                           input

                                                   16
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 17 of 28
Page 17 of 28
Text of page 17
SEP - 37221/II—A

54. Which of the following software               57. During the change control process,
                                                      which of the following activities are
    architecture is prone to ‘single point
                                                      required to be initiated ?
    of failure’ vulnerability ?
                                                      (i)   While software configuration
    (A) Client-server                                       identification (SCI) is under
                                                            development it can change
    (B) Peer-to-peer
                                                            freely since it is not under SCM.
    (C) Service-oriented                              (ii) While       under     review,   the

    (D) Distributed-object                                  software            configuration
                                                            identification (SCI) is considered
55. Vocabulary of a program is defined                      to be “Frozen”.
    as :                                              (iii) Once SCI is reviewed and
                                                            approved, it is entered into a
    (A) n = n1 + n2
                                                            library; the SCI is now formally
    (B) n = n1 – n2                                         under SCM.

    (C) n = n1 × n2                                   (iv) Check in-check out process :
                                                            once the change has been
    (D) n = n1 / n2                                         approved, the SCI has to be

56. Which model assumes that effort                         checked out from the library for
                                                            change; once the change has
    and development time are functions
                                                            been implemented, the SCI
    of product size alone ?                                 must be checked in to the
                                                            library.
    (A) Basic COCOMO
                                                      (A) (i), (ii), (iii) and (iv)
    (B) Detailed COCOMO
                                                      (B) (ii), (iii) and (iv)
    (C) Intermediate COCOMO
                                                      (C) (i), (ii) and (iii)
    (D) COCOMO                                        (D) (i) and (iv)
                                             17                                        [P.T.O.
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 18 of 28
Page 18 of 28
Text of page 18
SEP - 37221/II—A

58. Basic path testing is ................... .        61. The prefix form of (A – B / C) *
     (A) a whitebox testing technique
                                                           (A / K – L) is :
     (B) a blackbox testing technique
     (C) Both whitebox and blackbox                        (A) * – / – / A B C A K L
         testing techniques
                                                           (B) A B C A K L * – / – /
     (D) Neither whitebox nor blackbox
         testing technique                                 (C) * – A / B C – / A K L
59. The test conducted to ensure that
    due to addition of modules, software                   (D) * – A B C / – A K L /
    do not unintended behaviour or
                                                       62. Which of these best describes an
    extra errors are not added, is known
    as .................... .                              array ?

     (A) Smoke testing                                     (A) A data structure that shows a
     (B) Regression testing
                                                               hierarchical behaviour
     (C) Performance testing
     (D) Stress testing                                    (B) Container of objects of similar
60. Which amongst the following                                types
    statements are not true for Quality
    Assurance ?                                            (C) Container of objects of mixed
     (i)   Quality Assurance aims to                           types
           prevent the defects
     (ii) Quality Assurance is a reactive                  (D) Heterogeneous data types
          measure
                                                       63. Which of the following application
     (iii) Quality Assurance manages the
                                                           makes use of a circular linked list ?
           quality validation
     (iv) Quality Assurance covers full                    (A) Undo operation in a text editor
          development life cycle
     (A) (i) and (ii)                                      (B) Allocating CPU to resources
     (B) (i) and (iv)                                      (C) Recursive function calls
     (C) (ii) and (iv)
     (D) (ii) and (iii)                                    (D) Expression evaluation

                                                  18
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 19 of 28
Page 19 of 28
Text of page 19
SEP - 37221/II—A

64. AVL tree is used :                          67. Suppose that we have numbers

    (A) to save memory                              between 1 and 500 in a binary

                                                    search tree and want to search for
    (B) to attain faster memory access
                                                    the number 258. Which of the
    (C) to avoid formation of skew trees
                                                    following sequences could not be the
    (D) to simplify storing
                                                    sequence of nodes examined ?
65. The basic operations on sets :
                                                    (A) 453, 200, 448, 210, 363, 258
    (A) Push and pop
                                                    (B) 3, 240, 398, 256, 399, 258
    (B) Insert and delete
                                                    (C) 458, 250, 357, 255, 355, 258
    (C) Union, intersection, difference
                                                    (D) 3, 390, 358, 257, 312, 258
        and subset

                                                68. The technique that exploits the
    (D) Traversing and merging
                                                    relationship between solution to the
66. If A is an adjacency matrix of a
                                                    given instance of a problem and
    graph G, if A = AT, where AT is the
                                                    smaller instance of the same problem
    transpose matrix of A, then G is :
                                                    is known as :
    (A) A simple undirected graph
                                                    (A) Divide and Conquer
    (B) A graph with only self loop
                                                    (B) Decrease and Conquer
    (C) A graph with only parallel

        edges                                       (C) Transform and Conquer

    (D) A general graph                             (D) Dynamic Programming

                                           19                                    [P.T.O.
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 20 of 28
Page 20 of 28
Text of page 20
SEP - 37221/II—A

69. The FFT (a) returns DFT (y). To                71. ................... is a compiler capable of

    compute inverse of DFT, FFT                         creating an executable code for a

    algorithm can be modified to :                      platform other than the one on

    (i)   Switch the roles of a and y                   which .................... is run.

    (ii) Replace wn by wn1                              (A) Cross compiler, decompiler

    (iii) Divide the final result by n                  (B) Just-in time compiler, cross

                                                              compiler
    (A) (i) and (ii)
                                                        (C) Cross compiler, cross compiler
    (B) (i) and (iii)

    (C) (ii) and (iii)                                  (D) Just-in time compiler, just-in

                                                              time compiler
    (D) (i), (ii) and (iii)
                                                   72. Among the various ways an
70. Which of the following is not true
                                                        Intermediate code is represented,
    for problem reducibility ?
                                                        .................. intermediate code
    (A) Satisfiability is not reducible to
                                                        representation is close to the source
          halting problem
                                                        program/language itself and .............
    (B) Satisfiability is reducible to
                                                        intermediate code representation is
          every NP-complete problem
                                                        close to the target machine.
    (C) Optimization problems reduce
                                                        (A) Low level, High level
          to their corresponding decision
                                                        (B) Low level, Medium level
          problem

    (D) Reducibility satisfies transitivity             (C) High level, Low level

          property                                      (D) High level, Medium level

                                              20
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 21 of 28
Page 21 of 28
Text of page 21
SEP - 37221/II—A

73. Procedure activation record must                    76. If there exists a Turing machine M
                                                            which when applied to any problem
     contain :
                                                            in the class terminates if the correct
     (i)   Space for arguments
                                                            answer is yes and may not terminate
     (ii) Space for local data and local
                                                            otherwise is said to be .................. .
           temporaries
                                                            (A) Stable
     (iii) Space for global data
                                                            (B) Unsolvable
     (A) (ii) only
                                                            (C) Partially solvable
     (B) (i) and (iii) only                                 (D) Unstable
     (C) (ii) and (iii) only                            77. Which of the following are incorrect
     (D) (i) and (ii) only                                  statements ?
74. In some languages the meaningless                       (i)   A language L is said to be
     operation will be detected when the                          recursively enumerable if there
     program is compiled and rejected by                          exists a Turing machine that
     the compiler is known as .............. .                    accepts L

     (A) Dynamic type checking                              (ii) Let K       1 be an integer. Any
                                                                  K-tape Turing machine cannot
     (B) Weak typing
                                                                  be converted to an equivalent
     (C) Strong typing
                                                                  one tape Turing machine
     (D) Static type checking
                                                            (iii) Every computational process
75. LL(1) parsing uses an explicit .............
                                                                  which can be considered to be
     rather than recursive calls to                               algorithm can be converted to
     perform a parse.                                             a Turing machine
     (A) Deque                                              (A) (i) only
     (B) Stack                                              (B) (ii) only
     (C) Queue                                              (C) (iii) only
     (D) Linked List                                        (D) (i) and (ii) only

                                                   21                                          [P.T.O.
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 22 of 28
Page 22 of 28
Text of page 22
SEP - 37221/II—A

78. Consider the context free Grammar                     80. The grammar S                   aSa/bS/d is :
    with 7 (seven) productions.                               (A) LL(1) but not LR(1)
          S      Aa / B
                                                              (B) Neither LL(1) nor LR(1)
          B      A / bb
                                                              (C) LR(1) but not LL(1)
          A      a / bc / B
                                                              (D) Both LL(1) and LR(1)
    After removing all unit productions
    the resulting equivalent grammar                      81. Suppose we have to send an E-mail

    will contain .................................            with an attachment of 2.5 kbyte with
    productions.                                              1 Gbps bandwidth. Assume that the
    (A) 18                                                    distance between the sender and the
    (B) 12                                                    receiver is 12000 km and the light
    (C) 10                                                    travels at 2.4 × 108 m/s. What will
    (D) 11                                                    be the propagation time ?
79. Which of the following is correct
                                                              (A) 208 ms
    statement ?
                                                              (B) 50 ms
    (i)   A language is a regular
                                                              (C) 200 ms
          language if and only if it can
          be represented by a regular                         (D) 600 ms
          expression.                                     82. We have a LAN with 10 Mbps band-
    (ii) A language is a regular if and                       width and average 12000 frames per
          only if it cannot be generated                      minutes and size of each frame is
          by a regular grammar.
                                                              10000 bits. Then its throughput
    (iii) Every regular grammar is
                                                              will be ................... .
          context free grammar.
                                                              (A) 0.83 Mbps
    (A) (i) only
                                                              (B) 2 Mbps
    (B) (i) and (ii) only
    (C) (i) and (iii) only                                    (C) 0.2 Mbps

    (D) (iii) only                                            (D) 20 Mbps

                                                     22
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 23 of 28
Page 23 of 28
Text of page 23
SEP - 37221/II—A

83. Which is the only layer of OSI model         86. Which mechanism in transport
    that prevents itself from adding its
                                                     layer supplies multiple network
    own header to the data during the
                                                     connections     along     with    the
    data transmission process ?
                                                     distribution of traffic over them in a
    (A) Application layer
    (B) Network layer                                round-robin basis/fashion ?

    (C) Physical layer                               (A) Upward Multiplexing
    (D) Transport layer                              (B) Downward Multiplexing
84. In a leaky bucket used to control                (C) Buffering and Flow Control
    liquid flow, how many gallons of
                                                     (D) Crash Recovery
    liquid are left in the bucket if the
    output rate is 6 gal/min, there is an        87. While linking to the internet mail
    input burst of 100 gal/min for 12 sec            system which of the following ‘mailto’
    and there is no input for 48 sec ?               anchors is correct ?
    (A) 20 gal
                                                     (A) <a href = “mailto : amitkumar
    (B) 5 gal
                                                         @ gmail.com”> send a page to
    (C) 15 gal
                                                         amit </a>
    (D) 13 gal
                                                     (B) <a href = “emailto : amitkumar
85. In symmetric-key cryptography, if
    every person in a group of 10 people                 @ gmail.com”> send a page to
    needs to communicate with every                      amit </a>
    other person in another group of                 (C) <a href : “mailto : amitkumar
    10 people, how many minimum
                                                         @ gmail.com”> send a page to
    secret keys are needed ?
                                                         amit </a>
    (A) 1
    (B) 10                                           (D) <a href : “emailto : amitkumar

    (C) 100                                              @ gmail.com”> send a page to
    (D) 50                                               amit </a>

                                            23                                     [P.T.O.
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 24 of 28
Page 24 of 28
Text of page 24
SEP - 37221/II—A

88. Role of “data streamer” in Hadoop            90. Which DNS resource record is used
    Distributed File System (HDFS) is :              to provide the ability to associate
    (A) Send a request to the Data                   arbitrary text with a host name ?
         Node to send list of Name Node              (A) A
         to store replica of first block             (B) MCX
    (B) Send a request to the Name                   (C) TXT
         Node to get a list of suitable              (D) Text
         Data Nodes to store replica of          91. How are conflicts resolved in multi-
         first block                                 agent systems ?
    (C) Streaming service to indicate
                                                     (A) Co-operation
         failure of Data Nodes
                                                     (B) Negotiation
    (D) Streaming service to indicate
                                                     (C) Seclusion
         failure of Name Nodes
                                                     (D) Competition
89. While virtualizing X-86 architecture
                                                 92. Pragmatic interpretation in natural
    with “hardware assisted virtuali-
                                                     language understanding relates
    zation” which of the following is
                                                     to :
    true ?
                                                     (A) Symbols
    (A) Priviledged and sensitive calls
                                                     (B) Structure
         are automatically trapped to the
                                                     (C) Context
         hypervisor
                                                     (D) Syntax
    (B) Is    done        using   binary
         translation                             93. Sensorless planning is also known
                                                     as :
    (C) Is     done       using    para-
         virtualization                              (A) Conformant planning

    (D) Priviledged and sensitive calls              (B) Conditional planning

         are trapped using Application               (C) Contingency planning
         Binary Interface (ABI)                      (D) Continuous planning

                                            24
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 25 of 28
Page 25 of 28
Text of page 25
SEP - 37221/II—A

94. Which amongst the following are            96. The probability of 1-point crossover,
                                                   with crossover rate Pc, to break the
    essential components of an expert
                                                   schema of length ‘l’ given by :
    system ?                                           Pc * Pc
                                                   (A)
    (i)   Inference engine                               l 1
                                                       Pc * D(H)
    (ii) Context graph                             (B)
                                                          l 1
    (iii) Knowledge base                               Pc
                                                   (C)
    (iv) Computer vision                                l
                                                       Pc * D(H)
    (A) (i) and (ii)                               (D)
                                                            l
    (B) (i) and (iii)                          97. If
    (C) (i), (ii) and (iii)                              0.1   0.5     0
                                                    P                      and
    (D) (ii), (iii) and (iv)                             C1    C2     C3

95. What features amongst the following                  0.3   0.8
                                                    S
                                                         S1    S2 .
    would be required for a computer
                                                   The relation between P and S in
    program to pass the Turing test ?              set theoretic form is :
    (i)   Natural language processing                    0.1 0.1
                                                   (A)   0.3 0.5
    (ii) Knowledge representation
                                                         0.3 0.8
    (iii) Automated reasoning
                                                         0.1 0.3
    (iv) Computer vision                                 0.5 0.8
                                                   (B)
    (v) Machine learning                                 1   0.1

    (vi) Problem solving                                 0.2 0.5
                                                   (C)   0.1 0.8
    (A) (i), (ii) and (iii)
                                                         0.1 0.2
    (B) (i), (ii), (iii) and (iv)
                                                         0.2 0.8
    (C) (i), (ii), (iii) and (v)                         0.9 0.5
                                                   (D)
    (D) (i), (ii), (iv) and (vi)                         0.3 0.3

                                          25                                     [P.T.O.
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 26 of 28
Page 26 of 28
Text of page 26
SEP - 37221/II—A

98. If the fuzzy relations R and S are        99. Hopfield     networks       have     the

    defined as follows :                          “energy”, E, associated with them.

                                                  Thus for Hopfield network with
                0.7 0.5
           R                and                   symmetric weights, this energy,
                0.8 0.4
                                                  E at each state may ................. .

                 0.9 0.6 0.2                      (A) Increase
            S
                 0.1 0.7 0.5
                                                  (B) Decrease


    then using max-min composition                (C) Decrease or remain same

    T = RoS is represented as :
                                                  (D) Decrease or increase

                                              100. In artificial neural network (ANN)
          0.7 0.6 0.5
    (A)                                           training, epochs represent the total
          0.8 0.6 0.4

                                                  number of :

          0.9 0.6 0.2
    (B)                                           (A) Input layer nodes
          0.1 0.7 0.5

                                                  (B) Passes of the training data

          0.2 0.1 0.1                                  through the network
    (C)
          0.7 0.1 0.1
                                                  (C) Network nodes


          0.2 0.3 0.4                             (D) Passes of the test data through
    (D)
          0.1 0.1 0.9
                                                       the network

                                         26
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 27 of 28
Page 27 of 28
Text of page 27
SEP - 37221/II—A

ROUGH WORK




    27                 [P.T.O.
MH SET 2021 question paper, 26 September 2021, Paper II, Computer Science and Applications, page 28 of 28
Page 28 of 28
Text of page 28
SEP - 37221/II—A

ROUGH WORK




    28
Page 1 of 28

Source: Savitribai Phule Pune University. Question paper published by Savitribai Phule Pune University.