SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF ELECTRONICS AND ELECTRICAL ENGINEERING DEPARTMENT OF ECE COURSE PLAN

Similar documents
Tribhuvan University Institute of Science and Technology Bachelor of Science in Computer Science and Information Technology

AM AM AM AM PM PM PM

Bachelor Level/ First Year/ Second Semester/ Science Full Marks: 60 Computer Science and Information Technology (CSc. 151) Pass Marks: 24

LESSON PLAN. Sub Code: EE2255 Sub Name: DIGITAL LOGIC CIRCUITS Unit: I Branch: EEE Semester: IV

Course Plan. Course Articulation Matrix: Mapping of Course Outcomes (COs) with Program Outcomes (POs) PSO-1 PSO-2


TIME SCHEDULE. MODULE TOPICS PERIODS 1 Number system & Boolean algebra 17 Test I 1 2 Logic families &Combinational logic

Semester III. Subject Name: Digital Electronics. Subject Code: 09CT0301. Diploma Branches in which this subject is offered: Computer Engineering

R13 SET - 1 '' ''' '' ' '''' Code No: RT21053

MODU LE DAY. Class-A, B, AB and C amplifiers - basic concepts, power, efficiency Basic concepts of Feedback and Oscillation. Day 1

R13. II B. Tech I Semester Regular Examinations, Jan DIGITAL LOGIC DESIGN (Com. to CSE, IT) PART-A

Nirma University Institute of Technology. Electronics and Communication Engineering Department. Course Policy

Find the equivalent decimal value for the given value Other number system to decimal ( Sample)

[2 credit course- 3 hours per week]

Solution to Digital Logic )What is the magnitude comparator? Design a logic circuit for 4 bit magnitude comparator and explain it,

Subject : EE6301 DIGITAL LOGIC CIRCUITS

1 Hour Sample Test Papers: Sample Test Paper 1. Roll No.

PURBANCHAL UNIVERSITY

1. Convert the decimal number to binary, octal, and hexadecimal.

A.R. ENGINEERING COLLEGE, VILLUPURAM ECE DEPARTMENT

Minnesota State College Southeast

CS6201 UNIT I PART-A. Develop or build the following Boolean function with NAND gate F(x,y,z)=(1,2,3,5,7).

North Shore Community College

Department of Computer Science and Engineering Question Bank- Even Semester:

Digital Principles and Design

DIGITAL SYSTEM DESIGN UNIT I (2 MARKS)

Sequential Logic. Analysis and Synthesis. Joseph Cavahagh Santa Clara University. r & Francis. TaylonSi Francis Group. , Boca.Raton London New York \

Microprocessor Design

MODEL QUESTIONS WITH ANSWERS THIRD SEMESTER B.TECH DEGREE EXAMINATION DECEMBER CS 203: Switching Theory and Logic Design. Time: 3 Hrs Marks: 100

UNIVERSITI TEKNOLOGI MALAYSIA

WINTER 15 EXAMINATION Model Answer

Registers and Counters

problem maximum score 1 28pts 2 10pts 3 10pts 4 15pts 5 14pts 6 12pts 7 11pts total 100pts

Introduction to Digital Logic Missouri S&T University CPE 2210 Exam 3 Logistics

St. MARTIN S ENGINEERING COLLEGE

TEST-3 (DIGITAL ELECTRONICS)-(EECTRONIC)

WINTER 14 EXAMINATION

Saturated Non Saturated PMOS NMOS CMOS RTL Schottky TTL ECL DTL I I L TTL


Laboratory Objectives and outcomes for Digital Design Lab

TYPICAL QUESTIONS & ANSWERS

COE328 Course Outline. Fall 2007

Define the outline of formal procedures and compare different digital components like multiplexers, flip flops, decoders, adders.

Computer Architecture and Organization

Electrical and Telecommunications Engineering Technology_TCET3122/TC520. NEW YORK CITY COLLEGE OF TECHNOLOGY The City University of New York

G. D. Bishop, Electronics II. G. D. Bishop, Electronics III. John G. Ellis, and Norman J. Riches, Safety and Laboratory Practice

S.K.P. Engineering College, Tiruvannamalai UNIT I

BHARATHIDASAN ENGINEERING COLLEGE, NATTRAMPALLI DEPARTMENT OF ECE

