Code No: 07A3EC03 Set No. 1

Similar documents
Code No: R Set No. 1

Code No: R Set No. 1

Code No: R Set No. 1

R07

R07. Code No: V0423. II B. Tech II Semester, Supplementary Examinations, April

R10. II B. Tech I Semester, Supplementary Examinations, May

B.Tech II Year I Semester (R13) Regular Examinations December 2014 DIGITAL LOGIC DESIGN

SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE)


PART B. 3. Minimize the following function using K-map and also verify through tabulation method. F (A, B, C, D) = +d (0, 3, 6, 10).

SUBJECT CODE: IT T35 DIGITAL SYSTEM DESIGN YEAR / SEM : 2 / 3

Injntu.com Injntu.com Injntu.com R16

DHANALAKSHMI SRINIVASAN COLLEGE OF ENGINEERING AND TECHNOLOGY

HANSABA COLLEGE OF ENGINEERING & TECHNOLOGY (098) SUBJECT: DIGITAL ELECTRONICS ( ) Assignment

R a) Simplify the logic functions from binary to seven segment display code converter (8M) b) Simplify the following using Tabular method

VALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EC6302 DIGITAL ELECTRONICS

END-TERM EXAMINATION

SIR C.R.REDDY COLLEGE OF ENGINEERING, ELURU DEPARTMENT OF INFORMATION TECHNOLOGY LESSON PLAN

Switching Theory & Logic Design/Digital Logic Design Question Bank

10EC33: DIGITAL ELECTRONICS QUESTION BANK

(ii) Simplify and implement the following SOP function using NOR gates:

Digital logic fundamentals. Question Bank. Unit I

VALLIAMMAI ENGINEERING COLLEGE

QUESTION BANK FOR TEST

COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING QUESTION BANK SUBJECT CODE & NAME: EC 1312 DIGITAL LOGIC CIRCUITS UNIT I

VALLIAMMAI ENGINEERING COLLEGE

Principles of Digital Techniques PDT (17320) Assignment No State advantages of digital system over analog system.

Question Total Possible Test Score Total 100

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

2008 The McGraw-Hill Companies, Inc. All rights reserved.

II/IV B.Tech (Regular/Supplementary) DEGREE EXAMINATION. Answer ONE question from each unit.

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

Experiment 3: Logic Simplification

NADAR SARASWATHI COLLEGE OF ENGINEERING AND TECHNOLOGY Vadapudupatti, Theni

Gate Level Minimization Map Method

SHRI ANGALAMMAN COLLEGE OF ENGINEERING. (An ISO 9001:2008 Certified Institution) SIRUGANOOR, TIRUCHIRAPPALLI

1. Mark the correct statement(s)

BHARATHIDASAN ENGINEERING COLLEGE Degree / Branch : B.E./ECE Year / Sem : II/ III Sub.Code / Name : EC6302/DIGITAL ELECTRONICS

Hours / 100 Marks Seat No.

Scheme G. Sample Test Paper-I

CS/IT DIGITAL LOGIC DESIGN

Written exam for IE1204/5 Digital Design Thursday 29/

Philadelphia University Student Name: Student Number:

Simplification of Boolean Functions

Chapter 3. Gate-Level Minimization. Outlines

CONTENTS CHAPTER 1: NUMBER SYSTEM. Foreword...(vii) Preface... (ix) Acknowledgement... (xi) About the Author...(xxiii)

KINGS COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING QUESTION BANK NAME OF THE SUBJECT: EE 2255 DIGITAL LOGIC CIRCUITS

UNIT I BOOLEAN ALGEBRA AND COMBINATIONAL CIRCUITS PART-A (2 MARKS)

CS6201-DIGITAL PRINCIPLE AND SYSTEM DESIGN I YEAR/II SEM PART-B UNIT-I BOOLEAN ALGEBRA AND LOGIC GATES.

KING FAHD UNIVERSITY OF PETROLEUM & MINERALS COMPUTER ENGINEERING DEPARTMENT

CS8803: Advanced Digital Design for Embedded Hardware

R.M.D. ENGINEERING COLLEGE R.S.M. Nagar, Kavaraipettai

UPY14602-DIGITAL ELECTRONICS AND MICROPROCESSORS Lesson Plan

COPYRIGHTED MATERIAL INDEX

Chapter 2: Combinational Systems

