Tiêu đề INFORMATION TECHNOLOGY 27A.PDF ✅

Question Booklet No. SET A A13E-2019 ÂýàÙ- ̃æ /Question Paper - II INFORMATION TECHNOLOGY (Paper Code – 190227) ÂÚUèÿææ ·ð¤‹1⁄4ýæŠØÿæ ·¤è ×ôãUÚU Seal of Superintendent of Examination Centre ßèÿæ·¤ ·ð¤ ãUSÌæÿæÚU / Signature of Invigilator ßèÿæ·¤ ·ð¤ Ùæ× / Name of Invigilator ÂéçSÌ·¤æ ×ð ́ ÂëcÆUô ́ ·¤è â¢BØæ Number of Pages in Booklet ÂéçSÌ·¤æ ×ð ́ ÂýàÙô ́ ·¤è â¢BØæ Number of Questions in Booklet â×Ø Time Âê‡ææZ·¤ Total Marks ÂÚUèÿææçÍüØô ́ mæÚUæ ·ð¤ßÜ ·¤æÜð/ÙèÜð ÕæòÜ Âæò§‡ÅU ÂðÙ âð ÖÚUæ ÁæØÐ To be filled by Candidates by Black/Blue Ball Point Pen only. ƒæôá‡ææ Ñ ×ñ ́Ùð Ùè¿ð çΰ »° çÙÎðüàæô ́ ·¤ô ¥‘ÀUè ÌÚUãU ÂÉ ̧U·¤ÚU â×Ûæ çÜ° ãñ ́UÐ Declaration: I have read and understood the instructions given below. ¥TØÍèü ·ð¤ ãUSÌæÿæÚU / Signature of Candidate çÎÙ梷¤ / Date ¥TØÍèü ·¤æ Ùæ× / Name of Candidate â×Ø / Time ¥Ùé·ý¤×梷¤ Roll No. 20 100 2 ƒæ¢ÅðU / Hours 200 ÂÚUèÿææçÍüØô ́ ·ð¤ çÜ° çÙÎðüàæ v. (·¤) ¥TØçÍüØô ́ ·¤ô ¥ô.°×.¥æÚU. ©UîæÚU-àæèÅU ×ð ́ ÂýçßçcÅUØæ¡ Áñâð ÚUôÜ Ù¢., ÂðÂÚU ·¤ôÇU ¥æçÎ ÖÚUÙð ·ð¤ çÜ° ¥çÌçÚU@Ì â×Ø çÎØæ »Øæ ãñUÐ (1) §â çΰ »° â×Ø ·ð¤ Âà¿æÌ÷ ¥TØçÍüØô ́ ·¤ô ÂýàÙ-ÂéçSÌ·¤æ Îè Áæ°»èÐ ¥æ·¤ô çÙ`ÙæÙéâæÚU ·¤æØüßæãUè ·¤ÚUÙè ãñU Ñ— (i) ÂýàÙ-ÂéçSÌ·¤æ ×ð ́ ¿æÚUô ́ ÌÚUȤ âð Ü»è ãéU§ü ·¤æ»Á ·¤è âèÜ Îð1 Üð ́Ð çÕÙæ ·¤æ»Á ·¤è âèÜ Ü»è ¥Íßæ 1éÜè ãéU§ü ÂýàÙ-ÂéçSÌ·¤æ Sßè·¤æÚU Ù ·¤Úð ́UÐ (ii) ÂýàÙ-ÂéçSÌ·¤æ ·ð¤ ÂëcÆUô ́ ÌÍæ ÂýàÙô ́ ·¤è â¢BØæ ·¤æ ç×ÜæÙ §â ×é1ÂëcÆU ÂÚU Îè »§ü â¢BØæ¥ô ́ âð ·¤ÚU Üð ́Ð ØçÎ §â×ð ́ ·¤ô§ü çÖ‹ÙÌæ ãUô Ìô ·ë¤ÂØæ ÂýàÙ-ÂéçSÌ·¤æ ̈·¤æÜ ÕÎÜ Üð ́Ð (») ÂÚUèÿææ ÂýæÚU`Ö ãUôÙð ·¤è §â ¥ßçÏ ×ð ́ ©UîæÚU ¥¢ç·¤Ì ·¤ÚUÙð ·¤è ¥Ùé×çÌ ÙãUè ́ ãñUÐ ©UîæÚU ¥¢ç·¤Ì ·¤ÚUÙð ·ð¤ çÜ° Îô ƒæ‡ÅðU ·¤æ â×Ø ¥õÚU çÎØæ Áæ°»æÐ w. (·¤) Îè »§ü OMR ©UîæÚU-àæèÅU ×ð ́ ·¤æÜð/ÙèÜð ÕæòÜ Âæò§‡ÅU ÂðÙ âð ¥æßðÎÙ Ù¢., ÚUôÜ Ù¢., ÂÚUèÿææ ·ð¤‹1⁄4ý ·¤æ ·ý¤×梷¤, ÂÚUèÿææ ·¤è çÌçÍ, ÂðÂÚU ·¤ôÇU, ÂýàÙ ÂéçSÌ·¤æ ·¤è ·ý¤× â¢BØæ, ÒÀUîæèâ»É ̧U ·¤æ âæ×æ‹Ø TMææÙÓ ÂýàÙ- ̃æ ·¤æ ¥Ùé·ý¤×梷¤, çßáØ ·¤æ Ùæ×, ÂýàÙ-ÂéçSÌ·¤æ ·¤æ âðÅU (A, B, C ¥Íßæ D) ÌÍæ ãUSÌæÿæÚU ¥¢ç·¤Ì ·¤Úð ́UÐ (1) OMR ©UîæÚU-àæèÅU ×ð ́ ÚUôÜ Ù¢., ÂýàÙ-ÂéçSÌ·¤æ âðÅU, ÂðÂÚU ·¤ôÇU, ·ð¤‹1⁄4ý ·¤ôÇU ¥æçÎ â¢Õ¢çÏÌ »ôÜð ·¤ô ·¤æÜð/ÙèÜð ÕæòÜ Âæò§‡ÅU ÂðÙ âð ·¤æÜæ ·¤Úð ́UÐ (») OMR ©UîæÚU-àæèÅU ×ð ́ ÂýàÙô ́ ·ð¤ ©UîæÚU ¥¢ç·¤Ì ·¤ÚUÙð ãñ ́UÐ §â â`Õ‹Ï ×ð ́ çÙÎðüàæ §â ÂýàÙ-ÂéçSÌ·¤æ ·ð¤ ÂèÀðU çΰ »° ãñ ́UÐ x. ¥æòçŒÅU·¤Ü ×æ·ü¤ ÚUèÇUÚU (OMR) ×àæèÙ ©UîæÚU-àæèÅU ·¤è ·¤æÜð/ÙèÜð ÕæòÜ Âæò§‡ÅU ÂðÙ âð ÖÚðU »ôÜð ·¤è ÂýçßçcÅUØô ́ ·¤ô ÂÉ ̧U·¤ÚU ÂÚUèÿææÈ¤Ü ÌñØæÚU ·¤ÚUÌè ãñU, ¥ÌÑ ÂÚUèÿææçÍüØô ́ ·¤ô â¿ðÌ ç·¤Øæ ÁæÌæ ãñU ç·¤ ßð ©UîæÚU-àæèÅU ×ð ́ ÂýçßçcÅUØô ́ ·¤ô ÖÚUÌð â×Ø ÂêÚUè-ÂêÚUè âæßÏæÙè ÕÚUÌð ́ °ß¢ ·¤ô§ü ̃æéçÅU Ù ·¤Úð ́UÐ y. OMR ©UîæÚU-àæèÅU ×ð ́ çÙÏæüçÚUÌ SÍæÙ ·ð¤ ¥çÌçÚU@Ì ·¤ãUè ́ ÂÚU Öè ¥ÂÙæ Ùæ×, ¥Ùé·ý¤×梷¤, ·¤ô§ü Ïæç×ü·¤ ç¿‹ãU, ·¤ô§ü ÂãU¿æÙ ç¿‹ãU Øæ ©UîæÚU ·ð¤ ¥çÌçÚU@Ì ¥‹Ø ·¤ô§ü ¥ÿæÚU, àæμÎ, ßæ@Ø Øæ ·¤ô§ü Ïæç×ü·¤ àæμÎ, ßæ@Ø ÙãUè ́ çÜ1æ ÁæÙæ ¿æçãU°Ð OMR ©UîæÚU-àæèÅU ×ð ́ ÙèÜð ß ·¤æÜð ÕæòÜ Â構ÅU ÂðÙ ·ð¤ ¥çÌçÚU@Ì ¥‹Ø ç·¤âè Öè Ú¢U» ¥Íßæ Âý·¤æÚU ·ð¤ ÂðÙ Áñâð S·ð¤¿ ÂðÙ, ãUæ§Üæò§ÅUÚU, ‚ÜèÅUÚU ÂðÙ... §ˆØæçÎ ·¤æ ÂýØô» Ù ·¤Úð ́UÐ °ðâæ ·¤ÚUÙð ÂÚU â¢Õ¢çÏÌ ¥TØÍèü ·¤ô ¥ÙãüU ƒæôçáÌ ç·¤Øæ Áæ°»æÐ z. ç·¤âè Öè Âý·¤æÚU ·ð¤ ·ñ¤Ü·é¤ÜðÅUÚU, Üæò» ÅðUÕÜ, ×ôÕæ§Ü ȤôÙ °ß¢ S×æÅüU ßæ¿ ¥æçÎ ·¤æ ÂýØô» ßçÁüÌ ãñUÐ {. ÚU$Ȥ ·¤æØü §â ÂýàÙ-ÂéçSÌ·¤æ ·ð¤ çÙÏæüçÚUÌ 1æÜè ÂëcÆUô ́ ×ð ́ ¥Íßæ ¥‹Ø ÂëcÆUô ́ ×ð ́ çÙÏæüçÚUÌ Á»ãUô ́ ÂÚU ·¤Úð ́UÐ ¥çÌçÚU@Ì ÂëcÆU ÙãUè ́ çΰ ÁæØð ́»ðÐ |. ÂýàÙô ́ ·ð¤ çãU‹Îè ¥Íßæ ¥¢»ýðÁè ÂýæM¤Â, ÎôÙô ́ ×ð ́ âð ç·¤âè Öè Öæáæ ×ð ́ ßÌüÙè â¢Õ¢Ïè ¥Íßæ ¥‹Ø ̃æéçÅU ãUôÙð ÂÚU °ðâè ̃æéçÅUØô ́ ·¤è â×Ûæ ß çÙÚUæ·¤ÚU‡æ ·¤è ¥Âðÿææ SÙæÌ·¤ SÌÚU ·ð¤ ¥TØçÍüØô ́ âð ·¤è ÁæÌè ãñUÐ ©U@Ì â¢Õ¢Ï ×ð ́ ¥æØô» ·¤æ çÙ‡æüØ ¥¢çÌ× ãUô»æÐ (©UîæÚU ¥¢ç·¤Ì ·¤ÚUÙð ·ð¤ çÜ° ·ë¤ÂØæ ÂýàÙ-ÂéçSÌ·¤æ ·ð¤ ÂèÀðU ·¤ßÚU ÂðÁ ÂÚU çΰ »° çÙÎðüàæô ́ ·¤ô Îð1ð ́) Instructions for Candidates 1. (a) Candidates are allowed time to fill up the basic information in the OMR sheet such as Paper Code, Roll No., etc. (b) After this, question booklet will be given to the candidates. They are required to do the following : (i) Examine the booklet and to see that all paper seals at the edge of the booklet are intact. Do not accept the question booklet if sticker seals are not intact. (ii) Tally the number of pages along with no. of questions printed on cover of the booklet. In case of any discrepancy please get the booklet changed immediately. (c) Candidates are not permitted to mark answer in the Answer- Sheet in this time. TWO HOURS more will be given to mark the answers. 2. (a) On OMR Answer-Sheet provided to you, write/put Application No., Roll No., Center Code, Date of Exam., Paper Code, Question Booklet No., Roll No. of ‘General Knowledge of CG’ Question Paper, Subject Name, Set of Question Booklet (A, B, C or D) and Signature by Black/ Blue Ball Point Pen. (b) On OMR Answer-Sheet fill in your Roll No., Question Booklet Set, Paper Code and Centre Code etc. by darkening corresponding circle with Black/Blue Ball Point Pen. (c) On OMR Answer-Sheet only the answers to questions are to be marked. The instructions for this are available on the back cover page of this question booklet. 3. Optical Mark Reader (OMR) machine prepares the result by reading the entries made in the circle with the Black/Blue Ball Point Pen on the Answer-Sheet, hence the candidates must be extremely careful in marking these entries and must not commit errors. 4. Name, Roll No. or Identification mark/sign or any character, word or sentence except answer should not be written/mark anywhere on OMR Answer-Sheet other than the specified space. In OMR Answer-Sheet use only Blue / Black Ball point pen and should not use other colour or sketch pen, highlighter, glitter pen etc. If so, such candidate shall be disqualified. 5. Use of any Calculator, Log Table, Mobile Phone and Smart Watch etc. is prohibited 6. Rough work should be done on the blank pages or in the space provided for this on each page of this question booklet. Extra paper will not be provided. 7. In Hindi/English format of questions it is expected that graduate candidates can percept & understand any minor spelling/other mistakes in either one of the languages. In relation to this Commission’s decision will be final. (For instructions regarding marking the answers please see the back cover page of this Question Booklet.) Set-A CB-20
CB-20 [ 2 ] Set-A A13E-2019 ÂýàÙ- ̃æ / Question Paper - II INFORMATION TECHNOLOGY Set - A ©UîæÚU ¥¢ç·¤Ì ·¤ÚUÙð ·¤æ â×Ø Ñ 2 ƒæ‡ÅðU ¥çÏ·¤Ì× ¥¢·¤ Ñ 200 Time for Marking Answers : 2 Hours Maximum Marks : 200 ÙôÅU Ñ 1. §â ÂýàÙ- ̃æ ×ð ́ 100 ÂýàÙ ãñ ́UÐ ÂýˆØð·¤ ÂýàÙ 2 ¥¢·¤ ·¤æ ãñUÐ âÖè ÂýàÙ ¥çÙßæØü ãñ ́UÐ 2. ÂýàÙô ́ ·ð¤ ©UîæÚU ÎðÙð ·¤è çßçÏ â`Õ‹Ïè çÙÎðüàæ Áô ¥æç1ÚUè ÂëcÆU ÂÚU çΰ »° ãñ ́U, ŠØæÙ âð ÂçÉ ̧U°Ð ÂýàÙô ́ ·ð¤ ©UîæÚU, Îè »§ü OMR ©UîæÚU-àæèÅU (¥æ‹âÚU-àæèÅU) ÂÚU ¥¢ç·¤Ì ·¤èçÁ°Ð 3. ç·¤âè Öè ÌÚUãU ·ð¤ ·ñ¤Ü·é¤ÜðÅUÚU Øæ Üæò» ÅðUÕÜ, ×ôÕæ§Ü ȤôÙ °ß¢ S×æÅüU ßæ¿ ·¤æ ÂýØô» ßçÁüÌ ãñUÐ Note : 1. This question paper has 100 questions. Each question carries 2 marks. All questions are compulsory. 2. Read carefully instructions regarding method of answering questions given on the last page and indicate your answers on the OMR Answer-Sheet provided. 3. Use of any type of Calculator or Log table, Mobile phone and Smart watch is prohibited.
CB-20 [ 3 ] Set-A 1. What will be the truth value of conditional statement x→y, when x is False and y is True? (A) True (B) False (C) Don’t care (D) None of the above 2. How many sets are necessary to study the Algebraic Structure Ring? (A) One (B) Two (C) Three (D) Four 3. How many elements are there in the power set of the set {{a, b}, {c}} ? (A) 3 (B) 4 (C) 7 (D) 8 4. Which of the following properties are satisfied by the Partial Order Set (Poset)? (i) Reflexive (ii) Symmetric (iii) Anti-symmetric (iv) Transitive (A) (i), (ii) and (iv) (B) (i), (ii) and (iii) (C) (i), (iii) and (iv) (D) All of the above 5. The following is the Hasse diagram of the Poset [{a, b, c, d, e}, ≤ 1 ]. Which of the following is correct ? d a c b e (A) It is not a lattice (B) It is lattice but not distributive lattice (C) It is distributive lattice but not a Boolean Algebra (D) It is a Boolean Algebra
CB-20 [ 4 ] Set-A 6. In a graph G = (V, E) of n vertices and e edges, what will be total degrees possible ? (A) n × e (B) 2n (C) 2e (D) n e 7. How many maximum number of centres are possible in a Tree ? (A) One (B) Two (C) Three (D) Zero 8. A given graph G is an Euler graph if and only if, all vertices of G are of : (A) Same degree (B) Odd degree (C) Even degree (D) Different degree 9. In a Planar graph, what is the relation between number of vertices (v), number of edges (e) and number of regions (r) ? (A) v + 2 = e – r (B) v + e + r = 2 (C) v = e + r (D) v – e + r = 2 10. What is the purpose of Dijkstra’s Algorithm for a graph? (A) To count number of vertices and edges in graph (B) To find Hamiltonian circuits in graph (C) To find Euler path in graph (D) To find shortest path between two vertices of graph 11. Which of the following data structures is implementation of QuickSort? (A) Set (B) List (C) Stack (D) Queue 12. What is the complexity of searching an element in Binary Search Tree? (A) O(n) (B) O(log n) (C) O(n log n) (D) O(n2 )