y 2 3 4 5) 9) 2 8) %» 10) uy 12) 13) 14) 15) 16) 1) 18) 19) 20) 2) 22) ea bolo els 0 Boolean algebra was formulated by inglish Mathematicinn George Boole in (a) 1857 (b) 1853 1854 1847 1fZ is a Boolean variable then its value can be (@)0-9 (bp0-7 (0&1 ()0 orl Which of the following are busie logical operaturs in Boolean algcbva? (@) AND (by OR (NOI (all ‘The operator that gives complement of the given valu is culled (@) AND (bo (©) NOT (Atl IfA=1, B=0 then A’ And B @o | (b) 10 en «it Boolean Algebra isthe of lowe (a) Mathematics (b) Solution (6) Algebra (@) Geometry _____ uses symbols to represents logical statements instead of words, (@) Algebra (b} Geometry (©) Boolean Algebra (d) Digital data WA=1, B=1,C=0 then AB.C=? (@o (b) 10 ju @a IPA =1, B= 1, C=O.1then AtB+C =? (0 () 10 (ol @l IA=1, B=0, C=1 then X=A+BRC @)0 (b) 101 ©! to A+B=B+A and A.B =B.A tepresents which of the followi (a) Existence of identity (b) Commutative law (©) Associative Jaw (4) Idempotent law Boolean Algcbra wils formulated by the (@) Charles Babbage (b) Napir (©) Paseal (d) George Boole According to distributive law A. (B+ C=? @A+( B.C} ()(A+B).(A+C)()A B+A,C W)(A+B)+C According to Existence of identity element A . | @IA (b)0 (A @t As per Existence of inverse A +A =? @o (BA @o @t ‘Computer chips are made up of (@) Transmitters (b) Tra (©) Circuits (@) None According to inverse the output G@A+A WALA LFA (OvA Boolean Algebra consists of (@) Variables (b) Constant © Botha&b (d) Nothing, AND operator represent (a). (b)* ©! «wer In Boolean Algebra each variable at one time can taken how many values? (a) l (2 3 @4 Which is called an unary operator? (a) NOT (b) AND (OR @ai All electronic devices consist of circuits of (@) Buttons (b) Cables (©) Elements (d) Switches23) 24) 28) 26) 27) 28) 29) 30) 31) 32) 33) 3) 35) 36) 3 38) 39) 40) 41) 42) 43) rca BOOLEAN ALGEBRA A switch at any given time is in one of the states (a2 (b)4 Ol @5 Which operator is used for logical multiplication? (@) OR () AND (NOT @all Which of the following operations are used by the Boolean Algebra (a) Boolean Addition (b) Boolean Multiplication (©) Complement @all Logical addition refers to operation of (a) OR gate (b) AND gate (©) NOT gate (4) Inverter gate A serial circuit is represented by (a) - operator (b) . operator (©)+ operator @au Boolean Algebra derives its name form the British mathematician (a) Napir (b) Charles Babbage (c) George Boole (4) Bill Gates ‘A Boolean variable can only have one of the two values. (3,1 &) 2.0 ©ol 00 An OR gate has at least inputs (a2 ©)3 . o-4 @) An AND gate has at least inputs @2 (3 4 @1 A parallel circuit is represented by (a). operator (b) - operator (©)+ operator (@) All Two valied Boolean Algebra is a setthat has elements and operations (a)2 (b)5 cy4 3 In order to get high output in AND gate all the input must be (@lligh (b) Low (© Equal (@ None ‘The output of the NOT gate is always the of the original value. (@ySame (b) Reverse © Both a&b (None Which of the following is a proposition? (a) What is your Name? (b) Who is your father? (¢) Are you male? (d) None In the representation of Boolean function, the A bar is assigned the value @0 (b) 1 OA @A The table that represents the output of a Boolean expression for all possible combination of input is called (a) True Table (b) Truth Table (¢) Test Table @ Boolean Table Which of the following logical operator is denotted by + sign (a) AND (b) OR, (©) NOT (d) None Boolean Algebra deals with 1 (a) Octal digits (b) Hexadecimal digits (cJ Decimal digits (4) Binary digits Truth table show all possible combinations of . (@) Inputs (b) Outputs (©)Botha&b (@None Boolean operators and Boolean variables combine to form Boolean (a) Outputs (b) Expression ©Botha&b (@ None Who did: overcome the disadvantages of Bodlean algebra laws for simplification of expression? (a) Pascal (b) Charles Babbage (c) Maurice Kamaugh (d) George Boole47) 48) 49) 50) Cea) [ToloR ME csr Which is Boolean constant (ao 1 (Ok! @-1 X, Y are called (a) Boolean constant (b) Variables (©) Numbers (d) None We can u _.t© change the order of evaluation of operations in a Boolean expression. (a) Bars (b) Parentheses _(¢) Brac (@) Square brackets A truth table of'a two variable expression will always have a2” (2! ©z (a) 2? f(xy)axtyisa (a) Boolean variable (b) Boolean Expression (©) Boolean Function (d) Boolean Algebra Standard product is known as (a) Boolean function (b) Maxterms (6) Minterms (@) Literals Standard sum is known as (@) Boolean function (b) Maxterms (©) Minterms (d) Kemap ANSWER KEY