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

MP SET 2022: State Eligibility Test, Computer Science Application

  • Language: Bilingual
  • 36 pages
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 1 of 36
Page 1 of 36
Text of page 1
R/P/P/S/II/2022                                              Question Booklet No.



                         Sub'ject-COMPUTER SCIENCE & APPLICATION
 ^eT              A                          W(i^PxtpetJ)

                                                           ehlS-4
                                                                                        904000G29
                                                  Subject-Code-4
                                                            Tnhjn^                    yii( fo<^l
                                                   K '      Candidate should write his/her
 Roll No.                                                    Roil No.in the given boxes

  ■gfer         ^ ^Is^n/Nc. of Printed Pages: 32                                           y*<24i/Total No. of Questions : 100
  W?/Time: 2 "HPityHours                                                                            ■"jqf^/Total Marks : 200
                                                                  "feH^ Pt^Vl
  1.                 ^                 3T^ "Sf    t I mh^TCff                    ^ «Tt         RNT        fI , ^ ^
  2. XP't RRtiT "qftgr if ^         f I TO? TOT-"^ (arfNgpf            I-rirtr                                 tj
   "                  IRT
                       :£> ^^Pid
                            V _£."fero Wa t l 6 a-a. «A. ^           JSu.^
                                                                         ^ «^<*d
                                                                            <v4U. 3ft.Tl?.3lR.
                                                                                            ^ WZ
                                                                                               ^t^ |^
                                                                                                    TOtTOT
                                                                                                       ^^  W 1 ^,
                                                                                        ■tTsf ^              'TOT
                                                                                             «»jTm I feftt
      % ICQ TOT f                     % ISO f I                                fefht             rpt if tS:dk tot-to^
          I 'ReltT "jhH if "d'd< ST^kT        leil^ "'rit^Traf W<t PaitA^K T^tr I
  .,.
  3. -Rift TOT grPra^f f i                                                    v ^^                                   *
  4. Rip TI^* ^ 3fe RRFI t* I RtP^T R^ TOT %                    2 3T5T TOH fti? RTTO I :*tUUdi* H.^I<*»H ^ RTTOPI   tI
  5. TOT-'^RcRiT ^ arrarnr ^ rt TOR-^ferar if ctP                   rP rsjt arfett 11RpJ^rof 3tn?RRT f h 1^ to^ TOi-?R?ra;T
      PiViRd RW P'             M f, 3PTOT Rf                         ^
  6. RTOTOT-TO (OT.T?I.RTT. rife) RT                    Pcdttlf TO mH44ch R^R^ ^TTO TOTTOJTnT 3TOkT TO I
  7. tot^TOT-TO(aP.TO.3TrT. vfe^)RTPto^^trtortsTiTOTOr yf«tl\juT                  ar^RTOTRrtr^ i
  8. Rp^nRf Rip T^ TOR TOR-^f^TO^ PmfRd TRTR RT ^ Rp, a<-^a R»^                   d^ 3TO-TO ( TO.Ty.aTIT.                 *<^.1
  9. R^ 1TOP TOR if PntP RTOT TO TO^ ^«i RT RTOTcRR) RTOT TO               Rt TOR ^ 1|TO RRT aiPTO RxRfrlR ? P "f^TO RRTdT
      TO RIRRj RTRT           ^ ^        ^       ^ ^
  10. tTOP RTOT TO «hc^CT6\. Tor TOct arrf^ to rtot rRrt Pi ^ ^                     '       ...     ^
  11. 3:05 RR Rp^ RRTRT pH TO RRR aTt.T?T.aTIT. TOR" TO^RT TO RTTO TO R^RIR.?! RR^fTRT R>^ TJT^ I
                                 ^    INSTRUCTIONS TO THE CANDIDATES
  1.   HiIs Question Booklet is printedin two languages—Hindi andEnglish.Examinees can select any one of the
       two langtiages according to their convenience.
  2.   There are two papers in the State Eligihility Test. The first question paper (compulsory question paper) is
       General Paper on Teaching andResearch Aptitude. The second question paper is the subject selected by the
       examinee. Only one combined OMR sheet willbe provided for both the question papers. The Second paper of
       optional subject willbe given to the examinee at1p jn.The code ofthe second question paper subject selected
       by the examinee should be markedin the OMR Sheet. The booklet number of the second question paper has
       to be markedIn the necessary entries. The examinee can start second question paper at l.*05 p.m. There are
       100 questions in the second question paper (optional subject). The squence of these questions is 61 to 150.In
       a combined OJVLR. Sheet, the examinee should mark the answers of the second question paper in the part of
       Second Question Paper. The examinee himself will be responsible for marking the answer in the wrong
       order.
  3. All questions are compulsory.
  4. All questions carry equal marks. 2 marks will be ^ven for each correct answer. There is no provisions for
       NegativeMarking.                                                                                 .     .       .
  6. On the cover page the number ofpagesisindicatedin the Question Booklet. The examinee should verify that
       the requisite number of pages are attachedin the QuestionBooklet, otherwise he/she should ask for another
       QuestionBooklet.

  7. Kindly mAlce necessary entries on the Answer Sheet (OMR Sheet) only at the places indicated and nowhere else.
  8. Examinee should do all rou^ work on the spaces meant for rough work in the pages given in the Question
       Booklet and nowhere else, not even on the Answer Sheet (OMR Sheet).
  9. If thereis any sort ofmist^e either ofprintingor offactual natureinany question, then out oftheHindi and
       English vexrions of the question, the Hindi version will he treated as stwdard.
  10.Use of any type of calculator,log table etc. is prohibited.
  11.Examinees Will leave the Examination it«tt only after handing over the OMR Sheet to the Invigilator at the
       end of the examination at 3:05 p.m.

S/4/2022/A
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 2 of 36
Page 2 of 36
Text of page 2
TV


             (SPACE FOR ROUGH WORK)




S/4/2022/A
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 3 of 36
Page 3 of 36
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 4 of 36
Page 4 of 36
Text of page 4
56. A sorting algorithm based on binary
             n                ^fiT<^             "Rrq;                comparisons               requires          at
            "^H*                  ^                                   least           comparisons    to    sort   n
      t I                                                             elements.

      (A) [log(/3-l)!]                                                (A) [log(«-l)!]
      (B) [logn!]                                                     (B) [log/?!]
      ■(C) [log(«-!)!]/«                                              (C) [log(«-l)!]/«
      (D) [log«!]/«                                                   (D) [log«!]/«

57.          -qftRTcT         ^                           ^     57. The order of any subgroup of a finite
                        3#^                              "f I         group          the order of the group.
      (A)                       (B)                                   (A) Divides             (B) Multiplies
      (C)                       (D)                                   (C) Adds                (D) All of these

58. feft n ^                            ^ ^ fer^                58.   How many different Boolean functions of
      ■^Pd^H            ^              f ?                            degree n are there ?

      (A) 2"                    (B) 2"-'                              (A) 2«                  (B) 2""'
      (C) 2'"                   (D) 2'"-'                             (C) 2'"                 (D) 2'"-'

59. LP                                           ii STfei       59. In an LP problem, a solution is known
      fete              ferr                     ^                    as       if one or more decision variables

      "fer 3fet                          ■§■*,                        increase indefinitely without violating
      ^             -"^ ^ WT t I                                      feasibility.

      (A) "qfted snted                                                (A) Multiple optimal solution

      (B)                                                             (B) Feasible solution

      (C)                   ■ylr^VH                                   (C) Infeasible solution

      (D)                   ^te?PT                                    (D) Unbounded solution

{5)S/4/2022/A
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 5 of 36
Page 5 of 36
Text of page 5
60. m                   ri        ^RTTfepT hT-scti   60. In transportation model having m rows
          . "4',                       =h'feVH t, '^,          and « column, degeneracy is a condition
                                 MTFjllicl ^Ri<Rq1             where the number of positive variables in
                                                               the basic solution is less than :

           (A) m + n-1           (B) m + n — 2                 (A) m +n~l            (B) m+n-2
           (C) m+n~3             (D) w + w-4                   (C) in+n—3            (D) m + n~A

I
    61.            dTf^ch        ^         ^^            61. Which logic gate is also known as
            t ?                                                inverter ?

           (A) AND GATE (B) OR GATE                            (A) AND GATE          (B) OR GATE
           (C) NOT GATE          (D) XOR GATE                  (C) NOT GATE          (D) XOR GATE

    62. K ^ 1 HcrtilkJ^cHK                               62. The number of input to an n to 1
           ^ TOR ^ ^ t :                                       multiplexer is given by :
           (A) «                 (B) « + 1                     (A) n                 (B) n + 1

           (C)                   (D) 2'^(«-l)                  (C) 2-n               (D) 2^(«-l)
    63.              tlfVd      ^                 ^      63. The technology used to              fabricate
           "^i-l ^leil TOirt^ qiecniol t" :                    integrated circuits is called :
           (A) fe^ldoi               Mrm                       (A) Digital Signal Processing
           (B) ^I^s6l=h4ldl ylyiPHM                            (B) Microcontroller Programming
           (C)                             ^                   (C) VLSI (Very Large Scale Integration)
                                                               (D) FPGA (Field Programmble Gate
          (D) ■QTp.lt.^.-q;. (Tfe                ■^)                Array)

                                                         64.   Which error detection code is based on
           sTTSinfer t ?                                       polynominal division ?
           (A)         ^                                       (A) Parity check
           (B) ^^qRRT                                          (B) Checksum
           (C) ^.3nT."Rt.                                      (C) CRC (Cyclic Redundancy Check)
           (D) tfTFT                                           (D) Hamming code
    (5)S/4/2022/A                                                                                  P.T.O.
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 6 of 36
Page 6 of 36
Text of page 6
65.                                        E5 ^               65.   The hexadecimal number E5 in decimal
      t:                                                            is equal to :
      (A) 229                      (B) 197                          (A) 229               (B) 197
      (C) 2290                     (D) 1970                         (C) 2290              (D) 1970

66. ST^T^rl^TcfhT 3Tn ciifV=ti •W'ciiei'1 ^ mR'JIIhT          66. Which register is responsible for
                                                                    temporarily     storing   the   result   of
                                     t ?                            arithmetic and logical operations ?
      (A) "Hkm                (PC)                                  (A) Program Counter (PC)

  ■ (B)                    (ACC)                                    (B) Accumulator (ACC)
      (C)                   Tf^ (MAR)                               (C) Memory Address Register (MAR)
      (D)                          (IR)                             (D) Instruction Register (IR)

67.                "giei     ■^'               "^ctiidi       67. CPI recently became more important
            Rny.                          ^ cjeiii "^f              performance metric than the clock cycle
                            3K#T             ^ -TO t                rate for processor performance index,
                                                                    because :


      (A)          Tft^              RTOR7      Wm                  (A) Increasing processor clock cycle
                                                                        rate is almost reaching the physical
                             cRi" ^7^ 7^ "I I
                                                                        limit.
      (B)                  ct^T=b WR)^         Ritr^Qi
                                                                    (B) CPI and clock cycle rate are the
            RRFT 37?f ^ ^ f 1
                                                                        terms having exactly the same
      (C) Tlt^ ^                     "RR^ te fer                        meaning.
            f^ RIr ^                  ^           t I               (C) Processor clock cycle rate can be
      (D) ■#."^.31Tf.              1 ^         ^t                       increased without any limit.
            3^             RR^ te ^."^.aTll. ^                      (P) CPI is always equal to 1 and clock
                           f" I                                         cycle rate is same as CPI.