Programmable Logic Devices

DE Solution Set QP Code : 00904

2.6 BOOLEAN FUNCTIONS

LOGIC CIRCUITS. Kirti P_Didital Design 1

Lecture 4: Implementation AND, OR, NOT Gates and Complement

3. The high voltage level of a digital signal in positive logic is : a) 1 b) 0 c) either 1 or 0

UNIT- V COMBINATIONAL LOGIC DESIGN

CS470: Computer Architecture. AMD Quad Core

Chapter 2. Boolean Expressions:

ELCT201: DIGITAL LOGIC DESIGN

MGU-BCA-205- Second Sem- Core VI- Fundamentals of Digital Systems- MCQ s. 2. Why the decimal number system is also called as positional number system?

Hours / 100 Marks Seat No.

CHAPTER 9 MULTIPLEXERS, DECODERS, AND PROGRAMMABLE LOGIC DEVICES

ELCT201: DIGITAL LOGIC DESIGN

Gate-Level Minimization

MULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR

Digital Logic Design Exercises. Assignment 1

APPENDIX A SHORT QUESTIONS AND ANSWERS

NH 67, Karur Trichy Highways, Puliyur C.F, Karur District DEPARTMENT OF INFORMATION TECHNOLOGY CS 2202 DIGITAL PRINCIPLES AND SYSTEM DESIGN

DKT 122/3 DIGITAL SYSTEM 1

Chapter 2 Combinational Logic Circuits

Experiment 4 Boolean Functions Implementation

CHAPTER - 2 : DESIGN OF ARITHMETIC CIRCUITS

Gate-Level Minimization

Assignment (3-6) Boolean Algebra and Logic Simplification - General Questions

NODIA AND COMPANY. GATE SOLVED PAPER Computer Science Engineering Digital Logic. Copyright By NODIA & COMPANY


SWITCHING THEORY AND LOGIC CIRCUITS

DIRECTORATE OF TECHNICAL EDUCATION DIPLOMA IN ELECTRICAL AND ELECTRONICS ENGINEERING II YEAR M SCHEME IV SEMESTER.

GATE CSE. GATE CSE Book. November 2016 GATE CSE

Gate Level Minimization

2.1 Binary Logic and Gates

CMPE223/CMSE222 Digital Logic

ENGINEERS ACADEMY. 7. Given Boolean theorem. (a) A B A C B C A B A C. (b) AB AC BC AB BC. (c) AB AC BC A B A C B C.

Final Exam Solution Sunday, December 15, 10:05-12:05 PM

Computer Organization

Chapter 2 Boolean algebra and Logic Gates

BOOLEAN ALGEBRA. 1. State & Verify Laws by using :

2. (a) Compare the characteristics of a floppy disk and a hard disk. (b) Discuss in detail memory interleaving. [8+7]

NH 67, Karur Trichy Highways, Puliyur C.F, Karur District UNIT-II COMBINATIONAL CIRCUITS

Philadelphia University Faculty of Information Technology Department of Computer Science. Computer Logic Design. By Dareen Hamoudeh.

Unit-IV Boolean Algebra

EECS150 Homework 2 Solutions Fall ) CLD2 problem 2.2. Page 1 of 15

Standard Forms of Expression. Minterms and Maxterms

CSCI 220: Computer Architecture I Instructor: Pranava K. Jha. Simplification of Boolean Functions using a Karnaugh Map

Transcription:

