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

MH SET 2019: 23 June, Paper II, Computer Science and Applications

  • Date: 23 June 2019
  • Paper code: JUN-37219
  • Series: A
  • Language: Bilingual
  • 32 pages
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 1 of 32
Page 1 of 32
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.
JUN - 37219                                                                                          (To be filled by the Candidate)
Time Allowed : 2 Hours]                                                                                [Maximum Marks : 200
Number of Pages in this Booklet : 32                                                    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 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 2 of 32
Page 2 of 32
Text of page 2
JUN - 37219/II—A




2
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 3 of 32
Page 3 of 32
Text of page 3
JUN - 37219/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 set is built by using a
                                                                  generator G of size 5 × 8 with
                                                                  full rank, then code set weight
                                                                  is ....................... .

                                                                  (A) 5

                                                                  (B) 6

                                                                  (C) 7
     V = {A, B, C, D, E, F, G, H, I}
     E = {e1 = (A, B), e2 = (A, C), e3 =                          (D) 8
     (A, D), e4 = (B, C), e5 = (B, F), e6
     = (B, H), e7 = (C, D), e8 = (C, E),                     3.   ...................... is a received code word
     e9 = (C, F), e10 = (D, E), e11 = (D, I),                     knowing that one-bit error occurred
     e12 = (E, F), e13 = (E, G), e14 = (F,
     G), e15 = (F, H), e16 = (G, H), e17                          while transition of a group code word
     = (G, I), e18 = (H, I)}                                                                       1   0   0   1
     W = {22, 9, 12, 35, 36, 34, 4, 33, 30,                       generated by G =                 0   1   0   1
     18, 23, 24, 39, 25, 21, 19}
                                                                                                   0   0   1   1
     ....................... is a cut-set in the above
     graph.                                                       (A) 0011
     (A) {e1, e2, e4}                                             (B) 0111
     (B) {e1, e2, e5, e6}
                                                                  (C) 1111
     (C) {e12, e13, e15, e16}
                                                                  (D) 1100
     (D) {e4, e7, e8, e9}
                                                         3                                                 [P.T.O.
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 4 of 32
Page 4 of 32
Text of page 4
JUN - 37219/II—A

4.   Let P(x, y) be a propositional                          6.   Notation :
     function, then .................. is a                       C(n, r) = n!/(r!*(n-r)!))
     tautology.
                                                                  n! is factorial n.
     (A)     xP (x, y0)             yP (x0, y), x0 is
                                                                  |A| cardinality of set A
           a fixed value from domain of x
           and y0 is a fixed value from                           s is negation of s

           domain of y                                            C(2n, 2) = .....................

     (B)     xP (x, y0)             x    yP (x, y), y0            (A) 2C(2n, 1)
           is a fixed value from domain                           (B) nC(n, 1) + 2n
           of y
                                                                  (C) 2C(n, 2) + n2
     (C)     x y P(x, y)                y x P(x, y)
                                                                  (D) C(n, 2) + 2n2
     (D)     x y P(x, y)                yP (x0, y), x0
                                                             7.   Consider the following Linear
           is a fixed value from domain
                                                                  Programming Problem :
           of x
                                                                  Maximize : Z = 8x1 + 5x2
5.   Let A = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4,
                                                                  Subject to 2x1 + x2                500
     5, 5, 5, 5, 5}, B = {1, 2, 3, 4, 5},
     C = {1}, D = {1, {1}}                                                                 x1        150

     S1 : A and B are equal                                            x2     250, x1, x2            0

     S2 : C and D are equal then                                  The value of decision variable after
     .................... is True                                 the first iteration will be :

     (A) S1 and S2                                                (A) x1 = 0, x2 = 250

     (B) ~S1 and ~S2                                              (B) x1 = 150, x2 = 0

     (C) ~S1 and S2                                               (C) x1 = 250, x2 = 0

     (D) S1 and ~S2                                               (D) x1 = 150, x2 = 200

                                                         4
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 5 of 32
Page 5 of 32
Text of page 5
JUN - 37219/II—A

8.   Consider the following Linear                        10. Consider the following assignment
     Programming Problem :
                                                              cost matrix :
     Minimize : Z = 5x1 + 10x2
     Subject to : x1       4                                                        Jobs
                     x2    2                                                  J1   J2   J3 J4
              x1 + x2 = 5, x1, x2             0                         M1    10   9    7     8
     The problem is to be solved by                           Machines M2     5    8    7     7
     simplex     method.           How    many
                                                                        M3    5    4    6     5
     variables are needed to bring it to
                                                                        M4    2    3    4     5
     the standard form ?
     (A) 1 slack, 1 surplus, 2 artificial                     The optimal cost of assignment is :
     (B) 1 slack, 1 surplus, 1 artificial
                                                              (A) 24
     (C) 2 slack, 2 surplus, 2 artificial
     (D) 2 slack, 1 surplus, 2 artificial                     (B) 26