ROEVER COLLEGE OF ENGINEERING & TECHNOLOGY ELAMBALUR, PERAMBALUR DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING

Department of Electrical and Computer Engineering Mid-Term Examination Winter 2012

1.b. Realize a 5-input NOR function using 2-input NOR gates only.

Registers and Counters

Using minterms, m-notation / decimal notation Sum = Cout = Using maxterms, M-notation Sum = Cout =

Chapter Contents. Appendix A: Digital Logic. Some Definitions

LORDS INSTITUTE OF ENGINEERING & TECHNOLOGY

Question Bank. Unit 1. Digital Principles, Digital Logic

Lecture 8: Sequential Logic

Prepared By Verified By Approved By Mr M.Kumar Mrs R.Punithavathi Dr. V.Parthasarathy Asst. Professor / IT HOD / IT Principal

YEDITEPE UNIVERSITY DEPARTMENT OF COMPUTER ENGINEERING. EXPERIMENT VIII: FLIP-FLOPS, COUNTERS 2014 Fall

1. a) For the circuit shown in figure 1.1, draw a truth table showing the output Q for all combinations of inputs A, B and C. [4] Figure 1.

RS flip-flop using NOR gate

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad ELECTRICAL AND ELECTRONICS ENGINEERING

1. True/False Questions (10 x 1p each = 10p) (a) I forgot to write down my name and student ID number.

EECS 270 Midterm 2 Exam Closed book portion Fall 2014

DIGITAL FUNDAMENTALS

Course Administration

IT T35 Digital system desigm y - ii /s - iii

Principles of Computer Architecture. Appendix A: Digital Logic

211: Computer Architecture Summer 2016

RS flip-flop using NOR gate

MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified) WINTER 2018 EXAMINATION MODEL ANSWER

Chapter 2. Digital Circuits

MUHAMMAD NAEEM LATIF MCS 3 RD SEMESTER KHANEWAL

Semester 6 DIGITAL ELECTRONICS- core subject -10 Credit-4

Digital Electronic Circuits and Systems


VU Mobile Powered by S NO Group

a) (A+B) (C+D) b) AB+CD c) AC+BD d) (A+D) (B+C)

EXPERIMENT: 1. Graphic Symbol: OR: The output of OR gate is true when one of the inputs A and B or both the inputs are true.

VeriLab. An introductory lab for using Verilog in digital design (first draft) VeriLab

TRAINING KITS ON DIGITAL ELECTRONIC EXPERIMENTS. Verify Truth table for TTL IC s AND, NOT, & NAND GATES

PHYSICS 5620 LAB 9 Basic Digital Circuits and Flip-Flops

CS 151 Final. Instructions: Student ID. (Last Name) (First Name) Signature

MODULAR DIGITAL ELECTRONICS TRAINING SYSTEM

NH 67, Karur Trichy Highways, Puliyur C.F, Karur District UNIT-III SEQUENTIAL CIRCUITS

Vignana Bharathi Institute of Technology UNIT 4 DLD

BCN1043. By Dr. Mritha Ramalingam. Faculty of Computer Systems & Software Engineering

'if it was so, it might be; and if it were so, it would be: but as it isn't, it ain't. That's logic'

MC9211 Computer Organization

AC103/AT103 ANALOG & DIGITAL ELECTRONICS JUN 2015

UNIT 1: DIGITAL LOGICAL CIRCUITS What is Digital Computer? OR Explain the block diagram of digital computers.

Logic Design Viva Question Bank Compiled By Channveer Patil

Combinational vs Sequential

Chapter 3 Unit Combinational

I B.SC (INFORMATION TECHNOLOGY) [ ] Semester II CORE : DIGITAL COMPUTER FUNDAMENTALS - 212B Multiple Choice Questions.

ECE 263 Digital Systems, Fall 2015

Objectives. Combinational logics Sequential logics Finite state machine Arithmetic circuits Datapath

4.S-[F] SU-02 June All Syllabus Science Faculty B.Sc. II Yr. Instrumentation Practice [Sem.III & IV] S.Lot

Introduction to Digital Logic Missouri S&T University CPE 2210 Exam 2 Logistics

