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

MH SET 2023: 26 March, Paper II, Computer Science and Applications

  • Date: 26 March 2023
  • Paper code: MAR-37223
  • Series: A
  • Language: Bilingual
  • 28 pages
MH SET 2023 question paper, 26 March 2023, 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.
MAR - 37223                                                                                                 (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 2023 question paper, 26 March 2023, Paper II, Computer Science and Applications, page 2 of 28
Page 2 of 28
Text of page 2
MAR - 37223/II—A




2
MH SET 2023 question paper, 26 March 2023, Paper II, Computer Science and Applications, page 3 of 28
Page 3 of 28
Text of page 3
MAR - 37223/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.   Group code are generated using

                                                                1 0 0 1 1 0
                                                         G      0 1 0 0 1 1                  for
                                                                0 0 1 1 0 1

                                                         communication. Then.......... is not
                                                         code word.
                                                         (A) 000000       (B) 000111
                                                         (C) 101100       (D) 111111
     V = {A, B, C, D, E, F, G, H, I}                3.   The number of code word possible

     E = {e1 = (A, B), e2 = (A, C), e3 =                                             1   1   0
     (A, D), e4 = (B, C), e5 = (B, F),                   using the generator G =
                                                                                     0   1   1
     e6 = (B, H), e7 = (C, D), e8 = (C, E),
                                                         is :
     e9 = (C, F), e10 = (D, E), e11 = (D, I),
                                                         (A) 1            (B) 2
     e12 = (E, F), e13 = (E, G), e14 =
     (F, G), e15 = (F, H), e16 = (G, H),                 (C) 4            (D) 8
     e17 = (G, I), e18 = (H, I)}                    4.   Let X and Y be random variables
                                                         with joint distribution :
     W = {22, 9, 12, 35, 36, 34, 4, 33, 30,
                                                         Pr(X     i, Y   j)
         18, 23, 24, 39, 25, 21, 19}
                                                                1 / 6 for i    5,6 and j 3,6,9
     The weight of the shortest path from
                                                                0                  otherwise
     node A to I in the undirected graph
     is........... .                                     Then the conditional entropy
                                                         H(X|Y) = .................. .
     (A) 2           (B) 3                               (A) 0           (B) log(2)
     (C) 42          (D) 43                              (C) log(3)      (D) log(6)

                                                3                                        [P.T.O.
MH SET 2023 question paper, 26 March 2023, Paper II, Computer Science and Applications, page 4 of 28
Page 4 of 28
Text of page 4
MAR - 37223/II—A

5.   Let X and Y be random variable              6.   Notation :
                                                      C(n, r) = n!/(r!*(n-r)!))
     with the following distributions
                                                      n! is factorial n.
     respectively :
                                                      |A| cardinality of set A

           X 1   2   3   4   5                        s is negation of s
           P 0.1 0.2 0.4 0.2 0.1                      The number of ways to place r
                                                      indistinguishable balls in n(n < r)
           Y 10       20   35   50   60               distinct boxes, with no box left
           P   0.1 0.2 0.4 0.2 0.1                    empty, is........... .
                                                      (A) C(r – 1, n – 1)
     (A) Skewness of X and Y are same,
                                                      (B) C(n + r – 1, n – 1)
         Coefficient of Variations are the            (C) C(n + r – 1, r – 1)
                                                      (D) C(n – 1, r – 1)
         same
                                                 7.   Consider the following Linear
     (B) Skewness of distribution of X                Programming Problem :

         and Y are not same, Coefficient                   Maximize : Z = 5x1 + 6x2 + 4x3

         of Variations are the same                        Subject to 3x1 + x2 + 4x3        60

                                                                       2x1 + 3x2 + 3x3      75
     (C) Skewness of distribution of X
                                                                               x1, x2, x3   0
         and Y are same, Coefficient of
                                                      The value of the decision variables
         Variations are not same                      after the first iteration will be :

                                                      (A) x1 = 0, x2 = 0, x3 = 25
     (D) Skewness of distribution of X
                                                      (B) x1 = 0, x2 = 25, x3 = 0
         and Y are not same, Coefficient
                                                      (C) x1 = 20, x2 = 0, x3 = 0
         of Variations are not same                   (D) x1 = 0, x2 = 37.5, x3 = 0

                                             4
MH SET 2023 question paper, 26 March 2023, Paper II, Computer Science and Applications, page 5 of 28
Page 5 of 28
Text of page 5
MAR - 37223/II—A

8.   Consider the following Linear                  9.   The transportation problem of m
     Programming Problem :                               resources and n destinations can be
         Maximize : Z = 5x1 + 10x2                       written as Linear Programming
                                                         Problem with :
         Subject to :             x1        4
                                                         (A) mn decision variables and mn
                                  x2        2
                                                             constraints
              x1 + x2 = 5, x1, x2           0
                                                         (B) (m + n) decision variables and
     The dual of this problem is given
                                                             (m + n) constraints
     by :
                                                         (C) (m + n) decision variables and
     (A) Maximize : Z' = 4y1 + 2y2
                                                             mn constraints
                             + 5y3 – 5y4
                                                         (D) (mn) decision variables and
         Subject to :                                        (m + n) constraints
                   y1 + y3 – y4         5
                                                    10. The optimal solution to the following
                  –y2 + y3 – y4 > 10                    assignment problem
                   y1, y2, y3, y4       0                         J1        J2   J3 J 4
     (B) Minimize : Z' = 4y1 + 2y2                           M1 10          9    8 7
                             + 5y3 – 5y4                     M2   3         4    5    6
         Subject to :                                        M3   2         1    1    2
                   y1 + y3 – y4         5                    M4   4         3    5    6
                  –y2 + y3 – y4 > 10
                                                         is given by :
                   y1, y2, y3, y4       0
                                                         (A) M1        J3, M2        J2, M3   J1,
     (C) Maximize : Z' = 4y1 + 2y2
                                                             M4        J4
                                       + 5y3
                                                         (B) M1        J4, M2        J1, M3   J2,
         Subject to :        y1 + y3        4
                                                             M 4 – J3
                             y2 + y3 > 2
                                                         (C) M1        J4, M2        J1, M3 – J3,
                        y1 + y2 + y3 = 5
                                                             M4 – J 2
                           y1, y2, y3       0
                                                         (D) M1 – J3, M2 – J4, M3 – J2,
     (D) The dual cannot be written as
         there are mixed constraints.                        M 4 – J1

                                                5                                         [P.T.O.
MH SET 2023 question paper, 26 March 2023, Paper II, Computer Science and Applications, page 6 of 28
Page 6 of 28
Text of page 6
MAR - 37223/II—A

11. A switch debouncer circuit is an         15. The speed of information being
    application of :                             transferred in and out of memory
    (A) The gated SR latch                       depends on which of the following
    (B) The S R latch                            parameters ?
    (C) SR latch
                                                 (i)   Access time tA
    (D) The gated D latch
                                                 (ii) Cycle time tc
12. The ASCII code for decimal digit 9
                                                 (iii) Access rate rA
    with an even parity, placing the
    parity bit in the most significant           (iv) Bandwidth rc

    position is :                                (A) (i) & (ii)
    (A) 00111001                                 (B) (ii) & (iii)
    (B) 10111001
                                                 (C) (i), (ii) & (iii)
    (C) 00100101
                                                 (D) (i), (ii), (iii) & (iv)
    (D) 11000110

13. The 15's complement of A9BH is :         16. Which of the following assembler

    (A) B02 H                                    directives can be used to define &
                                                 re-define numeric constants ?
    (B) 173 H

    (C) CD2H                                     (i)   EQU

    (D) 564H                                     (ii) % assign
14. The write pulse width (twp) is the           (iii) % define
    time for which :
                                                 (A) (i) & (ii) only
    (A) WR goes high
                                                 (B) (ii) & (iii) only
    (B) WR goes low

    (C) WR goes high                             (C) (i) & (iii) only

    (D) WR goes low                              (D) (i), (ii) & (iii)

                                         6
MH SET 2023 question paper, 26 March 2023, Paper II, Computer Science and Applications, page 7 of 28
Page 7 of 28
Text of page 7
MAR - 37223/II—A

17. A horizontal micro-programmed                   19. A computer has 512 KB, 4-way set
   control unit supports the following.                 associative, write back data cache
   Identify the correct ones.                           with block size of 32 bytes. The
   (i)   Longer control word                            processor sends 32 bit addresses to

   (ii) Used in parallel processing                     the cache controller. Each cache tag

         applications                                   directory entry contains, in addition
                                                        to address tag, 2 valid bits, 1
   (iii) Allows      high        degree    of
         parallelism                                    modified bit and 1 replacement bit.
                                                        The number of bits in the tag field
   (iv) Requires           no    additional
                                                        of an address is :
         hardware (decoders)
                                                        (A) 80             (B)   32
   (A) (i), (ii) & (iii)

   (B) (i), (iii) & (iv)                                (C) 64             (D)   15

   (C) (i), (ii), (iii) & (iv)                      20. Why do race conditions occur ?

   (D) (ii), (iii), (iv)                                (i)   Values of memory locations

18. Which     of   the      following     are                 replicated in registers during

   representative application areas                           execution.
   where vector processing is used ?                    (ii) Content switches at arbitrary
   (i)   AI & Expert systems                                  times during execution.
   (ii) Seismic Data Analysis
                                                        (iii) Threads can see stale memory
   (iii) Petroleum Explorations                               values in registers.
   (iv) Medical Diagnosis
                                                        (A) Only (ii)
   (A) (i), (ii), (iii) & (iv)
                                                        (B) Only (iii)
   (B) Only (i)
                                                        (C) (i) & (ii)
   (C) Only (ii) & (iv)
   (D) None of the above                                (D) (i), (ii) & (iii)

                                                7                                     [P.T.O.
MH SET 2023 question paper, 26 March 2023, Paper II, Computer Science and Applications, page 8 of 28
Page 8 of 28
Text of page 8
MAR - 37223/II—A

21. A normalised heterogeneous                   23. Consider the following ‘C’ program
    abstract syntax tree must :
                                                     fragment :
    (i)   Trees with magnitude of node
          type are called heterogeneous                  int i = 5;
          tree
    (ii) Normalised heterogeneous tree                   do
         use a normalised list of children
                                                         {
         like homogeneous tree
    (iii) Nodes have irregular children                       putchar (i + 100);
    (iv) Use more than a single node
                                                              printf ("%d", i...);
         data type but with normalised
         child list representation.                      } while (i);
    (A) (i), (ii) and (iv)
    (B) (i) and (ii)                                 results in the following output :

    (C) (ii) and (iv)                                (A) i 5 h 4 g 3 f 2 e 1
    (D) (iv) only
                                                     (B) i 4 h 3 g 2 f 1 e 0
22. Which of the following comparison
    between static and dynamic type                  (C) An error message will come
    checking is correct ?
    (i)   dynamic type checking slow                 (D) Went into infinite loop
          down execution
                                                 24. The object-oriented programming
    (ii) dynamic type checking offers
         more flexibility to the                     can be seen as an attempt to
         programmers                                 enhance opportunities for code reuse
    (iii) Dynamic type checking is more
                                                     be making it ease to define new
          reliable
    (iv) Unlike static type checking the             abstraction as :
         dynamic type checking is done               (A) Extension or refinement
         during compilations.
    (A) (i) and (ii)                                 (B) Independence
    (B) (i) and (iii)
                                                     (C) Containment
    (C) (ii) and (iii)
    (D) (iv) only                                    (D) Facult containment

                                             8
MH SET 2023 question paper, 26 March 2023, Paper II, Computer Science and Applications, page 9 of 28
Page 9 of 28
Text of page 9
MAR - 37223/II—A

25. Exception handling is not meant to            27. Most of recent browsers support an
                                                      additional ENCTYPE of multipart/
    handle problems for which case ?
                                                      form-data, which statements out of
    (i)   termination of program                      the following correctly define it ?
    (ii) handle          return     value             (i)   This encoding transmit each
          representing error                                field as a separate part of MIME
                                                            compatible           document
    (iii) hand return a legal value and
                                                            automatically
          leave the program in an illegal
                                                      (ii) MIME compatible document
          state                                             automatically use POST to
    (iv) call an error handler function                     submit data in multipart

    (A) (i) and (ii)                                  (iii) This attribute specifies the way
                                                            in which data is enclosed
    (B) (ii) and (iii)
                                                      (iv) This encoding sometime makes
    (C) (iv) only
                                                            it easier for server side program
    (D) (i), (ii) and (iv)                                  to handle complex data.

26. The scope rules, especially the rules             (A) (i) and (ii)

    for nested type ensures that the                  (B) (ii) and (iv)

    resulting multitude of..........type do           (C) (iii) and (iv)

    not interface with each other.                    (D) (i), (ii) and (iv)
                                                  28. Identify      odd    one   from    the
    (A) Enumerated
                                                      following :
    (B) Inherited                                     (A) Digitizer
                                                      (B) Touch panel
    (C) Encapsulated
                                                      (C) Plotter
    (D) Contained                                     (D) Trackball

                                              9                                      [P.T.O.
MH SET 2023 question paper, 26 March 2023, Paper II, Computer Science and Applications, page 10 of 28
Page 10 of 28
Text of page 10
MAR - 37223/II—A
                                                        31. Data integrity constraints are used
29. The       transformation            matrix              for :
      0       1        0                                    (i) Establishing           limits on
                                                                  allowable property values
      1      0         0                                    (ii) Specifying a set of acceptable,
                           is used to obtain the
      0      0         1                                          predefined options to property
                                                                  values
    reflection about the.......... .                        (iii) Ensuring that duplicate values
                                                                  are not entered in the table
                                                            (iv) Controlling that data is
    (A) Y-axis, flipping x-coordinates
                                                                  accessed by authorised users
                                                            (A) (i) & (ii)
    (B) line Y = 0                                          (B) (i), (ii) & (iii)
                                                            (C) (iii) & (iv)
    (C) Diagonal line Y = –x                                (D) (i), (ii), (iii) & (iv)
                                                        32. Match the following statements in
    (D) Diagonal line Y = x                                 Group 1 with database objects in
                                                            Group 2 :
30. Given rx = ry, the following super                                      Group 1
                                                            P. View
    ellipse has the parameter value                         Q. Table
                                                            R. Role
      = .......... .
                                                            S. Function
                                                                        Group 2
                                                            I. that which contains data
                                                            II. that which returns a value
                                                            III. that helps in managing groups
                                                                  of privileges
                                                            IV. that which contains only a
                                                                  stored SQL statement
                                                            (A) P I, Q II, R III, S IV
    (A) 0.5                (B) 1
                                                            (B) P II, Q I, R IV, S III
                                                            (C) P IV, Q I, R III, S II
    (C) 1.5                (D) 2
                                                            (D) P IV, Q III, R I, S II

                                                   10
MH SET 2023 question paper, 26 March 2023, Paper II, Computer Science and Applications, page 11 of 28
Page 11 of 28
Text of page 11
MAR - 37223/II—A

33. Every table with two single valued            36. Which amongst the following
    attributes is in :                                statements are correct ?

    (A) 2NF                                           (i)   Writing a database object
    (B) 3NF                                                 without reading its initial value
    (C) BCNF                                                is called Blind write
    (D) All of the above                              (ii) In wound wait technique, the
34. Database contains two tables :                          number of rollback is low
    Employee (id, name, salary, did) and
                                                      (iii) In wait-die technique, the
    Dept. (did, dname).
                                                            younger transaction is never
    Which of the following is an incorrect                  rolled back
    SQL query ?
                                                      (iv) The different locks in 2PL
    (A) Select name, dname from
                                                            mechanism are shared, read,
        employee natural join Dept;
                                                            write and unlock.
    (B) Delete from employee where did
                                                      (A) (i), (ii) and (iii)
        in (Select did from Dept);
    (C) Update employee set salary =                  (B) (i) & (ii)
        salary * 1.03 where salary >                  (C) (i), (ii) and (iv)
        100000;
                                                      (D) (ii), (iii) and (iv)
    (D) Insert values into employee
                                                  37. An association rule which involves
        (1, 'vijay', 100000, 12);
                                                      numeric attributes having implicit
35. Which keyword is used to rename                   ordering among values is known
    a field name in SQL query ?                       as...............association rule.

    (A) AS                                            (A) Multivalued

    (B) ALTER                                         (B) Ordered

    (C) LIKE                                          (C) Numeric

    (D) FROM                                          (D) Quantitative

                                             11                                            [P.T.O.
MH SET 2023 question paper, 26 March 2023, Paper II, Computer Science and Applications, page 12 of 28
Page 12 of 28
Text of page 12
MAR - 37223/II—A

38. Agglomerative approach of clus-               42. A virtual memory has a page size
    tering is one of the..........methods.            of 1K words. There are eight pages
     (A) Density                                      and four blocks. The associative
     (B) Partitioning                                 memory page table contains the
     (C) Hierarchical                                 following entries :
     (D) Model based
39. What is the default replication factor                     Page     Block
    in HDFS for a hadoop cluster having
                                                                 0          3
    100 data nodes ?
                                                                 2          1
     (A) 1
     (B) 2                                                       5          2
     (C) 3                                                       7          0
     (D) 4
                                                      Which of the following lists of virtual
40. Which of the following is a wide
                                                      addresses (in decimal) will NOT
    column store ?
                                                      cause any page fault if referenced
     (A) Cassandra
                                                      by the CPU ?
     (B) Riak
                                                      (A) 1024, 3072, 4096, 6144
     (C) Mango DB                                     (B) 1234, 4012, 5000, 6200
     (D) Redis                                        (C) 1020, 3012, 6120, 8100
41. Consider a system having ‘m’                      (D) 2021, 4050, 5112, 7100
    resources of the same type. These             43. A memory management system has
    resources are shared by three                     64 pages with page size of 512 bytes.
    processes P1, P2 and P3 which have                Physical memory consists of 32 page
    peak demands of 2, 5 and 7 resources              frames. Number of bits required in
    respectively. For what value of ‘m’
                                                      logical and physical address are
    deadlock will not occur ?
                                                      respectively :
     (A) 70                                           (A) 14 and 15
     (B) 14                                           (B) 14 and 29
     (C) 13                                           (C) 15 and 14
     (D) 7                                            (D) 16 and 32
                                             12
MH SET 2023 question paper, 26 March 2023, Paper II, Computer Science and Applications, page 13 of 28
Page 13 of 28
Text of page 13
MAR - 37223/II—A

44. A FAT (File Allocation Table) based              46. We need to design a filesystem to
    file system is being used and the                    store image files having maximum
    total overhead of each entry in the                  one block size. Which of the following
    FAT is 4 bytes in size. Given a 100
                                                         disk space allocation methods is
    × 106 bytes disk on which the file
                                                         most appropriate to meet this
    system is stored and data block size
    is 103 bytes, the maximum size of                    requirement ?
    a file that can be stored on this disk               (A) Contiguous Allocation
    in units of 106 bytes is........... .                (B) Linked Allocation
    (A) 99.55 to 99.65
                                                         (C) Indexed Allocation
    (B) 100.5 to 101.4
    (C) 97.2 to 98.5                                     (D) Hashed Allocation
    (D) 89.1 to 91.2                                 47. Which type of encryption is
45. A computer has twenty physical                       preferred to encrypt the data stored
    page frames which contain pages
                                                         on a conventional hard-disk ?
    numberd 101 through 120. Now a
                                                         (A) Symmetric-key cryptography
    program      accesses      the     pages
    numbered 1, 2,....., 100 in that order,              (B) Asymmetric-key cryptography
    and repeats the access sequence                      (C) Hashing
    THRICE. Which one of the following
                                                         (D) Quantum cryptography
    page      replacement            policies
    experiences the same number of                   48. Which system call replaces a current
    page faults as the optimal page                      process in Linux ?
    replacement       policy     for    this
                                                         (A) pipe
    program ?
    (A) Least-recently-used                              (B) fork
    (B) First-in-first-out
                                                         (C) exec
    (C) Last-in-first-out
    (D) Most-recently-used                               (D) dup

                                                13                                     [P.T.O.
MH SET 2023 question paper, 26 March 2023, Paper II, Computer Science and Applications, page 14 of 28
Page 14 of 28
Text of page 14
MAR - 37223/II—A

49. Which of the following is not an           51. In software development process,
    Inter-process-communication
                                                   ...................... is a design strategy that
    mechanism in Linux ?
                                                   tries to address the design and
    (A) Pipe

                                                   implementation             complications
    (B) Redirection

    (C) Socket                                     associated         with       such     inter-

    (D) Signal                                     dependencies             by      explicitly

50. Windows operating system use the               introducing aspects as system
    following two modes to protect user
                                                   characteristics.
    applications from accessing and/or

    modifying critical operating system            (A) Agile development model

    data :
                                                   (B) Evolutionary              development
    (A) Normal     user   mode     and
                                                        model
        Administrator mode

    (B) User mode and Kernel mode                  (C) Rapid           linear        sequence

    (C) Hardware mode and Software
                                                        development model
        mode
                                                   (D) Aspect-oriented development
    (D) Hardware interrupt mode and

        Software interrupt mode                         model


                                          14
MH SET 2023 question paper, 26 March 2023, Paper II, Computer Science and Applications, page 15 of 28
Page 15 of 28
Text of page 15
MAR - 37223/II—A

52. In software development process,              54. Cohesion is........and coupling is...... .
    which is not one of the key questions
                                                       (A) Intra-module, Inter-module
    that is answered by each team
    member at each daily Scrum                         (B) Inter-module, Intra-module
    meeting ?
                                                       (C) Intra-module, Intra-module
    (A) What did you do since the last
        meeting ?                                      (D) Inter-module, Inter-module

    (B) What      obstacles      are   you        55. One of the following is most desirable
        encountering ?
                                                       when using LOC as a size oriented
    (C) What is the cause of the
                                                       metric ?
        problems           you         are
        encountering ?                                 (A) LOC is language dependent

    (D) What do you plan to accomplish                 (B) LOC is language independent
        at the next team meeting ?
                                                       (C) LOC can be computed before
53. A user is describing a real-life
                                                            design phase
    example     during     requirement
    gathering stage of a software                      (D) LOC can be easily computed
    development project.
                                                  56. Which of the following is not a size
    This most appropriately represents
    which    requirement      discovery                metric ?

    technique ?                                        (A) LOC
    (A) Viewpoint
                                                       (B) Function Count
    (B) Interview
                                                       (C) Program Length
    (C) Scenario
                                                       (D) Cyclomatic Complexity
    (D) Use-case

                                             15                                        [P.T.O.
MH SET 2023 question paper, 26 March 2023, Paper II, Computer Science and Applications, page 16 of 28
Page 16 of 28
Text of page 16
MAR - 37223/II—A

57. An independent path is a path               59. When error occurs, the process of

    through        the    program   that            anticipating such errors through
    introduces set of.......... .                   setting up error handling paths to

    (i)   new conditions                            reroute or terminating processing

    (ii) processing statements                      cleanly is known as............ .

    (A) (i) only                                    (A) Debugging

    (B) (ii) only                                   (B) Rebugging

    (C) (i) or (ii) or both                         (C) Prebugging

    (D) Neither (i) nor (ii)                        (D) Antibugging

58. Software Configuration Management           60. Which is the correct evolutionary

    (SCM) provides systematic evolution             path of five level capability maturity
    of a software under development and             model ?
    provides for :
                                                    (A) initial, defined, repeatable,
    (i)   Visibility
                                                         managed, optimizing
    (ii) Controlled change
                                                    (B) initial, repeatable, defined,
    (iii) Traceability
                                                         managed, optimizing
    (iv) Monitoring

    (A) (i), (ii) and (iii)                         (C) initial, defined, managed,

    (B) (i), (ii) and (iv)                               optimizing, repeatable

    (C) (i), (ii), (iii) and (iv)                   (D) initial, repeatable, managed,

    (D) (ii) and (iii)                                   defined, optimizing

                                           16
MH SET 2023 question paper, 26 March 2023, Paper II, Computer Science and Applications, page 17 of 28
Page 17 of 28
Text of page 17
MAR - 37223/II—A

61. For a given max-heap, which is the            63. The in-order traversal output and
    correct answer ?                                  pre-order traversal output of a
                                                      binary tree are same, then the
    (A) The leaf nodes have values
                                                      binary tree is :
        greater than or equal to their
        parents                                       (A) Left skewed

    (B) The leaf nodes have values less               (B) Right skewed
        than or equal to their parents
                                                      (C) Balanced
    (C) The leaf nodes and their parents
                                                      (D) Completely balanced
        have same values
                                                  64. The two statements that can change
    (D) The leaf nodes have values
                                                      the flow of control are :
        different from their parents
                                                      (A) if and switch
62. B+ trees are considered BALANCED
    because :                                         (B) if and while

    (A) The lengths of the paths from                 (C) switch and do-while

        the root to all leaf nodes are all            (D) break and continue
        equal
                                                  65. A deque is :
    (B) The lengths of the paths from
                                                      (A) A queue implemented with a
        the root to all leaf nodes differ
                                                          doubly linked list
        from each other by at most 1
                                                      (B) A queue implemented with both
    (C) The number of children of any
                                                          singly and doubly linked lists
        two non-leaf sibling nodes differ
        by at most 1                                  (C) Just a queue

    (D) The number of records in any                  (D) A queue with insert and delete

        two leaf nodes differ by at                       defined for both front and rear

        most 1.                                           ends of the queue

                                             17                                   [P.T.O.
MH SET 2023 question paper, 26 March 2023, Paper II, Computer Science and Applications, page 18 of 28
Page 18 of 28
Text of page 18
MAR - 37223/II—A

66. The postfix form of A*B+C/D is :              68. Match the algorithms in Group 1

                                                      with the design strategy used by the
     (A) * A B / C D +
                                                      algorithm in Group 2

     (B) A B * C D / +
                                                                Group 1

     (C) A * B C + / D                                P.   Merge Sort


     (D) A B C D + / *                                Q.   Insertion Sort

                                                      R.   Prim's algorithm
67. Let S be a sorted array of n integers.

                                                      S.   Kruskal's algorithm
     Let T(n) denote the time taken by

                                                                Group 2
     the most efficient algorithm to

                                                      I.   Greedy Strategy
     determine if there are two elements

                                                      II. Dynamic Programming
     in S with sum greater than m,

                                                      III. Divide and Conquer
     then :

                                                      IV. Decrease and Conquer
     (A) T(n) is of (1)
                                                      (A) P III, Q      II, R I, S IV
     (B) T(n) is of (m)
                                                      (B) P I, Q III, R II, S IV

     (C) T(n) is of (n)
                                                      (C) P IV, Q III, R II, S I

     (D) T(n) is of   (log n)                         (D) P   III, Q    IV, R I, S II

                                             18
MH SET 2023 question paper, 26 March 2023, Paper II, Computer Science and Applications, page 19 of 28
Page 19 of 28
Text of page 19
MAR - 37223/II—A

69. Which of the following is not true             71. For the language L = {anb/n > 0}

    for the problem classes P, NP, NP-                 which of the following is/are DFA
                                                       represents the above language ?
    complete and NP-hard ?
                                                       I.
    (A) P        NP

    (B) NP-complete          NP

    (C) NP-hard        NP                              II.


    (D) NP-complete          NP-hard

70. Maximum finding algorithm takes

    O(log 2 n)    parallel     time    with
                                                       III.
    p > n/2 processors using P-RAM

    model of parallel computation. If we

    have p < n/2 processors in reality,
                                                       IV.
    then which condition will retain the

    parallel time complexity of O(log n)

    extended with some constant factor.

    (A)   n   p n/ p          n/ p
                                                       (A) I and II only
    (B)   n      p 1 n/ p      n/ p
                                                       (B) I and III only
    (C) n * p 1 n / p         n/ p                     (C) II and IV only

    (D) n     n/ p     n/ p                            (D) III and IV only

                                              19                                 [P.T.O.
MH SET 2023 question paper, 26 March 2023, Paper II, Computer Science and Applications, page 20 of 28
Page 20 of 28
Text of page 20
MAR - 37223/II—A

72. Consider the context free grammar
                                                   74. The decision problem "Given a
    with productions :
                  S    ABa                            Turing Machine M and a step-
                  A    aab                            counting function "myfun", is the
                  B    Ac
                                                      language accepted by M in Time
     After constructing an equivalent
     grammar in Chomsky Normal form,                  (myfun) ?" is........... .
     the resulting grammar will contain
     ..............productions.                       (A) Stable
     (A) 10                  (B) 08
     (C) 06                  (D) 09                   (B) Unsolvable

73. For     to be an alphabet and
          *                                           (C) Partially solvable
    L       be a language A is said to
    be decidable if there exists a Turing
                                          *
                                                      (D) Solvable
    machine M for every string
    with which of the following conditions.        75. Consider the grammar G with
     (i)   If    L, the computation of TM
           M on input string terminates               productions           S       ACB/CbB/Ba,
           in accept state
                                                      A da/BC, B g/                 C   h/
     (ii) If       L ( does not belong
          to L) then computation of TM                Which of the following is correct set
          M on input string terminates
          in reject state                             for FIRST (S) ?

     (iii) If     L then computation of
                                                      (A) {a, b, h, g}
           TM M on input string
           terminates in reject state.
                                                      (B) {a, d, g,     }
     (A) (iii) only
     (B) (i) and (iii) only                           (C) {g, d, b, h,          }
     (C) (i) and (ii) only
                                                      (D) {g, d, a, b, h,           }
     (D) (ii) and (iii) only

                                              20
MH SET 2023 question paper, 26 March 2023, Paper II, Computer Science and Applications, page 21 of 28
Page 21 of 28
Text of page 21
MAR - 37223/II—A

76. An attribute grammar in which all               79. Consider the following function with
     the attributes are..........is called              line numbers.
     an.......attributed grammar.
                                                        1.    Int Myfunction( )
     (A) Synthesized, S
                                                        2.    {
     (B) Inherited, S
                                                        3.        int a = 24;
     (C) Synthesized, L
                                                        4.        int b = 25;
     (D) Inherited, L
77. Which of the following parameter                    5.        int c;

     passing methods works with the idea                6.        if (a! = 24)
     that the argument is not evaluated                 7.                 printf ("Is less than or
     until its actual use as a parameter                                   not equal to 24");
     in the called program ?
                                                        8.                 c = a << 2;
     (A) Pass by Value-Result
                                                        9.        return c;
     (B) Pass by Name
                                                        10.       b = 24;
     (C) Pass by Value
                                                        11. }
     (D) Pass by Reference
78. An...........is a data structure that is            Which line numbers contain the

     constructed from input data to a                   dead code/dead variable/unrea-
     program and from which part or all                 chable code in the above function
     of the output data of the program
                                                        definition ?
     is constructed.
                                                        (A) 4, 6, 7
     (A) Symbol Table
                                                        (B) 6, 7, 10
     (B) Flow Graph
     (C) Intermediate Representation                    (C) 4, 6, 7, 8, 10

     (D) Object File                                    (D) 4, 6, 7, 10

                                               21                                         [P.T.O.
MH SET 2023 question paper, 26 March 2023, Paper II, Computer Science and Applications, page 22 of 28
Page 22 of 28
Text of page 22
MAR - 37223/II—A

80. Consider the grammar shown below               82. While virtulizing X-86 architecture,
            S      AA                                  type-I hypervisor :
            A      aA/d
                                                       (A) Interact with OS through ABI
    The grammar is :
                                                            and emulate the ISA for Guest
    (A) LL(1)
                                                            OS
    (B) SLR(1) but not LL(1)
                                                       (B) run directly on top of the
    (C) LALR(1) but not SLR(1)
                                                            hardware with ISA exposed by
    (D) LR(1) but not LALR(1)
                                                            the hardware
81. While linking to Anonymous FTP
                                                       (C) is known as hosted virtual
    system which of the following
                                                            machine
    anchors is correct ?

    (A) <a href = "ftpto : // ftp.                     (D) run directly on top of the

        google.com"> google's public                        hardware with API exposed

        FTP servers </a>                           83. The guard interval is provided in

    (B) <a href="ftp : // ftp.google.com">             Orthogonal Frequency-Division
        google's public FTP servers                    Multiplexing (OFDM).
        </a>
                                                       (A) To eliminate the need of pulse
    (C) <a href : "ftp : //ftp.google.com">
                                                            shaping filter
        google's public FTP servers
                                                       (B) To eliminiate Inter Symbol
        </a>
                                                            Interface (ISI)
    (D) <a href : "ftp to : //ftp.
                                                       (C) High symbol rate
        google.com"> google's public
        FTP servers </a>'                              (D) Both (A) and (B)

                                              22
MH SET 2023 question paper, 26 March 2023, Paper II, Computer Science and Applications, page 23 of 28
Page 23 of 28
Text of page 23
MAR - 37223/II—A

84. The key length of a 3-key Triple              87. Match the following OSI layers with
    Data     Encryption       Standard                protocols :
    (3TDES) is :                                      (a) Layer 7 (Application)
    (A) 112 bits
                                                      (b) Layer 4 (Transport)
    (B) 256 bits
                                                      (c)   Layer 3 (Network)
    (C) 512 bits
                                                      (d) Layer 2 (Data Link)
    (D) 168 bits
                                                      (i)   IPv4
85. Suppose we have to send an E-mail
                                                      (ii) UPP
    with an attachment of 2.5 kbyte with
                                                      (iii) HTTP
    1 Gbps bandwidth. Assume that the
    distance between the sender and the               (iv) Ethernet, WiFi (802.11)

    receiver is 12000 km and that light               (A) a-(iv), b-(iii), c-(i), d-(ii)
    travels at 2.4 × 108 m/s. What will               (B) a-(iv), b-(iii), c-(ii), d-(i)
    be the transmission time ?                        (C) a-(iv), b-(ii), c-(iii), d-(i)
    (A) 50 ms
                                                      (D) a-(iii), b-(ii), c-(i), d-(iv)
    (B) 2 ms
                                                  88. If the frame to be transmitted is
    (C) 0.020 ms
                                                      1101011011          and      the       CRC
    (D) 0.2 ms
                                                      polynomial to be used for generating
86. What is the minimum Hamming
                                                      checksum is x4 + x + 1, then what
    distance for detection of three errors
                                                      is the transmitted frame ?
    or correction of two errors ?
                                                      (A) 11010110111110
    (A) 2
    (B) 3                                             (B) 11010110111011

    (C) 4                                             (C) 11010110111101

    (D) 5                                             (D) 11010110111001

                                             23                                            [P.T.O.
MH SET 2023 question paper, 26 March 2023, Paper II, Computer Science and Applications, page 24 of 28
Page 24 of 28
Text of page 24
MAR - 37223/II—A

89. In symmetric-key cryptography, how            91. Which of the following is not an
    many keys are needed for more
                                                      agent communication language ?
    secure communication if Alice and
                                                      (A) FIPA–ACL
    Bob want to communicate with each
    other ?                                           (B) KSE–KQML

    (A) 2                                             (C) KSE–KIF

    (B) 3                                             (D) FIPA–QIF
    (C) 4                                         92. An intermediate form between
    (D) 8
                                                      syntactic and logical form used in
90. Match the classes of IP addresses
                                                      Natural language processing is
    with their functional applications :
                                                      known as :
    (a) Class A      (1) Multicast
                                                      (A) Quantified logical form
                          Services

    (b) Classs B (2) Reserved          for            (B) Quasi-logical form

                          future use                  (C) Syntactic-logical form

    (c) Class D      (3) Large Organi-                (D) Definite clause grammar
                          zations
                                                  93. Forward state space search is also
    (d) Class E      (4) Midsize Organi-
                                                      known as :
                          zations
                                                      (A) Regression planning
    (A) (a)-4, (b)-3, (c)-2, (d)-1
                                                      (B) Progression planning
    (B) (a)-2, (b)-4, (c)-1, (d)-3

    (C) (a)-1, (b)-2, (c)-3, (d)-4                    (C) Contingency planning

    (D) (a)-3, (b)-4, (c)-1, (d)-2                    (D) Consistency planning

                                             24
MH SET 2023 question paper, 26 March 2023, Paper II, Computer Science and Applications, page 25 of 28
Page 25 of 28
Text of page 25
MAR - 37223/II—A

94. In     the   following       knowledge          96. Consider a non-binary genome of
    representation using first order logic
                                                        length l, over an alphabet of size
          person Indian (person) ^ know
    (person, English)         [Mother tongue            p(p>2).        How        many     different
    (person, lang) ^ hate (person, lang)],
                                                        schemata are there ?
    the number of predicates and
                                                        (A) 2 l
    variables are respectively :

    (A) 4, 2                                            (B) 2p

    (B) 4, 3                                            (C) 2p+l
                                                                  2
    (C) 3, 4                                            (D) 2 p
    (D) 5, 2
                                                                      1     0.5    0.3    0.2
95. Which of the following statements               97. If    A                                  and
                                                              ~       2      3      4      5
    are true for 'Rational Agents' ?

    (i)    it perceives its environment                               0.5    0.7    0.2    0.4
                                                              B                                ,
                                                              ~        2      3      4      5
           through sensors

    (ii) it acts upon the environment                   then A/B is :
           through actuators
                                                              0.5      0.2    0.1    0.2
                                                        (A)
    (iii) it improves its performance                          2        3      4      5
           through learning
                                                              0.5      0.2    0.1    0.6
    (iv) it knows the actual outcome of                 (B)
                                                               2        3      4      5
           its actions

    (A) (i) and (ii)                                          0.5      0.3    0.3    0.2
                                                        (C)
                                                               2        3      3      5
    (B) (i), (ii) and (iii)

    (C) (i), (ii) and (iv)                                    0       0.5    0.2    0.4
                                                        (D)
    (D) (iii) and (iv)                                        2        3      4      5

                                               25                                               [P.T.O.
MH SET 2023 question paper, 26 March 2023, Paper II, Computer Science and Applications, page 26 of 28
Page 26 of 28
Text of page 26
MAR - 37223/II—A


98. Functions that qualify as fuzzy           100. Which of the following data is

                                                  linearly separable ?
    intersections and fuzzy unions are


    referred to as :


    (A) t-norms & t-conorms                       (A)


    (B) i-norms & v-conorms


    (C) t-norms & i-norms


    (D) None of the above                         (B)


99. A single layer perception cannot


    compute the following logical


    function :                                    (C)


    (A) AND


    (B) OR


    (C) XOR                                       (D)



    (D) NOT

                                         26
MH SET 2023 question paper, 26 March 2023, Paper II, Computer Science and Applications, page 27 of 28
Page 27 of 28
Text of page 27
MAR - 37223/II—A

ROUGH WORK




    27                [P.T.O.
MH SET 2023 question paper, 26 March 2023, Paper II, Computer Science and Applications, page 28 of 28
Page 28 of 28
Text of page 28
MAR - 37223/II—A

ROUGH WORK




    28
Page 1 of 28

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