9.   Consider the following trans-
                                                              (C) 20
     portation problem :
                          Destinations                        (D) 18
                      D1    D2     D3    D4
     Sources    S1    3        7    6    4        5       11. Using    De-Morgan’s      law       the
                S2    2        4    3    2        2
                S3    3        8    5    3        3           simplified form of the expression
                      3        3    2    2
                                                                   (A B) (A B) is :
     The initial solution is obtained by
     Vogel’s method. The initial cost of                      (A) A    B
     transportation will be :
                                                              (B) A.B A.B
     (A) 36
     (B) 32                                                   (C) A + B
     (C) 40
     (D) 28                                                   (D) AB

                                                      5                                     [P.T.O.
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 6 of 32
Page 6 of 32
Text of page 6
JUN - 37219/II—A

12. What is the single error-correcting       15. One of the following is not a program
    code for the information code 10111           control instruction :
    for odd parity ?
                                                  (A) Interrupt-handling instructions
    (A) 100111110
                                                  (B) Subroutine call instructions
    (B) 111000001
                                                  (C) Unconditional branch instructions
    (C) 10101011
                                                  (D) System-control instructions
    (D) 10101100
                                              16. What is the range of instruction
13. Using 15’s complement method of
                                                  addresses to which conditional
    subtraction 69BH – C14H is :
                                                  branches, such as beq and bne can
    (A) 3EB H
                                                  branch in MIPS ?
    (B) A86 H
                                                  (A) +/– 217
    (C) 579 H
                                                  (B) +/– 216
    (D) – 579H
                                                  (C) +/– 232
14. Which of the following are the
    performance parameters of memory ?            (D) +/– 28

    (i)   Latency                             17. SPARC and POWER PC are based
                                                  on which of the following micro-
    (ii) Memory Cycle Time
                                                  processor architecture ?
    (iii) Transfer Rate
                                                  (A) EPIC
    (A) (i) and (ii)
                                                  (B) RISC
    (B) (ii) and (iii)

    (C) (i) and (iii)                             (C) CISC

    (D) (i), (ii) and (iii)                       (D) None of the above

                                          6
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 7 of 32
Page 7 of 32
Text of page 7
JUN - 37219/II—A

18. Strobe and Handshaking are                20. Which of the following are the

    mechanisms used to solve problems             characteristics of multiprocessors ?

    associated with :
                                                  (i)   Ability to share main memory
    (A) Synchronous I/O communi-
                                                        and I/O devices
        cation

                                                  (ii) Increased reliability because of
    (B) Asynchronous I/O communi-
                                                        redundancy in processors
        cation


    (C) Synchronous I/O synchroni-                (iii) Increased throughput because

        zation                                          of execution of multiple jobs in

    (D) Asynchronous I/O synchroni-                     parallel

        zation
                                                  (iv) Portions of the same job in

19. The term ‘Locality of Reference’ is
                                                        parallel
    generally associated with :
                                                  (A) (i) and (ii)
    (A) Secondary Memory

                                                  (B) (i), (ii) and (iii)
    (B) Registers

                                                  (C) Only (iii)
    (C) Main Memory


    (D) Cache Memory                              (D) (i), (ii), (iii) and (iv)

                                          7                                       [P.T.O.
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 8 of 32
Page 8 of 32
Text of page 8
JUN - 37219/II—A

                                                22. Consider the following ‘C’ fragment
21. Which of the following is dangling
                                                    of code where a, b, c is given as input
    reference ?                                     then predict the output from the
                                                    following :
    (i)   Accessing the storage that is               ...
                                                    char x, y, z;
          already disposed at users
                                                    printf (‘‘%d’’, scanf (‘‘%c%c%c’’, &x,
          request.                                  &y, &z));

                                                    (A) A syntax error
    (ii) Accessing the storage that is
                                                    (B) A fatal error
          already disposed at the request
                                                    (C) Segmentation violation
          of processor.                             (D) Shows 3 at output

    (iii) Accessing the variable that is        23. Consider the following ‘C’ program
                                                    fragment :
          declared but not initialised.
                                                    static char data [ ] [10] = {‘‘Java’’,
                                                    ‘‘Python’’, ‘‘CSharpe’’};
    (iv) Accessing the reference variable
                                                    printf (‘‘%d, %d, %d’’, data, data [0],
          that is declared but not
                                                    data [0] [0]);
          initialised.                              results in showing memory address
                                                    (irrespective of context as general)
    (A) (i) and (ii)
                                                    from the following sequences :

    (B) (ii) and (iii)                              (A) 170, 170, 170

                                                    (B) 170, 172, 174
    (C) (i), (ii) and (iii)
                                                    (C) 170, 170, 172

    (D) (i), (iii) and (iv)                         (D) 170, 172, 170

                                            8
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 9 of 32
Page 9 of 32
Text of page 9
JUN - 37219/II—A

24. In object oriented programming for            25. Using a constructor to specify the
                                                      type conversion is convenient but
    references and values, which of the
                                                      has implications that can be
    following statements are true :
                                                      undesirable in :
    (i)   If variables are references, then
                                                      (i)   There can be no implicit
          every object must be created                      conversion from a user defined
          explicitly.                                       type to basic type.

    (ii) If variables are values, then                (ii) It is not possible to specify a

          object creation can happen                        conversion from a new type to
                                                            an old one without modifying
          implicitly as result.
                                                            the declaration for the old one.
    (iii) If variables are references, then
                                                      (iii) It is not possible to have a
          every object must be created
                                                            constructor with a single
          implicitly                                        argument without also having

    (iv) If variables are values, then                      a conversion.

          object       creation   happens             (iv) A user defined conversion is
                                                            implicitly applied only if it’s
          explicitly
                                                            unique.
    (A) (i) and (ii)
                                                      (A) (i) and (iv)
    (B) (ii) and (iii)
                                                      (B) (i), (ii) and (iii)
    (C) (iii) and (iv)
                                                      (C) (ii), (iii) and (iv)

    (D) (i) and (iv)                                  (D) (iii) and (iv)

                                              9                                      [P.T.O.
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 10 of 32
Page 10 of 32
Text of page 10
JUN - 37219/II—A

26. Which one of the following ensures          28. Coordinates of a point (x, y) on a

    proper cleanup of objects of the                circle having centre at (xc, yc) and

    type ?                                          polar coordinates r and      may be

                                                    expressed in parametric polar form
    (i)   Destructor
                                                    as :
    (ii) Delete
                                                    (A) x = xc + r cos , y = yc + r sin
    (iii) Exception Handling
                                                    (B) x = xc + r sin , y = yc + r cos
    (iv) Garbage Collection
                                                    (C) x = xc + r cos , y = yc + r cos
    (A) (i) only
                                                    (D) x = xc + r sin , y = yc + r sin
    (B) (i) and (ii)
                                                29. Binary region codes assigned to line
    (C) (iii) only
                                                    end points according to relative
    (D) (iv) only
                                                    position with respect to the clipping
27. Microsoft has developed a very                  rectangle in the row order are :
    general scripting interface, that is
                                                    (A) 1001, 1000, 0001, 1010, 0000,
    implemented uniformly be the
                                                           0010, 0101, 0100, 0110
    operating system called WSH. Here
                                                    (B) 1001, 1000, 1010, 0001, 0000,
    WSH stands for :
                                                           0010, 0101, 0100, 0110
    (A) Windows System Handle
                                                    (C) 1001, 1000, 0001, 1010, 0000,
    (B) Windows Sewer Host
                                                           0101, 0010, 0100, 0110
    (C) Windows Scripting Host
                                                    (D) 1001, 1000, 0001, 1010, 0000,
    (D) Windows Scripting Handle                           0010, 0100, 0101, 0110

                                           10
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 11 of 32
Page 11 of 32
Text of page 11
JUN - 37219/II—A

30. Ambient light is light illuminated              32. Which amongst the following is an

    ....................... .                           example of object based logical

    (A) From a single light source                      model ?

    (B) From multiple light sources
                                                        (A) Network Model

    (C) By light sources and reflected
                                                        (B) Hierarchical Model
           by various surfaces
                                                        (C) Entity Relationship Model
    (D) Due to reflection from various

           surfaces                                     (D) Relational Model

31. The online redo log contains :                  33. A table has single valued attributes

    (i)    A record of all committed                    A, B, C, D and E, with the following

           transactions.                                functional dependencies

    (ii) A record of all rolled back
                                                           {A     C, B     D, AB      E}
           transactions.
                                                        In terms of normalization, this table
    (iii) A list of all the logged in users.
                                                        is in :
    (iv) A list of all the associated files.
                                                        (A) 1 NF
    (A) (i) and (ii)

                                                        (B) 2 NF
    (B) (i), (ii) and (iii)

    (C) (i), (ii) and (iv)                              (C) 3 NF

    (D) (ii), (iii) and (iv)                            (D) BCNF

                                               11                                     [P.T.O.
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 12 of 32
Page 12 of 32
Text of page 12
JUN - 37219/II—A

                                                   36. Which of the following properties of
34. Database contains the relation
                                                       a transaction are handled by
    Employee (id, name, salary),
                                                       Recovery Manager ?
    which of the following is an incorrect
                                                       (i)   Atomicity
    SQL query ?                                        (ii) Durability

    (A) Select * from Employee where                   (iii) Isolation

        salary > 10000;                                (iv) Consistency

                                                       (A) (i) and (ii)
    (B) Select distinct name from
                                                       (B) (i), (ii) and (iii)
        Employee;
                                                       (C) (i), (ii) and (iv)
    (C) Select * from Employee order by
                                                       (D) (i), (ii), (iii) and (iv)
        salary Desc, name Asce;
                                                   37. A statistical method used to make
    (D) Select * from Employee where                   numerical predictions is ................. .

        name like ‘%Joshi’;                            (A) Regression

                                                       (B) Support vector machine
35. Suppose you own a student table,
                                                       (C) Hidden Markov model
    the correct syntax for giving delete
                                                       (D) Link analysis
    privileges to all users of the database
                                                   38. Which of the following is the
    with one SQL statement is :
                                                       characteristic which is not exhibited
    (A) Grant delete to all on student;                by social network ?

                                                       (A) Heavy tailed distribution
    (B) Grant delete on student to all;
                                                       (B) Densification power law
    (C) Grant delete to public on student;
                                                       (C) Widening diameter
    (D) Grant delete on student to public;             (D) None of the above

                                              12
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 13 of 32
Page 13 of 32
Text of page 13
JUN - 37219/II—A

39. Acronym for Hadoop YARN is                            41. Operating system level firewall

    ........................ .                                provides an advantage over a

                                                              Network level firewall by allowing
    (A) Yet             Another     Repository
                                                              traffic control/filter according
           Navigator
                                                              to .......................
    (B) Yet              Another     Research
                                                              (A) IP Addresses
           Negotiator

    (C) Yet               Another     Register                (B) Port Numbers

           Negotiator                                         (C) Application Layer Protocols

    (D) Yet               Another    Resource                 (D) Application Programs

           Negotiator
                                                          42. Which of the following clouds

40. As per the CAP theorem, distributed                       computing               service     is    most

    database can provide ...................... to            appropriately                 supported      by

    achieve high scalability.                                 virtualization technology ?

    (A) Availability                                          (A) Infrastructure as a service (IaaS)

    (B) Consistency                                           (B) Platform as a service (PaaS)

    (C) Partition tolerance                                   (C) Software as a service (SaaS)

    (D) At least two among (A), (B)                           (D) Communication as a service

           and (C)                                                   (CaaS)

                                                     13                                                [P.T.O.
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 14 of 32
Page 14 of 32
Text of page 14
JUN - 37219/II—A


43. In Windows operating system,                        45.

    terminal services refer to support

    for ......................... .


    (A) Terminating user sessions on a

           system

                                                                    C : Computer System
    (B) Management of display devices
                                                                    T : Dumb Terminal

    (C) Shut down the operating system                        The given diagram most appro-
                                                              priately represents which of the
                                                              following scenario ?
    (D) Multiple              interactive   user
                                                              (A) Centralized system
           sessions on a single system                        (B) Local-access system
                                                              (C) Distributed system
44. Which command is used to manage                           (D) Remote-access system
                                                        46. Which of the following algorithms
    hard disk partitions in a Linux                         may cause starvation ?
                                                              (i)   First-come-first-serve
    system ?
                                                              (ii) Round Robin

    (A) df                                                    (iii) Priority
                                                              (iv) Shortest process next
    (B) fdisk                                                 (v) Shortest remaining time first
                                                              (A) (i), (iii) and (v)
    (C) dd                                                    (B) (iii), (iv) and (v)
                                                              (C) (ii), (iv) and (v)
    (D) iostat
                                                              (D) (ii), (iii) and (iv)
                                                   14
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 15 of 32
Page 15 of 32
Text of page 15
JUN - 37219/II—A
                                                48. Three processes A, B and C each
47. Suppose that the number of
                                                    executes a loop of 100 iterations. In
   instructions executed between page               each iteration of the loop, a process
                                                    performs a single computation that
   fault is directly proportional to the            requires tc CPU miliseconds and the
                                                    initiates single I/O operation that
   number of page frames allocated to               requires t io miliseconds. It is
                                                    assumed that the computer where
   a program. If the available memory
                                                    the processes execute has sufficient
   is doubled, the mean interval                    number of I/O devices and the OS
                                                    of the computer assigns different
   between page faults is also doubled.             I/O devices to each process. Also, the
                                                    scheduling overhead of the OS is
   Further, consider that a normal
                                                    negligible. The processes have the
   instruction takes one microsecond,               following characteristics :
                                                     Process id        tc         tio
   but if a page fault occurs, it takes
                                                          A        100 ms       500 ms
   2001 microseconds. If a program                        B        350 ms       500 ms

   takes 60 sec. to run, during which                     C        200 ms       500 ms
                                                     The processes A, B and C are started
   time it gets 15,000 page faults, how
                                                     at times 0, 5 and 10 miliseconds
   long would it take to run if twice as             respectively, in a pure time thrashing
                                                     system (round robin scheduling) that
   much memory were available ?                      uses a time slice of 50 miliseconds.
                                                     The time in miliseconds at which
   (A) 60 sec.                                       process C would complete its first
                                                     I/O operation is :
   (B) 30 sec.                                       (A) 700 ms
                                                     (B) 900 ms
   (C) 45 sec.
                                                     (C) 800 ms
   (D) 10 sec.                                       (D) 1000 ms

                                           15                                      [P.T.O.
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 16 of 32
Page 16 of 32
Text of page 16
JUN - 37219/II—A

49. A 4-way set-associative cache                 51. What are the three framework
    memory unit with a capacity of 16
                                                      activities for the Adaptive Software
    kB is built using a block size of 8
    words. The word length is 32 bits.                Development (ASD) process model ?
    The size of the physical address
                                                      (A) Analysis, design, coding
    space is 4 GB. The number of bits
    in the TAG field is :                             (B) Feasibility study, functional
    (A) 5
                                                          model iteration, implementation
    (B) 15
                                                      (C) Speculation, collaboration,
    (C) 20
                                                          learning
    (D) 25

50. Consider a disk queue with request                (D) Requirements gathering, adap-
    for input/output to block on cylinders
                                                          tive cycle planning, iterative
    98, 183, 37, 122, 14, 124, 65 and 67
    in that order. Assume that the disk                   development

    head is initially positioned at
                                                  52. In software development process,
    cylinder 53 and moving towards
    cylinder O. The total number of head              which of the following is not an Agile

    movements using Shortest Seek                     methodology ?
    Time First (SSTF) and SCAN
    algorithms are respectively :                     (A) XP

    (A) 236 and 252 cylinders                         (B) SCRUM
    (B) 640 and 236 cylinders
                                                      (C) Waterfall
    (C) 235 and 640 cylinders

    (D) 236 and 236 cylinders                         (D) Feature Driven Development

                                             16
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 17 of 32
Page 17 of 32
Text of page 17
JUN - 37219/II—A

53. Which of the following may not be               55. Which amongst the following are
    preferred as a tool to specify                      subcharacteristics of Reliability in
    requirements during requirement
                                                        ISO-9126 quality model ?
    gathering stage of a software
    development project ?                               (i)   Maturity

    (A) Use case diagram                                (ii) Recoverability
    (B) Sequence diagram
                                                        (iii) Suitability
    (C) Finite-state machine
                                                        (iv) Fault Tolerance
    (D) Class diagram
                                                        (A) (i), (ii) and (iii)
54. Which of the following is not a
    design principle for class based                    (B) (i), (ii) and (iv)
    component in modeling component
    level design ?                                      (C) (i), (iii) and (iv)

    (i)   A module should be open for                   (D) (i), (ii), (iii) and (iv)
          extension       but   closed   for
                                                    56. Testing       a    software         for   the
          modification.
                                                        performance towards extreme or
    (ii) One General purpose interface
                                                        abnormal resource utilization as
          is always better than many
          client-specific interfaces.                   against normal requirements is

    (iii) Classes that change together                  known as ...................... .
          belong together
                                                        (A) Stress testing
    (A) (iii) only
                                                        (B) Recovery testing
    (B) (ii) only
                                                        (C) Performance testing
    (C) (i) only

    (D) (i) and (iii) only                              (D) Security testing

                                               17                                             [P.T.O.
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 18 of 32
Page 18 of 32
Text of page 18
JUN - 37219/II—A

57. Which of the following is a structure        59. The CMM maturity levels measure

    which does not belong to classes of              the :

    loops considered for loop testing ?              (A) Quality of product


    (A) Simple loop                                  (B) Quantity of modules

                                                     (C) Capabilities of processes
    (B) Nested loop

                                                     (D) Process maturity
    (C) Concatenated loop
                                                 60. Select the components from the
    (D) Structured loop
                                                     following which contributes in the
58. The formula for estimating the                   building of software configuration

    development effort and development               management (SCM) :

    time of an embedded product is :                 (i)   Software configuration identifi-

    (A) Effort = 2.4 (KLOC)1.05 PM,                        cation (SCI)

         Tdev = 2.5(Effort)0.38 Months               (ii) Change control

    (B) Effort = 3.0 (KLOC)1.12 PM,                  (iii) Configuration status accounting

         Tdev = 2.5(Effort)0.35 Months               (iv) Configuration audit

    (C) Effort = 3.6 (KLOC)1.20 PM,                  (A) (ii) and (iv)

         Tdev = 2.5(Effort)0.32 Months               (B) (i), (ii), (iii) and (iv)

    (D) Effort = 2.4 (KLOC)1.05 PM,                  (C) (i), (ii) and (iii)

         Tdev = 2.5(Effort)0.35 Months               (D) (i), (iii) and (iv)

                                            18
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 19 of 32
Page 19 of 32
Text of page 19
JUN - 37219/II—A


61. Which of the following applications        63. What is the value of the postfix

                                                   expression :
    may use a stack ?
                                                            6 3 2 4 + – *
    (A) A   parentheses     balancing
                                                   (A) 28

        program
                                                   (B) 24

    (B) Tracking of local variables at             (C) 30


        run time                                   (D) 18

                                               64. A technique for direct search is :
    (C) Compiler syntax analyzer
                                                   (A) Linear search
    (D) All of the mentioned
                                                   (B) Binary search

62. Which of the following concepts
                                                   (C) Hashing

    make extensive use of arrays ?                 (D) Tree search


    (A) Binary trees                           65. Identify the odd one :

                                                   (A) Priority queue
    (B) Scheduling of processes
                                                   (B) Circular queue
    (C) Caching
                                                   (C) Deque

    (D) Spatial locality                           (D) Tower of Hanoi

                                          19                                   [P.T.O.
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 20 of 32
Page 20 of 32
Text of page 20
JUN - 37219/II—A

                                                 68. The discovery and finish time for the
66. In-order traversal of a binary search
                                                     vertex 5 in depth first traversal for

    tree gives the output in :                       the following graph is :


    (A) Non-increasing order



    (B) Unsorted



    (C) Non-decreasing order

                                                     (A) 3, 5
    (D) Decreasing order
                                                     (B) 4, 5

67. The correct ordering of the growth
                                                     (C) 2, 6

    rates 3n, n3, 33, log3 n is :                    (D) 1, 3

                                                 69. Which amongst the following is not
    (A) log3   n, n3, 33, 3n
                                                     an NP problem ?

    (B) log3 n, 33, n3, 3n                           (A) Satisfiability problem

                                                     (B) Sorting problem
    (C) 33, log3 n, 3n, n3
                                                     (C) Clique decision problem

    (D) 33, log3 n, n3, 3n
                                                     (D) Node cover problem

                                            20
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 21 of 32
Page 21 of 32
Text of page 21
JUN - 37219/II—A

70. Working modulo q = 11, how many
                                              72. Which of the following are types of

    spurious hits does the Rabin Karp
                                                  optimizations that operate on loops
    matcher encounter in the text

                                                  and instruction scheduling ?
    T = 459263781 when working for the

    pattern        = 37 :
                                                  (i)   Constant Folding

    (A) 2
                                                  (ii) Code Hoisting

    (B) 3

                                                  (iii) Shrink Wrapping
    (C) 4


    (D) 5                                         (iv) Branch     and     Basic   Block


71. Type checking is normally done                      Scheduling


    during ....................... .
                                                  (A) (i), (ii) and (iv) only

    (A) Lexical Analysis
                                                  (B) (i) and (iv) only
    (B) Code Generation

                                                  (C) (ii) and (iii) only
    (C) Syntax Analysis


    (D) Syntax Directed Translation               (D) (ii), (iii) and (iv) only

                                         21                                       [P.T.O.
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 22 of 32
Page 22 of 32
Text of page 22
JUN - 37219/II—A

73. Consider an array A of n elements           74. Which of the following are correct

    of integer type for assignment                  statements in context of compiler ?

    statement                                       (i)   A grammar is Left Recursive if

            Value = A[i]                                  we can find some non-terminal
                                                          ‘A’ which will eventually derive
    Which of the following is three
                                                          a sentential form with itself as
    address code representation for
                                                          a left symbol.
    address computation and value
                                                    (ii) Syntax analyzer groups the
    assignment above ?
                                                          tokens produced by the scanner
    (A) Temp1 = i * sizeof (integer)                      into syntactic structures by

        Temp2 = &A + Temp1                                parsing the expressions and
                                                          statements.
        Value = *(Temp2)
                                                    (iii) A control flow statement is an
    (B) Temp1 = i * sizeof (integer)
                                                          instruction when executed can
        Temp2 = &A + Temp2                                cause a change in the subsequent

        *(Temp2) = value                                  control flow to differ from the
                                                          natural sequential order in
    (C) Temp1 = &A * sizeof (integer)
                                                          which the instructions are
        Temp2 = Temp1 + i                                 listed.

        Value = *(Temp2)                            (A) (i) and (ii) only

    (D) Temp1 = &A * i                              (B) (ii) and (iii) only

        Temp2 = Temp1 + sizeof (integer)            (C) (i), (ii) and (iii) only

        Value = *(Temp2)                            (D) (i) and (iii) only

                                           22
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 23 of 32
Page 23 of 32
Text of page 23
JUN - 37219/II—A

75. Depending on a programming                          77. Which among the following is/are
                                                            correct statement(s) ?
    language which of the following a
                                                            (i)   If there is a TM (or algorithm)
    type checker may prevent ?
                                                                  which when applied to any
    (i)   Use of undeclared variables in                          problem in the class, always

          expressions.                                            eventually terminates with the
                                                                  correct YES/NO answer, then
    (ii) Functions that do not return                             we call the problem solvable.
          value.                                            (ii) If there is a TM (or algorithm)
                                                                  which when applied to any
    (iii) Variables are declared before
                                                                  problem in the class, always
          they are used.
                                                                  eventually terminates with the

    (A) (i) and (ii) only                                         correct answer when the answer
                                                                  is YES and with incorrect
    (B) (ii) and (iii) only                                       answer when answer is NO,
                                                                  then we call the problem as
    (C) (i) and (iii) only
                                                                  unstable.
    (D) (i), (ii) and (iii) only
                                                            (iii) If there is a TM (or algorithm)

76. LR parsers read their input from                              which when applied to any
                                                                  problem in the class, always,
    ............. to ............. and produce a
                                                                  eventually terminates with the
    .............. derivation.                                    correct YES as an answer then
                                                                  we call the problem unsolvable.
    (A) Left, Right, Rightmost
                                                            (A) (i) only
    (B) Right, Left, Leftmost
                                                            (B) (ii) only
    (C) Left, Right, Leftmost
                                                            (C) (iii) only
    (D) Right, Left, Rightmost                              (D) (i) and (iii) only

                                                   23                                     [P.T.O.
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 24 of 32
Page 24 of 32
Text of page 24
JUN - 37219/II—A

78. Consider the TM described below for         79. For which context free languages
                                                    below,    we      can    construct   an
    computing 2’s complement using a
                                                    equivalent PDA with one (1) stack :
    transition diagram. In this diagram
                                                    (i)   L = {anbncn/n           1}
    few of the transition input entries
                                                    (ii) L = {anbn/n         1}
    are missing and are denoted by I,

    II and III.                                     (iii) L = {anb2n/n        1}

                                                    (A) (i) and (ii) only

                                                    (B) (ii) and (iii) only

                                                    (C) (i) and (iii) only

                                                    (D) (i), (ii) and (iii) only

                                                80. Which of the following languages
    Here L represents left, R represents
                                                    are regular :
    right and N represents Accept (No
                                                    (i)   L = {an/n is a perfect square}
    movement)
                                                    (ii) L = {an/n is even}
    Which of the following is exact

    replacement for I, II and III above             (iii) L = {an/n     0}

    in the order.                                   (iv) L = {an       bn/n        0}

    (A) (0, 1, N), (B, 1, N), (1, 0, L)             (A) (i) and (iii) only

    (B) (0, 0, N), (B, 1, N), (1, 0, R)             (B) (ii) and (iv) only

    (C) (1, 0, N), (B, 0, N), (0, 1, R)             (C) (iii) and (iv) only

    (D) (1, 1, N), (B, 0, N), (0, 1, L)             (D) (ii) and (iii) only

                                           24
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 25 of 32
Page 25 of 32
Text of page 25
JUN - 37219/II—A

                                                     83. According to the IEEE project
81. In the infrastructure as a service (IaaS)
                                                         802.11, there are two types of
     cloud implementation, ‘‘Provisioning’’              wireless LANs. In an infrastructure-

                                                         based network, what is a BSA (Base
     component is responsible for :
                                                         Service Area) ?

     (A) Storing VM images                               (A) A BSA is a wireless station

                                                         (B) A BSA is a gateway which
     (B) Hiring third party IaaS cloud
                                                              connects a wireless station to a

     (C) VM image repository                                  network

                                                         (C) A BSA is simply a cell
     (D) Reservation of VM’s service
                                                         (D) A BSA is another word for

82. Which DNS resource record is used                         server

                                                     84. While designing cloud API using the
     to reverse map IP addresses to
                                                         ‘‘Richardson Maturity Model’’ on
     names ?                                             level ‘‘1’’, it uses :

                                                         (A) Individual       URI   for    each
     (A) ATR
                                                              resource

     (B) MXC                                             (B) Right HTTP method with

                                                              status code
     (C) SRV
                                                         (C) HATEOAS

     (D) PTR                                             (D) All (A), (B) and (C)

                                                25                                        [P.T.O.
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 26 of 32
Page 26 of 32
Text of page 26
JUN - 37219/II—A

85. A telephone line normally has a              87. Calculate the HLEN (Header

    bandwidth of 3000 Hz assigned for
                                                     Length) value in IPv4, if the total
    data communications. The signal-to-
                                                     length is 1200 bytes, 1176 of which
    noise ratio is usually 3162. Then the
                                                     is data from the upper layer :
    channel capacity for this channel

    is :                                             (A) 4

    (A) 34,860 bps
                                                     (B) 6

    (B) 6,262 bps
                                                     (C) 12
    (C) 11.62 bps
                                                     (D) 16
    (D) 3,854 bps

                                                 88. In RSA given two prime numbers
86. Which of the following CRC

    generator guarantee the detection of             p = 19 and q = 23, find n and     ?

    a single bit errors ?
                                                     (A) n = 437,    = 396

    (A) X4 + X2
                                                     (B) n = 381,    = 231
    (B) 1

                                                     (C) n = 38,    = 52
    (C) X3 + X


    (D) X2 + 1                                       (D) n = 19,    = 23

                                            26
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 27 of 32
Page 27 of 32
Text of page 27
JUN - 37219/II—A
                                                 91. The task environment in case of part-
89. Encrypt       ‘‘INTERNET’’      using
                                                     picking robot is :
   transposition cipher with the                     (A) Full observable, Deterministic
   following key :                                       and Episodic
                                                     (B) Partially observable, Stochastic
         3    5     2    1     4                         and Sequential
                                                     (C) Fully observable, Deterministic
         1    2     3    4     5                         and Sequential
                                                     (D) Partially observable, Stochastic
   (A) RINTE ZZNET
                                                         and Episodic
   (B) ZZNET INTER                               92. Match the knowledge representation
                                                     schema in Group-1 used to describe
   (C) ETRNI NZETZ                                   situation in Group-2 :
                                                                Group-1
   (D) TRNIE TZENZ                                   (P) Frames
90. Which provision can resolve/                     (Q) Scripts
                                                     (R) Stereotypes
   overcome        the       shortcomings
                                                     (S) Rule models
   associated with duplication or failure
                                                                Group-2
   condition of Stop-and-Wait Automatic              (i)   Common sequence of events
   Repeat Request protocol especially                (ii) Cluster of characteristics often
                                                          found together
   due to loss of data frames or non-
                                                     (iii) Common features              shared
   reception of acknowledgement ?                          among a set of laws
                                                     (iv) Collection of attributes that
   (A) Provision of sequence number                       given objects normally possess
       in the header of message                      (A) (P)    (ii), (Q)    (i), (R)     (iv),
                                                         (S)    (iii)
   (B) Provision         of     checksum
                                                     (B) (P)    (iv), (Q)    (i), (R)     (iii),
       computation                                       (S)     (ii)
                                                     (C) (P)    (iii), (Q)   (ii), (R)      (i),
   (C) Both (A) and (B)                                  (S)     (iv)
                                                     (D) (P)    (iii), (Q)   (iv), (R)      (i),
   (D) None of the above                                 (S)     (ii)
                                            27                                          [P.T.O.
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 28 of 32
Page 28 of 32
Text of page 28
JUN - 37219/II—A

93. Which of the following is not a
                                               95. Which of the following is not true
    property of planning graph ?

    (A) Literals increase monotonically            for    Internet   Book     Shopping

    (B) Actions decrease monotonically
                                                   Agent ?
    (C) Mutexes decrease monotonically

    (D) Eventually the graph levels off            (A) Its interface for user requests


94. Which visual clues amongst the
                                                         acts as sensors
    following are helpful in computer

    visions ?                                      (B) Its ability to follow links acts as

    (i)   Color
                                                         actuators
    (ii) Motion

    (iii) Depth                                    (C) Its environment as Internet is

    (iv) Texture
                                                         fully observable and sequential
    (v) Height

    (A) (i), (ii), (iii) and (iv)                  (D) Its performance is based on

    (B) (ii), (iii), (iv) and (v)
                                                         obtaining requested books in
    (C) (i), (iii), (iv) and (v)

                                                         minimum cost and time
    (D) (ii), (iii), (iv) and (i)

                                          28
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 29 of 32
Page 29 of 32
Text of page 29
JUN - 37219/II—A


96. The defining length and order of the
                                                98. The      centroid             method       of

    schema 1***********1 is :


                                                   defuzzification can be represented
    (A)   (H) = 13, O(H) = 02



    (B)   (H) = 10, O(H) = 13
                                                   by     the       following           algebraic


    (C)   (H) = 12, O(H) = 2

                                                   expression :
    (D)   (H) = 12, O(H) = 13



97. The axiom of excluded middle is                (A)    c ( z*)     c ( z)      z Z


    represented as :

                                                                    c ( z).z dz
                                                   (B) z*
    (A) A     A = X                                                  c ( z) dz



    (B) A     A = X                                                  c ( z ). z
                                                   (C) z*
                                                                       c (z)

    (C) A      A = X

                                                                a b
                                                   (D) z*
    (D) A      A = X                                             2


                                           29                                              [P.T.O.
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 30 of 32
Page 30 of 32
Text of page 30
JUN - 37219/II—A

99. The following table shows attributes
                                                      100. In a simple MLP model with 8
    of biological and artificial neurons

    respectively. Match the following
                                                         neurons in the input layer, 5
    according to the functions performed

    by their counterpart :
                                                         neurons in the hidden layer and 1
                   List I

    (i)   Cell/soma                                      neuron in the output layer. What is

    (ii) Synapse
                                                         the size of the weight matrices
    (iii) Dendrites

    (iv) Axon                                            between hidden-output layer and

                  List II
                                                         input-hidden layer ?
    (a) Neuron/Node

    (b) Weights
                                                         (A) [1 × 5], [5 × 8]
    (c) Net input

    (d) Output
                                                         (B) [8 × 5], [1 × 5]
    (A) (i)-(a), (ii)-(b), (iii)-(c), (iv)-(d)

    (B) (i)-(b), (ii)-(c), (iii)-(d), (iv)-(a)           (C) [8 × 5], [5 × 1]

    (C) (i)-(c), (ii)-(d), (iii)-(a), (iv)-(b)

    (D) (i)-(d), (ii)-(a), (iii)-(b), (iv)-(c)           (D) [5 × 1], [8 × 5]

                                                 30
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 31 of 32
Page 31 of 32
Text of page 31
JUN - 37219/II—A

ROUGH WORK




    31                 [P.T.O.
MH SET 2019 question paper, 23 June 2019, Paper II, Computer Science and Applications, page 32 of 32
Page 32 of 32
Text of page 32
JUN - 37219/II—A

ROUGH WORK




    32
Page 1 of 32

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