QUESTION 2 Draw a K-map for the function represented by the truth table, then complete the K-map template as a series of comma separated bits (1s & Os): e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t. [Kmap] abcd 0 0 0 0 0 0 0 1 F 1 1 0 0 1 0 0 F 0 0 1 1 1 cd 0 1 0 0 0 ab 0 1 0 1 1 0 1 1 0 ef g h 0 11 1 0 1 0 0 0 1 ij k 100 1 1 1 0 1 0 0 m❘n P 1 0 1 1 1 1 1 0 0 0 qr S t 1 1 0 1 1 1 1 1 0 1 1 1 1 1 16 points Save Answer

Q1. Convert following numbers in given radix system: a. (697)10 into Octal and Hexa decimal b. (2D9)16 into Decimal and Octal Q2. Using two’s complement representation, solve: a. 101110001 – 1111111001 b. 1010101010 – 1010010101

Write a VHDL program to design a circuit has 8-bit input data and 3-bit control signals (x, y, z). the output of the circuit as the following table Output XOO 0 0 0 1 1 1 y OOK 0 0 1 XOL 0 1 Z 0 1 X 0 1 1 Data_out= Data_in Data_out= Count of ones in Data_in High half of Data_out= Low half of Data_in Low half of Data_out= High half of Data_in Data_out= Data_in * 3+5 Data_out Data_out all ones all zeros

also show all groupings on the K-Map

Show each step clearly ... 1. Compute the 8-bit two’s complement for -79 and -23. 2. What are the negative decimal numbers represented by the bytes 0xF2 and 0x83? 3. Show how each of the following signed, decimal integers would be stored in 8-bit two's complement code. Give your answer in hexadecimal. Must show the steps to get the result. (part a) +99   (part b) -1

3-) Analyze the circuits below and write the Boolean equation for each Part. Simplify the equation using Boolean algebra and determine if they function as an XOR, XNOR or neither. A): Dor B): XD XD . D

Q1. Convert following numbers in given radix system: a. (697)10 into Octal and Hexa decimal b. (2D9)16 into Decimal and Octal Q2. Using two's complement representation, solve: a. 101110001 – 1111111001 b. 1010101010 – 1010010101 Q3. Perform following arithmetic operations: a. (6767)10 + (3592)10 using BCD b. (C7C)16 - (B0E)16 using 16's complement Q4. A code 1011011 needs to be sent to the receiver. Using, hamming code find out the code- word and the mechanism to check the corrected data when error occurred at 4th bit. (Assumptions: Right to Left with Odd Parity) Q5. (a) Convert the following logic gate circuit into a Boolean expression, writing Boolean sub-expressions next to each gate output in the diagram: A (b) Realise Ex-OR gate using universal gate? Q6. Implement and simplify f (A, B, C, D) = E(1,3,5,8,9,11,13,15) using K-map?

Question 01: Part 1: Make Output expression for the circuit given in Figure_1.Simplify using, Boolean laws & DeMorgan’s law.                                                                                            Part 2: Draw truth table & output (F) waveform using the given input waveforms in Figure_2

communication

Design a code converter that converts a decimal digit from BCD to excess-3 code, the input variables are organized as (A BC D) respectively with A is the MSB, the output variables are organized as (W X Y Z) respectively with W is the MSB, put the invalid decimal numbers as don't care. X= BCD'+B'D+B'C X= BC'D'+B'D+BC X= BC'D'+B'D+B'C X= BC'D'+BD+B'C