SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY
(AUTONOMOUS)
(Approved by AICTE, New Delhi & Affiliated to JNTUA, Ananthapuramu)
(Accredited by NBA for Civil, EEE, Mech., ECE & CSE)
(Accredited by NAAC with ‘A+’ Grade)
QUESTION BANK (DESCRIPTIVE)
Subject with Code: Digital Logic and Computer Organization (23CS0506)
Course & Branch: B.Tech –CSE, CCC, CIC & CSIT
Year & Semester: II - B. Tech. & I-Semester Regulation: R23
UNIT- I
PART-A (2 MARKS)
1(a) What is binary number system?
Binary Number System: According to digital electronics and mathematics, a binary number is
defined as a number that is expressed in the binary system or base 2 numeral system. It describes
numeric values by two separate symbols; 1 (one) and 0 (zero). The base-2 system is the positional
notation with 2 as a radix.
The binary system is applied internally by almost all latest computers and computer-based devices
because of its direct implementation in electronic circuits using logic gates. Every digit is referred
to as a bit.
Example: Convert 4 in binary.
Solution:
4 in binary is (100)2.
(b) What is an Excess-3 code?
Excess-3 Code: The excess-3 code (or XS3) is a non-weighted code used to express code used to
express decimal numbers. It is a self-complementary binary coded decimal (BCD) code and
numerical system which has biased representation. It is particularly significant for arithmetic
operations as it overcomes shortcoming encountered while using 8421 BCD code to add two
decimal digits whose sum exceeds 9. Excess-3 arithmetic uses different algorithm than normal
non-biased BCD or binary positional number system.
(C) What are the basic properties of Boolean algebra?
The three basic properties of Boolean algebra are the commutative, associative, and distributive
properties. The commutative property states that the order of the variable does not matter in OR
and AND operations. The associative property states that parentheses can be moved when two OR
or two AND operations are next to each other. The distributive property describes what happens
when an AND is distributed over an OR operation and what happens when an OR is distributed
over an AND operation.
(D) List out the names of basic logical operators.
There are three logical operators: AND,OR and NOT.
(E) List the names of universal gates with symbols
NAND and NOR gates are the universal gates.
A NAND gate is a combination of an AND gate followed by a NOT gate. It outputs a 0 only
when all its inputs are 1; otherwise, it outputs 1.
Symbol
Truth Table
NOR Gate
A NOR gate is a combination of an OR gate followed by a NOT gate. It outputs a 1 only when
all its inputs are 0; otherwise, it outputs 0.
Symbol
Truth Table
2.(a) Differentiate between floating point representation and fixed-point representation.
Floating Point Representation Fixed Point Representation
1. A Formulatic representation of real numbers
1. A representation of real data type for a
as an approximation so as to support a trade off
number that has a fixed number of digits after
between range and precision. the radix part.
2. Used to represent a wide range of values
2. Used to represent a limited range of values
3. Lower Performance 3. Higher Performance
4. More flexible 4. Less flexible
5. Overall the code is clearer and easy to read
5. This results in more lines of code which are
consequently more difficult to read.
6. Numerical stability with out double 6. Numerical stability can be determined
precision values is hard to ensure clearly.
(b) What is number system? Explain the different types of number systems
.
Definition: In digital electronics, the number system is used for representing the information.
The number system has different bases and the most common of them are the decimal, binary,
octal, and hexadecimal.
The base or radix of the number system is the total number of the digit used in the number system.
Ex: Suppose if the number system representing the digit from 0 – 9 then the base of the system is
the 10.
Types of Number Systems:
• Decimal Number System
• Binary Number System
• Octal Number System
• Hexadecimal Number System
1. Decimal Number Systems: The number system is having digit 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 is
known as a decimal number system because total ten digits are involved. The base of the decimal
number system is 10.
2. Binary Number Systems: The modern computers do not process decimal number; they work
with another number system known as a binary number system which uses only two digits 0 and1.
The base of binary number system is 2 because it has only two digit 0 and 1.
3. Octal Number system: The Octal system is base 8. Therefore, it requires 8 digits. The base of
octal number system is 8 because it has only two digit 0 to 7.
4. Hexadecimal Number system: The hexadecimal system is base 16. Therefore, it requires 16
different symbols. The values 0 through 9 are used, along with the letters A through F, which
represent the decimal values 10 through 15.
3.(a) Convert the (555)10 into binary, octal and Hexadecimal number systems.
(b) Convert the following into binary to decimal i) (1101.1) 2 ii) (1100.001)2
4.(a) Convert the following into Decimal into Hexa decimal
i) (5386.34) 10 ii) (214.35)10
(b) Represent signed numbers from +7 to -8 using different ways of representation.
5. Explain the Binary codes with examples.
Binary codes: The digital data is represented, stored and transmitted as groups of binary digits.
The group of bits, also known as binary code, represent both numbers and letters of the alphabets
as well as many special characters and control functions. They are classified as numeric or
alphanumeric. Numeric codes are used to represent numbers. Alphanumeric codes are used to
represent characters: Alphabetic letters and Numerals.
Classification of Binary Codes:
The different binary codes can be classified as
• Weighted Codes
• Non-Weighted Codes
• Reflective Codes
• Sequential Codes
• Alphanumeric Codes
• Error Detecting and Correcting Codes
Weighted Codes: In weighted codes, each digit position of the number represents a specific
weight. For example, in decimal code, if number is 567 then weight of 5 is 100, weight of 6 is 10
and weight of 7 is 1. In weighted binary codes each digit has a weight 8421. The codes 8421, 2421
and 5211 are all weighted codes.
Non-weighted Codes: Non-weighted codes are not assigned with any weight to each digit
position, i.e. each digit position with in number is not assigned fixed value. Excess-3 and gray
codes are the non-weighted codes.
Reflective codes: A code is reflective when the code is self-complementing. In other words, when
the code for 9 is the complement the code for 0, 8 for 1, 7 for 2, 6 for 3 and 5 for 4. 2421BCD,
5421BCD and Excess-3 code are reflective codes.
Sequential codes: In sequential codes, each succeeding 'code is one binary number greater than
its preceding code. The 8421 and excess-3 are sequential, whereas the 2421 and 5211 codes are
not.
Alphanumeric codes: The codes which consists of both numbers and alphabetic characters are
called alphanumeric codes. The most commonly used alphanumeric codes are: American
Standard Code for Information Interchange (ASCII), Extended Binary Coded Decimal Interchange
Code (EBCDIC) and Hollerith code.
Error defecting and correcting codes: Codes which allow only error detection are called error
detecting codes and Codes which allow error detection and correction are called error detecting
and' correcting codes. Hamming code is the mostly commonly used error detecting and correcting
code.
6.(a) List the Basic Logic functions.
A logic gate is a device that acts as a building block for digital circuits. They perform basic logical
functions that are fundamental to digital circuits. Most electronic devices we use today will have
some form of logic gates in them. For example, logic gates can be used in digital electronics such
as smartphones and tablets or in memory devices.
Basic logic gates
There are seven basic logic gates: AND, OR, XOR, NOT, NAND, NOR and XNOR.
(b) Explain about Basic Logic gates with symbols and truth table.
A basic logic gate is an elementary building block that takes one or more inputs and produces a
single output based on a specific truth table. There are only three fundamental logic gates - AND,
OR and NOT - that can be combined in different configurations to construct more complex digital
circuits and systems.
AND Gates: An AND gate is a digital circuit that has two or more inputs and produces an output, which
is the logical AND of all those inputs. It is optional to represent the Logical AND with the symbol ‘.’
OR gate: An OR gate is a digital circuit that has two or more inputs and produces an output, which
is the logical OR of all those inputs. This logical OR is represented with the symbol ‘+’.
NOT gate: A NOT gate is a digital circuit that has single input and single output. The output of NOT gate
is the logical inversion of input. Hence, the NOT gate is also called as inverter.
7.(a) Explain about Universal Logic gates with symbols and truth table.
NAND and NOR gates are the universal gates.
NAND gate: NAND gate is a digital circuit that has two or more inputs and produces an output, which is
the inversion of logical AND of all those inputs.
NOR gate: NOR gate is a digital circuit that has two or more inputs and produces an output,
which is the inversion of logical OR of all those inputs.
(b) Prove the following identities:
A’ B’ C’ + A’ B C’ + A B’ C’ + A B C’ = C’
A B + A B C + A’ B + A B’ C = B + A C
8.(a) Simplify the following Boolean Expressions:
A’C’+ABC+AC’+AB to three literals.
A’B (D’+C'D) +B (A+A’CD) to one literal.
(b) Simplify the given Boolean expression using K-map F(A,B,C,D)=
∑m(0,2,3,8,10,11,12,14)
9.(a) Simplify the following Boolean expressions using K-map
i) F (x, y, z) = ∑m (2, 3, 4, 5) ii) F (x, y, z) = ∑m (3, 4, 6, 7).
(b) Define combinational circuit and explain the procedure for designing a combinational
circuit.
combinational circuit: The circuit whose output at a given instant of time depends only on the
present input variables is known as combinational circuits. The combinational circuit consists of
input variables, logic gates, and output variables.
The block diagram of n*m combinational circuit is show in figure
DESIGN PROCEDURE:
The design of combinational circuits starts from the outline of the problem statement and ends in
a logic circuit diagram or a set of Boolean functions from which the logic diagram can be easily
obtained. The design procedure of the combinational circuit involves following steps:
• The problem definition.
• The determination of number of available input variables and required output variables.
• Assigning letter symbols to input and output variables.
• The derivation of truth table indicating the relationships between input and output variables.
• Obtain simplified Boolean expression for each output.
• Obtain the logic diagram.
10.(a) Explain about Binary Half Adder with truth table and logic diagram.
Half Adder: The Half adder operation needs two binary inputs: augend and addend bits; and two
binary outputs: sum and carry. The truth table shown in table gives the relation between input
and output variables for half adder operation.
Block diagram
Truth Table
K-Map simplification for carry and sum:
For carry For sum
Logic Diagram:
(b) Design and draw a full adder circuit.
Full Adder:
A full adder is a combinational circuit that forms the arithmetic sum of three input bits. It consists
of three inputs and two outputs. Two of the input variables, denoted by A and B, represent the two
significant bits to be added. The third input Cin represents the carry from the previous lower
significant position.
Block diagram
Truth Table
11.(a) Define Decoder and explain in detail about a 2-to-4-line binary decoder.
Decoder:
A decoder is a combinational circuit. It has n input and to a maximum m = 2 n outputs. Decoder is
identical to a Demultiplexer without any data input. It performs operations which are exactly
opposite to those of an encoder.
Block diagram
2 to 4 Decoder
Let 2 to 4 Decoder has two inputs A1 & A0 and four outputs Y3, Y2, Y1 & Y0.
(b) Design and implement the following Boolean function by 8:1 Multiplexer.
(A,B,C.D)=Σm(0,1,2,5,7,8,9,14,15).
