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

MH SET 2018: 28 January, Paper III, Computer Science and Applications

  • Date: 28 January 2018
  • Paper code: JAN37318
  • Series: A
  • Language: Bilingual
  • 24 pages
MH SET 2018 question paper, 28 January 2018, Paper III, Computer Science and Applications, page 1 of 24
Page 1 of 24
Text of page 1
Test Booklet Code & Serial No.
                                                                                                                    A
                     COMPUTER SCIENCE AND APPLICATION
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.

JAN - 37318                                                                                         (To be filled by the Candidate)
Time Allowed : 2½ Hours]                                                                            [Maximum Marks : 150
Number of Pages in this Booklet : 24                                                   Number of Questions in this Booklet : 75
                     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 75 objective type questions. Each question
          will carry two marks. All questions of Paper-III will be compulsory,   2.
          covering entire syllabus (including all electives, without options).
3.        At the commencement of examination, the question booklet
          will be given to the student. In the first 5 minutes, you are
          requested to open the booklet and compulsorily examine it as           3.
          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                    (ii)
                   cover page. Faulty booklets due to missing pages/
                   questions or questions repeated or not in serial
                   o rder or any other discre pancy 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
                   should be entered on this Test Booklet.                               (iii)
4.        Each question has four alternative responses marked (A), (B),
          (C) and (D). You have to darken the circle as indicated below on
          the correct response against each item.                                4.                       (A), (B), (C)   (D)
          Example : where (C) is the correct response.

                             A        B                 D
                                                                                                    (C)
5.        Your responses to the items are to be indicated in the OMR
          Sheet given inside the Booklet only. If you mark at any place                                   A        B              D
          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.
8.        If you write your Name, Seat Number, Phone Number or put               6.
          any mark on any part of the OMR Sheet, except for the space            7.
          allotted for the relevant entries, which may disclose your             8.
          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.       Use only Blue/Black Ball point pen.                                    10.
11.       Use of any calculator or log table, etc., is prohibited.               11.
12.       There is no negative marking for incorrect answers.                    12.
MH SET 2018 question paper, 28 January 2018, Paper III, Computer Science and Applications, page 2 of 24
Page 2 of 24
Text of page 2
JAN - 37318/III—A




2
MH SET 2018 question paper, 28 January 2018, Paper III, Computer Science and Applications, page 3 of 24
Page 3 of 24
Text of page 3
JAN - 37318/III—A
               Computer Science and Application
                                    Paper III
Time Allowed : 2½ Hours]                           [Maximum Marks : 150
Note : This Paper contains Seventy Five (75) multiple choice questions, each
       question carrying Two (2) marks. Attempt All questions.

1.   If you have a staircase electric           3.   To store N-bit word the number of

     switch which logical operation                  Flip-Flops required is :

     represents the staircase switch :               (A) 2n Flip-Flops

     (A) XNOR (Exclusive-NOR)                        (B) 2n Flip-Flops


     (B) OR                                          (C) n Flip-Flops

                                                     (D) 2n–1 Flip-Flops
     (C) NOR
                                                4.   After performing the addition of 47H
     (D) XOR (Exclusive-OR)
                                                     and 51H the status of the zoro (Z),
2.   A circuit which is used to sent data            Carry (Cy), Sign (S), Parity (P),
     from two or more sources through                Auxiliary (AC) are :

     a single transmission line is known             (A) S = 1, Z = 0, AC = 0, P = 0,
     as :                                                Cy = 0

     (A) Decoder                                     (B) S = 0, Z = 1, AC = 1, P = 1,

                                                         Cy = 1
     (B) Multiplexer
                                                     (C) S = 1, Z = 1, AC = 1, P = 0,
     (C) Encoder
                                                         Cy = 0
     (D) De-multiplexer
                                                     (D) None of the above

                                            3                                    [P.T.O.
MH SET 2018 question paper, 28 January 2018, Paper III, Computer Science and Applications, page 4 of 24
Page 4 of 24
Text of page 4
JAN - 37318/III—A

                                                 7.   Consider the following set of
5.   An 8086 microprocessor can fatch
                                                      functional dipendencies of the
     and Pre-fetch upto.......... bytes of            schema (A, B, C) :

     instructions and stores them in the              A        BC, B          C, A          B,
                                                      AB       C
     queue :
                                                      Then the canonical cover for this set
     (A) 8                                            is :

                                                      (A) A        BC & AB            C
     (B) 6
                                                      (B) A        BC & A         B
     (C) 16
                                                      (C) A        BC & B         C

     (D) 20                                           (D) A        B & B      C

                                                 8.   Given the following statement
6.   The client server application
                                                      ALTER         TABLE             employee
     development is supported by one of               MOVE TABLESPACE data 1.

     the following RDBMS Software :                   The action taken is :

                                                      (A) table space is renamed
     (A) Excell
                                                      (B) data is moved to new segment

     (B) Access                                       (C) A copy of table is moved into
                                                             new segment
     (C) Ingress
                                                      (D) The table structure is moved in

     (D) Oracle 9.0                                          to new segment

                                             4
MH SET 2018 question paper, 28 January 2018, Paper III, Computer Science and Applications, page 5 of 24
Page 5 of 24
Text of page 5
JAN - 37318/III—A

9.   In a railway reservation system, the         11. The ratio of vertical points to

     entities are–date, train no, place of            horizontal points required to
                                                      produce equal length lines in both
     departure, destination, type of train,
                                                      direction is called as :
     type of seats, seats available.
                                                      (A) frame ratio
     The primary key will be :
                                                      (B) aspect ratio
     (A) train no. + date
                                                      (C) scanline ratio
     (B) train no.+ destination
                                                      (D) display ratio
     (C) train no.+ place of departure
                                                  12. The aliasing effect is a phenomena
     (D) train no.                                    that occurs when................. :

10. The command used to regain the                    (A) a discrete singnal is sampled in
     space for an index containing                         a continuous manner with a

     deleted entries is :                                  constant rate

     (A) ALTER          INDEX          emp            (B) a discrete signal is sampled in

         DEALLOCATE                                        a discrete manner with a
                                                           constant rate
     (B) ALTER       INDEX       emp-idx
                                                      (C) a continuous signal is sampled
         COALESCE
                                                           in a continuous manner with a
     (C) ALTER TABLE emp DROP                              constant rate
         INDEX
                                                      (D) a continuous signal is sampled
     (D) ALTER       INDEX       emp-idx                   in a discrete manner with a

         REBUILD                                           constant rate.

                                              5                                         [P.T.O.
MH SET 2018 question paper, 28 January 2018, Paper III, Computer Science and Applications, page 6 of 24
Page 6 of 24
Text of page 6
JAN - 37318/III—A

13. Key frame systems are specialized            16. Software that supports virtual
    ................... languages designed            machine is called as :

    simply to generate the in-between                 (A) Virtual machine monitor
    from used spicified key frames.
                                                      (B) Hypervisor
    (A) Graphics                                      (C) Kernel

    (B) modeling                                      (D) Both (A) and (B)

    (C) animation                                17. ................. is the MS-DOS command,
                                                      counterpart to ‘tar’ of unix.
    (D) fractal generation
                                                      (A) dir
14. Which of the following is not a
                                                      (B) backup
    category of the graphics standards ?
                                                      (C) copy
    (A) Basic graphics system
                                                      (D) edit
    (B) Portable network graphics
                                                 18. Which of the following conversions
    (C) Open GL
                                                      is not possible algorithmically ?
    (D) Open Raster
                                                      (A) regular grammar to context free
15. Which of the following is a 3D                         grammar
    graphics package ?                                (B) Non-deterministic         TM    to

    (A) paint                                              deterministic TM

    (B) dream viewer                                  (C) Non-deterministic FSA to
                                                           deterministic FSA
    (C) AC3D
                                                      (D) Non-deterministic PDA to
    (D) Light room
                                                           deterministic PDA

                                             6
MH SET 2018 question paper, 28 January 2018, Paper III, Computer Science and Applications, page 7 of 24
Page 7 of 24
Text of page 7
JAN - 37318/III—A

                                              21. Consider the stop and wait protocol,
19. The number of arguments a complex
                                                  if transmission time is ‘a’ at the

    term    in prolog is called as                source and propagation delay is ‘b’
                                                  then after what time the sender can
    its :                                         send the second packet ?

                                                  Assume data packet and ACK packet
    (A) Arity
                                                  of the same size with no pissy
                                                  backing :
    (B) Atom
                                                  (A) 2a + 2b

    (C) Numbers                                   (B) (a + b)/2

                                                  (C) 2b + a
    (D) Constants
                                                  (D) a + 2b

20. A data structure where elements can       22. Assuming classbased addressing
                                                  scheme, in an university has 35 (thirty
    be added or removed at either end             five) departments and uses a class B
                                                  address. If use 6 (six)-bit subnet
    but not in the middle.
                                                  number and 10-bit host number then
                                                  how many Ethernet segments and
    (A) Linked lists
                                                  maximum hosts in each Ethernet
                                                  segment are possible ?
    (B) Stacks
                                                  (A) 64, 256

    (C) Queues                                    (B) 64, 254

                                                  (C) 64, 1024
    (D) deque
                                                  (D) 64, 1022

                                          7                                     [P.T.O.
MH SET 2018 question paper, 28 January 2018, Paper III, Computer Science and Applications, page 8 of 24
Page 8 of 24
MH SET 2018 question paper, 28 January 2018, Paper III, Computer Science and Applications, page 9 of 24
Page 9 of 24
Text of page 9
JAN - 37318/III—A


26. The number of times swap function          28. The best/worst case time complexity

    called for the selection sort on an            of Bubble sort is :


    array with N numbers is :                      (A) O(n)/ O(n2)


    (A) N2                                         (B) O(n)/ O(n log n)


                                                   (C) O(n log n)/O(n log n)
    (B) N log N

                                                   (D) O (n log n)/ O(n2 log n)
    (C) log N

                                               29. For Job sequence problem :
    (D) N–1

                                                   Item :          1    2   3   4     5
27. For the following :
                                                   Profit :        20 15 10 5         1
    I. The 52 notation is anti-symmetric
                                                   Deadline : 2         2   3   3     3
    II. The big Oh notation is semi-
                                                   Which of the following leads to
    equivalence.
                                                   optimal solution ?

    (A) Both (I) and (II) are true
                                                   (A) (1, 3, 4)

    (B) Both (I) and (II) are false
                                                   (B) (4, 2, 3)

    (C) (I) is true & (II) is false                (C) (1, 2, 4)

    (D) (I) is false & (II) is ture                (D) (1, 5, 2)

                                           9                                        [P.T.O.
MH SET 2018 question paper, 28 January 2018, Paper III, Computer Science and Applications, page 10 of 24
Page 10 of 24
Text of page 10
JAN - 37318/III—A

30. For the following statements of
                                                      32. For the following statements, a
     problems :
                                                          property which is false for classes is
     (I) 3 COL : Given a graph G, can                     that they :
          be painted with 3 colours.
                                                          (A) are removed from memory when
     (II) COLO : given a graph G, find                        not in use
          the chromatic number of G.
                                                          (B) permit data to be hidden from
     Select the correct answer :                              other classes

     (A) Only (I) is NP-Complete                          (C) can closely model objects in the

     (B) Only (II) is polynomial time                         real world

     (C) (I) is NP-complete & (II) is NP-                 (D) bring together all aspects of an

          hard                                                entity in one place

     (D) Only (I) is polynomial time                  33. A static function :

31. The.............. inheritance supports the            (A) should be called when an object

     mechanism of deriving one base                           is destroyed

     class with more than one derived                     (B) can be called using the class
     classes.                                                 name and function name

     (A) Hierarchical                                     (C) is used when a dummy object

     (B) Multiple                                             must be created

     (C) Multilevel                                       (D) is closely connected with and

                                                              individual object of a class.
     (D) Hybrid

                                                 10
MH SET 2018 question paper, 28 January 2018, Paper III, Computer Science and Applications, page 11 of 24
Page 11 of 24
Text of page 11
JAN - 37318/III—A


34. The copy constructor must receive          36. In software engineering, coding

                                                   techniques       consider     many
    its arguments by :
                                                   non-functional       requirements.
    (A) Only pass by reference                     Following is one of the important

                                                   non-functional aspect while writing
    (B) Only pass by address
                                                   a code :
    (C) Only pass by value
                                                   (A) Input formats
    (D) either pass by value or pass by
                                                   (B) Quality
        reference
                                                   (C) Performance

35. If a base class destructor is not              (D) User interface

    virtual then :                             37. If we compare agile process with the

                                                   traditional process, then one of the
    (A) it cannot be called
                                                   following is a significant advantage
    (B) it cannot be called when                   of agile process :

        accessed from pointer                      (A) Better suited for larger process

    (C) destructor in derived class                (B) Scopes easily with changes in

                                                        requirements
        cannot be called when accessed
                                                   (C) Can be used to mission critical
        through a pointer to the base
                                                        system
        class
                                                   (D) Better    suited   for   larger
    (D) It cannot have a function body.                 companies

                                          11                                    [P.T.O.
MH SET 2018 question paper, 28 January 2018, Paper III, Computer Science and Applications, page 12 of 24
Page 12 of 24
Text of page 12
JAN - 37318/III—A

38. In   object-oriented         use-case
                                                  40. In above expression given in No. 39,
    methodology, following is one of the
                                                      which is for metric ‘c’ i & n
    essential step for identifying the

    factors   that     serve     as   good            respectively represents :

    requirement analysis methodology :
                                                      (A) highest level of coupling
    (A) stakeholders
                                                           relationship,    all   coupling
    (B) eliminating duplications
                                                           relationships
    (C) viewpoints

                                                      (B) lowest    level   of    coupling
    (D) boundary conditions

39. The metric for measuring coupling                      relationships, all coupling

    between two units, is given by :                       relationships

    c (x, y) = i + [n/(n + 1)]
                                                      (C) minimum level of coupling
    where, the coupling between two
                                                           relationships, all coupling
    units means :

                                                           relationships
    (A) class units

    (B) object units                                  (D) maximum level of coupling

    (C) software units                                     relationships, all coupling

    (D) method units
                                                           relationships

                                             12
MH SET 2018 question paper, 28 January 2018, Paper III, Computer Science and Applications, page 13 of 24
Page 13 of 24
Text of page 13
JAN - 37318/III—A

41. In a distributed system, a link and
                                                43. The page table is maintained by
    site failed due to some reason, what
    is the mechanism for detectings the
                                                    operating system for :
    failure.

    (A) Polling                                     (A) each thread

    (B) handshaking
                                                    (B) each process
    (C) token passing

    (D) backup multiplexing
                                                    (C) each instruction
42. Let P and Q be the two processes
    which are interlinked and by an                 (D) each address
    indirect mode of communication.
    Which of the following mechanisms           44. On termination which of the
    they will adopt ?
                                                    following system call does not return
    (A) There is another process R to
        handle and pass on the
                                                    control to calling point :
        messages between P and Q

    (B) There is a mailbox to help                  (A) exec
        communication between P and
        Q                                           (B) fork
    (C) There is another machine
        between the two processes to                (C) ioctl
        help communication.
                                                    (D) longjmp
    (D) All of the above

                                           13                                    [P.T.O.
MH SET 2018 question paper, 28 January 2018, Paper III, Computer Science and Applications, page 14 of 24
Page 14 of 24
Text of page 14
JAN - 37318/III—A


45. In case of multiprogramming the         47. .............. was the first program to

    degree is defined as :                       support explanation and knowledge


    (A) Per unit time execution of               aquisition for expert systems.

        processes
                                                 (A) MYCIN

    (B) Number of processes in ready
                                                 (B) TEIRESIAS
        queue
                                                 (C) EMYCIN
    (C) Nomber of processes in the
                                                 (D) MOLE
        I/O queue

                                            48. DENDRAL rules are used to
    (D) The number of processes in

                                                 determine :
        memory


46. 77a is equivalent to :                       (A) Pharmaceutical        compound


                                                     structures
    (A) 7a


    (B) aa                                       (B) Biological structures


    (C) a                                        (C) Geological structures


    (D) 1 – a                                    (D) Complex chemical structures

                                       14
MH SET 2018 question paper, 28 January 2018, Paper III, Computer Science and Applications, page 15 of 24
Page 15 of 24
Text of page 15
JAN - 37318/III—A

49. ‘‘If.......... then.........’’ is defined in :        52. Write an Regular expression :

      (A) Formal                                              Starting with 0’s or 1’s ending with

                                                              ‘01’ is equivalent to :
      (B) Conceptual dependency

                                                              (A) (0 + 1)* 11
      (C) Predicate logic

                                                              (B) (0 + 1)* 00
      (D) Scripts

                                                              (C) (0 + 1)* 01
50. Who is Domain expert ?

                                                              (D) (0 + 1)* 10
      (A) Software Engineer
                                                          53. The regular expression :
      (B) Operator
                                                              (R + S)* S is equivalent to :
      (C) Doctor
                                                              (A) (R + S)*
      (D) Programmer
                                                              (B) (S + R)*
51. The given FSM :
                                                              (C) R* S*

                                                              (D) (R + S)*

      is equivalent to :                                  54. P     1 P 1 |0|     will give :

      (A) 1*0 (0 + 1)                                         (A) 01*0

      (B) 0*1 (0 + 1)                                         (B) 00*1

      (C) 01* (0 + 1)
                                                              (C) 10*0
      (D) 00* (0 + 1)
                                                              (D) 10*1

                                                     15                                    [P.T.O.
MH SET 2018 question paper, 28 January 2018, Paper III, Computer Science and Applications, page 16 of 24
Page 16 of 24
Text of page 16
JAN - 37318/III—A


55. Travel salesman problem is :                        57. Hamming distance between the


                                                           codes 1110100 and 1111001 is :
     (A) P

                                                           (A) 0
     (B) NP

                                                           (B) 1
     (C) NP-Hard

                                                           (C) 2
     (D) NP-Complete
                                                           (D) 3
56. A.................... is said to be strongly
                                                        58. What is the dimension of the
     symmetric, if in the transmission
                                                           subspace spanned by 0111, 1010,
     matrix each row is a permutation of
                                                           0011 and 1110 using generator

     each column.
                                                           matrix ?

     (A) Binary symmetric channel
                                                           (A) 0


     (B) Discrete memoryless channel
                                                           (B) 1


     (C) Binary assymmetric channel                        (C) 2


     (D) Burst channel                                     (D) 3

                                                   16
MH SET 2018 question paper, 28 January 2018, Paper III, Computer Science and Applications, page 17 of 24
Page 17 of 24
Text of page 17
JAN - 37318/III—A

                                                 Q. Nos. 61 and 62 : Consider the
59. Min filter is a............. filter :
                                                     following linear programming

     (A) Order statistic                             problem. The standard weight of a

                                                     special purpose brick is 5 kg. It

     (B) Averaging                                   contains 2 ingredients B1 and B2.

                                                     B1 costs Rs. 5 per kilogram and B2

     (C) Sharpening                                  costs Rs. 10 per kilogram. Strength

                                                     consideration dictate that the brick

     (D) Noise reduction                             cantains not more than 4 kg of B1

                                                     and at least 2 kg of B2. In what

60. Which of the following redundancy                proportion B1 and B2 should be mixed

                                                     to minimize the price of the brick ?
     is not eliminated in the lossless
                                                 61. The standard simplex formulation of

     compression :                                   this problem will have :

                                                     (A) 1 slack, 1 surplus and 1 artificial
     (A) Psychovisual redundancy                         variable.

                                                     (B) 2 surplus, 2 slack and 2
     (B) Coding redundancy
                                                         artificial variables

                                                     (C) 1 slack, 1 surplus and 2 artificial
     (C) Interpixel redundancy
                                                         variables.

     (D) Both B and C                                (D) 2 surplus and 2 slack variables.


                                            17                                     [P.T.O.
MH SET 2018 question paper, 28 January 2018, Paper III, Computer Science and Applications, page 18 of 24
Page 18 of 24
Text of page 18
JAN - 37318/III—A

                                                63. Consider the following tansportation
62. The dual of this problem will become
                                                    problem :
    a :
                                                                        Fac tory
    (A) maximization problem with 4                                F1    F2 F3 F4

                                                              W1 19 30 30 10          7
          variables and 2 inequality
                                                              W2 70 30 40 60          9
                                                  Warehouse
          constraints.
                                                              W3 40      8   70 30 18

                                                                   5     8   7     14 34
    (B) minimization problem with 4


          variables and 2 inequality                Let Xij be the allocation in the

                                                    (i, j)th cell. The solution
          constraints.
                                                    (x11 = 5, x14 = 2, x22 = 2, x23 = 7,
    (C) maximization problem with 3                 x32 = 6, x34 = 12) is :

          variables and 2 inequality                (A) Initial solution by Vogel’s

                                                         method
          constraints
                                                    (B) Optimal solution

    (D) maximization problem with 2                 (C) Initial solution by least cost

                                                         method
          inequality and 1 equality
                                                    (D) Suboptimal solution which can
          constraint.                                    be improved

                                           18
MH SET 2018 question paper, 28 January 2018, Paper III, Computer Science and Applications, page 19 of 24
Page 19 of 24
Text of page 19
JAN - 37318/III—A

64. Consider the following assignment                65. Consider the following network with
                                                         source at S and sink at T :
    problem

                             Mac hines

                         A    B   C   D

                I     10 25 15 20

                II    15 30       5   15
       Jo bs
                III 35 20 12 24                          The maximum flow through this

                IV 17 25 24 20                           network :

                                                         (A) is 16 and has 3 different paths
    The solution to this problem is given                (B) is 14 and has 3 different paths

    by :                                                 (C) is 14 and has 7 different paths
                                                             from S to T
    (A) I            A, II        C, III   B,
                                                         (D) is 15 and has 2 different paths
           IV        D
                                                     66. The output of two-input logical

    (B) I            A, II        B, III   C,            Exclusive OR function............ :

           IV        D                                   (A) is an example of linearly
                                                             separable problem
    (C) I            B, II        A, III   C,
                                                         (B) can be separated with a single

           IV        D                                       line

                                                         (C) can be separated with two lines
    (D) I            B, II        C, III   A,
                                                         (D) needs more than two lines for
           IV        D
                                                             separation.

                                                19                                      [P.T.O.
MH SET 2018 question paper, 28 January 2018, Paper III, Computer Science and Applications, page 20 of 24
Page 20 of 24
Text of page 20
JAN - 37318/III—A

67. A four input neuron has weights 1,
                                                     69. Let X = [x1, x2, x3], Y = [y1, y2] and
    3, 4, 5 and their inputs are 5, 10,
                                                          z = [z1, z2, z3]. Let R be fuzzy
    2, 8 respectively. The transfer

    function is linear with the constant                                     y1 y2
    of proportionality being 3. What is/
                                                                      x1 0.5 0.1
    are its output ?
                                                                      x2 0.2 0.9
    (A) 5, 30, 8, 40                                      relation                    and S be a
                                                                      x3 0.8 0.6
    (B) 83
                                                                                     z1 z2 z3
    (C) 249
                                                                                y1 0.6 0.4 0.7
    (D) 860                                                fuzzy relation
                                                                                y2 0.5 0.8 0.9
68. Suppose two fuzzy sets A and B                        then RoS, by max-min composition
    have the values                                       yields :

    A = {(x1, 1), (x2, 0.7), (x3, – 0.2)}
                                                            z1   z2     z3            z1   z2    z3
    B = {(x1, 0.3), (x2, 0.6), (x3, 0.5)}               x1 0.5 0.5 0.5           x1 0.6 0.8 0.9

    Then the fuzzy intersection A           B        (A) x2 0.6 0.8 0.9 (B) x2 0.9 0.9 0.9
    is........... .                                     x3 0.5 0.8 0.8           x3 0.9 0.9 0.9

    (A) {(x1, 0.7), (x2, 0.1), (x3, – 0.3)}
                                                            z1   z2     z3            z1   z2   z3
    (B) {(x1, 0.7), (x2, 0.1), (x3, 0.3)}
                                                        x1 0.5 0.4 0.5           x1 0.1 0.1 0.1
    (C) {(x1, 1), (x2, 0.7), (x3, 0.5)}
                                                     (C) x2 0.5 0.8 0.9 (D) x2 0.2 0.2 0.2

    (D) {(x1, 0.3), (x2, 0.6), (x3, 0.2)}               x3 0.6 0.6 0.7           x3 0.5 0.4 0.6

                                                20
MH SET 2018 question paper, 28 January 2018, Paper III, Computer Science and Applications, page 21 of 24
Page 21 of 24
Text of page 21
JAN - 37318/III—A


70. Which of the following statements          71. The process state transition diagram

                                                   for a UNIX like uniprocessor system
    is false for fuzzy expert systems ?

                                                   is given below :
    (A) First stage in building a fuzzy


        expert system is choosing


        suitable linguistic variables


    (B) Fuzzy expert system is built by


        creating a set of fuzzy rules


        applying fuzzy inference


    (C) Standard expert systems are


        always more appropriate than               Which transitions are not possible ?


        fuzzy expert systems.                      (A) A, D, G, F


    (D) Fuzzy rules are generated                  (B) C, H, F


        based on expert’s knowledge,               (C) A, C, H, F


        using linguistic variables.                (D) C, G, E


                                          21                                   [P.T.O.
MH SET 2018 question paper, 28 January 2018, Paper III, Computer Science and Applications, page 22 of 24
Page 22 of 24
Text of page 22
JAN - 37318/III—A

72. The link system call in UNIX is              74. Windows uses a HANDLE, which is
    called link (sfname tfname) :                    simply a 32 bit number that refers
                                                     to an object. Which amongst the
    Which of the following statements
                                                     following are windows HANDLES ?
    are true ?
                                                     (1) HDC
    (1) sfname and tfname have the
        same inode after the call.                   (2) HBRUSH

                                                     (3) HMENU
    (2) sfname and tfname have the
        same directory entry after the               (4) HWND
        call.                                        (A) (1), (2) and (4)
    (3) sfname is an existing file before            (B) (1), (3) and (4)
        the call.
                                                     (C) (1) and (4)
    (4) tfname is an existing file before
                                                     (D) (1), (2), (3) and (4)
        the call.
                                                 75. P and Q are amongst the five
    (A) (1) and (3)                                  synchronization objects supported by
    (B) (1), (2) and (3)                             windows.

    (C) (1), (3) and (4)                             P blocks access to a resource until
                                                     some other thread or process signals
    (D) All of the above
                                                     that it may be used. Q prevents a
73. Which global variable in LEX points              block of code being used by more
    to matched string and which global               than one thread at a time.
    variable contains the length of the
                                                     What is P and Q ?
    matched string ?
                                                     (A) Event object, Waitable timer
    (A) yylex, yylval
                                                     (B) Event object, critical section
    (B) lextext, lexval                                  object
    (C) yytext, yyleng                               (C) Semaphore, waitable timer
    (D) lexyy, yylex                                 (D) Mutex, critical section object

                                            22
MH SET 2018 question paper, 28 January 2018, Paper III, Computer Science and Applications, page 23 of 24
Page 23 of 24
Text of page 23
JAN - 37318/III—A
ROUGH WORK




    23                 [P.T.O.
MH SET 2018 question paper, 28 January 2018, Paper III, Computer Science and Applications, page 24 of 24
Page 24 of 24
Text of page 24
JAN - 37318/III—A
ROUGH WORK




    24
Page 1 of 24

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