0% found this document useful (0 votes)
35 views3 pages

NOR Gate Implementation and K-Map Simplification

1. The document discusses Boolean algebra, logical gates, number systems, and digital logic circuits. It defines binary, octal, and hexadecimal number systems, explains how to convert between decimal, binary, octal, and hexadecimal, and provides examples of logic circuit implementations and simplifications using K-maps and DeMorgan's theorem.

Uploaded by

Zaigham Abbas
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
35 views3 pages

NOR Gate Implementation and K-Map Simplification

1. The document discusses Boolean algebra, logical gates, number systems, and digital logic circuits. It defines binary, octal, and hexadecimal number systems, explains how to convert between decimal, binary, octal, and hexadecimal, and provides examples of logic circuit implementations and simplifications using K-maps and DeMorgan's theorem.

Uploaded by

Zaigham Abbas
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

I.

What is Boolean algebra, define its history


II. What are the logical gates, define each in detail
III. Implement using NOR gates only, maximum five gates are allowed.
i.F(v,w,x,y,z) = ∏(0,4,10,16)

IV. If we have a Sum of Product expression, which output is located at position 4,5,12,13,9 . Then use K-Map to
minimize expression and draw a socket.
V. What are Number Systems? State the road map for designing the number system of any particular base.
Explain Binary, Octal and Hexadecimal number systems.
VI. (a) Convert the decimal number (29.8)10 to binary, octal and hexadecimal.
a. (b) Simplifying by applying Demorgan’s theorem and draw the Simplified Circuit.

i. A.B  A.B.C.D  ( A.B).( A.B.C.D)


VII. Implement using NOR gates only, maximum five gates are allowed.
i.F(v,w,x,y,z) = ∏(0,4,10,16)

VIII. (a) Construct truth table for the following function


i. F(a,b,c)=(ab+a′c)′+bc
b. (b) Use the truth table of (a) to write the function F in sum of minterms form

IX. Simplify the following function using Karnaugh map.


i. F(w, x, y, z) = w′z + xz + x′y + wx′z

X. Draw the truth table of a Half-Adder. Draw the logical circuit diagram of a half-adder.
a. Write Boolean expressions for all the output signals of half adder circuit.

Solve dld
1. Implement using NOR gates only, maximum five gates are allowed.
F(v,w,x,y,z) = ∏(0,4,10,16)

2. What are Number Systems? State the road map for designing the number system of any
particular base. Explain Binary, Octal and Hexadecimal number systems.
A computer, like all digital systems, utilizes two states to represent information. These two states are
given the symbols 0, and 1. It is important to remember that these 0's and 1's are symbols for the
two states and have no inherent numerical meanings of their own. These two digits are called binary
digits (bits) and can be used to represent numbers of any magnitude. Digital systems including the
microcontroller carry out all arithmetic and logic operations internally using binary numbers. Because
binary numbers are long, a more compact form using some other number system is preferable to
represent them. The computer user finds it convenient to work with this compact form. Hence, it is
important to understand the various number systems used with computers. These are described in
the following sections.
Number System
We are familiar with numbers, characters and symbols. But this type of data are not suitable for
microprocessor, logic circuits, computers etc. For this reason data is converted into electronic pulses
and each pulse is identified as code. Then this code is converted into numeric format by ASCII, where
each number, character and symbol have numerical equivalent. E.g.: Character A has ASCII value 65.
Using this equivalent, the data is interchanged into numeric format. For this numeric conversions we
use number systems having a base number, which indicates the number of digits in that number
system.

Types of number system


 Binary Number System
Represents two types of digits 0's and 1's, so the base of number system is 2.
Uses two types of electronic pulses, where absence of pulse shows 0 and presence of pulse shows 1.
Each binary digit is called as bit.
Left-most bit of a number is known as Most Significant Bit (MSB) and right-most bit is known as Least
Significant Bit (LSB). Its same for all number system.
A group of 4 bit is called as nibble and group of 8 bit is called as byte.
Value of digit is determined by the position of digit in the number, where lowest value is for the right-
most position and each successive position to the left has a higher place value. Its same for all number
system.
Examples: a) (010101)2 b) (1010.101)2

 Octal Number System


Represents 8 types of digits from 0 to 7, so the base of number system is 8.
It takes exactly three binary digits to represent an octal digit.
Binary 000 is same as octal digit 0, binary 001 is same as octal 1, and so on.
Insufficient to convert values into bytes(8 bit), so not widely used in computers.
Examples: a) (03105)8 b) (4237.23)8

 Decimal Number System


Represents 10 types of digits from 0 to 9, so the base of number system is 10.
This is the most familiar number system with everyone.
Examples a) (582938)10 b) (3797.902)10

 Hexadecimal Number System


Represents 16 types of digits from 0 to 9 and alphabets from A to F, so the base of number system is
16.
Digits from 10 to 15 are represented as 10-A, 11-B, 12-C, 13-D, 14-E, 15-F.
As numeric digits and alphabets are used to represent digits, this number system is also called as
alphanumeric number system.
More complex number system and widely used in computer system.
Examples: a) (AF38)16 b) (CE7.5B)16
3. (a) Convert the decimal number (29.8)10 to binary, octal and hexadecimal.

(b) Simplifying by applying Demorgan’s theorem and draw the Simplified Circuit.

A.B  A.B.C.D  ( A.B).( A.B.C.D)

4. (a) Construct truth table for the following function


F(a,b,c)=(ab+a′c)′+bc

(b) Use the truth table of (a) to write the function F in sum of minterms form

You might also like