List of the CMOS 4000 series Dual tri-input NOR Gate and Inverter Quad 2-input NOR gate Dual 4-input NOR gate

Transcription:

SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF ELECTRONICS AND ELECTRICAL ENGINEERING DEPARTMENT OF ECE COURSE PLAN Course Code : EC0205 Course Title : DIGITAL SYSTEMS Semester : III Course Time : JULY NOVEMBER 2011 Location : S.R.M.E.C Faculty Details Sec. Name Office Class hour Mail id A NS-2 Day1-1 st hr, Day2-3 rd hr, Day5-1 st & 2 nd hr B Mr. J. Selvakumar TP12S8 Day1-4 th Hr, Day3-6 th & 7 th hr, Day5-1 st selvakumarj@ktr.srmuniv.ac.in C Ms. Sabitha Gauni Day1-3 rd hr, Day2-5& 6 th hr, TP1103A Day3-1 st hr sabithagauni@ktr.srmuniv.ac.in D Ms.S.Kayalvizhi TP903A Day1-6 th &7 th, Day4-2 nd hr, Day5-1 st hr, kayalvizhis@ktr.srmuniv.ac.in E NS-8 Day1-2 nd & 3 rd hr, Day2-1 st hr, Day3-5 th hr F Ms.P.Radhika TP12S6 Day3-3 rd & 4 th, Day4-1 st, Day2-5 th hr radhikap@ktr.srmuniv.ac.in Required Text Books: 1. Morris Mano. M, "", Pearson education, Third Edition 2002 2. Ronald J. Tocci, "Digital System Principles and Applications", PHI, Sixth Edition, 1997 3. Floyd, "Digital Fundamentals", Universal Book Stall, New Delhi,1986 4. Morris Mano. M, "", PHI, Third Edition 5. Ronald J. Tocci, "Digital System Principles and Applications", Pearson education 9th edition Web Resources : www.freebookcentre.net www.cse.iitd.ernet.in www.circuit- magic.com www.utwired.engr.utexas www.books.google Prerequisite : GE0106 s : 1. To understand concepts of combinational and sequential circuits. 2. Analyze synchronous and asynchronous logic circuits. 3. Understand concepts of memory, programmable logic and digital integrated circuits. Page 1 of 8

Assessment Details Cycle Test I : 10 Marks Surprise Test I : 5 Marks Cycle Test II : 10 Marks Surprise Test II : 5 Marks Attendance : 5 Marks Model Exam : 15 Marks Test Schedule S. DATE TEST PORTIONS DURATION 1 1 rd week of Aug 11 Cycle Test-1 1 to 17 2 Periods 2 3 rd week of Sep 11 Cycle Test-2 18 to 29 2 Periods 3 4 th week of Oct 11 Model Test 1 to 45 3 Hrs Outcomes Students who have successfully completed this course 1. To understand concepts of combinational and sequential circuits. 2. Analyze synchronous and asynchronous logic circuits. 3. Understand concepts of memory, programmable logic and digital integrated circuits. Program outcome identify, formulate and design and conduct, analyze and interpret data Page 2 of 8

Detailed Plan NUMBER SYSTEMS - BOOLEAN ALGEBRA AND LOGIC GATES Number Systems - Boolean algebra - Canonical and standard forms. Digital logic gates - Integrated circuits. Map method - four and five variable map methods -Products of Sums Simplification - Don't care conditions. Quine -McClucskey Method. 1. Number Systems- Chapter 1 Binary, Decimal, Octal, Hexadecimal & 1-13 conversion from system to other 2. Boolean algebra- Basic laws and postulate with proof 3. Canonical and standard forms POS and SOP with problems 4. Digital logic gates, Integrated circuits. 5. Map method four and five variable K- map methods 6. K-Map method four and five variable map methods 7. Sum of Product and Products of Sum Simplification 8. Don t care conditions with K-map 9. Quine -McClusky Method-problems with don t care conditions to be discussed 36-44 44-51 53-61 65-76 65-76 76-79 80-82 80-82 1.To understand concepts of combinational and sequential circuits. Page 3 of 8

