UNIT, a PONY eae 3 ‘ eD 01 Digital Systemdeal @ Rogic Design ica Soo 5 1 \\\SSO¥ Short Intr; Ipuhit In this Chaj ‘will discuss the Boolean functions, logic, digital logic and difference between analog and digital signals. We will also discuss several types of gates, their truth tables, and digital devices including half and full adders. Q.1 Describe Analog and Digital Signals with their conversion. o»s03001 Ans. Digital systems are the backbone of today’s electronics and computing. They manipulate digital information in the form of binary digits, which are cither 0 or 1 and are used in calculation devices such as calculators and computer, among others. 1. Analog signals Analog signals are signals that changes with time smoothly and continuously over time. They can have any value within given range, Examples include voice signal (speaking), body's temperature and radio-wave signals. 2. Digital signals Digital signals are the signals which have only two values that are in the form ‘0° and ‘1 these are utilized in digital electronics and computing systems. Analog to digital converter (ADC) and digital to analog converting (DAC) are important operations_in_ to, cAtpchnolozicall developments, enabling the transmission and control of signals. > \_ (C(O)\\ eae Signal Continuous \\VZ\ (USS _ Discrete Infinite possi 5 \ ww Finite (0 or 1) Example: Saund\wave's) \? Example: Binary data in computers Y Analog to “ADC is the conversion of analog signals into digital signals, which are discrete and processed by computerized devices like computers and smart phone. Digital fo Analog Conversion (DAC): DAC is the conversion whereby analog signals are converted to digital signals, making it possible for human to perceive the information, for instance through speakers, as depicted in figures Sound Waves Electrical Voltage Binary Data. __—Electrical Voltage Sound Waves. O\\5 pS é Anal jal Vic Versa (H.Q Picture is available on Pg# 235) ’ 48ADC and DAC Conversion Digital to analog conversion, and vice. er storage, and transmission. Digital sae and are therefore better suit rangmil Example: Sound wayes Let us consi jere one person is speaking into a microphone while the other person is rect ind through speakers as illustrated in the figure. 1. Microphone (ADC)! When you speak into the microphone your voice produces sound waves (analog signals) that are captured by the system). This is done by converting the sound waves into digital form using an ADC with the microphone. 2. Speakers (DAC): At the receiver end, the digital signals are then converted back into analog signals with the help of DAC. The speakers then translate these analog signals back into sound waves to enable you hear to the other person’s voice as if they were speaking directly to you. Q.2 Describe Boolean Algebra and Logical Gates with the help of Corwsponding Truth Tables. OR Explain the usage of Boolean functions in computers. 09503002 Ans. Boolean algebra is a branch of mathematics relate to logi¢ and symbolic computation, using two values namely True and False. It is an essential branch of digital circuits since it is the basis for the analysis and design of circuits. Boolean Functions and Expressions Binary values are used to describe the relationship between variables inahe Boolean function and Boolean expressions. The expressions are built using OR ne logic operations and can in several ways be a, onftimi thee Binary Variable sand Logic Operation§ ues;-0 and 1. Logic operations are basic jing of these binary variables. The primary Binary variables that can haya logic operations : 5 1. AND Op: AND is the basic logical operator which is used in Boolean algebra. It requires two binary operations implemented in, inputs which will give a single binary output The symbolic used for the AND operation. The output of the AND operation is “1” only when both inputs are “1”. Otherwise, the result is “O”. Example: A=1 (True) B=0 (False) ‘The AND operation for these variables can be written mathematically as: P=AB In this example: A= 1,B=0 Therefore, then, the result P of the AND operation is 0 (false). Truth Table 0 0 iS) Ou iat TAS Rel mye 2. OR Operation The OR operation is ano! earth KS in Boolean algebra. To be specific this is al8o, a function Daeg les as i produces a single binary output. According tetable, ee oe = aeaune Slealols| Hlol-Hlo 2 aeOR operation yield true (1) output when at least of ‘1’ of the sin OST output ut is 0 only when both inputs are ‘0’ o Raamele ‘ Wao Aoniny onsider two binary man Nia \\ B=0 (false) The OR © Variables can be written mathematically as: P=A+B In this exemple A=1,B=0 Therefore, result P of the OR gate wal be 1. Truth Table AA truth table is useful for better understanding of how the OR operation is organized and what the result of the OR’s application is for all variants of the input variables. Below is the | "°.® : truth table for the OR operation eee sea MNT» vs oF ayo both of the inputs to this operator are 1. me ns which takes a single binary ‘one, the output is zero and if the input is zero, Did you know? In binary logic, 1 + 1 does not equal 2 but equals 1 in ° isle betel estes 3. NOT Operation: 9 The NOT operation is one of the bask liebe variable and simply “ant 4 ree the output is on Fame aA Consider a =a A=1 (true) The NOT operation for this variable can be written mathematically as: P=AorP=3A This signifies that if you have A = | (true), the result of NOT operation is going to be 0 (false). Truth Table nN NOT (P) 0 1 0 BOOLEAN ALGEBRA + Logical Operators * Boolean Laws ¢ Truth TableQ.3 How Are Boolean Functions Constructed? Provide a Detailed OR Describe how to construct a truth table for a Boolean express ‘Ans, Boolean functions are algebraic stateméats variables and logical operatigns-(These ine Elpltioulariy important for digital logic design and are employed in fe ate fis Wivital circuits, which are the basis of current computers, mobi sittple calculator. Ursin a Penn : "A Boles’ function is a function which has a one or more binary inputs and products a single binary output. The inputs and outputs can only have two values: False (represented by 0) and true (represented by 1). The construction of Boolean functions is done by employing the basic logical operations such as AND, OR and NOT, which connect the inputs to generate the correct output. Example 1: Simple Boolean Function ‘Consider a Boolean function with two inputs, A and B. We can construct a function F that represents the AND operation: F(A, B)=A.B Input : : A\ coun d : f \ OQ WA The ceria ‘demonstrates a basic digital circuit, which is an AND gate..The box symbolt: ID function F(A, B). This box ‘has two inputs A and B. If both A and B are 1, the output will be 1. In any other case, the output will be 0. The truth table for this function is as follows:- —|-|olo) 2 H|olo Example 2: Now, let us construct a more complex Boolean function with three inputs, A, B and eG F(A, B,C)=AB+ A.C ‘This function uses AND, OR and NOT at the same: time. The truth table for this function is as follows: iS © The results of AND operation between two vam K ‘the column A.B. The column A standing for the NOT ; Explanation «The parameters A, B and C are included in the following ex: Every value in the col she Of AND operation between the values in the fifth column and pSOF oe oa Did you know? ofopi tod rey on George Boole, a Mathematician | of fof ain eno who invented Boolean algebra [i Ott A Ni] 5 Vat was bom in Lincoln, England in | 1 Sy 0 the year 1815. 1 ToL 20s a Oa a0) 0 1 1 0 1 o | 0 1 AST Lobos e dere: 1 Q.4 Discuss Logic Gates and their Functions. —_ 09503004 ‘Ans, Logic gates are physical devices in electronic circuits that perform Boolean operations. Each type of logic gate corresponds to a basic Boolean operation. Example of the logic gates are: AND Gate: Implements the AND function. It outputs true only when both inputs are True (1) Imagine a simple electro ND gate. If you press two switches (both must be ON), a light bulb © Switel of * Switch ON (True) «Right bulb: ON (True) because both is switches are ON. « _ Ifeither switch is OFF, the light bulb will be OFF. OR Gate: Implements the OR function, It outputs true when at least one input is true. | AtB | OR Gate NOT Gate: Implements the NOT function. It outputs the opposite of the input. See bs es: nf eee Ce Gate Pe GeeNAND Gate: This gate is achieved when an-AND gate is combined with a NOT erates true when at least one of the inputs in false. In other words, it isi presented in figure. pat ee NAND Gate Example: Imagine a safety system where an alarm should go on detects an issue. © Sensor 1: No issue (False) Sensor 2: Issue detected (True) «Alarm: ON (True) becaiise one sensor detects an issue. XOR Gate: The XOR (Exclusive OR) gate outputs true only when exactly one of the inputs is ime, It differs from the OR gate in that it does not output true when both inputs are tue. Itis shown in Figure. f = Example: Imagine a sc iby 4 video games or do homework, but not both at the ; ° © Play vide Yes (True) © Do homework: No (False) f «Allowed? Yes (True) because only one activity is being done. 5 Mention and describe fundamental Boolean Algebraic rules with the help of examples. ‘09503005 oR Describe the concept of duality in Boolean algebra and provide an example to illustrate it. ‘Ans. Simplification of Boolean function is a particularly important process in designing an Gficient degtal circuit, Such simplified functions required fewer gates making them ‘compact in size, energy efficient and faster than the complicated ones. Simplification means applying of some Boolean algebra rules to make the functions less complicated. A+0 1. | Identity Laws 2. | Null Laws 3, | idempotent Laws atest” q My 4 CauiNuitieal (A+ A=1 NI AA5. |CommutativeLaws | A+B=B+ CO A : eran = ao 7, Pigiitie Laws | A. (BHC) =(AB)+ (A.C) Nee a A+ (B.C)=(A4B). (AXC) WA 8. | Absorption Laws AHAB) =A 9. |DeMorgan’s Theorems | 4+ B-AB AB=A+B 10. | Double Negation Law | a = 4 Simplification Examples Example 1 = Simplify the expression A+ A. B Solution oo Ubi ey ces (Distributive Law) HL (At (Complement Law) aes (Identify Law) Example 2 HInye Simplify the exy aticl Solution (De Morgan’s Theorem) AR +A (Since Ais already present in A.B, we can use absorption law. Example 3 Simplify the expression (A+B) . (A+B ) Solution (A+B) . (A+B) =A. (A+B )+B.(A+ (Distributive Law) OE O ee 5 (Absorption Law) (Identity Law) (Distributive Law) (Null Law) (Identify Law) Example 4 Simplify the expression A+B . (A+B) Solution : ae A+B. (AtB)=(A.B)(A+B) 5 Paw) =A.B Atal FAO ol ‘Identpotent Law) (Identity Law)ZOO eir truth tables, Boolean Q.6 What are the Applications of Digital Compare and contrast half-adders ant expression, and circuit dit an Ans, Digital logic an esses fn Secdoiig of several modern electric systems, such as computers, acca other digital gadgets. Digital logic optimize in many ways in order to crea enhance circuits meant to perform various tasks. Two important applications of digital logic are the design of adder circuits and the use of Kamaugh maps for function simplification. Half-adder and Full-adder Circuits Adder circuits are widely used in the digital circuits to perform arithmetic calculations. There are two general forms of adder circuits known as half-adders and full adders. 1. Half-adder Circuits A half adder is a basic circuitry unit that performs addition-of two single-bit binary digits. It has ‘two inputs, usually denoted as A and B, and two outputs: thie sum (S) and the carry (C). Truth Table for Half-adder ° ERR ToSaneg ° mlolelo 0 1 1 00 2 \ : a ecom™ Boolean Expressions fot Hal Ee qo u aN =AB In this case represents the XOR operation. The sum output is high when only one of the inputs is high, while the carry output is high when both inputs are high. Boolean Expressions $< Sum = A®B : 2. Fullkadder CireuitsQ\ \-— \\ A full-adder is a more i adds three single-bit binary numbers. Two bits that ma previous addition. It has three inputs, denoted as A, B, and 9 ———Cia (carry input), and two outputs: called the sum (S) and the ~ = ary (Ci Oia being integs values. NAN G “4 etna enn) 0 0 G NSE 71 0 Bis) 0 1 0 nnn OT ORS duehiad 0 1 1 {of 0 1 0 bee eGo hahcaad. 1 PSE ICO 0 1 TN Srapse 1 Ey Boolean Expressions < = ee Sum = A®B®Cin Carry = (A.B) + (Cin(A@B)) Cin { Daw ‘ | B ° ; i x Dapeng a The sum output i high js oaNe odd whereas the carry output is high if the number of high inputs i "7 Q.7 What do vouknojw\ ‘arnaugh Map (K-Map)? Describe its structure. _09s03007 OR How do Karnaugh maps simplify Boolean expression? Provide a detailed example with steps. Ans. A Kamaugh map (K-map) is a graphical representation which can be used to solve Boolean’ algebra expressions and minimize a logic function where algebraic computations are not employed. It is a technique in which the truth value of Boolean function is plotted to enable the ‘identification of patterns and to perform term combining for simplification, A=0,B=1,C=0 A=0,B=1,C=1 ABC A=1LB=0,C=0 | ABC NN A=1B=0,C=1 | Thee (CO AA BOLA TALI lane | AS NBS OS ABC foe A,B and C._ 0 ———_———These cells are filed with ‘1’ or ‘0” in referenceto 1 ‘ ols © 2 Variables: 2x2 grid =O aM 8) a A K-map is a matrix where each square is a cell, which corres oat e| (Basle: of the K-map depends on the number of. Ht uy aS ‘Smnbination. ction. The size * 2 Variables: 24 gris \\ ) a 4 «vantage «5 Variable! 8 grid (less common for manual simplification) Every cell in the K-map represent a minterm, and the cells in each row of the K-map differ by only one bit at any particular position, following the gray code sequence. Q.1 What are the digital systems? o9s02008 Ans. Digital systems are the basis of the present-day electronics and computing. They process digital data in form of ‘0’ and ot : Q.2 What do you know about Analog systems? 09503009 Ans. Analog signals are continuous time varying signal. nA Q.3 How ADC is processe A Ans, ADC (Analog to Digit! y the process vices for example col signals into discrete signals that can be processed by digital devices for example computers and smart phones. Q.4 How DAC is processed? ‘09503011 ‘Ans, DAC (Digital to Analog Converter) converts the digital signal back to the analog signal. Q.5 Define Digital Logic. 9803012 Ans. Digital logic is the basis of all digital systems. This is the technique we use to process digital information in the form of binary numbers. (ren Q.6 What is Boolean Algebra? —_09s03013 Ans, Boolean algebra is a sub-discipline: oj mathematics based on operations invél\i binary variables. O\"\——a\\ K \ hort Questions(Addi Q.9 What = oo 09503014 Oo’ Q.7 What d LY Snot ARO ‘Ans, In the case of AND operation the output is 1 only when both input values are 1, Otherwise, the output is 0. Q8 What do you know about OR Operation? 09503015 Ans, In an OR gate, the result is 0 only when both the input values are 0. Otherwise, the output is 1. aa) you (Ge@y about NOT Oo (09503016 operation the simplest logical eration in Boolean algebra, which accept a + single binary inputs and gives its opposite as the outputs. NOT (A) Q.10 What are the Boolean Functions? (09803017 ‘Ans, Boolean functions are mathematical expressions that represent logical operations involving binary variables. Example: AND, OR, NOT Q.11 What are the basic logic gates and their truth tables? 09803018 Ans. AND Gate: Outputs 1 when all inputs are 1. OR Gate: Returns | if at | 1 COW C input is i ne {\ aie Heh ‘complement of the (an BE These basic gates serve as the foundation for NAND, NOR, XOR, and XNOR gates.FETE ROLLS Q.12 What is the crucial element of digital c circuit? 09506019 Ans. A crucial element of digithl\ Gtieh(t() design is the logi¢al\ \ swhich~ represents the st bk tircuit by showing ci tween logic gates, Q.13 fe adder circuits? —99s03020 Ans. Adder circuits are widely used in the digital electronic systems with the principal application in arithmetic operations, Q.14 Differentiate between Half and Full adder. 09503021 Ans. A half-adder is a digital circuit used to compute the addition of two single-bit binary numbers. A fulladder is a more complex circuit that adds three single-bit numbers: two main bits and a carry bit from a previous addition. Q.15 Define K-map. (09503022 Ans. A Kamaugh map (K-map) is a graphic aid that is employed in simplificationCpf, Boolean expressions and_minimizi fa 1. Digital system depends on? _oosus026 (a)11 (b)00 () 10 (d) None of These 2. In digital systems 0 represents? (a) OF (b) OFF ()ON (d) Alll of These [Link] digital systems 1 represents? —09s03027 (a) OF (b) OFF (c)ON (d) All of These 4. Bit stands for___? 09503028 (a) Binary Digit (b) Binary Integer (©) Binary Value (d) Binary Number 5. What does ADC represents? 3a) / (a) Analog Digital Conyersioy wa \ (b) Analog Digital Co A\USeY nyghient - Ae functions tS for compl itho al jic/dj i sh a multiplexer, and how it ‘work in digital circuits? o9sox Ans. A multiplexer (MUX) chooses one « many input signals and sends it to the outp based on control signals, Q.17 Explain the word —_ propagation delay in terms of digital logic gates, 09503024 Ans. Propagation delay is the time it takes for an input change to result in an outpt change ina logic gate.It_ influences th overall performance of digital circuits. Q.18 What do you know about minterm? 9so302s Ans. In Boolean algebra, a minterm is _ particular product term whereby oa variable of the function is present in either its true form or its complement. Ead minterm corresponds to \d only one of —_variabie (@)\\that makes 1) to true or 1. \\) it Questions (Additional) (d) All of These [Link] does DAC represents? _oos03030 (a) Digital Analog Conversion (b) Analog Digital Conversation (c) Analog Digital Convenient (d) All of These 7. Which signals are in discrete form? 09503031 (a) Analog (b) Digital (c) Both a,b (d) None of these 8. Which signals are in Continuo form? 09503032) (a) Analo; igital a oho these @ example of Anal 09503033, ae = ven gaen \B \\—“(a) Sound Wave (6) Binary ()10 (d) None of these (c) Analog Re10. Which one is the example of a Signal? nage (a) Sound Wave _(b) Bina: (11 11. The out aan ration is 1 i when both/inputs are? 09503035 (a)0 (b) 1 (10 (00 12. OR operation yields 1 output when at ontrol Unit (b) Central Unit (c) Circuitry Unit (d) None of these [Link] Arithmetic Operations like ‘Addition, Subtraction are performed by? 09503039 (b)cU (a) ALU (c) UDP (d) All of these least of ___of the input is true. oss03036 16. Comparison of two or more values are (a)0 (b) 1 performed in? o9soaoso (10 (00 (a) CU (b) LU (c) UDP (d) Alll of these 13. ALU stands for z eieer 17.1n K-map, K stands for___? _9s03041 (a) Arithmetic & Logic Unit (a) Knowledge _(b) Karnaugh (b) Arithmetic & Local Unit (¢) Both a,b (d) None of these nA COUN fiels leis. aaaare [<4 bl 8fa | 9 a [10 |» [ote QI aa 41a (is|a|i6] > fit [. (Wo a Solved Exercise Q.1 Choose the correct option. 1. Which of the following Boolean (c)XOR gate (d) NOT gate expressions represents the OR operation? o9snx042 @AB (b) A+B (A (d) ASB 2. What is the dual of Boolean expression A.0=0? 09503043. (a) AH1=1 (b) AH0=A ()AI=A (a) A.0=0 Which logic gate outputs true only if both inputs are true? o9sasoas (a) OR gate (b) AND gate ‘ \ |. In a half-adder circuit, the carry is generated by which operation? 09sa3045 (a) XOR operation (b) AND operation (c) OR operation (d) NOT operation What is the decimal equivalent of the binary number 1101? 09503046 (a) 11 (b) 12 © Ne \ GON Ay Lae 4[> > ——sBN comm \ f TOs i the input variables. 1, Define a Boolean function and giy an example. ff) 9 marsha Ans. See Short oa \ ean 3. Explain the difference between 2. What is the si vob KD truth analog and digital signals. (09503049 table in sige ovs030ss Ans, See Short Question No.1,2. Ans. ing le is an important tool in 4. Describe the function of a NOT gate digital logic because it provides a systematic with its truth table. o9s030s0 method for representing the behavior of a Ans, See Short Question No. 9 logic cireuit or Boolean function for all 5. What is the purpose of a Karnaugh possible input combinations. A truth table is map in simplifying Boolean expressions? useful for better understanding of hhow the Ress 09503051 OR operation is organized and what the Ans. See Short Question No. 15 Long Q Oy) 1. Explain the usage of Boolean functions in computers. 09503052 Ans. Long Question No. 2 Describe how to construct a truth table for a Boolean expression with an example. o9sox Ans. Long Question No. 3 Describe the concept of duality in Boolean algebra anete cone to isa 2. - it, Ans. Long Question No. ee a Sy 4. Compare and contr; ain including their truth tables, Boole: expression, and circ 9503 Ans. Long i 5. How. A ‘itaps simplify Boolean expression? Provide a detailed example wit steps. Ans. Long Question No. 7 6. Design a 4-bit binary adder using both half-adders and full-adders. Explain each st with truth tables, Boolean expressions, and circuit diagrams, sos Ans. Half-adder Circuits : A half adder is a basic circuitry unit that performs addition of two single-bit binary digits. It has two inputs, usually denoted as A and B, and two outputs: the sum (S) and the carry (C): ‘Truth Table for Half-adder th Hlololo HlHlo 0 1 1 0 1 ia ih she -}o}-| 2! elolol-le halls] ST Boolean Expressions: Sum = A@B@Cin Carry = (A.B) + (Cin.(A@B) ; ‘The gum output is high if the number of high inputs is odd whereas the carry output is high ifthe number of high inputs is at least 2. 7. Simplify the following Boolean function using Boolean algebra rules: 09503088 F(A, B)=A.B+A.B Ans. . F(A,B)=A<(B+l) Distributive law Null Law 2 Zoom ag CY ‘VSS=——a—aeaeeoooF(A, B,C) = A+B+AC Ans. Fees OO gol 8... Use De-Morgan’s laws to simplify the following fun Awe coum ossna0s9 3 A F(A,B, F(A, B,C) =(A'B) ne C) F (A, B, C) =A-B+A-C (Result) 9. Simplify the following expressions. 09503060 (a) F=A+B. (A+B) ‘Ans. XX=0 Null Law Using Complement Law So, F=0 (b) (A+B). (A +B) Ans. F=(A+B)-(A+B) FeA-A+A-B+B- A+ BB A: A=0 (Complement Law) om Series gcrermnve® F=A-Bt j AA © \UBITe Ans, F=A+A (B+C) F=A+(A-B)+(A‘C) Distributive law F=A+ B+ A-C Absorption Law (@) A+B+A.B Ans, F=A-B+A-B by using De-Morgan’s law (©) (A.B) +(A By Ans. F= (A.B) + (A .B) F=A@B OR F-A@B [Link] = We on daily basis. Can you kes a password to unlock your smart Activity-1 Consider what do you do wiff distinguish activities hatte : YeAns, Class Work\ Lab Work \ Practical Work. oun Saat Activity-2 raw CG ssna062 Let's make learning these logical functi i 1. AND Adventure: Form prize (like both w s| . OR Onin ie extra play . NOT Negatives: Ask true/false questions and have students shout the opposite answer. For example, “Is the sky green?” Students should shout “No!” (NOT True). Construct a basic circuit using a breadboard, a battery, and LED lights to represent AND gate. Connect two switch which will serve as, inputs A and B. In this experiment the LED will light up only when both switches are pressed. Ans. Class Work\ Lab Work \ Practical Work. Activity-3 (09503063, Construct a digital circuit that includes both half-adders and full-adders to add two 4-it binary numbers, Create the truth tables. Boolean expressions. And circuit diagrams for each steps. Ans. Class Work\ Lab Work \ Practical Work rm CO 3 Hint: Check Long Question No.6 es wane ag a cs fun activities. If at least one activity is possible, the class gets +