1. Tointroducethebasictoolsfordesignwithcombinationalandsequential digitallogic and statemachines.
2. To learn simple digital circuits in preparation for computerengineering
COURSE OUTCOMES (COs)
Upon Completion of the course, the students will be able to
CO1. Define different number systems, binary addition and substraction, 2’s complement representation and operations with this representation.
CO2. Understand the different switching algebra theorems and apply them for logic functions.
CO3. Define the Karnaugh map for a few variables and perform an algorithmic reduction of logic functions.
CO4. Design the Different Combinational logic Circuits for logic functions CO5. Design the Different Sequential logic Circuits for logic functions.
CO6. Design the various Registers and counters for logic functions Mapping of COs with Pos
Course Outcomes
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1:
3 2 1 2CO2:
2 1
CO3:
3 1 1 1
CO4: 3 2 2 1 2 3
CO5: 2 2 3
CO6: 2 2 2 2 2 2
Computer Science & Engineering Department, Kallam Haranadharedy Institute of Technology, Guntur Page 37
I Digital Systems and Binary Numbers
1.1 Introduction to NumberSystems 1
1.2 1
1.3 Introduction to Binary NS 1
1.3 1
Binary to decimal conversion 1
1.3 2
Decimal to Binary convertion 1
Tutorial -1(Conversions)
Octal to decimal conversion 1
Tutorial -1(Conversions) 1.4
2
Binary to octal conversion 1
1.4 3
Octal to binary conversion 1
1.4 4
Decimal to octal conversion 1
1.4
Binary to Hexadecimal conversion 1
1.5 2
Octal to Hexadecimal conversion 1
1.5 3
Decimal to Hexadecimal conversion 1
1.5 4
Hexadecimal to Decimal conversion 1
1.5 5
Hexadecimal to Octal conversion 1
Tutorial -1(Conversions)
1.56 Hexadecimal to Binaryconversion 1
1.5 7
1
1.6 Complements of Numbers 2
Tutorial -1(Complements of Numbers)
1.7 Signed Binary Numbers 2
UNIT-2 II Concept of Boolean algebra:
2.1 Basic Theorems and Properties of Boolean algebra 5 Tutorial -II(Theorems)
2.2 Boolean Functions 1
2.3 Canonical and Standard Forms 2
Tutorial - II(Theorems)
2.4 Minterms 1
2.5 Maxterms 1
UNIT-3
Computer Science & Engineering Department, Kallam Haranadharedy Institute of Technology, Guntur Page 38 QUESTION BANK
III Gate level Minimization:
3.1 Map Method 1
3.5 Products of Sum Simplification 1
3.6 Sum of Products Simplification 1
3.7 Care Conditions 2
3.8 Exclusive OR Function 1
Tutorial-III( CareConditions)
3.9 NAND and NOR Implementation 3
UNIT-4 IV Combinational Logic:
4.1 Introduction, Analysis Procedure, Design Procedure 1
4.2 Binary Adder Subtractor 1
Tutorial -IV(Binary Adder Subtractor)
4.3 Decimal Adder 1
4.8 HDL Models of Combinational Circuits. 2
Tutorial -IV(Multiplexers)
UNIT-5 V Synchronous Sequential Logic:
5.1 Introduction to Sequential Circuits & Storage Elements 1
5.2 Latches 2
5.3 Flip-Flops 2
Tutorial -V(Flip-Flops)
5.4 Analysis of Clocked Sequential Circuits 2 5.5 Mealy and Moore Models of Finite State Machines. 2
Tutorial -V(Analysis of Clocked Sequential Circuits)
UNIT-6 VI Registers and Counters:
6.1 Registers 1
6.2 Shift Registers 2
6.3 Ripple Counters 2
Tutorial -VI(Shift Registers)
6.4 Synchronous Counters 3
6.5 Ring Counter 1
1. Weighted Codes and Non-Weighted Codes 4
2. Logic Gates 2
3. 3
Computer Science & Engineering Department, Kallam Haranadharedy Institute of Technology, Guntur Page 39
The solutions of quadratic equation are
Represent -45,+45,-65&+65 in (i)sign magnitude
complement form.
4 CO 1
4 .
Evaluate using Add and Subtract in BINARY (i)
1111 & 1010 (ii) 100100 & 10110
8 CO 1
Solve (i) 5250-321 (ii)3570-2100 (iii) 20-100
complement subtraction.
6 CO 1
7 .
Solve (i) 325010-7253210 (ii) 7253210-325010
you infer from results.
7 CO 1
8 .
Solve arithmetic operations indicated below and
Solve (i) 32508-725328 (ii)
7253210-325010 using 7 CO 1
subtraction. what did you infer from results.
10.
Solve (i) 32508-725328 (ii) 7253210-325010 using
subtraction.
10 CO 1
11. Describe and
complement form of subtraction with example.
1 CO 1
12. Consider and solve
325010- 7253210. 8 CO 1
1. List out basic Boolean theorems and properties and
give proofs of each property and theorem.
2 CO 2
Computer Science & Engineering Department, Kallam Haranadharedy Institute of Technology, Guntur Page 40 II
2 .
Conclude that AND-OR network is equivalent to
(i)NAND-NAND network and (ii) NOR-NOR network.
8 CO 2
3
. Classify universal gates? Why are they
called so? 7 CO 2
4
. Represent XOR & XNOR using
Universal gates. 4 CO 2
5 .
Modify the following equations into standard sop
Modify the following equations into canonical pos
Represent the following functions using (i) NAND
gates (ii) NOR gates F1=A(B+CD)+(B
Reduce the following Boolean
expressions 9 CO 2
10.
Write the complement of the following Boolean
Apply K-MAP and implement using
NAND gates 6 CO 3
Write minimal SOP and minimal POS
expressions for the following function 9 CO 3
5 .
Solve the following Boolean expression using X-
NOR and NOR gates 10 CO 3
6 .
Consider K-MAP and simplify
8 CO 3
Computer Science & Engineering Department, Kallam Haranadharedy Institute of Technology, Guntur Page 41 7
.
Modify using K-MAP and implement using AOI
Represent the following Boolean expression using
Consider K-MAP simplification and
implement using AOI logic 8 CO 3
Explain 4 bit ripple adder/subtractor with suitable
(ii) 5bitmagnitudecomparator 10 CO 4
4 .
Summarize the following code converters
Design (i) octal to binary encoder
(ii) 4 bit priority encoder 9 CO 4
6 .
Reproduce HALF SUBTRACTOR and FULL
Apply decoder and external gates for following
Represent following using LOGIC GATE (i) 3 to 8
decoder (ii) 4 to 16 mux (iii) 1x16 demux
4 CO 4
9 .
Analyze following using (i) 4 input mux (ii) 8x1
Computer Science & Engineering Department, Kallam Haranadharedy Institute of Technology, Guntur Page 42 11. Convert 4 to 16 decoder into demux 3 CO 4 V 1. Explain the operation of (a) SR latch
using NOR
gates (b) Gated D latch using NAND gates
7 CO5
2 .
Explain the operation of negative edge triggered D
flip-flop when CP=1.
7 CO5
3 .
Define is RACE AROUND condition?
How can
we eliminate it? Explain MASTER SLAVE JK flip-flop and state its advantages.
2 CO5
4 .
Explain the operation of positive edge triggered JK
flip-flop in detail.
3 CO5
5 .
Distinguish combinational & sequential logic
circuits?
8 CO5
6 .
Interpret different methods used to trigger a flip-
flop?
6 CO5
7 .
Define flip-flop? Design basic flip-flop circit with
NAND gates.
1 CO5
8 .
Write EXCITATION tables and TRUTH tables of
(a) D (b) T (c) JK (d) SR flip-flops.
10 CO5
9 .
Determine characteristic equations of (a) D (b) T
(c) JK (d) SR flip-flops.
5 CO5
10.
Justify the following terms with respect to flip-
flops (a)Setup time (b) Hold time (c) Propagation delay (d) Preset (e) Clear (f) Latch
8 CO5
11. Convert the following flip-flops (a) JK to D (b) T
With neat diagram explain operation of (a)3 bit
universal shift register. (b) 4 bit controlled buffer register.
7 CO6
3 .
illustrate
register. Draw waveforms and list
applications of shift register. 5 CO6
4 .
Describe about parallel in serial out shift register.
How to load data word ABCD=1101 in the 4 bit bidirectional shift register in shift left mode.
2 CO6
5 .
Sketch a register for left & right shift of data for
10110101.
9 CO6
6 .
Differentiate ring counter and twisted ring counter.
Draw and explain about 4 bit ring counter.
8 CO6
Computer Science & Engineering Department, Kallam Haranadharedy Institute of Technology, Guntur Page 43 7
.
Explain about synchronous ripple counter and
compare merits and demerits.
3 CO6
8 .
Explain about 4 bit ripple down counter using
positive edge triggered flip-flop.
4 CO6
9
. Define ripple counter. Design BCD
ripple counter. 1 CO6
10. Explain about working of 4 bit asynchronous
counter.
7 CO6
11.
Design (a) mod-12 synchronous up counter using
-flop. (b) mod-10 synchronous down
1. Digital Circuits by A.Anandkumar.
2. Switching theory and Logic design by A.Anandkumar
Prepared by
Dr. B. Sai Chandana, Professor,
Dept. of CSE, KHIT
Computer Science & Engineering Department, Kallam Haranadharedy Institute of Technology, Guntur Page 44 COURSE TITLE: PYTHON PROGRAMMING
Sub code : C204 Contact Hours per week : 6 (L) Hours
Course Coordinator : Mr. B. Satyanarayana Reddy Course Advisor (if any) : Mr. B. Satyanarayana Reddy Module Coordinator : Dr. Umar Khan
Course coordinator phone : 9963585097
Course coordinator e-mail : [email protected] Course coordinator location : Room No.: 2S-01
Course Coordinator availability : Monday 9:30am - 10:30am Friday 2.30pm – 3.15pm
Resource link : https://www.python.org/downloads/
Pre-requisites Courses : C and C++ Programming Course Description:
In this course students will learn about the fundamentals of computers and understand the various steps in Program development. It provides the syntax and semantics of Python Programming Language. This course makes how to write modular and readable Python Programs. It also makes to write programs using structured and OOP programming approach in Python to solve problems.
Overview of learning activities:
5. Lecture and Class Discussions.
6. Assignment work.
7. Tutorial/Quiz sessions 8. Power Point Presentations Overview of learning resources:
Prescribed & Suggested Text Books
1. Python Programming: A Modern Approach, Vamsi Kurama, Pearson 2. Learning Python, Mark Lutz, Orielly
3. Think Python, Allen Downey, Green Tea Press 4. Core Python Programming, W.Chun, Pearson.
5. Introduction to Python, Kenneth A. Lambert, Cengage Software Links:
1. https://www.python.org/
2. https://en.wikipedia.org/wiki/List_of_Python_software
Reference Books
1. Python Programming: A Modern Approach, Vamsi Kurama, Pearson 2. Learning Python, Mark Lutz, Orielly
Freely Accessible Internet Sites
https://www.python.org/about/gettingstarted/
https://www.tutorialspoint.com/python/
Computer Software
a. Windows XP or Later versions b. Python3.6.1
Overview of assessment:
Internal Test.
Quiz
Assignments.
University Exams.
Computer Science & Engineering Department, Kallam Haranadharedy Institute of Technology, Guntur Page 45 SYLLABUS
UNIT-I
Introduction: History of Python, Need of Python Programming, Applications Basics of Python Programming Using the REPL(Shell), Running Python Scripts, Variables, Assignment, Keywords, Input-Output, Indentation.
UNIT- II
Types, Operators and Expressions: Types - Integers, Strings, Booleans; Operators- Arithmetic Operators, Comparison (Relational) Operators, Assignment Operators, Logical Operators, Bitwise Operators, Membership Operators, Identity Operators, Expressions and order of evaluations Control Flow- if, if-elif-else, for, while, break, continue, pass.
UNIT- III
Data Structures Lists: Operations, Slicing, Methods; Tuples, Sets, Dictionaries, Sequences.
Comprehensions.
UNIT- IV
Functions - Defining Functions, Calling Functions, Passing Arguments, Keyword Arguments,Default Arguments, Variable length arguments, Anonymous Functions, Fruitful Functions(Function Returning Values), Scope of the Variables in a Function : Global and Local Variables.
Modules: Creating modules, import statement, from. Import statement, name spacing, Python packages: Introduction to PIP, Installing Packages via PIP, Using Python Packages UNIT- V
Object Oriented Programming OOP in Python: Classes, 'self variable', Methods, Constructor Method, Inheritance, Overriding Methods, Data hiding.
Error and Exceptions: Difference between an error and Exception, Handling Exception, try except block, Raising Exceptions, User Defined Exceptions.
UNIT- VI
Brief Tour of the Standard Library - Operating System Interface - String Pattern Matching, Mathematics, Internet Access, Dates and Times, Data Compression, Multithreading, GUI Programming, Turtle Graphics.
Testing: Why testing is required ?, Basic concepts of testing, Unit testing in Python, Writing Test cases, Running Tests.
TEXT BOOKS:
1. Python Programming: A Modern Approach, Vamsi Kurama, Pearson 2. Learning Python, Mark Lutz, Orielly
REFERENCES:
1. Think Python, Allen Downey, Green Tea Press 2. Core Python Programming, W.Chun, Pearson.
3. Introduction to Python, Kenneth A. Lambert, Cengage