(5)S/4/2022/A                                             ^
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 7 of 36
Page 7 of 36
Text of page 7
68.   The      microinstruction       format   in
     3ilHrtl<       "f^TR      SKI             Rti'Hi "^jTI^             microprogrammed control is usually
     t:                                                                  determined by the :
    (A)                ^                                                 (A) Instruction set architecture
    (B)                        BhcH^'^l                                  (B) Processor clock frequency
    (C)                       ^ 3WR                                      (C) Size of the control memory
    (D)                              ^ TOK                               (D) Type of the microprocessor used

69. PiHldRsJO               ^ ^?RrHT .qFTSH                        69. Which of the following statements
                                       Tt^ (DMA)                       accurately describes Direct Memory
           /Hilch            ch<dl ■!■ ?
                                                                       Access (DMA) in computer system ?
     (A) DMA        d^'ilcti t" RunCM <iH^Vi
         ^         ^           ^ %?R                                     (A) DMA is a technique used to
         ^ Rny, Rti-Hi «TTciT ■§ I                                             improve the performance of a cache
     (B) DMA       TOR ^           t I^ITOT                                    memory.
           Wih :5RT                                    ^                 (B) DMA is a type of interrupt used for
                     Rny, Rti^i "^idi "1"
                                                                               handling errors in data transmission.
     (C) DMA                   ^          ^
         ^llPMel fer fro        ^ ^ ■?33%                                (C) DMA allows peripheral devices to
                               '^* T®?PTfclfRT ch<^                          transfer data directly to and from
                      ^ t                                                      memory without involving the CPU.
     (D) DMA "Q^ ^ t                      TO                             (D) DMA is a mechanism that enables
                                                                               multi-threading       and    parallel
                    TOcTT t                                                    processing in a processor.

70. Pl^1 cJ^ji         "^KT "q;^                   "Rr^R           70. In a multiprocessor system with private
     "^, ^ ^y'JIddl                    ^ %TT sWr                         cache,    which     of    the     following
     RT PiHRrlRsJd "^f          1^ m RR                                  mechanism      is   commonly      used   to
            RRTT t ?                                                     maintain cache coherence ?

     (A) R^-'^Ri" yldlcbiel                                              (A) Write Back Protocol
     (B) Rjfro ylilRiM                                                   (B) Snooping Protocol

     (C) RRRRvi^ RR^ ylciUTd                                             (C) Exclusive Access Protocol

     (D)                       TO^ (DMA)                             • (D) Direct Memory Access (DMA)