Code No: 07A3EC03 Set No. 1 II B.Tech I Semester Regular Examinations, November 2008 SWITCHING THEORY AND LOGIC DESIGN ( Common to Electrical & Electronic Engineering, Electronics & Instrumentation Engineering, Bio-Medical Engineering, Electronics & Control Engineering, Electronics & Computer Engineering and Instrumentation & Control Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks 1. (a) What is the Gray code? What are the rules to construct Gray code? Develop the 4 bit Gray code for the decimal 0 to 15. (b) List the XS3 code for decimal 0 to 9. (c) What are the rules for XS3 addition? Add the two decimal numbers 123 and 658 in XS3 code. [8+2+6] 2. (a) State Duality theorem. List Boolean laws and their Duals. (b) Simplify the following Boolean functions to minimum number of literals: i. F = ABC + ABC + A B ii. F = (A+B) (A +B ). (c) Realize XOR gate using minimum number of NAND gates. [8+4+4] 3. Simplify the following Boolean expressions using K-map and implement them using NOR gates: (a) F (A, B, C, D) = AB C + AC + A CD (b) F (W, X, Y, Z) = W X Y Z + WXY Z + W X YZ + WXYZ. [16] 4. (a) Design BCD to Gray code converter and realize using logic gates. (b) Design 2*4 decoder using NAND gates. [10+6] 5. (a) Draw the basic macro cell logic diagram and explain. (b) Explain the general CPLD configuration with suitable block diagram. [16] 6. (a) Draw the logic diagram of a 4 bit binary ripple counter using positive edge triggering. (b) Draw the block diagram of a 4 - bit serial adder and explain its operation.[16] 7. (a) Write the differences between Mealy and Moore type machines. (b) A sequential circuit has 2 inputs w 1 =w 2 and an output z. It s function is to compare the i/p sequence on the two i/p s. If w 1 =w 2 during any four consecutive clock cycles, the circuit produces z=1 otherwise z=0 w 1 = 0110111000110 w 2 = 1110101000111 z=0000100001110 [8+8] 1 of 2

Code No: 07A3EC03 Set No. 1 8. (a) For the given control state diagram obtain its equivalent ASM chart. (b) Design control logic circuit as shown in figure 8b using multiplexers. [8+8] Figure 8b 2 of 2

Code No: 07A3EC03 Set No. 2 II B.Tech I Semester Regular Examinations, November 2008 SWITCHING THEORY AND LOGIC DESIGN ( Common to Electrical & Electronic Engineering, Electronics & Instrumentation Engineering, Bio-Medical Engineering, Electronics & Control Engineering, Electronics & Computer Engineering and Instrumentation & Control Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks 1. (a) Why the binary number system is used in computer design? (b) Given the binary numbers a = 1010.1, b = 101.01, c =1001.1 perform the following: i. a + c ii. a - b iii. a. c iv. a / b. (c) Convert (2AC5.D)16 to binary and then to octal. [2+10+4] 2. (a) Simplify the following Boolean functions to minimum number of literals: i. ( a + b ) ( a + b ) ii. y(wz + wz) + xy (b) Prove that AND-OR network is equivalent to NAND-NAND network. (c) State Duality theorem. List Boolean laws and their Duals. [4+4+8] 3. (a) What are don t-care conditions? Explain its advantage with example. (b) Simplify the following Boolean function for minimal POS form using K-map and implement using NOR gates. F(W,X,Y,Z) = π(4,5,6,7,8,12). d(1,2,3,9,11,14) [4+12] 4. (a) Design BCD to Gray code converter and realize using logic gates. (b) Design 2*4 decoder using NAND gates. [10+6] 5. (a) Using PLA logic, implement a BCD to excess 3 code converter. Draw its truth table and logic diagram. (b) Disucss about types of sequential PCDs. [16] 6. (a) What do you mean by triggering. Explain the various triggering modes with examples. (b) Draw the logic diagram of a JK flip flop and using excitation table, explain its operation. [16] 1 of 3

Code No: 07A3EC03 Set No. 2 7. (a) Derive a circuit that realises the FSM defined by the state assigned table in figure below using JK flip flops. Present Next state Output State w=0 w=1 y 2 y 1 y 2 y 1 y 2 y 1 Z 00 10 11 0 01 01 00 0 10 11 00 0 11 10 01 1 (b) Find the state table for the following state diagram as shown in figure 7b of a simple sequential ckt. [8+8] Figure 7b 8. (a) For the given control state diagram, draw the equivalent ASM chart as shown in figure 8a. 2 of 3 Figure 8a

Code No: 07A3EC03 Set No. 2 (b) Design the control circuit using multiplexers for the above state diagram.[8+8] 3 of 3

Code No: 07A3EC03 Set No. 3 II B.Tech I Semester Regular Examinations, November 2008 SWITCHING THEORY AND LOGIC DESIGN ( Common to Electrical & Electronic Engineering, Electronics & Instrumentation Engineering, Bio-Medical Engineering, Electronics & Control Engineering, Electronics & Computer Engineering and Instrumentation & Control Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks 1. (a) What is the necessity of binary codes in computers? (b) Encode the decimal numbers 0 to 9 by means of the following weighted binary codes. i. 8 4 2 1 ii. 2 4 2 1 iii. 6 4 2-3 (c) Determine which of the above codes are self complementing and why?[2+12+2] 2. (a) List the Minterms and Maxterms for three binary variables. Draw the truth table and express the Boolean function F(A,B,C) whose minterms are 1,3,5,7 as Canonica Sum of Minterms form. (b) Simplify the following Boolean functions to minimum number of literals: i. F = X Y + XYZ + X Y ii. F = X + Y[ Z + (X+Z) ] (c) For the logic expression Y = AB + A B: i. Obtain the truth table. ii. Name the operation performed. iii. Realize this using AND, OR, NOT gates. [8+4+4] 3. Simplify the following Boolean expressions using K-map and implement them using NOR gates: (a) F (A, B, C, D) = AB C + AC + A CD (b) F (W, X, Y, Z) = W X Y Z + WXY Z + W X YZ + WXYZ. [16] 4. (a) Implement Full Adder using decoder and OR gates. (b) Realize the Boolean function T(X,Y,Z) = Σ(1,3,4,5) using logic gates for hazard free. [8+8] 5. (a) List the PLA programming table for the BCD to excess-3 code converter. (b) A ROM chip of 4,096 8bits has two clip select inputs and operates from a 5-volt power supply. How many pins are needed for the integrated circuit package? Draw the block diagram of this ROM. [8+8] 1 of 2

Code No: 07A3EC03 Set No. 3 6. (a) Draw the ckt diagram of 4 bit ring ring counter using D flipflops and explain its operation with the help of bit pattern. (b) Distinguish b/w transition table and excitation table? [16] 7. Explain the following related to sequential ckts with suitable examples. (a) State diagram (b) State table (c) State assignment. [16] 8. (a) For the given control state diagram obtain its equivalent ASM chart. (b) Design control logic circuit as shown in figure 8b using multiplexers. [8+8] Figure 8b 2 of 2

Code No: 07A3EC03 Set No. 4 II B.Tech I Semester Regular Examinations, November 2008 SWITCHING THEORY AND LOGIC DESIGN ( Common to Electrical & Electronic Engineering, Electronics & Instrumentation Engineering, Bio-Medical Engineering, Electronics & Control Engineering, Electronics & Computer Engineering and Instrumentation & Control Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks 1. (a) Explain the 7 bit Hamming code. (b) A receiver with even parity Hamming code is received the data as 1110110. Determine the correct code. [10+6] 2. (a) State and prove the following Boolean laws: i. Commutative ii. Associative iii. Distributive. (b) Find the complement of the following Boolean functions and reduce them to minimum number of literals: i. (bc + a d) (ab + cd ) ii. b d + a bc + acd + a bc (c) Which gate can be used as parity checker? Why? [6+8+2] 3. (a) List the Boolean function simplification rules in the K-map (b) Simplify the following Boolean function for minimal SOP form using K-map and implement using NAND gates. F(W,X,Y,Z) = Σ(1,3,7,11,15) + d(0,2,5) [4+12] 4. Design a combinational circuit that converts a decimal digit from 2,4,2,1 code to 8, 4,-2,-1 code. [16] 5. (a) The following memory units are specified by the no of words times the number of bits per word. How many address lines and input-output data lines are needed in each case? i. 4K 16 ii. 2G 8 iii. 16M 32 iv. 256K 64. (b) Give the number of bytes stored in the memories listed above. [16] 6. (a) Distinguish between a state table and a flow table? 1 of 2

Code No: 07A3EC03 Set No. 4 (b) Draw the logic diagram and write functional table of an SR latch using NAND gates. Explain the operation. [16] 7. For the given minimal state - table: (a) Give proper assignment. (b) And design the circuit using D - Flip-flops. [6+10] Present State Next state, out - put X=0 X=1 X=0 X =1 (Z) q 1 q 2 q 1 0 0 q 2 q 3 q 1 0 0 q 3 q 4 q 5 0 0 q 4 q 4 q 1 0 0 q 5 q 2 q 1 1 0 8. (a) How do you indicate moore outputs and mealy outputs in an ASM block. (b) Obtain the ASM chart for the following state transition. Start for State T 1 ; then if xy=00, go to T 2 if xy=01, go to T 3 ; if xy=10 go to T 1 ; otherwise go to T 3. [8+8] 2 of 2