GATE LEVEL MINIMIZATION & COMBINATIONAL LOGIC Two level implementation - NAND & NOR Implementations - EXOR Functions. Combinational Circuits - Analysis and design procedure - Binary adder - Subtractor - Decimal Adder - Binary Multiplier - Magnitude Comparator - Decoders - Encoders - Multiplexers. 10 Two level Chapter 3 implementation 82-84 11 NAND & NOR Implementations and EXOR Functions 12 Combinational Circuits : Introduction & Binary Adder 13 Binary Adder- 1-bit adder and 4-bit ripple carry adder 14 Subtractor Implementation of Half & Full Subtractor 15 Decimal Adder and Binary Multiplier 16 Magnitude Comparator 4-bit magnitude comparator 17 Decoders and Encoders namely 3:8 decoder and 8:3 Encoder and Priority encoder 18 Multiplexers & demultipliers- Boolean function Mux s, combinational logic implementation using basic mux s Chapter 3 85-99 111-115 119-125 126-128 129-132 133-134 134-141 141-145 1.To understand concepts of combinational and sequential circuits. d. Graduate will design a system, d. Graduate will design a system, Page 4 of 8

SYNCHRONOUS SEQUENTIAL LOGIC Sequential circuits - Latches - Flip-Flops - Analysis of Clocked Sequential Circuits - State Reduction and Assignment - Design Procedure. Registers - Shift Registers - Ripple counters - Synchronous Counters - Other counters. 19 Sequential circuits: Latches namely RS,D latch in detail with truth table 167-172 20 Flip-Flops brief description of RS and D FF with Truth & Excitation Table 172-174 21 Flip-Flops- brief description of JK and T FF with Truth & Excitation Table 175-179 22 Conversion technique from D FF to T FF, JK FF to T FF/D FF Analysis of Clocked 180-189 Sequential Circuits 23 State Reduction and Assignment 198-203 24 Design Procedure - explanation 25 Design Procedure implementation with an example 26 Registers and Shift Registers 203-207 208-211 Chapter 6 217-222 27 Ripple counters Chapter 6 28 Synchronous Counters 227-232 Chapter 6 232-239 To understand concepts of combinational and sequential circuits. Analyze synchronous and asynchronous logic circuits. d. Graduate will design a system, Page 5 of 8

29 Other counters: Synchronous/Asynchr onous counter with unused states, Ring Counter & Johnson Counter Chapter 6 239-244 d. Graduate will design a system, AYSYNCHRONUS SEQUENTIAL LOGIC AND MEMORY Introduction - Analysis Procedure - Circuit with Latches - Design Procedure - Reduction of State and Flow Tables - Race-Free state Assignment. Memory - Introduction - Random-Access Memory - Memory Decoding - Read only memory. 30 Asynchronous Chapter 9 Sequential Logic And Memory Introduction 342-344 31 Analysis Procedure and Circuit with Latches Chapter 9 352-360 32 Design Procedure Chapter 9 33 Reduction of State and Flow Tables and race free assignment 360-366 Chapter 9 367-373 34 Race free assignment Chapter 9 35 Memory Introduction Random-Access Memory 36 Memory Decoding 374-379 255-259 262-267 Analyze synchronous and asynchronous logic circuits. Understand concepts of memory, programmable logic and digital integrated circuits. component component component component component component component Page 6 of 8

37 Read only memory 270-275 component DIGITAL INTEGRATED CIRCUITS AND PROGRAMMABLE LOGIC Introduction - Special Characteristics - Bipolar-Transistor Characteristics - RTL and DTL Circuits - TTL - ECL - MOS - CMOS - CMOS Transmission Gate Circuits - Programmable Logic Array - Programmable Array Logic - Sequential Programmable Devices 38. Bipolar-Transistor Characteristics Chapter 10 400-407 39. RTL and DTL Circuits Chapter 10 40. NAND/NOR gate TTL logic with detailed description 41. NAND/NOR gate ECL, MOS and CMOS 408-410 Chapter 10 411-416 Chapter 10 420-426 Understand concepts of memory, programmable logic and digital integrated circuits 42. CMOS Transmission Gate Circuits-its advantages & disadvantages 43. Programmable Logic Array-. Boolean function PLA logic Chapter 10 427-430 276-280 Page 7 of 8

44. Programmable Array Logic - Boolean function PLA logic 45. Sequential Programmable Devices 280-283 283-287 Page 8 of 8