(5)S/4/2022/A                                                  !                                              P.T.O.
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 8 of 36
Page 8 of 36
Text of page 8
71. OPEN GL                ^         STT ?              71.   OPEN GL was released by :

      (A) HI^ShUnT^ri                                         (A) Microsoft

      (B)                                                     (B) Silicon Graphics

      (C) 13^                                                 (C) Apple

      (D)^                                                    (D) Google


72.                            (■qH.^.'sft.) f :        72. Scalable Vector Graphics (SVG) is ;

      (A) C ^                                                 (A) C language

      (B)        W                                            (B) Java language

      (C) C++ 'm                                              (C) C++ language

      (D) XML Wf                                              (D) XML language


73.             ^TTfefOT           -t I                 73. Unified Modeling Language (UML) is a

      (A) TtelfrPT ^                                          (A) Programming language

      (B) 1^31^ ^T^PdM ^                                      (B) Visual Modeling Tool

       (C) =+>uj|^eK                                          (C) Compiler

       (D)                                                    (D) Operating System


74.            ^ WlW fTT=T -^f               ^JlRTT :   74.   Constructors are not used in the :


       (A) C ^                                                (A) C language

       (B) C++ TO                                             (B) C++ language

       (C) Java TO                                            (C) Java language

       (D) C# TO                                              (D) C# language

(5)S/4/2022/A
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 9 of 36
Page 9 of 36
Text of page 9
75. C++         ^                   ^         ^     75. In C-H-, short occupies two bytes gives

                       t I                                range from :

   (A) - 32768 ^ + 32768                                  (A) - 32768 to + 32768

   (B) - 1024 ^ + 1024                                    (B) - 1024 to + 1024

   (C) - 1 MB ^ + 1 MB                                    (C) - 1 MB to + 1 MB

   (D) -2,147,483,648 to + 2,147,483,648                  (D) - 2,147,483,648 to + 2,147,483,648

76. C++               3;Tfqte              ^fen     76. Which operator cannot be overloaded in
    ■^3IT       t ?                                       C++ ?


    (A) aferfeft^ afqfer                                  (A) Arithmetic Operators

    (B) Reli^Hd 3Tfqte                                    (B) Relational Operators

    (C) "fei                    srfqter                   (C) Scope Resolution Operators

    (D)               arfqte                              (D) Subscript Operators


77. XML ^ ^ "4*                  "^1^ ^jfer ^ ?     77.   The valid statement about XML :


                                                          (A) All XML elements must be properly
    (A) ^ XML                Tjpfe: ^
                                                              closed


    (B)         XML ^                     ^ •4' ^         (B) All XML elements must be in lower

                                                              case



                                                          (C) All XML documents must have a
    (C) ^ XML             ^ DTD #TT
                                                              DTD
            \




    (D) ^                       t                         (D) All the statements are true

(5)S/4/2022/A                                                                               P.T.O.
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 10 of 36
Page 10 of 36
Text of page 10
78.                      ^ "q^ ^ ^ 100                  78.   We want to assign 100 to first element
                t, cit ^ [HHi:i^i<          1^                of the following array, select not
      ^ ^H<^idT f" ?                                          acceptable :

      a[]= {10, 20, 30, 40}, i = 1                            int a [] = {10, 20, 30, 40}, i = 1 :

      (A) i - 1 [a] = 100;                                    (A) i - 1 [a] = 100;

      (B) 0 [a] = 100;                                        (B) 0 [a] = 100;

      (C) (i - 1)[a] = 100;                                   (C) (i-l)[a]=100;

      (D) [a] 0 = 100;                                        (D) [a] 0 = 100;

79. C ^ ^              TTTO     ^^ t ?                  79.   Which is not loop in C ?

      (A) for                 (B) while                       (A) for               (B) while

      (C) do-while            (D) until-repeat                (C) do-while          (D) until-repeat

80.                                  TTTfWT ^           80. Which of the following is Computer
      t ?                                                     Graphics curve ?

      (A)          qf^                                        (A) Bezier curves

      (B) afdWr^d ^                                           (B) Implicit curves

      (C)        ^                                            (C) Explicit curves

      (D)                                                     (D) All of the above

                                                        81.   A collection of concepts that can be used
             ^                      3i^!?nqn3^f ^             to describe the structure of a database is :
            t:
                                                              (A) Data type
      (A)^
                                                              (B) Database
      (B) "srei^
      (C) ■siei "qfe^                                         (C) Data model

       (D) siei WIhi                                          (D) Data schema

(5)S/4/2022/A                                       8
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 11 of 36
Page 11 of 36
Text of page 11
82. To find the details of all employees
      ^ 1^ f^H^ii "te 50,000                   "STR            where salary is above Rs. 50,000, which
             Pi^-iRriRaa ■^*                                   of   the   following      tuple   calculus
                     ^ t ?                                     expression is correct ?
       (A) {t I EMPLOYEE (0 AND t. Salaiy                      (A) {t I EMPLOYEE (/) AND t. Salary
              > 50000}                                              > 50000}
       (B) {Select EMPLOYEE (0 AND                             (B) (Select EMPLOYEE (/) AND
              t. Salaiy > 50000}                                    t. Salary > 50000}
       (C) (Select EMPLOYEE AND Salary                        (C) (Select EMPLOYEE AND Salary
              > 50000}                                              > 50000}
       (D)              ^                                     (D) All of the above

83.   ER       4m\H                                      83. In ER-diagram, derived attributes are
       Pi*^I^naa "^f Rh^=ti OT RtsiHI "SfM f ?                represented by :
      (A) sTi-s 37t^                                          (A) Dotted Oval
      (B)             3teT                                    (B) Double Oval
      (C) -soKn -sTis                                         (C) Double Dotted Oval
                      3TTO                                    (D) Double Rectangle

84.          7|tt                    R(A, B, C, D)       84. Given the relational scheniaR(A, B, C, D)
      ^ FDsA => B                  BC => D ^
                                                              and FDs A => B and BC => D. Determine
      ^ "f^^IRo qilRiy.                        ^
                                                              which of the dependencies shown below
                               FDs ^ "SIM ■^* ^
                                                              cannot be derived firom these FDs ?
      ■5IT           t ?
      (A) AC            D                                     (A) AC => D

      (B) B => D                                              (B) B => D

      (C) AC            B                                     (C) AC => B
      (D)           (B) 3=lk (C)
                                                             (D) Both (B) and (C)
(5)S/4/2022/A                                        J                                           P.T.O.
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 12 of 36
Page 12 of 36
Text of page 12
85.          ^           ^ ^ -of                   ^         85. A given population of events or items are
      WT                 ^^           I^^TTf^ ^
                                                                  partitioned into sets of similar elements
      ^ h1^<HI        PlM      -TFT       "^^TFTT "^SHcTT
                                                                  is known as :
      t:
                                                                 (A) Pattern with time series
      (A) "^iT^ ^<3011      "^TT^ "^cpf
                                                                 (B) Clustering
      (B)
                                                                 (C) Classification Hierarchies
      (C) ^*Kni M<i^shH
      (D)                                                        (D) Association Rules


86.           -sit                ^ "qfecNf ^                86. A database which permits the database
             ^              ^             sr^i# ^                 system to store history of changes and
      t sk wfm^sif ^                      ^
                                                                  allows users to queiy both current and
      ^     ^ 37^^3^f      qf^
      ^^hRi     "f^F^ ^ HFT "^STHT                                past states of the database is known as :

      f:                                                          (A) Temporal database
      (A) ^Wl<el
                                                                  (B) Spatial database
      (B) ^F^3M ^l<il<i^
                                                                  (C) Deductive database
      (C)

      (D) V^mi ^THl^                                              (D) Expert database


87. rHHPeiRsid       ^ 1^                            ^       87. Which of the following is also known as

      ^ ^ ^ ^^ t ?                                                galaxy schema ?

      (A) W                                                       (A) Start schema

      (B)       "q^                                               (B) Snow Flake schema

      (C)                                                         (C) Fact constellation schema

      (D)                                                         (D) Redundant schema

(5)S/4/2022/A                                               10
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 13 of 36
Page 13 of 36
Text of page 13
88t                            -^idi     Pi^^r^RsJd
                                                        88. In data-warehouse data sources can be
              r=b^H4)l wjw                Tsn
                                                              constructed using :
        t?
                                                              (A) Similar schema and data model
       (A)               ■?:^7t^Tr 3?k    ifef
                                                              (B) Different schema and data model
        (B)                 ^Ihi sik "OT

        (C)             ■^^^krr sSk                           (C) Similar schema and different data

                                                                  model


       (D) ^517^ ^                                            (D) All of the above


89                    ti^ 4ii^crl "I"                  89               is the main file that drives the

                ^ "^T^rfecl ch<a1 "i" I                      Map reduce process.

       (A) Mk                                                (A) Mapper

       (B)                                                   (B) Reducer

       (C)                                                   (C) Driver

       (D) y.RM=Hici<                                        (D) Executer


90. sidl-^^                        1^     ^^           90.   A database that has a set of associated

       t-             ^ ^ -snrn t I                          triggers is known as :

       (A)          ^|(il<5^H                                (A) Active database

       (B)              <Slil«^«                             (B) Operational database

       (C) 41't^Hd "STHI^                                    (G) Functional database

       (D) ^nhiPh^                                           (D) Dynamic database

(5)S/4/2022/A                                     n                                             P.T.O.
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 14 of 36
Page 14 of 36
Text of page 14
M
91.                                             ^        91. A system call is invoked by :
      t i
                                                               (A) Polling
      (A)
                                                               (B) Software interrupt
      (B)

      (C)                                                      (C) Instruction

      (D) W                                                    (D) Jump

92. 17F ^ilf^ %                 ■TO 12 TOR               92.   Suppose we have 12 identical resources
      4l #T "Slf^ Pi, P2 ■ -sfk P3 t I                         and 3 processes Pj, P2 and P3. The
                    3?teTO ^                   10, 5,          maximum claims of the processes are 10,
      3 t I         "Hfeir Pj ■^' 8                            5, 3 respectively. Currently, the process
      f, P2 ^ 2 TOPR t afR P3 -^T I TOm                        Pj holds 8 resources, P2 holds 2
      t I                                                      resources and P3 holds 1 resource.
      PHHRiRsid -^r                              t ?
                                                               Which of the following is/are correct ?
      (i) fero                           t I
                                                               (i)   The system is in safe state.
      (ii) fero                           t I
                                                               (ii) The system is inninsafe state.
      (iii)                       =Ri4     Riy. =hM
                                                               (iii) The minimum one more resource is
                 "^H     i<=h    ai^C
                                                                     needed to make it safe state.
              STR^^RhIT t" I
                                                               (iv) The unsafe system does not employ
      (iv) ai^^ -spiM 4^<rlTd> ^ a^fefR
                                                                     the existence of deadlock.
              ^ "fpR R^' "TOlt t' I
                                                               (A) (i) and (iv)
      (A) (i) 4?: (iv)
                                                               (B) (ii) and (iii)
      (B) (ii) afl^ (iii)
                                                               (C) (ii) and (iv)
      (C) (ii)a^k(iv)
      (D) (ii), (iii) aik (iv)                                 (D) (ii), (iii) and (iv)

(5)S/4/2022/A                                           12
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 15 of 36
Page 15 of 36
Text of page 15
93. T3^ ^                        ^          ^^ f^         93. One thread immediatly terminates the
                          ^ ^^ t I                               target thread is called ;
        (A) 3T^^qg7T%^                                           (A) Asynchronous cancellation
        (B)                 ri<wl=b<"I                           (B) Deferred cancellation
        (C) ^c^ctiilcrlch RiWlcbi^i                             (C) Synchronous cancellation
        (D)                  ^^                                 (D) None of the above

 94.         t^STf^ "q^          ctORil^,    ^TTf^RTFT     94. Consider the situation where several
        "^FIPT -Sldl        "^RT^cff "^vq           sfir        processes access and manipulate the
               qi<dl              Pi^Mim qq qf^qiFT ^           same data concurrently and the outcome

                       qr "fq^ ct)<ai t", I^rt^                 of the execution depends on the
                                                                particular order in which the access takes
        ^Itii "t" I ^"f^srfq cfi^eiicil "I" :
                                                                place. The situation is called :-.
       (A) ^-soiTct)
                                                                (A) Deadlock
       (B) "qf^Rq ^^qqqFR
                                                                (B) Process synchronization
       (C)
                                                               (C) Race condition
       (D)                =ti*-s1;fM                           (D) Unsafe condition

95. ■^.q^.'^. fe STqqm 98% t I ^.qef.^.                    95. The TLB hit ratio is 98%. ' It takes
       ^ <al^^ ■^' 20                       eiq^ f sik         20 nanoseconds to search the TLB and
              'm qfq^ ■^* 100                     w\^          100 nanoseconds to access memory.
       f I qqr^                             ^^ ?               What will be the effective memory
                                                               access time ?
       (A) 100
                                                               (A) 100 nanoseconds
       (B) 122
                                                               (B) 122 nanoseconds
       (C) 130
                                                               (C) 130 nanoseconds
    (D) 140                                                    (D) 140 nanoseconds

(5)S/4/2022/A                                        13
                                                                                                     P.T.O.
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 16 of 36
Page 16 of 36
Text of page 16
96.                             6 wm "mm                96. A computer system has 6 identical
            "t I "3^                                         resources. There        are   n   processes
      n         f I           y[^Mi      2                   competing for them. Each process may
      ^                 ^             t- I « ^               need 2 resources. What will be the

                    ^ #1T,                                   maximum value of n so that the system
      -^^dT=6 "3^ ^ ? .                                      is deadlock free ?

      (A) 2                  (B) 3                          (A) 2                 (B) 3

      (C) 4                  (D) 5                          (C) 4                 (D) 5

97. fshfi^bcri Xh^FT "I" :                              97. A critical region is :

      (A)      ^ ^H14>1< "qr P 3ft^ V                       (A) One which is enclosed by a pair of
            ^ "Q^                     ^-371 t" I                    P and V operations on semaphores.

      (B)      "HhiTH             ^-"3^                     (B) A program segment that has not
               fair t I                                             been proved bug-free.

      (C) TT^ 3ihinT            ar^ an-ar^^                 (C) A program segment that often
            feaiT^^                     tI                          causes unexpected system crashes.

      (D) TT^ 4i|4s6H                        "RHT^*         (D) A program segment where shared
            ^ wto             ^5TRIT f i                            resources are accessed.


98.         ^TTOT ^                        ^            98. A virus that mutates with every infection

      a^rfMcfcf ^ t :                                        is :


      (A) 3^ ^TTOT                                          (A) Stealth virus

      (B)               wm                                  (B) Metamorphic virus

      (C) MldlMWch ^PRH                                     (C) Polymorphic virus

      (D) aTF^FTffxji^ ^TTOT                                (D) Ultramorphic virus

(5)S/4/2022/A                                      14
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 17 of 36
Page 17 of 36
Text of page 17
99.                        "sMtpt m\                      -qr    99. The            represents a commonly used
        wtW                                    ^           ^           group of codes in a source programming
                       WT t I                                         language.

        (A) W                                                         (A) Loop

        (B) -wm                                                       (B) Branch Statements

        (C)                                                           (C) Macro

       (D) "^1%^                                                      (D) Functions

 100. "q;^ RiWH                                    ^             100. A system uses paging and segmentation,
               t,                              "4* 8 ■tlqAd           the virtual address space consists of up
              f,          wc^ctJ             2^9                      to 8 segments where each segment can
              ^              f I                                      be up to 2^9 bytes long. The hardware
       ^ 256-^112 '^'                                     f I         page each segment into 256-byte pages.
                                                                     How many bits in the virtual address are
       Rny. Rid-^ f^d-H                 -JKFv^d "?H1" ?              needed for page numbers ?

       (A) 3                       (B) 8                             (A) 3                 (B) 8
       (C) 32                      (D) 21                            (C) 32                (D) 21

101. 3iiq^fHet>aii<        % ^HT4d<^^<                    ^ff    101. Requirements     which    specify   the
                   ^               ^ f, ct^^dld)                     constraints imposed on the software are
       t :                                                           called :

       (A)            3llcli;qct>fin^                                (A) Domain requirements
       (B) ^l^[rH=h                                                  (B) Functional requirements

       (C) ^-qiiqlcH^ti 3liq^;qchcliy[                               (C) Non-functional requirements
     (D)                   ^ ^                                       (D) None of the above

(5)S/4/2022/A                                               15                                         P.T.O.
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 18 of 36
Page 18 of 36
Text of page 18
102.                                        ^ TTSZT    102. Exchange of data between two modules
       •Siei ^                         ■gRI
                                                            in a structure chart is shown by :
       ^ t ?
                                                            (A) Data couple
       (A) ^
                                                            (B) Flag
       (B)

       (C) ^                                                (C) Condition

       (D)           -^f    ^                               (D) None of the above

103.         P ^fer                t, L ^ t,           103. If P is risk probability, L is loss, then
                  3Pn^ -(RE) ^ WIT ^ WR                     Risk Exposure (RE) is computed as :
       ^ ^ f :
                                                            (A) RE = P/L
       (A) RE = P/L
                                                            (B) RE = P * L
       (B) RE = P * L

       (C) RE = P + L                                       (C) RE = P + L

       (D) RE = P * L/2                                     (D) RE = P * L/2


104. W«^'4< ^                 ^        ^ 3#T^          104. Cost of software mainjejiance-is very

             t I WfJ^CR ^                       T^*         high. A large amount of'software life-
                                                                                          s)   ■>'
       «si«aici             ""IT                            cycle   costs   is   expanded, in        the

       i\ ^ t I rHHPdRsid "4* ^                             maintenance activities. The maximum

       «£i<^ici            ^ ^?^^krt ^rtrt ^                effort spent on which of the following

       PtJ^i "^ndT ^ ?                                      maintenance activities ?


       (A)           (lM^)                                  (A) Preventive maintenance

       (B) 1WTO7                    IteR^Ici                (B) Corrective maintenance

       (C)           (T^srfer) <<or^2||c|                   (C) Adaptive maintenance

       (D)                                                  (D) Perfective maintenance

(5)S/4/2022/A                                     16
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 19 of 36
Page 19 of 36
Text of page 19
105.                           ^             -qs?         105. All activities which are on critical i«th
       ^f,"3™                    "WT            f:               have slack time equal to :
       (A) 0
                                                                 (A) 0
       (B) 1
                                                                (B) l
       (C) 2                                                    (C) 2

       (D) <14^^            ^ ^ -^T^'                           (D) None of the above

 106. Pi^RriRaa                                            106. Which of the following architectures is

       1^                ^ st3^q^ ^R^lfHd                        characteristized   by   a     series   of

         mRc<M                   ^     -siHr -snctr f?          transformations on orderly defined set of
                                                                input data ? .
       (A) -Sltil
                                                                (A) Data centered architecture
       (B) -sicii y<^i^
                                                                (B)        flow architecture
       (C) W ^iRh'^cfdi ■
                                                                (C) layer architecture
       (D)          1^* -Rs^ snRif^^
                                                                (D)- Call and return architecture
                    •S




107.         32-fe                       1^ Tcj^           107. If a program has two integer inputs on a
       ^      "'jyfe             f; ci^ 1^ "gfenH ^             machine with a 32-bit word, then how

       t^Kf^ -H^lRid ^ c^                ?                      many, possible test cases does ;this
                                                                program have ?
    (A) 216
                                                               (A) 216        \
    (B) 232                  .
                                                               (B) 232
    (C) 264
                                                               (C) 264
    (D) 2128
                                                               (D) 2*28

{5)S/4/20^2/A                                         17                                            P.T.O.
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 20 of 36
Page 20 of 36
Text of page 20
108. PiHroiRsld           ^                   ylilHl     108. Which of the foiiowmg is a calculated
     "5TOT/C0C0M0"MET ^ TOI                                     value of programmer effort/COCOMO
      <5^                               RiUi                    effort for an organic project under the
     ^ ST^Sl^ ^fhlFT ^ M                       t -q;^*          category of application program with
            ^              10 K           ^                     estimated size of -10 K Line of Code
     t ?                                                        (LOC) ?

     (A) 13.0                  (B) 26.9                         (A) 13.0             (B) 26.9
     (C) 41.2                  (D) 55.8                         (C) 41.2             (D) 55.8

109. ^Pl4i<0 COCOMb "RT^                                  109. In basic COCOMO model, effort for,
           ^       (1^)
                                                                embedded system is given by :
            «ncii "I" .?
                                                               (A) 2.4 * (KLOC )l-05
     (A) 2.4 *(KLOC )l-05
     (B) 3.0 *(KLOC )l-120                                     (B) 3.0 * (KLOC )I-120

     (C) 3.6 * (KLOC )l-20                                     (C) 3.6 * (KLOC )i-20
     (D)                   ^^                                  (D) None of the above

110. ^ 10 "Mf '%                  ^ ^Rr                   110. If the software had 5 failures in 100 tests
     R'- ICQ                   5 Ri4iddnt          cit         during 10 days of testing, what would be
                                                               a good estimate of the reliability of the
     3T^ 3T3RR ^                  (yfdRd 10 "RltW              software over the next day (assume 10
     ■RR               10' "Mf ^ 3^ ^) ?                       test per day, average from last 10 days) ?
     (A) 0.05                                                  (A) 0.05

     (B) 0.027                                                 (B) 0.027

     (C) 0.005                                                 (C) 0.005

    (D) 0.598                                                  (D) 0.598

{5)S/4/2022/A.                                       18
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 21 of 36
Page 21 of 36
Text of page 21
111.                       ^          ^             111. What is the worst case time complexity
        =hTi^[^cl| ^ t ?                                • of a quicksort algorithm ?

        (A) 0(N)                                          (A) 0 (N)

        (B) 0(N log N)                                    (B) 0 (N log N)

        (c) o m                                          (C) O (N2)

        (D) O (log N)                                    (D) 0(logN)


 112. AVL (^.^.T3^.) ^ ^ t ?                        112. What is an AVL tree ?

     (A)                      t                ^         (A)- A tree which is balanced and is a

                                                              height balanced tree

     (By           ^ 3W^              ^                  (B) A tree which is unbalanced and is

           "1^ ^ ^                                            a height balanced tree

     (C) ■#!                                           . (C) A tree with three children

        (D) 3#IWT #t                       ^             (D) A tree with at most three childrens


113. Pi+^l^Rafl         "RfiH M.tr'ilR^^            113. Which ofthe following design techniques
     wiNr         wih             ^
                                                         is used in Quick Sort algorithm ?
               ^t ?
                                                         (A) Greedy algorithm
     (A) M
                                                        (B) Divide and. conquer algorithm
     (B) feqi^-s «[k             wrtR^
    (C) h\ tfel                                         (C) Hash table


    (D) ^iiRfn                                          (D) Parsing

(5)S/4/2022/A                                  19                                            P.T.O.
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 22 of 36
Page 22 of 36
Text of page 22
114.                                 :                  114. In the input restricted deque :
         (A)                ^ (iM           "q^ "sf^fe         (A) insertion at only one end, rear end
         (B)                    Cot^ -^) -q^ f^eilqq
                                                               (B) deletion at only one end, ftont end
         (C)           M,         3ik        ^M
                                                               (C) insertion at both ends, rear and front
               ■qr
                                                                    end

         (D)             ^
                                                              (D) All of the above

 115.                  ^ "qq?           ^       -qi^ 115. What is the number .of edges present in
                     ti'oqi qqr "f ?                          a complete graph having 'n' vertices ?

         (A) («*(«+l))/2                                      (A) («*(«+l))/2
         (B) («*(«-l))/2                                      (B) {n*{n-l))/2
         (C) «                                                (C) n

        (D) ^ Tff Tsnqqqt srq^ t                             (D) Information given is insufScient

116.                                    ^                116, Which of the following sorting

    .                        ^ t ?                           algorithms has the lowest worst case

                                                             complexity ?
        (A)          ^ ■
                                                             (A) Merge sort
        (B)
                                                             (B) Bubble sort
        (C) "fq^ ^
                                                             (C) Quick sort

        (D)
                                                            (D) Selection sort

(5)S/4/2022/A                                      20
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 23 of 36
Page 23 of 36
Text of page 23
117. ^                            (n ~ 1)                   117. Suppose a circular queue of copacity
                     ^^            ^ -q^T                          (« - 1) elements is implemented with an
                  CIM]^     "T^ "I" I TfH                          array of n elements. Assume that the
       1^             3^ "feefto 3Tfq^ ^TOT:                       insertion and deletion operation are
       "f^ (REAR) sfk "5^ (FRONT)                                  carried out using REAR and FRONT as

                 wnt                 ^^             4'             array index    variables, respectively.
       fe?T ^t i -m^               REAR = FRONT                   Initially REAR = FRONT = 0. The

       =0 I        ^       cf^rr         ^         t:              conditions to detect queue full and queue
                                                                   empty are :
       (A)        : (REAR + 1) mod n = =
                                                                  (A) Full : (REAR +1) mod n = =
                                             FRONT
                                                                                                   FRONT
                    : REAR = = FRONT = =
                                                                       Empty : REAR - - FRONT - =
                                                 NULL
                                                                                                     NULL
       (?) lyf • (REAR + 1) mod n = =
                                                                  (B) Full : (REAR + 1) mod « = =
                                             FRONT
                                                                                                   FRONT
               ■<s)ieil : (FRONT + 1) mod n = =
                                                                       Empty : (FRONT + 1) mod n = =
                                                 REAR
                                                                                                    REAR

       (C)        : REAR = = FRONT                                (C) Full : REAR = = FRONT
               ^siidl : (REAR + 1) mod n ~ =                           Empty : (REAR + 1) mod n = =
                                             FRONT                                                 FRONT

       (D) ^ : (FRONT + 1) mod « = =                              (D) Full ; (FRONT + 1) mod « = =
                                                 REAR                                              REAR

                   : REAR = FRONT                                      Empty : REAR = FRONT

118.                                 ^H'siPdcl               118. The best data structure to check whether

       t "qr       "ZTF      ^                                    an arithmetic expression has balanced
       "^TC^ t" :                                                 parentheses is a :

       (A) ^                (B) ^                                 (A) Queue            (B) Stack

       (C) ^                (D) Tira-                             (C) Tree             (D) Graph

(5)S/4/2022/A                                           21                                           P.T.O.
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 24 of 36
Page 24 of 36
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 25 of 36
Page 25 of 36
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 26 of 36
Page 26 of 36
Text of page 26
126. fF#Tfer IJm              ferR          :         126. Consider the following grammar :

               S —> ABSc I Abe                                    S ^ ABSc I Abe

               BA^ AB                                             BA-> AB

               Bb ^ bb                                            Bb -> bb

               Ab ->• ab                                          Ab -> ab

               Aa -> aa                                           Aa -> aa

             "iTO OT PinRrlRsid     ^                       Which of the following statements can
                      ^           t ?                       be derived by this grammar ?

       (A) aab              (B) abc                         (A) aab              (B) abc

       (C) abcc             (D) abbe                        (C) abcc             (D) abbe


127. ^-RchRic^              "RTf^ ^                    127. Non-recursive predictive parsing is
       ^                                   t,               constructed using stack that contains :
       %•             qRW          t I
                                                            (A) Parsing table
       (A) ■qiRRr
                                                            (B) Sequence of grammar symbols
       (B) imi             ^
       (C) chciei                                           (C) Only terminals

       (D) G                                                (D) G


128.         fjTRFT        m          t, ^             128. A dangling reference occurs when there
                                   -RrtT        t I         is a reference to storage that has been

       (A)                                                  (A) Allocated

       (B)                                                  (B) Reallocated

       (C)                                                 (C) Deallocated

       (D) <iH^<W ■^' ^                                    (D) None of the above

(5)S/4/2022/A                                     24
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 27 of 36
Page 27 of 36
Text of page 27
129. Pi^RnRsid                              -CR
                                                             129. Consider the following C-code segment:
          ctilRjiiJ :
                                                                        a=b+c
                 a= b + c
                                                                       c=a+ I
                 c=a + I

                 d= b + c                                              d= b +c

                f=d+ 1                                                f=d+\
                 g= e ++
                                                                       g= e + +
         tTFT           ^^                           ^
                                                                 Suppose this code segment is represented
         ^                araiffer^ tjTttt (DAG)^
                "4* irMt                   t, ^ dag              internally as directed acyclic graph, then
                 ^ "^Rs^TT f :                                   the number of nodes in the DAG is :

        (A) 4                    (B) 5                          (A) 4                (B) 5
        (C) 6                    (D) 3                          (C) 6                (D) 3 . '
 130. Pi^-iRiRaa                       [^<=h(r^/f^cti(r^T ^ 130. Which of the following represents
                                                                intermediate codes ?
        (A) teq^                                                (A) Triples
        (B)                                                     (B) Quadriples
        (C)                  f^Hcr^                             (C) Indirected Triples
        (D)             ^                                      (D) All of the above

 131.             i^* 3?^ ^ ^ 10 base-2                    131. Coaxial cable 10 base-2, used on ethemet
                                                                can also be known as :

        (A) fe"                                                (A) Thick coaxial cable
    (B)                           qioiQi                       (B) Thin coaxial cable

    (C)                 '^'4< ch=<Cl                           (C) Twisted pair cable
    (D) ^3^?^ "4* ^ ^                                          (D) None of the above

(5)S/4/2022/A                                         25
                                                                                                  P.T.O.
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 28 of 36
Page 28 of 36
Text of page 28
132.                   f^M, OSI                132. Which layer of OSI reference model is

       ^          im           t ?                  responsible for data compression ?

       (A) "QT^rt^^                                 (A) Application layer

       (B) W-^yn ^                                  (B) Presentation layer

       (C)        ^                                 (C) Session layer

       (D)                                          (D) Transport layer


133.               ^^ mTR ^1^                   133. The      propagation      speed      of

       t:
                                                     electromagnetic signals depends on the :

       (A)         ^                                (A) Frequency of the signal

       (B)                                          (B) Communication medium

       (C)        (A) sk (B)                        (C) Both (A) and (B)

       (D)           -^f ^ ^                        (D) None of the above


 134. ^Q^<r1< AicjcH? ^               C"^), 134. Which generation of cellular networks is
             cRf ^        r^r^M      STT^ftd        . completely based on packet switching
                                                     technology ?
        t?

        (A) 4G                                       (A) 4G

                                                     (B) 3G
        (B) 3G_

                                                     (C) 2G
        (C) 2G

        (D) IG                                       (D) IG


 (5)S/4/2022/A                                 26
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 29 of 36
Page 29 of 36
Text of page 29
135. ^14-51                        "qr              135. Which is an overlay network on the top

                  3TfeT?[ "3^ ^ -^rref -q;^ a;te^         of public networks but with most of the

      ^(iq<4 ^?Nh "t ?                                    properties of private network ?

      (A)                                                 (A) VPN

      (B) 3fN^                                            (B) Proxy

      (C) ^.T^q.T3^.                                      (C) DNS

     (D)                                                  (D) Radius


136. "R^M                ^ Rs?f^ R, wfeq             136. What is the semantics HTTP error status

      R           Mfe^ HTTP 1311 -^fer ^                  code   related   to   Forbidden^, when

            t ?                                           manipulating resources ?

     (A) 400                                             (A) 400

     (B) 500                                             (B) 500

     (C) 404                                             (C) 404

     (D) 403                                             (D) 403


137.^                    R,                 ^Rdt     137. In data communication, data rate depends

     t ?                                                  on :




     (A)               ^ <iMQl®fclcll "q^                (A) The available bandwidth

     (B) RpT^ ^ elciQi "q^                               (B) The level of signal

     (C) ^ ^                  "qr                        (C) The level of noise

     (D)           ^                                     (D) All of the above

(5)S/4/2022/A                                   27                                          P.T.O.
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 30 of 36
Page 30 of 36
Text of page 30
138. 32                              -q^             138. How     long   does   downloading     an

                                                           uncompressed text file of 1 Mega bit
        ^      "f^cFTT         ei'Vll ?                    over a 32 kilobites/sec modem take ?

        (A) 312.5^^^                                      (A) 312.5 sec

        (B) 212.5                                         (B) 212.5 sec

        (C) 350.5                                         (C) 350.5 sec

        (D) 250.5                                         (D) 250.5 sec


 139.         ^ 01000010 ^ ^ -^f               fi3;   139. In an IP packet, receiver discards the
                                                           packet that received with first 8 bits as
        W 8              ^ ^81 37n^ 3TTf.-qt. (IP)
                                                          01000010. What is the possible reason ?
              ^^ 1^ 1                        t:           (A) Incorrect IP version and incorrect
                                                                header length
        (A)      IP             13^ 7T^ ^^
                                                          (B) Incorrect IP version and correct
        (B)      IP ^h'^-Lui Tt^"           ^                  header length
                                                          (C) Correct IP version and incorrect
        (C)      IP                       ^^
                                                               header length
    (D)                     ^                             (D) None of the above

140. CSMA/CD yVl^hld ^ <44^1'! ^ fir^                 140. Which   mode     of communication     is

                                ^ fm % 7                  utilized by ethemet using CSMA/CD
                                                          protocol ?
    (A)
                                                          (A) Full duplex
    (B) ^
                                                          (B) Half duplex
    (C)                                                   (C) Simplex

    (D)               T4 ^ ^                              (D) None of the above

(5)S/4/2022/A                                    28
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 31 of 36
Page 31 of 36
Text of page 31
141. -ONT ^ DFS 3ffT BFS ^                    ^ 141. When searching a graph using DFS and

                 PiHRrlRsid T^'     ctJlH^HI                BFS, which of the following statements

          % 7                                               is true ?


     (A) DFS             ^         ^^                       (A) DFS always guarantees to find the

                "^81 ^       ^           ^t I                    shortest path between two nodes.

     (B) BFS, DFS            srfe                           (B) BFS is more memory-efficient than

          f i                                                   DFS.


    (C) DFS            "^-y.-KNdl i^trdlR^H t,             (C) DFS is non-recursive algorithm

          ^3Rf^ BFS liH^MdT t 1                                 while BFS is recursive.


    (D) BFS TIN) ■^' aiT]^ ^ ^                             (D) BFS explores all the neighbouring

                                                                nodes before moving to the next

          ^)TdT "I I                                            level in the graph.


142. eiH4)V'S            ^ "512^               ^       142. What is the primary purpose of a

    t ?                                                    Hopfield Network ?

    (A) cnilcti<u|                                         (A) Classification

    (B) wM                                                 (B) Associative memory

    (C)                                                    (C) Clustering

    (D)                                                    (D) Regression

(5)S/4/2022/A                                     29                                       P.T.O.
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 32 of 36
Page 32 of 36
Text of page 32
m
 143. PHHRiRsId         ^
                                                       143. Which of the following statements is
     t ?
                                                            true ?
     (A) IW
                               ^ i%5T -mm                   (A) Hill climbing is a local search
           ^                                ■gkn "t,
                                                                 algorithm, meaning it focuses on
           # 3TRT-"q^ ^                     ^
                                                                 improving the current solution by
           wm t I

     (B)         4<HI^'RJ| ^              sfk f^TRR             exploring neighbouring solutions.

                    w^37f            ^           W
                                                            (B) Hill climbing can be applied to both
                  t I
                                                                discrete       and         continuous
     (C) fl^                     ^ ^ ■Sffer
           313^^ ^^TTT^aif -^f -OTT!^ 3TteP^                    optimization problems.

           "4*      ^ im             t,
                                                            (C) Hill climbing is prone to getting

                                                                trapped in local optima.
           1^ f I

     (D)                       f I                         (D) All of the above are correct.


144. PihRiRsicI '^" "H cFFRfi f^^l 4i41                144. Which of the following operations is

     2^ Tq' iTFTRT ^ ^                     ^ ^             commonly used in Fuzzy set theoiy for

    t ^             ^           ^ %3; ?                    combining Fuzzy sets ?

    (A)                                                    (A) Cartesian product

    (B) ^PH-m, fsidwT afk chT^IA'd                         (B) Union, intersection and complement

    (C) chM^d sSk qqffeqq ^?qiq                            (C) Complement and Cartesian product

    (D) w ^ 3ik qii^Rnqn                                   (D) Power set and Cartesian product

(5)S/4/2022/A                                     30
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 33 of 36
Page 33 of 36
Text of page 33
145; PiMPdR^d         ^ ^m\                              145. From the given below, which can be

       37T?HlRa                           TT^IT^ ^            effectively used as a simple phonetic

       ^                  ^ WcIT t ?                          based spell checker ?

       (A) A* q.dilR^H                                       (A) A* algorithm

       (B) ^lcl*^4H                                          (B) Soundex algorithm

       (C)             q.dllR^^                              (C) Phonetic algorithm

       (D) "3^1^         ^^                                  (D) None of the above


146. "q^"                'leiRaa "q;^' gM        "qi^    146. A             is a collection of written or

       ^ W ^ f,                 PdJ^elqui aqk                 spoken texts that serve as a source of
       ^ 1^              ^T5T ^ ^ftcl ^ ^ R*                  linguistic data for analysis and study.
       dii4 di<ai t" I
                                                             (A) N-Grams
       (A) N-IITH
                                                             (B) Dictionary

                                                             (C) Corpus
       (C)
                                                             (D) Language model
       (D) TO "Rfe^
                                                         147. Factors that influence backpropagation
147.                mRiSJ^ "qr            5id^
                                                              training :
       qq^ :

                                                             (A) Bias
       (A)
                                                             (B) Momentum
       (B) -qfer
                                                             (C) Learning constants
       (C)          cbT-H^d'H

       (D) dq^ckl                                            (D) All of the above

(5)S/4/2022/A                                       31                                            P.T.O,
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 34 of 36
Page 34 of 36
Text of page 34
148.                           ^            ^               148. The theoretical foundation of genetic
       ^                        yPdi^NH "qr 3^                   algorithm rely on the binary string
       ^            ■^l ^TTNTfcr ^ t I ^ V                       representation of solutions and the notion
                              ^ -f^f^ ^ WTT t,                   of schema. If '/*' is the number of 'donl't
       ^ "y?^                 1^e^-                              care symbol' in the schema then every
              t I                                                schema matches exactly.         strings.
       (A) 2r                      (B) 2^                        (A) 2r                (B) 2'
       (C) .2                      (D) 2r - 1                    (C) r2                (D) 2r - 1

149. Htrxil-y.'jii'd ^riiPi'i                               149. The issue(s) involved with multi-agent
                                                                 planning is/are :

       (i) ^ ^HiHM ^rrqf ^ "qfraqq 37k                           (i) Representing and planning for

             krilPHq
                                                                       multiple simultaneous actions.

                                                                 (ii) Cooperation,     coordination     and
       (ii) ciiwf^ch                                   ^
                                                                       competition     arising   in     true
                                                                       multiagent settings
       (A) "^of^ (i)
                                                                 (A) Only®
       (B)             (ii)
                                                                 (B) Only (ii)
       (C)        (i) 37k (ii)                                   (C) Both (i) and (ii)
       (D) H ^ (i) ^ ^ (ii)                                      (D) Neither (i) nor (ii)

150. #f                       3ITK Tj^qRff T^' ^            150. In a Horn clause, if the antecedent

       cTc^ ^ "t, ^                      "^ncIT t" :             contains multiple literals, it is known as
                                                                 a :
       (A) PiPf^a cKrlT-Jl
                                                                 (A) Definite clause
       (B) fs'ti^'Ptdq
                                                                 (B) Disjunctive clause
       (C) ^82T
                                                                (C) Fact

       (D) f^                                                   (D) Rule

(5)S/4/2022/A                                          32
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 35 of 36
Page 35 of 36
Text of page 35
(SPACE FOR ROUGH WORK)




S/4/2022/A
MP SET 2022 question paper, State Eligibility Test 2022, Computer Science Application, page 36 of 36
Page 36 of 36
Page 1 of 36

Source: Madhya Pradesh Public Service Commission. Question paper published by Madhya Pradesh Public Service Commission.

Other years