1.
PLAGIARISM OR HIRING OF GHOST WRITER(S) FOR SOLVING THE
ASSIGNMENT(S) WILL DEBAR THE STUDENT FROM AWARD OF
DEGREE/CERTIFICATE, IF FOUND AT ANY STAGE.
2.
SUBMITTING ASSIGNMENTS BORROWED OR STOLEN FROM
OTHER(S) AS ONE’S OWN WILL BE PENALIZED AS DEFINED IN
“AIOU PLAGIARISM POLICY”.
Note: All questions carry equal marks.
Q. 1 a) Explain the process of following conversions with examples: i) Binary to Octal and Hexadecimal b) ii) Octal and Hexadecimal to Binary
Differentiate Map method and Tabulation method in detail. Also discuss difference better Adder and Subtractor. (20)
Q. 2 a) Define Boolean Algebra and Logic Gates. b) What is difference between canonical form and standard form? Which form is preferable when implementing a Boolean function with gates? (20)
Q. 3 Given the Boolean function: F = xyz + xy’z’ + y’z implement it with: (20)
(a) AND, OR, and NOT Gates (b) Only OR and NOT Gates
(c) Only AND and NOT Gates
Q. 4 a)
Write down the ASCII codes (in Hex.) for the characters in the string “This is a wonderful course!” excluding the quotation marks. b)
Write down the ASCII codes (in Dec.) for the characters in the string “Hello, hope you are doing well!” excluding the quotation marks. (20)
Q. 5 a) Implement the following SOP function using NAND gate only
F = XZ + YʹZ + XʹYZ b) Implement the following POS function using NOR gates only
F = (X + Z) (Yʹ+Z) (Xʹ+Y+Z) (20)
1

Total Marks: 100
Pass Marks: 50
Note: All questions carry equal marks.
Q. 1 Design an excess-3-to-BCD code converter using a 4-bit full-adders MSI circuit. (20)
Q. 2 Using MSI circuits, construct a binary parallel adder to add two 16-bit binary number and label all carries between the MSI circuits. (20)
Q. 3 a) Differentiate Ripple Counters and Synchronous Counters with the help of an b) example.
Differentiate between multiplexer and de-multiplexer. (20)
Q. 4 Design a mod-5 counter which has the following binary sequence: 0, 1, 2, 3, 4. Use
JK flip-flops. (20)
Q. 5 a) Design a counter that has the following repeated binary sequence: 0, 1, 2, 3, 4, 5,
6, 7. Use RS flip-flops.
b) Write a note on each of the following: i) Memory ii) Decimal Adder (20)
Recommended Book:
Digital Logic Design by Morris Mano
Course Outlines:
Unit–1: Binary System
Binary Numbers Based Conversion of Octal, Hexadecimal and Binary,
Complements, Binary Codes, Binary Logic and ICs
Unit–2: Boolean Algebra and Logic Gates
Definitions, Theorems and Properties, Boolean Functions, Canonical and
STD Forms, other Logical Properties, Gates
Unit–3: Simplification of Boolean Function
Map Method, NAND and NOR Implementation, Tabulation Method,
Prime Implement
2

Unit–4:
Unit–5:
Unit–6:
Unit–7:
Unit–8:
Unit–9:
Combination Logic
Design Procedure, Adder, Subtractors, Code Conversation Analysis
Procedure, NAND and NOR Functions, Ex-OR and Ex-NOR Function
Combination Logic with MSI and LSI
Binary Parallel Adder, Decimal Adder, BCD Counter, Magnitude
Compactor, Decoders, Demultiplexers, Encoder, Multiplexer, ROM, PLA
Sequential Logic
Introduction, Flip Flop, Triggering, State Reduction Excitation Table,
Design Procedure, Design of Counter
Register, Counter, and Memory Unit
Register Counter, Timing Sequence, Memory Unit
Asynchronous Sequential Logic
Analysis Procedure, Circuits with Latches, Design Procedure, Reductions of State and Flow Tables, Race Free State Assignment
Digital Integrated Circuits
Bipolar Transistor Characteristics, RTL and DTL Circuits, Transistor,
Transistor Logic, Emitter Coupled Logic (ECL), Metal Oxide
Semiconductor (MOS), CMOS
==========
3