DLD CD It - 0
DLD CD It - 0
(Autonomous)
Dundigal, Hyderabad -500 043
INFORMATION TECHNOLOGY
COURSE DESCRIPTOR
Programme B.Tech
Theory Practical
3 1 4 3 2
Chief
Mrs. G Bhavana, Assistant Professor , ECE
Coordinator
Course Faculty Mrs. G Bhavana, Assistant Professor , ECE
I. COURSE OVERVIEW:
The course will make them learn the basic theory of microprocessor and their applications in
detail. Subsequently the course covers important concepts like how to write an assembly
language programming. They will learn to write an assembly language programming for
interfacing various I/O modules. They will learn to design different advance architectures to
design a new communication interfaces.
Page | 1
✔ Chalk & Talk ✔ Quiz ✔ Assignments ✘ MOOCs
V. EVALUATION METHODOLOGY:
The course will be evaluated for a total of 100 marks, with 30 marks for Continuous Internal
Assessment (CIA) and 70 marks for Semester End Examination (SEE). Out of 30 marks allotted
for CIA during the semester, marks are awarded by taking average of two CIA examinations or
the marks scored in the make-up examination.
Semester End Examination (SEE): The SEE is conducted for 70 marks of 3 hours duration.
The syllabus for the theory courses is divided into five units and each unit carries equal
weightage in terms of marks distribution. The question paper pattern is as follows. Two full
questions with “either” or “choice” will be drawn from each unit. Each question carries 14
marks. There could be a maximum of two sub divisions in a question.
Component Theory
Total Marks
Type of Assessment CIE Exam Quiz / AAT
CIA Marks 25 05 30
Page | 2
VI. HOW PROGRAM OUTCOMES ARE ASSESSED:
Program Outcomes (POs) Strength Proficiency assessed
by
PO 1 Engineering knowledge: Apply the knowledge of 3 Quiz
mathematics, science, engineering fundamentals, and an
engineering specialization to the solution of complex
engineering problems.
PO 2 Problem analysis: Identify, formulate, review research 2 Assignments
literature, and analyze complex engineering problems
reaching substantiated conclusions using first principles of
mathematics, natural sciences, and engineering sciences
PO 4 Conduct investigations of complex problems: Use 2 Seminars
research-based knowledge and research methods including
design of experiments, analysis and interpretation of data,
and synthesis of the information to provide valid
conclusions.
3 = High; 2 = Medium; 1 = Low
Familiarize the basic concept of number systems, Boolean algebra principles and minimization
I
techniques for Boolean algebra.
Analyze Combination logic circuit and sequential logic circuits such as multiplexers, adders,
II
decoders flip flops and latches.
III Understand about synchronous and asynchronous sequential logic circuits.
IV Impart the basic understanding of memory organization, ROM, RAM, PLA and PAL.
Page | 3
CLO CLO’s At the end of the course, the student will have the PO’s Strength of
Code ability to: Mapped Mapping
complements.
AEC020.03 CLO 3 Discuss about digital logic gates, error detecting and PO 1 3
correcting codes for digital systems.
AEC020.04 CLO 4 Describe the importance of SOP and POS canonical PO 2 2
forms with examples.
AEC020.05 CLO 5 Describe minimization techniques and other PO 2 2
optimization techniques for Boolean formulas in
general and digital circuits.
AEC020.06 CLO 6 Evaluate Boolean algebra expressions by PO 2 2
minimizing algorithms like sop and pos using
Boolean Postulates and theorems.
AEC020.07 CLO 7 Solve various Boolean algebraic functions using PO 2 2
Karnaugh map and Tabulation Method.
AEC020.08 CLO 8 Understand bi-stable elements and different type’s PO 1 3
combinational logic circuits.
AEC020.09 CLO 9 Analyze the design procedures of Sequential logic PO 1 3
circuits with the help of registers.
AEC020.10 CLO 10 Discuss the concept of flip flops and latches by PO 2 2
using sequential logic circuits.
AEC020.11 CLO 11 Differentiate combinational logic circuits with PO 4 1
sequential logic circuits along with examples.
AEC020.12 CLO 12 Understand the concept of memory organization, PO 1 3
read only memory and random access memory.
AEC020.13 CLO 13 Discuss and implement combinational and PO 1 3
sequential logic circuits using PLA and PLDs.
AEC020.14 CLO 14 Explain the concept of memory hierarchy in terms of PO 1 3
capacity and access time.
AEC020.15 CLO 15 Explain about Synchronous and Asynchronous PO 2 2
Sequential Circuits: Reduction of state tables for
Mealy and Moore machines.
AEC020.15 CLO 16 Discuss about various memory concepts with respect PO 1 2
to temporary and permanent memory organizations.
3 = High; 2 = Medium; 1 = Low
CLO 2 3 1
CLO 3 3
CLO 4 2 1
CLO 5 2
Page | 4
Course Program Specific
Program Outcomes (POs)
Learning Outcomes (PSOs)
Outcomes
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
(CLOs)
CLO 6 3 3
CLO 7 2 2
CLO 8 3 2
CLO 9 2 2
CLO 10 2
CLO 11 2
CLO 12 3
CLO 13 2 1
CLO 14 3
CLO 15 2 2 2
CLO 16 2 1
3 = High; 2 = Medium; 1 = Low
XIII. SYLLABUS
Page | 5
UNIT -III DESIGN OF COMBINATIONAL CIRCUITS (CC)
Combinational Circuits: Analysis and Design Procedure; Binary adder and subtractors; Carry Look-a-head
adder; Binary multiplier.
Magnitude comparator;BCD adder; Decoders; Encoders; Multiplexers; Demultiplexer.
UNIT-IV DESIGN OF SEQUENTIAL CIRCUITS
Combinational Vs Sequential Circuits ; Latches, Flip Flops: RS flip flop, JK flip flop, T flip flop, D flip
flop, Master-Slave Flip flop, Flip Flops excitation functions; Conversion of one flip flop to another flip
flop; Shift Registers; Design of Asynchronous and Synchronous circuits; State Table, State diagram, State
Reduction and State Assignment for Mealy and Moore Machines..
UNIT -V MEMORY
Random access memory; Types of ROM; Memory decoding; Address and Data bus; Sequential memory;
Cache memory; Programmable logic arrays; Memory hierarchy in terms of capacity and access time
Text Books:
1. M. Morris Mano, Digital Design‖, Pearson Education/PHI, 3rdEdition 2001.
2. Charles H. Roth, Jr,Fundamentals of Logic Design‖, Thomson Brooks/Cole, 5 thEdition, 2004.
Reference Books:
1. C. V. S. Rao, Switching Theory and Logic Design, Pearson Education, 1stEdition, 2005.
2. M. Rafiquzzaman, Fundamentals of Digital Logic & Micro Computer Design‖, John Wiley, 5thEdition,
2005.
3. Zvi. Kohavi, Switching and Finite Automata Theory‖, Tata McGraw-Hill, 2ndEdition 1991.
11-15 Learn Boolean algebra and Logical operations in Boolean algebra. CLO 4 T1:2.2
Identify basic building blocks of digital systems and Minimization
16-20 using three variable; four variable; five variable K-Maps; Don‘t CLO 5 T1:2.8
Care Conditions.
21-25 Discuss the Bistable multi with triggering methods. Fixed bias, self
CLO 2 T1:3.5
bias, unsymmetrical triggering, symmetrical triggering.
26-28 Design functions using universal gates. NAND and NOR
implementation; Other Two-Level Implementation; Exclusive –OR CLO 6 T2:0.1
function.
29-30 Discuss the availability of different logic circuits.. CLO 12 T2:3.2
Design different combinational logic circuits comparators
31-35 CLO 14 T1:3.1
multiplexers.
36-40 Demonstrate the design of sequential logic circuits. CLO 10 T1:4.3
Page | 6
XV. GAPS IN THE SYLLABUS - TO MEET INDUSTRY / PROFESSION REQUIREMENTS:
Prepared by:
Mrs. G Bhavana, Assistant Professor,ECE
HOD, IT
Page | 7