Code No: R Set No. 1

Similar documents
Code No: R Set No. 1

Code No: R Set No. 1

Code No: 07A3EC03 Set No. 1

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)

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

R07

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

END-TERM EXAMINATION

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

Injntu.com Injntu.com Injntu.com R16

10EC33: DIGITAL ELECTRONICS QUESTION BANK

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

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

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

DHANALAKSHMI SRINIVASAN COLLEGE OF ENGINEERING AND TECHNOLOGY

NADAR SARASWATHI COLLEGE OF ENGINEERING AND TECHNOLOGY Vadapudupatti, Theni

Hours / 100 Marks Seat No.

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

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

VALLIAMMAI ENGINEERING COLLEGE

VALLIAMMAI ENGINEERING COLLEGE

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

Switching Theory & Logic Design/Digital Logic Design Question Bank

Hours / 100 Marks Seat No.

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).

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

QUESTION BANK FOR TEST

CS/IT DIGITAL LOGIC DESIGN

Digital logic fundamentals. Question Bank. Unit I

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

Scheme G. Sample Test Paper-I

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

1. Mark the correct statement(s)

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

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

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

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

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

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

Chapter 3. Gate-Level Minimization. Outlines

Question Total Possible Test Score Total 100

MULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR

Philadelphia University Student Name: Student Number:

1. Draw general diagram of computer showing different logical components (3)

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

APPENDIX A SHORT QUESTIONS AND ANSWERS

Combinational Circuits

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

ELCT201: DIGITAL LOGIC DESIGN

CS8803: Advanced Digital Design for Embedded Hardware

Experiment 3: Logic Simplification

KING FAHD UNIVERSITY OF PETROLEUM & MINERALS COMPUTER ENGINEERING DEPARTMENT

ELCT 501: Digital System Design

Gate-Level Minimization

DE Solution Set QP Code : 00904

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

GATE CSE. GATE CSE Book. November 2016 GATE CSE

EE 8351 Digital Logic Circuits Ms.J.Jayaudhaya, ASP/EEE

ELCT201: DIGITAL LOGIC DESIGN

COMBINATIONAL LOGIC CIRCUITS

Gate Level Minimization Map Method

IT 201 Digital System Design Module II Notes

UPY14602-DIGITAL ELECTRONICS AND MICROPROCESSORS Lesson Plan

LOGIC CIRCUITS. Kirti P_Didital Design 1

COPYRIGHTED MATERIAL INDEX

Final Examination (Open Katz, asynchronous & test notes only, Calculators OK, 3 hours)

Written exam for IE1204/5 Digital Design Thursday 29/

2.6 BOOLEAN FUNCTIONS

Topics. Midterm Finish Chapter 7

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?

CMPE223/CMSE222 Digital Logic

Simplification of Boolean Functions

SWITCHING THEORY AND LOGIC CIRCUITS

Computer Organization

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

Programmable Logic Devices

ECE380 Digital Logic

LSN 4 Boolean Algebra & Logic Simplification. ECT 224 Digital Computer Fundamentals. Department of Engineering Technology

Chap.3 3. Chap reduces the complexity required to represent the schematic diagram of a circuit Library

6.1 Combinational Circuits. George Boole ( ) Claude Shannon ( )

Digital Logic Design Exercises. Assignment 1

Chapter 2 Boolean algebra and Logic Gates

DIGITAL ELECTRONICS. P41l 3 HOURS

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

Department of Electrical and Computer Engineering University of Wisconsin - Madison. ECE/CS 352 Digital System Fundamentals.

CS470: Computer Architecture. AMD Quad Core

DIGITAL CIRCUIT LOGIC UNIT 9: MULTIPLEXERS, DECODERS, AND PROGRAMMABLE LOGIC DEVICES

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


DKT 122/3 DIGITAL SYSTEM 1

Chapter 2 Combinational Logic Circuits

FPGA Design Challenge :Techkriti 14 Digital Design using Verilog Part 1

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

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

Gate Level Minimization

Transcription:

