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

MH SET 2020: 27 December, Paper II, Computer Science and Applications

  • Date: 27 December 2020
  • Paper code: JUN37220
  • Series: A
  • Language: Bilingual
  • 28 pages
MH SET 2020 question paper, 27 December 2020, 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.
JUN - 37220                                                                                          (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 2020 question paper, 27 December 2020, Paper II, Computer Science and Applications, page 2 of 28
Page 2 of 28
Text of page 2
JUN - 37220/II—A




2
MH SET 2020 question paper, 27 December 2020, Paper II, Computer Science and Applications, page 3 of 28
Page 3 of 28
Text of page 3
JUN - 37220/II—A
                 Computer Science and Applications
                                            Paper II
Time Allowed : 120 Minutes]                                            [Maximum Marks : 200
Note : This Paper contains One 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. How many distinct words
                                                              can be used for communication using
                                                              these code set ?

                                                              (A) 32

                                                              (B) 16
     V = {A, B, C, D, E, F, G, H, I}
                                                              (C) 8
     E = {e1 = (A, B), e2 = (A, C), e3 = (A, D),
     e4 = (B, C), e5 = (B, F), e6 = (B, H),                   (D) 4
     e7 = (C, D), e8 = (C, E), e9 = (C, F),
     e10 = (D, E), e11 = (D, I), e12 = (E, F),           3.   The number of errors can be
     e13 = (E, G), e14 = (F, G), e15 = (F, H),
                                                              corrected using the code words of
     e16 = (G, H), e17 = (G, I), e18 = (H, I)}
     W = {22, 9, 12, 35, 36, 34, 4, 33, 30,                   group code with the generator :
         18, 23, 24, 39, 25, 21, 19}
     ....................... is a Eulerian path in                          1 1 0
                                                                       G=
     the above graph.                                                       0 1 1
     (A) e1, e6, e15, e9, e7, e10, e13, e17
     (B) e2, e7, e11, e17, e13, e8, e9, e14,                  (A) 3
         e16, e6
                                                              (B) 2
     (C) e3, e11, e17, e13, e8, e9, e14, e16,
         e6, e4                                               (C) 1
     (D) e10, e12, e14, e16, e18, e11, e3,
                                                              (D) 0
         e1, e4
                                                     3                                     [P.T.O.
MH SET 2020 question paper, 27 December 2020, Paper II, Computer Science and Applications, page 4 of 28
Page 4 of 28
Text of page 4
JUN - 37220/II—A
                                                     7.   Consider the following Linear
4.   Let f be a Boolean expression in                     Programming Problem :
     8 variables which has true value                     A company produces two types of hats
     exactly for 4 combinations out of 28                 say A and B. Each type A hat requires
                                                          twice as much labour as type B. If all
     possible combinations. Then f can be                 the hats are of type B only, the
     expressed as sum of .......... min                   company can produce 500 hats a day.
                                                          The market limits the sale of type A and
     terms.                                               type B hats to 150 and 250 respectively.
     (A) 10                                               If the profit earned on type A hat is ` 8
     (B) 8                                                and type B hat is ` 5, how many hats of
                                                          each type should be produced so as to
     (C) 6                                                maximize the profit ?
     (D) 4                                                The primal and dual of this problem is :
5.   A person with list of n items, collects              (A) Maximize : Z = 8x1 + 5x2
     1st item one (unit) time, 2nd item                        Subject to : 2x1 + x2        500
     two (2 units) times, 3rd item three                                             x1    150
                                                                   x2     250,    x1, x2     0
     (3 units) times, ........ rth items r
                                                               Dual : Minimize :
     times (r units) ....... to his cart while
                                                               Z = 500y1 + 150y2 + 250y3
     going around the mart ......... number
                                                               Subject to : 2y1 + y2 < 8
     of units will be in his cart by the                           y1 + y3 < 5, y1, y2 > 0
     time he reaches to billing counter,                  (B) Maximize : Z = 8x1 + 5x2
     if he has list of 6(n = 6) items for                      Subject to : 2x1 + x2        500
     that day procurement.                                                     x1    150
     (A) 6                                                         x2     250,    x1, x2     0
     (B) 14                                                    Dual : Minimize :
     (C) 21                                                    Z = 500y1 + 150y2 + 250y3
                                                               Subject to : 2y1 + y2 > 8
     (D) 42
                                                                   y1 + y3 > 5,       y1, y2 > 0
6.   Notation :                                           (C) Maximize : Z = 8x1 + 5x2
     C(n, r) = n!/(r!*(n – r)!))                               Subject to : 2x1 + x2        500
     n! is factorial n.                                                        x1    150
     |A| cardinality of set A                                      x2     250,    x1, x2     0
      s is negation of s                                       Dual : Minimize : Z = 8y1 + 5y2
     The number of equivalence relations                       Subject to : 2y1 + y2 > 500
     of order n that can be defined over                           y1 > 150
                                                                   y2 > 250,      y1, y2 > 0
     A of size r = |A| (r > n), is ..........
                                                          (D) Primal and dual are the same
     (A) C(r – 1, n – 1)                                       Maximize : Z = 8x1 + 5x2
     (B) C(n + r – 1, n – 1)                                   Subject to : 2x1 + x2        500
     (C) C(n + r – 1, r – 1)                                                   x1    150
     (D) C(n – 1, r – 1)                                           x2     250,    x1, x2     0
                                                 4
MH SET 2020 question paper, 27 December 2020, Paper II, Computer Science and Applications, page 5 of 28
Page 5 of 28
Text of page 5
JUN - 37220/II—A

8.   The optimal solution of the linear            10. The Hungarian method for the

     programming problem is located :                 assignment problem is based on the
     (A) in the interior of the feasible              fact that :
          region
                                                      (A) The optimal assignment is not
     (B) at the center of the feasible
                                                          affected if a constant is
          region
                                                          subtracted from any row or
     (C) at one of the corners of the
                                                          column
          feasible region

     (D) on the surface of the feasible               (B) The value of the objective

          region                                          function is not affected by
9.   Consider the following trans-                        adding     or    subtracting    a
     portation problem :                                  constant from any row or
                       Destinations
                                                          column
               D1       D2   D3   D4
          S1       6     4    1       5   14          (C) The optimal assignment is not

Sources   S2       8     9    2       7   16              affected        by   adding    or
          S3       4     3    6       2   5
                                                          subtracting a constant from any
                   6    10   15       4
                                                          row or column
     The initial transportation cost by
     Vogel’s method is :                              (D) The optimal assignment is not

     (A) 128                                              affected if each entry in the cost

     (B) 152                                              matrix is treated separately to

     (C) 124                                              obtain sufficient number of
     (D) 114                                              zeros

                                               5                                    [P.T.O.
MH SET 2020 question paper, 27 December 2020, Paper II, Computer Science and Applications, page 6 of 28
Page 6 of 28
Text of page 6
JUN - 37220/II—A

11. For even number of 1’s at the input           14. The minimum time required for
    or inputs having all 0’s, the output              memory device to put valid data on
    of EX-NOR gate is :                               the data bus after CS goes low is
    (A) Not defined                                   called :
    (B) High
                                                      (A) tACS : Chip select access time
    (C) Low
                                                      (B) tHZ : Chip deselection to output
    (D) None of the above
                                                                 in tri-state
12. Binary cyclic code :
                                                      (C) tLZ : Chip selection to output in
    (i)   Detects all single errors.
                                                                 tri-state
    (ii) Detects all odd number of error
                                                      (D) tAA : Address access time
          bits.

    (iii) Detects all burst errors of 16 or       15. Determine the status of the condition

          fewer bits.                                 flags if the operation performed

    (A) Only (i)                                      on A and B is A           B where
                                                      A = 01100010 and B = 01000101 :
    (B) Only (ii)

    (C) (ii) and (iii)                                (A) N = 1, V = 1, C = 0 and
                                                           Z = 0
    (D) (i), (ii) and (iii)

13. Using 16’s complement method of                   (B) N = 0, V = 0, C = 0 and

    subtraction compute CB2H – 972H :                      Z = 1

    (A) 68DH                                          (C) N = 1, V = 1, C = 1 and

    (B) 1340H                                              Z = 1

    (C) 340 H                                         (D) N = 0, V = 0, C = 0 and

    (D) CB2 H                                              Z = 0

                                              6
MH SET 2020 question paper, 27 December 2020, Paper II, Computer Science and Applications, page 7 of 28
Page 7 of 28
Text of page 7
JUN - 37220/II—A

16. If a byte is used as a storage unit,       19. Assume that an instruction pipeline
    number 5 and character 5 in                    has 5 stages without any branch
    assembly language are stored as :
                                                   prediction. Fetch Instruction (FI),
    (A) 00000101B and 00110101B                    Decode Instruction (DI), Fetch
    (B) 01110101C and 00110101B                    Operand (FO), Execute Instruction

    (C) 00000011B and 00000101B                    (EI) and Write Operand (WO) with

    (D) None of the above                          state delays as 6, 8, 6, 5 and 4 ns

17. Which one of the following is not a            respectively.

    most common use of displacement
                                                   Consider a program with 15
    addressing ?
                                                   instructions (I1 .... I15) where only
    (A) Relative addressing
                                                   I7 is a branch instruction and I12
    (B) Base-register addressing

    (C) Indexing                                   is the target instruction.

    (D) Register-indirect addressing               If the branch is taken during

                                                   execution of the program then what
18. One of the following cannot be
                                                   is the time needed to complete the
    classified as an Interrupt :
                                                   program ?
    (A) Priority
                                                   (A) 210ns

    (B) Daisy chaining
                                                   (B) 216ns

    (C) Non-maskable                               (C) 25ns

    (D) Memory                                     (D) 144ns

                                           7                                    [P.T.O.
MH SET 2020 question paper, 27 December 2020, Paper II, Computer Science and Applications, page 8 of 28
Page 8 of 28
Text of page 8
JUN - 37220/II—A
                                                       22. Consider the following segment of ‘C’
20. Which protocol is responsible for
                                                           programming code, upon execution
    distributing the responsibility for                    it will produce output as :
                                                           int main( )
    maintaining cache coherence among
                                                           {
    all the cache controllers in a                            auto int i=1;
                                                              { auto int i=2;
    multiprocessor system ?
                                                                  { auto int i=3;
    (A) Snoopy protocol                                                  { printf("\n%d", i);
                                                                     }
    (B) Directory protocol                                           print f("%d", i);
                                                                     }
    (C) Write-back protocol                                          printf("d%", i);
                                                                  }
    (D) Write-through protocol                                }
                                                           (A) 3 2 1
21. Objects       life        time     generally
                                                           (B) 3 3 2
    corresponds          to    which    storage            (C) 3 3 1
                                                           (D) 3 1 2
    allocation mechanism from the
                                                       23. Consider the following ‘C’ program
    following :                                            fragment :
                                                           int main( )
    (i)   Static objects                                   {
                                                                char *a, *b, c[10], d[10];
    (ii) Stack objects                                          a=b;
                                                                b=c;
    (iii) Heap objects
                                                                c=d;
    (iv) Serialised objects                                     d=a;
                                                           return ;
    (A) (i), (ii) and (iv)                                 }
                                                           Choose the statement having error
    (B) (i), (ii) and (iii)                                from the following :
                                                           (A) b=c; and c=d;
    (C) (i), (iii) and (iv)                                (B) a=b; and b=c;
                                                           (C) c=d; and d=a;
    (D) (ii) and (iii)                                     (D) a=b; and d=a;
                                                   8
MH SET 2020 question paper, 27 December 2020, Paper II, Computer Science and Applications, page 9 of 28
Page 9 of 28
Text of page 9
JUN - 37220/II—A

24. In object oriented programming, an           26. Which of the following properties
    abstraction that holds a collection of           makes user defined class good ?
    objects of some given class is
                                                     (i)   Something that has a small and
    called :
                                                           well defined set of operations.
    (i) Package list
    (ii) Container or collection                     (ii) Something that can be seen as
    (iii) Library                                         a ‘‘Black Box’’ manipulated
    (iv) Directory list                                   exclusively through that set of
    (A) (i) and (iii)                                     operations.
    (B) (ii) only                                    (iii) Something whose actual
    (C) (i) and (iv)                                       representation           could
    (D) (ii) and (iii)                                     conceivable be modified without
25. Function declaration gives the name                    affecting the way that set of
    of the function. Which of the                          operation is used.
    following statements are relevant for
                                                     (iv) Something one might want
    function :
                                                          more than one of.
    (i) The semantics of argument
          passing are identical to                   (A) (ii) and (iii)
          semantics of initialisation.               (B) (i), (ii), (iii) and (iv)
    (ii) The argument types are
          checked and implicit argument              (C) (i) and (ii)
          type conversion takes place                (D) (iv) only
          when necessary.
                                                 27. Which action has the ability to
    (iii) The argument types are
                                                     match the request parameter to
          unchecked       and    explicit
                                                     properties of some name in java
          argument type conversion takes
                                                     bean be specifying ‘*’ for attribute
          place when necessary.
                                                     property ?
    (iv) A function declaration may
          contain argument names                     (A) < jsp : include >
    (A) (i) and (ii)                                 (B) < jsp : set Property >
    (B) (i), (ii) and (iv)
                                                     (C) < jsp : use Bean >
    (C) (i), (ii) and (iii)
    (D) (ii) and (iv)                                (D) < jsp : param >

                                             9                                       [P.T.O.
MH SET 2020 question paper, 27 December 2020, Paper II, Computer Science and Applications, page 10 of 28
Page 10 of 28
Text of page 10
JUN - 37220/II—A

28. Which of the following points lies            31. Which of the following is not one of
    over the line when Bresenham’s line               the Codd’s rules ?
    drawing algorithm is used to draw                 (A) Everything in database must be
                                                            stored in a table format.
    the line between the points (4, 6) and
    (15, 12) ?                                        (B) Null values in database must be
                                                            given a systematic and uniform
     (A) (5, 6)                                             treatment.
     (B) (7, 7)                                       (C) The structure definition stored
                                                            in data dictionary should be
     (C) (11, 9)                                            accessible to all users
     (D) (13, 11)                                     (D) Database        must      support
                                                            insertion, updation and deletion
29. Minimum and maximum window                              of a single row as also a set of
    and viewport coordinates are (2, 4),                    records
    (18, 30) and (8, 8), (16, 20)                 32. Which of the following statements
    respectively. The scaling factors                 are true ?
    along x and y axes are :                          (i) Logical independence is the
                                                            capacity to change the
     (A) 0.5 and 0.66
                                                            conceptual schema without
     (B) 0.25 and 0.5                                       having to change external
                                                            schema.
     (C) 0.4 and 0.55
                                                      (ii) Logical independence is the
     (D) 2 and 1.5                                          capacity to change the
                                                            conceptual schema without
30. From modeling coordinates to device                     having to change internal
    coordinates in general 3D                               schema.
    transformation pipeline, identify the             (iii) Physical independence is the
    correct order of other coordinates                      capacity to change the internal
    involved :                                              schema without having to
                                                            change conceptual schema.
     (i)   Viewing coordinates
                                                      (iv) Physical independence is the
     (ii) Projection coordinates                            capacity to change the
                                                            conceptual schema without
     (iii) World coordinates
                                                            having to change external
     (A) (i), (ii) and (iii)                                schema
     (B) (ii), (i) and (iii)                          (A) (i) and (iii)
                                                      (B) (i) and (iv)
     (C) (iii), (i) and (ii)
                                                      (C) (ii) and (iii)
     (D) (ii), (iii) and (i)                          (D) (ii) and (iv)
                                             10
MH SET 2020 question paper, 27 December 2020, Paper II, Computer Science and Applications, page 11 of 28
Page 11 of 28
Text of page 11
JUN - 37220/II—A

33. In a schema with attributes A, B,              35. Which connective is used to test the
    C, D and E, with the following set
                                                       absence of set membership in
    of functional dependencies {A        B,
                                                       SQL ?
    A    C, CD         E, B    D, E     A},
    which of the following functional                  (A) minus
    dependencies are not implied by the
    above set ?                                        (B) not in

    (A) CD        AC                                   (C) intersection
    (B) BD        CD
                                                       (D) or
    (C) BE        AD
                                                   36. Which of the following are the lock
    (D) AB        CD
                                                       modes in multiple granularity
34. Database contains the relation
    course (Id, name, semester, year),                 locking ?

    which of the following is an incorrect
                                                       (i)   S
    SQL query ?
                                                       (ii) X
    (A) Select * from course order by
        year;                                          (iii) SIX
    (B) Select count(semester), semester
                                                       (iv) IX
        from course group by semester;

    (C) Select semester from course                    (v) IS
        group by semester where
                                                       (A) (i) and (ii)
        count (semester) > z;
                                                       (B) (i), (ii) and (iii)
    (D) Select     count       (semester),
        semester from course group by                  (C) (i), (ii), (iv) and (v)
        semester       order    by    count
        (semester);                                    (D) (i), (ii), (iii), (iv) and (v)

                                              11                                            [P.T.O.
MH SET 2020 question paper, 27 December 2020, Paper II, Computer Science and Applications, page 12 of 28
Page 12 of 28
Text of page 12
JUN - 37220/II—A

37. The information gain, one of the             39. Which among the following is correct
    attribute selection measures, used in            sequence of data flow in Apached
    partition of data (D), is expressed              hadoop parallel MapReduce ?
    as
                                                     (A) map, split, reduce, shuffle
    Info (D) = .................
                                                     (B) split, shuffle, map, reduce
    where pi is the probability that an
    arbitrary tuple in D belongs to class            (C) split, map, shuffle, reduce
    ci :
                                                     (D) split, map, reduce, shuffle
            m
                   pi log( pi )                  40. For storing the information about
    (A)
            i 1                                      networks, such as social connections,
           m                                         the stores used are ...............
    (B)          pi log( pi )
           i 1                                       (A) Key-value

               m                                     (B) Graph
    (C)            pi log 2 ( pi )
            i 1                                      (C) Wide-column

           m                                         (D) Document
    (D)          pi log 2 ( pi )
           i 1                                   41. ‘Login-ID and Password’ mechanism
38. Which of the following is a method               is implemented in an operating
    for mining frequent subgraphs ?
                                                     system to ensure which of the
    (i)    Pattern growth approach.
                                                     following aspects of security ?
    (ii) Priori-based approach.
                                                     (A) Confidentiality
    (A) (i) only
                                                     (B) Integrity
    (B) (ii) only
    (C) (i) and (ii)                                 (C) Authentication

    (D) None of the above                            (D) Authorization

                                            12
MH SET 2020 question paper, 27 December 2020, Paper II, Computer Science and Applications, page 13 of 28
Page 13 of 28
Text of page 13
JUN - 37220/II—A
                                                43. What is the most appropriate
                                                    purpose of ‘kill’ command in
42.
                                                    Linux ?
                                                     (A) Kill a running process
                                                     (B) Send a signal to a process
                                                     (C) Abort a user login
                                                     (D) Shutdown the operating system
                                                44. Windows operating system follows
                                                    ............... and Linux operating
                                                    system follows ............. type of kernel
                                                    architecture.
                                                     Select most appropriate option from
                                                     the following :
                                                     (A) Monolithic, Micro
      The given diagram represents which
                                                     (B) Hybrid, Monolithic
      of the following scenario ?
                                                     (C) Micro, Monolithic

      (A) Type 1 Hypervisor or virtual               (D) Micro, Micro
                                                45. Which of the following scenario most
          machine monitor
                                                    appropriately depicts the primary
                                                    use of a distributed file system ?
      (B) Type 2 Hypervisor or virtual
                                                     (A) Store data and its backup on
          machine monitor                                multiple computer systems
                                                     (B) Access data stored on remote
      (C) Type 3 Hypervisor or virtual
                                                         computer systems
          machine monitor                            (C) Store parts of related data on
                                                         different computer systems
      (D) Type 4 Hypervisor or virtual
                                                     (D) Allow multiple file systems on
          machine monitor                                one computer system

                                           13                                          [P.T.O.
MH SET 2020 question paper, 27 December 2020, Paper II, Computer Science and Applications, page 14 of 28
Page 14 of 28
Text of page 14
JUN - 37220/II—A

46. Consider a system with 12 magnetic          48. A hierarchical memory system that
    tape drives and three processes P 1,            uses cache memory has cache access
    P 2 and P 3. Process P 1 requires               time of 50 nano seconds, main
    maximum 10 tape drives, P2 may                  memory access time of 300 nano
    need 4 tape drives and P3 may need              seconds, 75% of memory requests are
    upto 9 tape drives. Suppose at time             for read, hit ratio of 0.8 for read
    t1, process P1 is holding 5 tape                access and the write-through scheme
    drives, process P2 is holding 2 tape            is used. What will be the average
    drives and process P3 is holding                access time of the system, both for
    3 tape drives. At time t1 the system            read and write requests ?
    is in :
                                                     (A) 157.5 nano sec.
    (A) safe state
                                                     (B) 110 nano sec.
    (B) unsafe state
                                                     (C) 75 nano sec.
    (C) deadlocked state
                                                     (D) 82.5 nano sec.
    (D) starvation state
                                                49. Suppose a disk has 201 cylinders,
47. In a demand paging memory system,
                                                    numbered 0 to 200. At some time
    page table is held in registers. The
                                                    the disk arm is at cylinder 100, and
    time taken to service a page fault
                                                    there is a queue of disk access
    is 8 m.sec. if an empty frame is
                                                    requests for cylinder 30, 85, 90, 100,
    available or if the replaced page is
                                                    105, 110, 135 and 145. If shortest-
    not modified, and it takes 20 m.sec.
                                                    seek time first (SSTF) is being used
    if the replaced page is modified.
                                                    for scheduling the disk access the
    What is the average access time to
    service a page fault assuming that              request for cylinder 90 is serviced
    the page to be replaced is modified             after servicing ............ number of
    70% of the times ?                              requests.

    (A) 11.6 m.sec.                                  (A) 1

    (B) 16.4 m.sec.                                  (B) 2

    (C) 28 m.sec.                                    (C) 3

    (D) 14 m.sec.                                    (D) 4

                                           14
MH SET 2020 question paper, 27 December 2020, Paper II, Computer Science and Applications, page 15 of 28
Page 15 of 28
Text of page 15
JUN - 37220/II—A

50. Let m[0] ...... m[4] be mutexes (binary           52. Which of the following provides a
    semaphores) and P[0] ........ P[4] be                 concise,    unambiguous,     and
    processes. Suppose each process P[i]                  consistent method for documenting
    executes the following :                              system requirements in software
    wait (m[i]); wait (m[(i+1) mod 4]);                   development process ?
    .......................                               (A) CMM
     release (m[i]); release (m[(i+1) mod 4]);            (B) ISO standard
     This could be :                                      (C) CASE tools
     (A) Thrashing                                        (D) Formal methods
     (B) Deadlock                                     53. Use-cases are not well suited for
                                                          capturing ............. requirements.
     (C) Starvation but not deadlock
                                                          (A) functional
     (D) None of the above
                                                          (B) non-functional
51. Which one of these is appropriate in
    an agile and iterative software                       (C) user interaction
    development process ?                                 (D) hardware interaction
     (A) Gather a complete set of                     54. The architectural model generally is
         requirements before designing/                   derived from which of the following
         building anything                                sources ?
     (B) Implement       the     system                   (i)   Information about application
         incrementally, building it up bit                      domain for software.
         by bit
                                                          (ii) Data flow diagram or analysis
     (C) Implement the backend of the                          classes (along with their
         system first, that is, before                         relationships and collaborations)
         implementing the front-end
                                                          (iii) Availability of design patterns/
         functionality with which users
                                                                frameworks
         interact
                                                          (A) (i) and (ii) only but not (iii)
     (D) Generate     and    maintain
         complete, detailed design                        (B) (i) and (iii) only but not (ii)
         documents, which comprehen-                      (C) (ii) and (iii) only but not (i)
         sively model all aspects of the
                                                          (D) (i), (ii) and (iii)
         design
                                                 15                                     [P.T.O.
MH SET 2020 question paper, 27 December 2020, Paper II, Computer Science and Applications, page 16 of 28
Page 16 of 28
Text of page 16
JUN - 37220/II—A
                                                  57. The concurrent version system
55. FP based estimation decomposes                    (CVS) is widely used for version
                                                      control, where it is originally
    problems based on :
                                                      designed for source code, but useful
                                                      for any text-based file, then CVS
    (A) Process activities
                                                      system must perform :

    (B) Project schedule                              (i)   Establishing         a    simple
                                                            repository.
    (C) Information                                   (ii) Maintains all version of a file
                                                           in a single named file by storing
    (D) Software procedures                                only the difference between
                                                           progressive version of the
                                                           original file.
56. Assume that the size of an organic
                                                      (iii) Protect against simultaneous
    type software product has been                          changes to a file by establishing
                                                            different directories for each
    estimated to be 34,000 lines of source                  developer thus insulating one
                                                            from another.
    code. Assume that the average
                                                      (iv) The CVS merges changes when
    salary of software engineers is                        each developer completes the
                                                           work.
    ` 20,000 per month. Determine the
                                                      (A) (i), (ii) and (iii)
    effort and cost required to develop
                                                      (B) (i), (ii), (iii) and (iv)
    the software product along with the               (C) (i), (ii) and (iv)

    nominal development time.                         (D) (ii), (iii) and (iv)
                                                  58. Suppose a graph has 5 flow graph
    (A) 91 PM, 210,000, 14 months                     edges and 3 flow graph modes, the
                                                      cyclometric complexity V(G) of flow
    (B) 97 PM, 280,000, 14 months                     graph G is ..............
                                                      (A) –2
    (C) 91 PM, 280,000, 14 months                     (B) 2
                                                      (C) 4
    (D) 97 PM, 210,000, 12 months
                                                      (D) 8
                                             16
MH SET 2020 question paper, 27 December 2020, Paper II, Computer Science and Applications, page 17 of 28
Page 17 of 28
Text of page 17
JUN - 37220/II—A

59. Which is/are the false statement(s)          62. Consider the usual algorithm for
    about alpha test ?                               determining whether a sequence of
    (i)   It is conducted by developers.             parentheses is balanced.
    (ii) It is conducted in controlled
                                                     The maximum number of parentheses
         environment.
                                                     that appear on the stack AT ANY
    (iii) It is conducted       on   live
          application.                               ONE TIME when the algorithm
                                                     analyzes      ( ) ( )   ( )   is :
    (A) (i) and (ii)
    (B) (i) and (iii)                                (A) 12

    (C) (ii) and (iii)                               (B) 6
    (D) (iii) only                                   (C) 3
60. Which amongst the following are
                                                     (D) 4
    McCalls production transition
    factors ?                                    63. A queue data structure can be used
    (i)   Reliability                                for :
    (ii) Portability
                                                     (A) Resource allocation
    (iii) Testability
                                                     (B) Expression parsing
    (iv) Reusability
                                                     (C) Recursion
    (A) (i) and (ii)
    (B) (ii) and (iii)                               (D) Expression evaluation
    (C) (ii) and (iv)                            64. The minimum number of nodes
    (D) (i) and (iii)                                possible in a binary tree of height
61. A doubly linked list is :                        h (assuming that the root is at
    (A) A linear data structure                      height 1) is :

    (B) A non-linear data structure                  (A) h
    (C) Both linear and non-linear data              (B) 2 h
        structure
                                                     (C) 2 h – 1
    (D) Neither linear nor non-linear
        data structure                               (D) 2h – 1

                                            17                                       [P.T.O.
MH SET 2020 question paper, 27 December 2020, Paper II, Computer Science and Applications, page 18 of 28
Page 18 of 28
Text of page 18
JUN - 37220/II—A
65. If the in-order traversal output               68. Let C^(x) denote the ranking
    sequence of a binary tree is :
                                                       function that associates cost with a
             D B E A F C
    and its pre-order traversal output                 node       in       Branch    and   Bound
    sequence is :                                      Formulation of Travelling Salesperson
             A B D E C F
                                                       Problem. What is the value of C^(x)
    then its post-order traversal output
    sequence is :                                      for the root node for the following

    (A) A B C D E F                                    problem instance ?
    (B) F E D C B A
                                                                       1    2    3   4
    (C) D E B F C A
                                                              1             3    5   10
    (D) F E D C B A
                                                              2 11               6   8
66. Some differences between B tree and
    B+ tree approaches are :                                  3 16          7        20
    (i)   In a B tree, search keys and                        4 13 12 10
          data are stored in internal or
          leaf nodes. But, in B+ tree, data
          are stored only in leaf nodes.               (A) 26

    (ii) A link is maintained among all                (B) 29
         the nodes so that one can move
         from the left-most node to right-             (C) 31
         most node in B+ tree.
    (A) only (i) is correct                            (D) 36
    (B) only (ii) is correct
                                                   69. Which amongst the following is not
    (C) Both (i) and (ii) are correct
                                                       an NP-complete problem ?
    (D) Both (i) and (ii) are incorrect
67. If f(n) = 4n2 for all n and g(n) = n
                                                       (A) CNF satisfiability problem
    if n > 100 and n 3 if n < 100,
    then :
                                                       (B) Clique decision problem
    (A) g(n) is of O(f(n))
    (B) g(n) is of (f(n))                              (C) Node Cover decision problem
    (C) f(n) is of O(g(n))
                                                       (D) Halting problem
    (D) g(n) is of (f(n))

                                              18
MH SET 2020 question paper, 27 December 2020, Paper II, Computer Science and Applications, page 19 of 28
Page 19 of 28
Text of page 19
JUN - 37220/II—A
70. Consider the following segment of a                 72. Consider the        grammar     with
    parallel algorithm expressed in                         productions :
    PRAM model of computing and                             S      aBDh, B    cC, C    bC/ ,
    allows concurrent read exclusive                        D      EF, E   g/ , F   f/
    write model. What is the ‘‘Parallel
                                                            Which of the following is correct set
    time’’ complexity ?
                                                            for FOLLOW (E) ?
    For k = m – 1 step – 1 to 0 do
    for all j, 2k < j < 2k+1 – 1, in parallel do            (A) {g, f, h, $}
    A(j) = max {A(2j), A(2j + 1)}                           (B) {f, h, $}
    where ‘‘max’’ is a function that find
                                                            (C) {h, $}
    maximum of two numbers using
    single comparison operation.                            (D) {g, $,   }
    (A) O(n2)                                           73. Which of the following is/are correct
    (B) O(n)                                                statement(s) :
    (C) O(log2 n)                                           (i)   A language L is said to be a
    (D) O(n log2 n)                                               deterministic context free
71. Which of the following languages                              language if and only if there
    are denoted/represented by the                                exists a deterministic DA M
    regular expression :                                          such that :
           (0 1) (0 1) * * 00 (0         1) *                            L = L(M)
     (i)   The language contains strings
           over 0’s and 1’s with at least one               (ii) If every grammar that
                                                                 generates L is ambiguous,
           pair of consecutive zeros.
                                                                 then the language is called
     (ii) The language contains strings
                                                                 inherently ambiguous.
           over 0’s and 1’s with strings
           starting with either 0 or 1 and                  (iii) A CFG is in Greibach Normal
           may end with 0 or 1.                                   Form if all productions in G
     (iii) The language contains strings                          have the form A       BC and
           over 0’s and 1’s with number of                        A    a where A, B, C are non-
           0’s to be more than number of                          terminals and a is a terminal.
           1’s.                                             (A) (i) and (iii) only
     (A) (ii) and (iii) only                                (B) (ii) and (iii) only
     (B) (iii) only
                                                            (C) (i) and (ii) only
     (C) (i) and (ii) only
     (D) (i) and (iii) only                                 (D) (i), (ii) and (iii) only

                                                   19                                      [P.T.O.
MH SET 2020 question paper, 27 December 2020, Paper II, Computer Science and Applications, page 20 of 28
Page 20 of 28
Text of page 20
JUN - 37220/II—A

74. The process of computing an                           76. Match all items in Group 1 with
                                                              correct options from Group 2
      attribute and associating its
                                                              below :
      computed value with the language
                                                                          Group 1
      construction is referred as ............ of
                                                              (i)   Regular expression
      the attribute.
                                                              (ii) Pushdown automata

      (A) Binding                                             (iii) Data flow analysis

                                                              (iv) Register allocation
      (B) Collision
                                                                          Group 2
      (C) Synthesizing
                                                              (1) Syntax analysis
      (D) Chaining
                                                              (2) Code generation

75. ................. refers to the order in which            (3) Lexical analysis

      individual          statements           or             (4) Code optimization

      instructions of a program are                           (A) (i)—(4), (ii)—(1), (iii)—(2),
                                                                    (iv)—(3)
      executed.
                                                              (B) (i)—(3), (ii)—(1), (iii)—(4),
      (A) Data flow
                                                                    (iv)—(2)

      (B) Control flow                                        (C) (i)—(3), (ii)—(4), (iii)—(1),
                                                                    (iv)—(2)
      (C) Register allocation
                                                              (D) (i)—(2), (ii)—(1), (iii)—(4),
      (D) Instruction scheduling                                    (iv)—(3)

                                                     20
MH SET 2020 question paper, 27 December 2020, Paper II, Computer Science and Applications, page 21 of 28
Page 21 of 28
Text of page 21
JUN - 37220/II—A

77. Which of the following is/are type of         79. Which among the following is/are
    data supported/added by/in typical
                                                      correct statement/statements ?
    object file formats in code generation
    phase of a compiler ?                             (i)   A class of problems with two

    (i)   Data segment                                      outputs ‘‘yes’’ or ‘‘no’’ is said to

    (ii) Block started by symbol                            be decidable (solvable) if there

    (iii) Text segment                                      exists some definite algorithm

    (A) (i) only                                            which always terminates (halts)

    (B) (ii) and (iii) only                                 with one of two outputs ‘‘yes’’ or

    (C) (i), (ii) and (iii) only                            ‘‘no’’. Otherwise, the class of

                                                            problems       is   said   to    be
    (D) (i) and (iii) only
                                                            undecidable.
78. A synthesized attributes can be :

    (i)   Result of attribute evaluation              (ii) A decision problem is a problem
          rules.                                            that requires a yes or no
    (ii) The one whose value at a node                      answer.
          in a parse tree is defined in
                                                      (iii) Undecidable problem can be
          terms of its sibling or parent.
                                                            solved by a computer or a
    (iii) The one whose value at parent
          node can be determined from its                   computer program of any kind.
          children.
                                                      (A) (i) and (ii) only
    (A) (i) only
                                                      (B) (i) and (iii) only
    (B) (i) and (iii) only
                                                      (C) (ii) and (iii) only
    (C) (i) and (ii) only

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

                                             21                                         [P.T.O.
MH SET 2020 question paper, 27 December 2020, Paper II, Computer Science and Applications, page 22 of 28
Page 22 of 28
Text of page 22
JUN - 37220/II—A

80. Which of the following production              82. What is the minimum Hamming
    forms belongs to unrestricted
                                                       distance for detection of six errors
    grammar (Type 0) :
                                                       or correction of two errors ?
    (i)   S     ASA A       BCa BC     Aa

    (ii) S      aSa/                                   (A) 7

    (iii) BSA       aSb/ASB, A       aB/b              (B) 5
          B     Bb/a
                                                       (C) 3
    (A) (i) and (iii) only
                                                       (D) 1
    (B) (ii) and (iii) only

    (C) (i) and (ii) only                          83. Find the class of the following two

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

81. A noiseless channel with bandwidth
                                                       (a) 0000 0001 0000 1011 00001011
    of 3000 Hz transmitting a signal
                                                           11101111
    with four signal levels (for each level

    we send 2 bits). Then the maximum                  (b) 14.23.120.8
    bit rate is :
                                                       (A) Class D, Class D
    (A) 6,000 bps
                                                       (B) Class C, Class C
    (B) 8,000 bps

    (C) 10,000 bps                                     (C) Class B, Class B

    (D) 12,000 bps
                                                       (D) Class A, Class A

                                              22
MH SET 2020 question paper, 27 December 2020, Paper II, Computer Science and Applications, page 23 of 28
Page 23 of 28
Text of page 23
JUN - 37220/II—A

84. Imagine a flow specification that has         86. Which ARQ mechanism deals with
                                                      the transmission of only damaged or
    a maximum packet size of 1000
                                                      lost frames despite the other multiple
    bytes, a token bucket rate of 10
                                                      frames by increasing the efficiency
    million bytes/sec, a token bucket size            and its utility in noisy channels ?
    of 1 million bytes, and a maximum                 (A) Go-Back-N ARQ
    transmission rate of 50 million                   (B) Selective Repeat ARQ
    bytes/sec. How long can a burst at                (C) Stop-and-Wait ARQ
    maximum speed last ?                              (D) All of the above

    (A) 50 sec                                    87. The role of Common Gateway
                                                      Interface (CGI) is to :
    (B) 50 msec
                                                      (A) Generate dynamic web pages
    (C) 25 sec
                                                      (B) Stream videos
    (D) 25 msec                                       (C) Program used to view html
                                                          document
85. In symmetric key cryptography, if
                                                      (D) Generate executable files from
    every person in a group of 10 people
                                                          web content by web server
    needs to communicate with every
                                                  88. In virtual cluster management
    other person in the group, how many
                                                      ‘‘templates’’ can be implemented
    secret keys are required ?                        using :

    (A) 9                                             (A) Skip and relay format

                                                      (B) Copy and relay format
    (B) 90
                                                      (C) NOW (newtor of workstation)
    (C) 45
                                                          format
    (D) 10                                            (D) COW (copy on write) format

                                             23                                     [P.T.O.
MH SET 2020 question paper, 27 December 2020, Paper II, Computer Science and Applications, page 24 of 28
Page 24 of 28
Text of page 24
JUN - 37220/II—A

89. GSM is an example of :                                                       0
                                                 92. If A = near 0.74 =
    (A) TDMA cellular systems                                                  0.730

    (B) FDMA cellular systems                       0.8         1       0.6         0
                                                   0.735      0.740    0.745      0.750
    (C) CDMA cellular systems
                                                                                0
    (D) SDMA cellular systems                        and B = in 0.74 =
                                                                              0.730
90. The responsibility of a Certification
                                                    0.4        0.8       1         0.6
    Authority (CA) for Digital Signature           0.735      0.740    0.745      0.750
    is to authenticate the :
                                                     then A      B is :
    (A) hash function used
                                                             1          .2        0
    (B) private keys of subscribers                  (A)
                                                           0.730      0.735     0.740
    (C) key used in DES                                                 0.4         1
    (D) public keys of subscribers                                     0.745      0.750

91. A population of size 400, consists of                    1          .6       0.2
                                                     (B)
    123 copies of genome 0001 (with                        0.730      0.735     0.740
    fitness 0.12), 57 copies of genome                                   0         0.4
    1111 (with fitness 0.23), 201 copies                               0.745      0.750
    of genome 1010 (with fitness 0.56)                       2          .8       0.2
    and 19 copies of genome 0110 (with               (C)
                                                           0.730      0.735     0.740
    fitness 0.43). What is the estimated
                                                                        0.4        0.6
    fitness of schema 1 *** ?
                                                                       0.745      0.750
    (A) 0.4870
                                                             1          .2        0
                                                     (D)
    (B) 0.4880                                             0.730      0.735     0.740

    (C) 0.4877                                                           0         0.4
                                                                       0.745      0.750
    (D) 0.5870

                                            24
MH SET 2020 question paper, 27 December 2020, Paper II, Computer Science and Applications, page 25 of 28
Page 25 of 28
Text of page 25
JUN - 37220/II—A

93. Suppose the function y and a fuzzy
                                                         95. The ability to manipulate the
    integer number around – 4 for X are
    given as :                                               existing knowledge representational

             y = (x – 3) 2 + 2                               structures to derive new structures,

    Around – 4 = {(2, 0.3), (3, 0.6),                        is known as :
    (4, 1), (5, 0.6), (6, 0.3)} respectively,
    then f(Around – 4) is given by :                         (A) Representational adequacy

    (A) {(2, 0.6), (3, 0.3), (6, 1), (11, 0.3)}
                                                             (B) Inferential adequacy
    (B) {(2, 0.6), (3, 1), (6, 1), (11, 0.3)}
                                                             (C) Inferential efficiency
    (C) {(2, 0.6), (3, 1), (6, 0.6), (11, 0.3)}

    (D) {(2, 0.6), (3, 0.3), (6, 0.6), (11, 0.3)}            (D) Acquisitional efficiency
94. Which amongst the following are the
                                                         96. Which of the following is not true
    four types of agents in Artificial
    Intelligence ?                                           for STRIPS language used for
    (i)   Simple reflex
                                                             planning ?
    (ii) Model based
                                                             (A) There is no support for equality
    (iii) Goal based

    (iv) Action based                                            and types.

    (v) Utility based                                        (B) The goals and effects are
    (vi) Learning action
                                                                 specified as conjunction.
    (A) (i), (ii), (iii) and (v)
                                                             (C) It uses open world assumption
    (B) (i), (ii), (iii) and (iv)

    (C) (ii), (iii), (iv) and (v)                            (D) It uses only positive literals in

    (D) (iii), (iv), (v) and (vi)                                states

                                                    25                                      [P.T.O.
MH SET 2020 question paper, 27 December 2020, Paper II, Computer Science and Applications, page 26 of 28
Page 26 of 28
Text of page 26
JUN - 37220/II—A

97. In the source language, a single              100. We have to use a Hopfield network
    pronoun may stand for many things                  to store three vectors as follows :
    that require distinct pronouns in the                   (1, 1, 1, 1, 1)
    target language. This difficulty in                     (1, –1, –1, 1, –1)
    Natural language understanding                          (–1, 1, –1, –1, –1)
    encountered by machine translation                Find the weight matrix using outer
    systems is known as :                             products method :
     (A) Lexical disambiguation                               0          1 1         3    1
     (B) Grammatical ambiguity                                   1   0       1       1 1
                                                      (A)
     (C) Anaphoric references                                 1      1       0       1    3
     (D) Idioms                                               3          1 1         0    1
98. What are the two middle agents                            1      1       3       1    0
    involved  in   a  Distributed
    Environment Centered Agent                                0          1       1   3     1
    Framework ?                                       (B)        1   0           1       1 1
     (A) Dispatcher and Planner                               1      1           0   1     2
     (B) Matchmaker and Broker
                                                              0          1 1
     (C) Dispatcher and Broker
                                                                 1   0       1
     (D) Scheduler and Broker
                                                      (C)     1          1 0
99. The activation levels of node in
                                                              3          1 1
    neural network depends on the
                                                              2      1       1
    activation function chosen. If it is a
    sigmoid function, then activation
    levels are :
                                                             1       3       1
                                                             1       1 1
     (A) [0, 1]
                                                      (D)    0       1       3
     (B) unrestricted
                                                             1       0       1
     (C) [–   , +   ]
                                                             3       1       0
     (D) 0 (or – 1) and 1
                                             26
MH SET 2020 question paper, 27 December 2020, Paper II, Computer Science and Applications, page 27 of 28
Page 27 of 28
Text of page 27
JUN - 37220/II—A

ROUGH WORK




    27                 [P.T.O.
MH SET 2020 question paper, 27 December 2020, Paper II, Computer Science and Applications, page 28 of 28
Page 28 of 28
Text of page 28
JUN - 37220/II—A

ROUGH WORK




    28
Page 1 of 28

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