Institute of Aeronautical Engineering: Mid Semester Test
Institute of Aeronautical Engineering: Mid Semester Test
Institute of Aeronautical Engineering: Mid Semester Test
II.
Credits
4
Mr. B. Naresh
Mr. D. Loknath Reddy
II - B. Tech -ECE
Course overview
The course will make them learn the basic theory of switching circuits and their
applications in detail. Starting from a problem statement they will learn to design
circuits of logic gates that have a specified relationship between signals at the input
and output terminals. They will be able to design combinational and sequential
circuits .They will learn to design counters, adders, sequence detectors. This course
provides a platform for advanced courses like Computer architecture,
Microprocessors & Microcontrollers and VLSI design. Greater Emphasis is placed on
the use of programmable logic devices and State machines.
Prerequisite(s)
Level
UG
III.
Credits
4
Periods / Week
5
Prerequisites
Logical Arithmetic
Marks Distribution
Sessional Marks
University
End Exam
marks
Total marks
75
100
IV.
Evaluation Scheme
Sl.No
1
2
3
4
5
V.
Component
I Mid Examination
I Assignment
II Mid Examination
II Assignment
End Semester Examination
Duration(Hrs)
1hr 20 min
-1hr 20min
-3hr
Marks
20
5
20
5
75
VI.
Course Outcomes
2 | Page
VII.
PO 2
PO 3
PO 4
PO 5
P0 6
PO 7
PO 8
PO 9
3 | Page
Level
H
Proficiency
assessed by
Lectures,
Assignments,
Exercises.
Hands on
Practice
Sessions.
--
Lab sessions,
Exams
Design
Exercises.
--
Oral
discussions
--
Seminars
Discussions
VIII.
N - None
related
Syllabus:
S - Supportive
S
S
Seminars, Paper
Presentations
Discussions,
Exams
Development
of Mini
Projects
H - Highly
UNIT -I:Number
System
and
Boolean
Algebra
And
Switching
Functions:
Number Systems, Base Conversion Methods, Complements of Numbers, CodesBinary Codes, Binary Coded Decimal Code and its Properties, Unit Distance Codes,
Alpha Numeric Codes, Error Detecting and Correcting Codes.
Boolean Algebra: Basic Theorems and Properties, Switching Functions, Canonical
and Standard Form, Algebraic Simplification of Digital Logic Gates, Properties of
XOR Gates, Universal Gates, Multilevel NAND/NOR realizations.
UNIT II: Minimization and Design of Combinational Circuits:
Introduction, The Minimization with theorem, The Karnaugh Map Method, Five and
Six Variable Maps, Prime and Essential Implications, Dont Care Map Entries, Using
the Maps for Simplifying, Tabular Method, Partially Specified Expressions, Multioutput Minimization, Minimization and Combinational Design, Arithmetic Circuits,
Comparator, Multiplexers, Code Converters, Wired Logic, Tristate Bus System,
Practical Aspects related to Combinational Logic Design, Hazards and Hazard Free
Relations.
UNIT -III: Sequential Machines Fundamentals:
Introduction, Basic Architectural Distinctions between Combinational and Sequential
circuits, The Binary Cell, Fundamentals of Sequential Machine Operation, The FlipFlop, The D-Latch Flip-Flop, The Clocked T Flip-Flop, The Clocked J-K Flip-Flop,
Design of a Clocked Flip-Flop, Conversion from one type of Flip-Flop to another,
Timing and Triggering Consideration, Clock Skew.
UNIT -IV: Sequential Circuit Design and Analysis:
Introduction, State Diagram, Analysis of Synchronous Sequential Circuits,
Approaches to the Design of Synchronous Sequential Finite State Machines, Design
Aspects, State Reduction, Design Steps, Realization using Flip-Flops
Counters - Design of Single mode Counter, Ripple Counter, Ring Counter,
Shift Register, Shift Register Sequences, Ring Counter Using Shift Register.
UNIT -V:
Sequential Circuits: Finite state machine-capabilities and limitations, Mealy and
Moore models-minimization of completely specified and incompletely specified
4 | Page
IX.
Course Plan
At the end of the course, the students are able to achieve the following course
learning outcomes (CLO):
Lectu Unit
re
NO
No.
Number
systems,
conversion methods
1-3
4-5
6-7
8-10
11-13
5 | Page
Topics to be covered
base
different
T1 - 1.1 to
and
its
1.5
Complements
of
numbers
Understand the arithmetic operations
codes-binary codes, BCD code
T1 - 1.7
carried by digital systems.
and its properties ,
Unit
distance
code,
Understand
the
different
alphanumeric codes, and error
code representations in digital T1 - 1.7
detecting
and
correcting
systems.
codes.
Basic
theorems
and
its Learn Boolean algebra and
properties,
switching logical operations in Boolean T1 2.1 to
functions,
canonical
and algebra.
2.6
standard form.
Algebraic
simplification
of Apply different logic gates to T1 2.8
digital logic gates, properties functions and simplify them.
of XOR gates.
14-15
16-21
22-23
24-26
27-31
32-33
34-36
37
38-39
40-45
46-49
50-51
6 | Page
52-58
V
59-62
Minimization of completely
specified and incompletely
specified sequential machines
partition techniques and
merger chart methods
concept of minimal cover
table.
Salient features of the ASM
Chart- Simple Examplessystem design using data path
and control subsystems
control implementations
63-65
Illustrate minimization of
complete and incomplete state R4 - 7.3,
machines and to write a
7.4
minimal cover table
R7
Examples of weighing
Analyze the different
machine and Binary multiplier examples to ASM.
R5 - 18.1
TO 18.3
X:
Mapping course objectives leading to the achievement of the program
outcomes
Course
Objecti
ves
I
II
III
IV
V
VI
PO
1
H
PO
2
PO
3
PO
4
H
S
S
H
H
H
PO
9
PO
10
PO
12
S
S
S
H
H
H
H
H
S = Supportive
PO
11
S
H = Highly Related
XI:
Mapping course learning objectives leading to the achievement of the
program outcomes:
COURSE
OUTCO
MES
1
2
7 | Page
PROGRAM OUTCOMES
PO
1
PO
2
PO
3
P
O
4
PO
5
PO
6
H
H
PO
7
PO
8
PO
9
P
O
10
H
S
P
O
11
PO
12
S
H
S
8
9
H
S
S
H
H
S = Supportive
Prepared By
Date
H = Highly Related
HOD,ECE
8 | Page