Code No: R059210504 Set No. 1 II B.Tech I Semester Regular Examinations, November 2006 DIGITAL LOGIC DESIGN ( Common to Computer Science & Engineering, Information Technology and Computer Science & Systems Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks 1. (a) Express the Decimal Digits 0-9 in BCD, 2421, 84-2-1 and Excess-3. (b) Convert the Hexadecimal number 1010 to Decimal and then to Binary. [12+4] 2. (a) Express the following functions in sum of minterms and product of maxterms. i. F (A,B,C,D) = B D + A D + BD ii. F(x,y,z) = (xy + z)(xz + y). (b) Obtain the complement of the following Boolean expressions. [8+8] i. (AB + AC )(BC + BC )(ABC) ii. AB C + A BC + ABC iii. (ABC) (A + B + C) iv. A + B C (A + B + C ). 3. (a) Implement the following Boolean function F using the two level forms NAND- AND, AND-NOR. F (w, x, y, z) = Σ0, 1, 2, 3, 4, 8, 9, 12 (b) Draw NOR-logic diagram that implements the following function: [8+8] f (A, B, C,D) = Σ0, 1, 2, 3, 4, 8, 9, 12. 4. (a) Design a combinational logic circuit to compare two-two-bit binary numbers AB, CD in which A is MSB and D is LSB, to produce an output Z=1 whenever AB CD and Z = 0 if AB < CD. Draw the circuit using NAND gates. (b) Draw the circuit diagram of a Full-subtractor using NOR gates. [8+8] 5. (a) Explain the following terms related to filp-flops. i. race round conditions ii. propagation delay iii. clock. (b) Explain the operation of R-S flip-flop with negative edge triggering with neat sketch. And explain its truth table. [8+8] 6. (a) Write the HDL structural description of the 4- bit universal shift register (b) Design a 4-bit ring counter using D- flip flops and draw the circuit diagram and timing diagrams. [8+8] 1 of 2

Code No: R059210504 Set No. 1 7. (a) Give the HDL code for a memory read, write operations if the memory size is 64 words of 4 bits each. Also explain the code (b) Obtain the 15-bit Hamming code for the 11-bit data word 11001001010. [8+8] 8. (a) What do you mean by hazard? Classify and explain. (b) Draw the logic diagram of the product of sums expression: Y= (x 1 + x 2 ) ( x 2 + x 3 ). Show that there is a 0-hazard when x 1 and x 3 are equal to 0 and x 2 goes from 0 to 1. Find a way to remove the hazard by adding one or more OR gate. [8+8] 2 of 2

Code No: R059210504 Set No. 2 II B.Tech I Semester Regular Examinations, November 2006 DIGITAL LOGIC DESIGN ( Common to Computer Science & Engineering, Information Technology and Computer Science & Systems Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks 1. (a) Perform the following using BCD arithmetic. Verify the result. [4+4] i. 7484 10 + 3668 10 ii. 8254 10 + 8277 10 (b) Convert the following: i. A6 16 = ( ) 10 ii. 1266 8 = ( ) 10 iii. 10100011 2 = ( ) 10 iv. 372 10 = ( ) 16 [2+2+2+2] 2. (a) Write short notes about the various digital logic families. (b) Obtain the complement of the following Boolean expressions. i. AB + A(B + C) + B (B + D) ii. A + B + A B C. (c) Obtain the dual of the following Boolean expressions. [8+4+4] i. A B + A BC + A BCD + A BC D E ii. ABEF + ABE F + A B EF. 3. (a) Implement the following Boolean expression with Excusive-NOR and NOR gates: F = ABCD + ABCD + ABCD + ABCD (b) If F 1 = wxy + yz + wyz + xyz AndF 2 = (w + x + y + z) (x + y + z) (w + y + z) Obtain minterms list of F 1 F 2 using K-map obtain minimal SOP function of F 1 F 2. [8+8] 4. (a) Generate 2 s complement for the given 4 bit binary number using Full-adders. (Use only block diagram for Full adders) (b) Implement the following Boolean expressions with three half - adders. D = A B C E = ABC + ABC F = ABC + ( A + B ) C G = ABC where A, B, C are the inputs and D, E, F, G are the outputs. [8+8] 1 of 2

Code No: R059210504 Set No. 2 5. (a) Define and explain the following systems. i. synchronous sequential systems, ii. a synchronous sequential systems and iii. combinational systems. (b) Define a latch. Explain the operation of NAND latch with truth table. [10+6] 6. (a) Explain synchronous and ripple counters. Compare their merits and demerits. (b) Design a modulo -12 up synchronous counter using T- flip flops and draw the circuit diagram. [8+8] 7. Derive the PLA programming table and the PLA structure for the combinational circuit that squares a 3- bit number. Minimize the number of product terms. [16] 8. (a) Explain critical and non critical races with the help of examples. (b) An asynchronous sequential circuit has two internal states and one output. The excitation and output functions describing the functions are: [6+10] Y1 = x 1 x 2 + x 1 y 2 + x 2y 1 Y2 = x 2 + x 1 y 1y 2 +x 1y 1 Z = x 2 + y 1 i. Draw the logic diagram of the circuit. ii. Derive the transition table and output map. iii. Obtain a flow table for the circuit. 2 of 2

Code No: R059210504 Set No. 3 II B.Tech I Semester Regular Examinations, November 2006 DIGITAL LOGIC DESIGN ( Common to Computer Science & Engineering, Information Technology and Computer Science & Systems Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks 1. Convert the following to Decimal and then to Binary. (a) 1011 16 (b) ABCD 16 (c) 7234 8 (d) 7766 8 (e) 128 10 (f) 720 10 [3+3+3+3+2+2] 2. (a) Explain the concept of positive logic and negative logic. Also draw the truth tables for positive logic AND gate and negative logic OR gate. (b) Obtain the complement of the following Boolean expressions. i. B C D + (B + C + D) + B C D E ii. AB + (AC) + (AB + C). (c) Obtain the dual of the following Boolean expressions. [8+4+4] i. A B C + A BC + AB C + ABC ii. AB + (AC) + AB C. 3. (a) Implement the following Boolean function F using no more than two NOR - gates and draw the circuit. F (A, B, C,D) = (0, 1, 2, 9, 11) + d (8, 10, 14, 15) (b) Implement the following Boolean function using two - level forms: [6+10] i. NAND - AND ii. AND - NOR iii. OR - NAND and iv. NOR - OR and draw the circuits. F (A, B, C,D) = Π5, 7, 9, 11, 12, 13, 14, 15 4. (a) Using 3 to 8 line de- multiplexers, construct 5 to 32 line de- multiplexers. Use active - low Enable input. If necessary use additional logic gates. (b) Design a combinational logic circuit with three inputs x, y, z and three outputs A, B, C. when the binary input is 0,1,2,or 3, the binary output is one greater than the input. When the binary input is 4,5,6,or 7 the binary output is one 1 of 2

Code No: R059210504 Set No. 3 less than the input. Draw the circuit using one- full adder and an inverter. (Use only block diagram of Full adder). [8+8] 5. A sequential circuit with 2 D-flip-flops A and B has two inputs (X, Y) and one output Z with following relationship D A = (A+B)X, D B = AX, Z = (A+B)X Obtain logic diagram, state table and state diagram. [16] 6. A counter is to be designed to count either in 5421 code or 8421 code based on a control signal input. Draw the state diagram for such a counter and synthesize it using T flip flops. Assume that the control signal cannot change in the middle of a counting sequence. [16] 7. (a) What is parity checking? Explain its necessity and how is it implemented? (b) How many parity check bits must be included with the data word to achieve single error-connection and double-error detection when the data contains [8+8] i. 16 bits, ii. 32 bits, iii. 48 bits. 8. (a) Explain static and dynamic hazards in asynchronous sequential logic with an example. (b) Find a circuit that has no static hazards and implements the Boolean function. [8+8] F = Σ( 0,2,6,7,8,10,12) 2 of 2

Code No: R059210504 Set No. 4 II B.Tech I Semester Regular Examinations, November 2006 DIGITAL LOGIC DESIGN ( Common to Computer Science & Engineering, Information Technology and Computer Science & Systems Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks 1. Convert the following to Decimal and then to Hexadecimal. (a) 3214 8 (b) 4567 8 (c) 10101101 2 (d) 1100101 2 (e) 756 10 (f) 533 10 [3+3+3+3+2+2] 2. (a) Simplify the following Boolean expressions. i. A C + ABC + AC to three literals ii. (x y + z) + z + xy + wz to three literals iii. A B(D + C D) + B(A +A CD) to one literal iv. (A + C)(A + C )(A + B + C D) to four literals. (b) Obtain the complement of the following Boolean expressions. [8+8] i. B C D + (B + C + D) + B C D E ii. AB + (AC)? + (AB + C) iii. A B C + A BC + AB C + ABC iv. AB + (AC) + AB C. 3. (a) Obtain minimal SOP expression for the given Boolean function, using K-map: F (A, B, C,D) = Σ (0, 1, 4, 6, 8, 9, 10, 12) + d3, 7, 11, 13, 14, 15 And draw the circuit using 2-input NAND gates. (b) Obtain minimal POS expression for the Boolean function: f (A, B, C,D) = Π (0, 1, 2, 3, 4, 6, 9, 10)+d7, 11, 13, 15 And draw the circuit using 2-input NAND gates. [8+8] 4. (a) Generate 2 s complement for the given 4 bit binary number using Full-adders. (Use only block diagram for Full adders) (b) Implement the following Boolean expressions with three half - adders. D = A B C E = ABC + ABC F = ABC + ( A + B ) C G = ABC where A, B, C are the inputs and D, E, F, G are the outputs. [8+8] 1 of 2

Code No: R059210504 Set No. 4 5. (a) Draw the circuit diagram of clocked D- flip-flop with NAND gates and explain its operation using truth table. Give its timing diagram. (b) Explain the procedure for the design of sequential circuits with example. [8+8] 6. (a) Explain synchronous and ripple counters. Compare their merits and demerits. (b) Design a modulo -12 up synchronous counter using T- flip flops and draw the circuit diagram. [8+8] 7. (a) Explain the construction of a basic memory cell and also explain with diagram the construction of a 4 * 4 RAM (b) Given a 32*8 ROM chip with an enable input, show the external connections necessary to construct a 128 * 8 ROM with four chips and a decoder. [8+8] 8. (a) i. Explain the difference between asynchronous and synchronous sequential circuits. ii. Define fundamental-mode operation. iii. Explain the difference between stable and unstable states. iv. What is the difference between an internal state and a total state. (b) Explain critical and non critical races with the help of examples. [8+8] 2 of 2