KEMBAR78
Computer Science Objective Question | PDF
0% found this document useful (0 votes)
156 views260 pages

Computer Science Objective Question

The document contains a collection of multiple-choice questions (MCQs) related to computer science, specifically targeting PGT (Post Graduate Teacher) Computer Science exams. It includes questions on topics such as logic gates, number systems, memory, and coding techniques, along with their respective answer choices. The questions are derived from previous year papers and are formatted for educational assessment purposes.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
156 views260 pages

Computer Science Objective Question

The document contains a collection of multiple-choice questions (MCQs) related to computer science, specifically targeting PGT (Post Graduate Teacher) Computer Science exams. It includes questions on topics such as logic gates, number systems, memory, and coding techniques, along with their respective answer choices. The questions are derived from previous year papers and are formatted for educational assessment purposes.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 260
MCQ BANK PGT COMPUTER PGT COMPUTER Utsilcl huge Chae Ud Hera Ulan ch few tifaae dog oe arena MULTIPLE CHOICE QUESTIONS BASED ON PREVIOUS YEAR PAPERS PGT Computer Science Previous Year Questions Q1. Reflection of a point about x-axis, fol- lowed by a counter-clockwise rotation of 90°, is equivalent to reflection about the line-U7a - 3a aR A ue fag aw uid, 90° & aad (Piset-Asl) FAA & Tle, et & farsa A ufeferer & erag 2 (Oy =-x (2)x=-y G)x=y (xty=l KVS Computer C beam pene- tration method for producing colour dis- play is/are true @ feel & gare & fer die weer fare & are A Er aT ert Be (1) It is used with random-scan monitors/ 7ast mratt arghese eer wibtet Serer fear a AAT e (2) It is used with raster-scan monitors/aé TE RT ATTA AT WANT Fea SAAT (3) By using beam penetration method wide range of colours can be obtained/diy wast ferfer er Soar Bre Tt a fae PTT Ia aR él (4) It uses three electron guns, one each for- green, blue and red colours/4e dit sctereit ET STAM EY, Atel Bie wet TH ch fereaaT z KVS Computer Paper Q3. The refresh rate below which a picture flickers is- 3771 4 & aT faa foetax & fare fope Re (1) 30 (2) 25 (3) 35 (4) 60 KVS Computer Paper CIAL eeceeeeenneee tool is used to create special effects with text. sentsaeacsvansed SA/ STR HT STANT SRS eH ATT FATT WATE GAM oe Fore State () Smart Art/ are gp (2) Text Box/@Re TF (3) Shapes/ arepft (4:) Word Art/ ae ané KVS Computer Paper C5. A circle, if scaled in only one dimen- sion becomes a/an-&& aq, ale hae Ch Ara Ebet A zt Ga @, at TH- () hyperbola/ afamacat (2) parabola/Waert (3) ellipse/ #tetqqa (4) remains a circle/ Ut Fa By TIA ze KVS Computer Paper Q6. The line 2x - y + 4 = O, if clipped against this window will connect the points-?@I 2x-y + 4=0 af ga fast & face aire Ta at she Bs STE (1) (0, 1) and (2, 3)/ (0,1) 3K (2,3) (2) (0, 1) and (3, 3)/(0,1) 31 (3,3) (3) (1, 2) and (3, 4)/ (1,2) AR (1, 2) (4) None of the above/ seqa 4 A wg AE KVS Computer Paper Q7. Which of the following expressions represents logical AND gate? E74 a SH AT ae ached AND gate FT ad Pe 2- (1) A/B (2) A+B (3) A>B (4) AB KVS Computer Paper Q8. A single transistor can be used to build which of the following logic gates— ua ferret cifreer at Se & fepa cater Te & Frater a parr fear it erat e (1) AND (2) OR (3) NOR (4) NOT KVS Computer Paper C9. Both........... and..........gates are also called universal gates. (1.) NAND, NOR (2) AND, NAND (3) OR, NOR (44) XOR and XNOR NVS Computer Paper (110. Exclusive-OR(XOR) logic gates can be constructed from what other logic gates? fra wen & gat logic gates & afte aq C’R(XOR) logic gates a frat fear aT aaa 2 (1) AND gates and NOT gates AND gates art 7 f NOT gates ant (2) OR gates only/OR gates af act (}) AND gates, OR gates and NOT gates AND gates, OR gates a NOT gates @nT (4) OR gates and NOT gatesOR gates amt 4 fe NOT gates al KVS Computer Paper Q11. Which of the following logic gates is a universal gate i.e. its combinations can be used to construct the logic of any other logic gate? ae er a te gdtader te 21 at ser aif At So Tirerept Gta BP (lL) AND We (2) OR Te (3) NAND #2 (4) NOT tz KVS Computer Paper C12. The most widely used universal gates are: ara ey sod fear sr ater alae (universal) 727: (1) NOR and NAND gates/ NOR mt NAND tz (2) OR and AND gates/ OR df AND “12 (3) NOR and AND gates/ NOR ae AND te (4) NAND and OR gates/ NAND aa ORTe CSSSB Computer Paper @13. The Octal equivalent of 111010 is 111010 # ater A er (1) 72 (2) 71 (3) 73 (4) None of the above/stvaa 4 4 &e Tat PGT Computer Teacher Paper 14. A Hexa decimal number ‘AO’ has the decimal value @Hefa4al FET ‘AO’ 4 sare TR él (1) 256 2ye0 (3) 100 (4) 160 KVS Computer Paper Q15. Number in base 16 are called as 31a 16 4 feat der & ea Ft Sa Te (1.) Hexadecimal System (2) Octal System (3) Decimal System (4) Binary Numbering System KVS Computer Paper Q16. Decimal equivalent of the binary number 110111 is fq 74 Geqit FET a ane Ge é (1) 56 (2) 55 (3) 57 (4) 58 [C'SSSB Computer Paper @17. Which of the following is a non- weighted code in which when going from one code to other only one bit is changed? Frafetaa Fo Br a apie wre & Se wp HIS de 8 eat F ard aa chert Weber Pere afters eta 2? (L) Excess-3 2!) Gray (3) ASCIL (44) BCD KVS Computer Paper C18. Considering 1's complement repre- sentation for negative numbers, -85 will be stored into an 8- bit memory space as #71H# I-85 1's arate Arad Ey aT 8 fae ret ATT A et 1) 20122211 (2) 10101010 (3) 10100110 Q18. Considering 1's complement representa- tion for negative numbers, -85 will be stored into an 8- bit memory space as 7 1As FA-85 1's PIAS Hed Eo a 8 fae ret AAT eR Het eB (.) 10111111 (2) 10101010 (3) 10100110 (4) 11101001 PGT Computer Teacher Paper Q19. 014. The 2's compliment of the binary number (10101010), is Te4 HET (10101010), HI 2's Ws (:.) (00000000), (21) (10000000), (3) (01010110), (4) (10101010), DSSSB Computer Paper Q20. Gray code of decimal number 2 is.......... Bareta (SfeAe1) 2 TF IS... BI (:.) 1000 (2) 0010 (3) 0011 ( NVS Computer Paper Q21. Which one of the following binary num- beris divisible by 4? Fata ar a oer seat 4 aro fori 2? (1) 100101100 (2) 101010 (3) 1110001 (4) 100011 PST Computer Teacher Paper Q22. Octal equivalent of the Decimal number 567 is: SITS PET S67 & RI Hae (1) 1067 (2) 1267 (3) 1167 (41) 967 KVS Computer Paper Q23. The minimum number of flip-flops re- quired to implement a 16-bit ring counter is : 16-fee fin rer Sr a] He & fore sree fra FeiTG T =aqa Hee: (.) 16 (2)4 (3) 8 (4) 65,536 KVS Computer Paper Q24. The type of code, which involves the as- signment of a consecutive and unique number tv each item is: HS Hl WN, PIAA Weds SSE Chl OTM AN heads AT Hl sraretate efter é : (:.) sequence / arse (2) group / F4e (2) numeric / dares (4) None of these / 344 4 &1e Tet PGT Computer Teacher Paper Q25. Which one of the following is not a univer- sal building block ? Prfertaa 48 erat arader fates seit set B? (:.) Three - input NAND gate #fl-s74z NAND #2 (2!) Two-input NOR gate 2-2792 NOR Tz (3) Two-input multiplexer ¢-34Y¢ multiplexer (4) Two-input EXOR gate z-¢7yz EXOR tte KVS Computer Paper Q26. The sum of two hexadecimal numbers 23D and 9AA gives the hexadecimal number : @ srarefara Fen 23 st sik 9AA Gr afer eearstarcet ASM eae: (1) BF6 (2) BES (3) BE7 (41) AF7 KVS Computer Paper Q27. Which of the following is not an advan- tage of asynchronous circuits ? Prete fa ero ofa abe wr cin aa 8? (:.) Higher speed / =a 71fet (2) Lesser power consumption 4 faseft &t ead (2) Smaller design effort / tt fag7 ware (4) No need to provide clock generation circuit- TAS SA Aheedl Wer Her cel PISA AT e KVS Computer Paper Q28. The fundamental mode of operation of asynchronous sequential circuits implies that : Utara athe % carer & afore aie or avert 2 fe: (:.) we cannot feed pulses as inputs to the circuit eT afee a gaye & eo Hf oda (Pulses) HI Tete GH e (2!) the flow table of the circuit cannot be reduced alee =Bt ware arferser at aH eT Pea ST AeA z (3}) there exists a homing sequence for each of the states in the flow table 4 @aet 4 wets Be & fers we eft (homing) #4 sofia & (4) None of the above / s4fea 4 8 arg at KVS Computer Paper Q29. Which of the following is not an enhance- ment to the Pentium that was unavailable inthe 8086/8088? frafetaa 4 8 erat ofeay (Pentium) ¥ gfe Tet 2 sit 8086/8088 4 Sueal Te aT (.) Expansion of cache memory #31 S4it & feat (2) "Pipelined" architecture Teves Arblerat (3) Inclusion of an internal math coprocessor U&é arrifee hd coprocessor Ife (4) Data/address line multiplexing 221 / vat ate4 eth KVS Computer Paper Q30. A modulo-20 counter can be designed using : UH HSAe-20 Hisar Sl STANT Hees SaaS Pea AT AAT e: (1) 5-flip-flops / 5- fara - Fatt (2) 4flip-flops / 4—fFerq-7e1rT (3) 20-flip-flops / 20-frera-vairt (4) None of these / 344 4 @ig 7et KVS Computer Paper Q31. Any given boolean expression can be im- plemented by using : fesat fen 1y gferar aifieaiaa a saan ae apratieara fear al Bea e— (:.) only NOR gates/del NOR Te (2!) only NAND gates/sael NAND Tz (3) only OR gates/act OR Te (4) both (1) and (2) only/ at (1) a (2) ai KVS Computer Paper Q32. Which of the following statement is/are tue regarding flip-flop ? Fea a or oT er feo & Ty A eT (:.) Capable of storing one bit of information/ aan & we fare Here Br array (2) A flip-flop is a binary cell/TRty—Fea1rg UH TST ane (3) It has two outputs/gae aI aiseqe ee & (4) All of the above/ FHtqa Wt KVS Computer Paper Q33. Computer memory is measured - F°4et HT eyfer er ner feear ara e — (:.) by ohms / Sela & art (2) by bits / faz 7 & arr (3) by ampere / Uftaz } ant (4) by volts / dee & art PGT Computer Teacher Paper Q34. Which of the following is/are application of flip-flop ? Fa A a Br PRT Th TAT? (1) Latch (2) Bounce elimination switch (3) Counters (4) All of the above/ Tiga Wit EKVS Computer Paper Q35. Flip-Flop is a— fre1y-7ar7 &- (1) 2-state device/2-Rz graf (2!) 1-state device/1-@2 afaa (1) 3-state device/3-t gfe (41) 4-state device/4-Re afadt KVS Computer Paper Q36. The circuit used to store one bit of data is knownas: wp fare Sey or WaT pet ate fee Sa BT A AT STAT e- (..) Encoder/S7#itst (2) Register/tere2t (3) Decoder/feetst (4) Flip Flop/ fer - Fat NVS Computer Paper Q37. Which of the following is a valid octal con- stant?/ fet 4 8 @r-ar we qe sitaect eT FP (1) 032 (21) 32 (3) 049 (41) Ox49 KVS Computer Paper Q38..A + Bcan be implemented by: A+ Bart mriitead fear a1 aa B— (.) NOR gates alone/act NOR "lz (2) NAND gates alone/#aei NAND ‘2 (3) AND gates alone/tact AND Tz (4) Both (1) and (2) only/ ®aet (1) ait (2) at DSSSB Computer Paper Q39. The output of XOR gate is one (1) when XOR ‘re @ ffs wee (1) Bla eg (:.) Both inputs are zero/al S492 Fe (2) Both inputs are different/ émt gage fra # (3) Both inputs are one/Shi S1Gt Se (4) Both inputs are same/aMtt $492 FAM et KVS Computer Paper Q40. Given two literals 0 0 001B and 033. What are these equal to? @ Ves OC] OOIB AN .33 Hl Ea EU SAH TN TT 2? (..) 27 and 33 (21) 21 and 33 (3) 33 and 33 (4) 27 and 27 PGT Computer Teacher Paper Q41. Which of the following Relational Algebra Operators is a unary operator? Prfestad dearer serrated FS Era UH URS atte 8? (..) Joins sitet eT (2) Cross product /2-art Tor (3) Division/ fr (4) Selection/ a7 KVS Computer Paper Q42. Considering X and Y as Boolean variables, the simplest form of the Boolean expression X + XY is— Gfern diwaa & ea AX ah Y Ad EE erat UPAR X + KY GT ATA ATTA BY (x (1) 0 (3) 1 (Q¥ KVS Computer Paper Q43. In terms of Digital Certificate, SSL stands for? feftec afeftnke & after F SSL a aa set 2? (:.) Secure Service Layer/farin afer aa (2) Standard Socket Layer/teUse Fiche cA (3) Secure Service Line/faein afag ast (4) Secure Socket Layer/ faean atée car KVS Computer Paper Q44. Ex-OR SR Wa Be & fed =a feat NAND Tre hl Saez Etat FP (1)3 (2)4 (3) 2 (4) 5 KVS Computer Paper Q45. Considering X and Y as binary variables, the equivalent Boolean expression for (X . Y)'is: @ aftusret KAN Y (KX. ¥)' Sr Bert Sort ETI (2) X+Y" (2) X'+¥ (2) x ¥" (41) XLY' PST Computer Teacher Paper Q46. In boolean Algebra, A' (A + B') is equivalent to gferat cist 11a FA! (A + BY) Tee ETT (:.) AB' (2) A'B (3) AB (4) AB PST Computer Teacher Paper Q47. Considering X as a binary variable, the Boolean expression X.0 is equivalent to. x of fee ufadt amd ez, X.0 a gies aftait fears qe ():1 (2) X (3)0 (4) X' KVS Computer Paper Q48. Considering X and Y as binary variables, the Boolean expression X'Y+X'Y' is equivalent to- X aa ¥ eT fads ee Ad Et afersad aS XY +X°y' fea Grae e? GoY¥ (2) X (3)x" (4) Y" KVS Computer Paper Q49. Considering X and Y as binary variables, the Boolean expression X.Y.0 is equivalent to- X ait y at fgarertt at & Bo Ft aT oT Ter @, Terra sie X.¥.0 77a 2 Gj (2) X (3)0 (4) ¥ KVS Computer Paper Q50. Considering X as a binary variable, the Boolean expression X + 1 equivalent to-af< XT FER TST ez, aK + 1 or fers arpa fea eT e (1j)1 (i) xX (3) 0 (4) X" KVS Computer Paper Q51. Considering X as a binary variable, the Boolean expression X + X' is equivalent to: Ale X Up Tea Ae at Bless Aa K + KS TL EMT (1)1 (2)X (3)0 (4) X! KVS Computer Paper Q52. Considering X as binary variables, the Boolean expression X.X' is equivalent to- X aad et oftated aad gu ger aise XX! AB Cy (2) X (3)0 (4) X" KVS Computer Paper Q53. Considering X and Y as binary variables, the equivalent Boolean expression for X(X + Y) is: X aR Y et Ted ae Ba A ad ES K(X + Y) & fee AAs Gitar Sah OT TTT | (1)¥ (2)x (3) XY ()X+¥ KVS Computer Paper Q54. Considering X and Y as binary variables, the equivalent Boolean expression for Y(X+Y) is Xa Wi eset ae oT CY (2) X (2) XY (44) X+¥ KVS Computer Paper Q55. In boolean Algebra, AB + AB' is equivalent to: gferaa drerrftra AB + AB’ fea ater eT Ca (0 GA (4) B KVS Computer Paper Q56. Considering X and Y as binary variables, the Boolean expression X(X+Y) is equivalent tome Xan Y Ue ASR aeat &, aT K(X + ¥) BT Tere azar fea area 2 Ca (2) x (3)0 (44) ¥ KVS Computer Paper Q57. Considering X and Y as binary variables, the Boolean expression X + Y + 1 is equivalent to-X AY eat St ard Be hers aia K+ 41 Te Be q)1 yx (3)0 (4) ¥ KVS Computer Paper Q58. Considering X and Y as binary variables, the Boolean expression Y + XY is equivalent to: ae Xa Y Ue afeR Gea &, aT Y + XY @ gferr ATA fea TER Se G1 (2X (3)0 (4)¥ KVS Computer Paper Q59. Considering X and Y as binary variables, the equivalent Boolean expression for X + XY is arent X ait y at oftafe ara eu glee Gia & + XY Wafeta Bea ze (RRB SSE Secundrabad (Shift-I), 02.09.2015) COY (2) x (3) XY (4)X+¥ KVS Computer Paper Q60. In Boolean Algebra, A (A + B') is equivalent to: UE Cie ota FA (A +B) FA er? (1 (2) 0 (2)A (4) B KVS Computer Paper Q61. 56. A NOR gate is called Universal Logic Gate because feat NOR ‘Te HT artic citar Te (\Jniversal Logic Gate) é1 Stel 2 Fife (:.) it can be used only with AND gate universally/ Borer Sa arbiters Sa H act AND te & aver fee AT eae (2) it can be used without need of any other gate type/ a5 Sri fet aa wen & te at snarrear & fear fea ar wea ze (3) it can be used oniy with OR gaie universaily sae Soa abit Bo Y act OR te & area fear aT Wea & (4) it can be used only with NOT gateuniversally/ Baar Sea artis ST A aANOT te & Bret feat ST aaa et KVS Computer Paper Q62. Considering X as a binary variable, the Boolean expression X.1 is equivalent to- U4 TE aad afteae 21 qferat wegen K.1 eta e- ja (a) x (3) 0 (4) x" KVS Computer Paper Q63. The output of a logic gate is '1' when all its inputs are '0'. Then the gate is either fat ahs Tre pT asege 1! e ale Sa HT SWZ 'O' eI (1) ANOR or an EX-NOR Gate TF NOR 4 UW EX-OR 4 (2) A NAND or an EX-OR Gate Uh NAND @I Uh EX- ORT (3) An OR or an EX-NOR Gage Ut OR UT Uh EX-OR itz (¢) An AND or an EX-OR GateU® AND 4 U$ EX-OR TE KVS Computer Paper Q64. In Binary Algebra, A+B can be imple- mented by: aeat ssa FA + Baal reba fear ST AeA B: (:.) NOR gates alone/ 4c NOR "2 art (2!) NAND gates alone/@aei NAND 72 ent (3) AND gates alone/cdel AND 72 ant (4) Both (1) and (2)/(1) ae (2) @at arr KVS Computer Paper Q65. Which of the following logic gates outputs O when the input values are different? Wa SAS AM SteP Tater Ele @, al Pret A a fess ciate te HI Sey O Fla el (1) XNOR (2) OR (3) XOR (4) NAND KVS Computer Paper Q66. According to Demorgan's theorem: Sila Pa eb s44he— (1) A NAND gate is equivalent to negative OR gate./ UT NAND ‘tz, fmfza-OR ( fait OR) te S aH eT 71 (2) A NAND gate is equivalent to negative AND gate/Us NAND te, fanfea- AND (fata AND) lz & HAM aT el (3) A NAND gate is equivalent to NOR gate. T} NAND 7, NOR 72 & WH ete 21 (4) A NAND gate is equivalent to negative OR- gate./™ NOR te, ffed- OR (faut OR) & FA Ela zl KVS Computer Paper Q67. Which gate has the output low, only when both the inputs are high? Sat Sys & Tet EF are it fps te wr areeqe FA em? (.) OR (2) NOR (3) NAND (4) AND KVS Computer Paper Q68. Which of the following logic gates shows output 1 when value of input is different? Prafertaa #8 er oT aif te, sage qeat & firs a oe BNF (aTSeyZ) STAT BP (1) XOR (2) AND (3) NOR (4) XNOR KVS Computer Paper Q69. The hexadecimal representation of 125.25 pt eee eraedine 4 veliia 125.25 & (.)(7D.04)16 (2)(7D.40)16 (3) (D7.40)i¢ (4) (D7.04)i¢ KVS Computer Paper Q70. 15" complement of hexadecimal number (4401), ¢is: WS PINT (SaaS AA) HET (AOI), 1ST Ee: C.) (GEE)i6 (2) (SE0);6 (3) (6E0)16 (4) (SFE)i6 KVS Computer Paper Q71. The octal representation of the binary number (1101010.01), is- Tetit HET (1101010.01), FF Hier GST ...... & BF era Sra eB C.)(152.1)g (2) (152.2), (3) (650.2)s (41) (650.1), KVS Computer Paper Q72. The hexadecimal representation of the bi- nary number (1101010.01), is- t= faucia Fear (1101010.01), #1 9S SRASa eT SAAT AT SP (2) (6A.1)16 (2) (64.4)16 (3) (D2.4)16 (41) (D2.1)16 KVS Computer Paper Q73. Binary equivalent of octal number 705 is: afeeet Fat 705 I Sferael (ATS) AEA... aes #1 (.) 1010111 (2) 1110101 (2) 111000101 (4) 101000111 KVS Computer Paper Q74. The 8's complement of the octal number (4060); is 314241 TT (4060), EI 8's HAS eT (1) (3711)3

You might also like