0% found this document useful (0 votes)
21 views10 pages

ECE 223 Digital Circuits Exam 2000

This document is the final examination for the University of Waterloo's ECE 223 Digital Circuits and Systems course from Winter 2000. It contains 9 problems testing various concepts related to digital circuits, including number conversion between radix systems, Boolean algebra, logic gates, flip-flops, counters, and finite state machines. Students are instructed to show their work and attempt all problems over the course of the 3 hour exam.

Uploaded by

sal
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
21 views10 pages

ECE 223 Digital Circuits Exam 2000

This document is the final examination for the University of Waterloo's ECE 223 Digital Circuits and Systems course from Winter 2000. It contains 9 problems testing various concepts related to digital circuits, including number conversion between radix systems, Boolean algebra, logic gates, flip-flops, counters, and finite state machines. Students are instructed to show their work and attempt all problems over the course of the 3 hour exam.

Uploaded by

sal
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

University of Waterloo

Department of Electrical and Computer Engineering


ECE 223 Digital Circuits and Systems
Final Examination
Winter 2000
Duration 3 hours Instructor: M. Sachdev Date April 12, 2000

Name .......................................................... Student ID ..........................................

1 2 3 4 5 6 7 8 9 Total

Notes
1. Attempt all problems.
2. If information appears to be missing make a reasonable assumption, state it and proceed.
3. Calculators are not needed and are not allowed.
4. No additional material is allowed.
Name:.................................................... Student id:.....................................................

Problem 1
(A): Convert following number from one radix to another [4]
(127.094)10 to radix 5

(B): Write a 4-bit gray code. In what applications usage of gray code is desirable? [4]
Name:.................................................... Student id:.....................................................

Problem 2
(A): What is the difference between Mealy and Moore machines [4]

(B): Highlight two major differences between a Programmable Logic Array (PLA) and a Programmable
Array Logic (PAL) devices [4]
Name:.................................................... Student id:.....................................................

Problem 3
Simplify the following Boolean function by means of Quine-McCluskey tabulation method [12]
P(A,B,C,D,E,F) = Σ ( 6, 9, 13, 18, 19, 25, 27, 29, 41, 45, 57, 61 )
Name:.................................................... Student id:.....................................................

Problem 4
Design a combinational circuit that converts a binary number of 4 bits (WXYZ) to a binary coded decimal
(BCD) format. Show the logic level implementation. [12]
Name:.................................................... Student id:.....................................................

Problem 5
Give a logic diagram of a level sensitive, master-slave flip-flop. Why edge triggered flip-flops are gener-
ally preferred in digital designs? Give a logic level diagram for an edge triggered flip-flop. [12]
Name:.................................................... Student id:.....................................................

Problem 6
A sequential circuit is shown in the figure. Derive the state table and state diagram of the circuit [12]

J Q A J Q B

B’
K Q’ K Q’

CP

y
x
Name:.................................................... Student id:.....................................................

Problem 7
Design a 4-bit ripple counter with Toggle flip-flops. What is the disadvantage of a ripple counter? [12]
Name:.................................................... Student id:.....................................................

Problem 8
Construct an ASM chart for a digital system that counts the number of people in a room. People enter the
room from one door with a photocell that changes a signal x from 1 to 0 when the light is interrupted. They
leave the room from a second door with a similar photocell with a signal y. Both x and y are synchronized
with the clock but may stay on or off for more than one clock pulse period. The data processor subsystem
consists of an up-down counter with a display of its contents. [12]
Name:.................................................... Student id:.....................................................

Problem 9
Derive the transition table for the asynchronous sequential circuit shown in the figure. Determine the
sequence on internal states Y1Y2 for the following sequence of inputs, x1x2 : 00, 10, 11, 01, 11, 10, 00 [12]

x
1
Y
1

x2

Y
2

Common questions

Powered by AI

PLAs and PALs differ mainly in their programmability and complexity: 1. PLAs offer programmability in both the AND and OR planes, providing greater flexibility and complexity for designers to implement combinational logic functions . 2. PALs, on the other hand, have a programmable AND plane but a fixed OR plane, resulting in simpler design and typically faster circuitry but with less flexibility compared to PLAs .

The Quine-McCluskey method is a systematic approach for simplifying Boolean functions to their minimal form. It involves the following steps: 1. List all minterms for the given function and convert them to binary form. 2. Group these binary numbers by the number of 1s they contain. 3. Compare and combine pairs of terms differing by a single bit to form prime implicants, which are then tabulated. 4. Find a minimal set of prime implicants covering all required minterms by using a selection matrix. This method is exhaustive and guarantees finding the minimal expression, unlike Karnaugh maps which are more suitable for smaller variable counts .

To convert a binary number (WXYZ) into BCD using combinational logic, each group of 4 bits (binary digit) needs to be processed as follows: 1. Determine the inputs (WXYZ – 4-bit binary) and convert to BCD, which requires checking if the number exceeds decimal 9 (1001 in binary). 2. Implement logic to adjust (add 6) to the binary equivalent of numbers ≥10, ensuring correct BCD output through logic gates, such as AND, OR, and XOR gates, or multiplexers. 3. Design the logic circuit diagram, mapping binary input combinations to corresponding BCD outputs, ensuring that binary combinations 1010 to 1111 are adjusted appropriately .

The key difference between Mealy and Moore machines lies in their output generation: 1. Mealy machines generate outputs based on the current state and the present input, which may lead to changes in output within cycles, allowing for potentially faster response to changes in input . 2. Moore machines generate outputs solely based on the current state, making them simpler to design and predictable since outputs change only at state transitions; however, this can result in slower response times to inputs compared to Mealy machines .

A 4-bit Gray code is a binary numeral system where two successive values differ in only one bit. The 4-bit Gray code sequence is: 0000, 0001, 0011, 0010, 0110, 0111, 0101, 0100, 1100, 1101, 1111, 1110, 1010, 1011, 1001, 1000. Gray codes are often used in applications like rotary encoders and digital error correction where it is beneficial to minimize errors, as it reduces the chance of logic errors by ensuring only one bit changes at a time during transitions .

To convert (127.094)₁₀ to base 5, begin by converting the integer part (127) to base 5. Divide the number by 5, record the remainder, and continue dividing the quotient by 5 until it becomes zero: 127 ÷ 5 = 25 remainder 2 25 ÷ 5 = 5 remainder 0 5 ÷ 5 = 1 remainder 0 1 ÷ 5 = 0 remainder 1 Reading the remainders from bottom to top, (127)₁₀ is equivalent to (1002)₅. Next, convert the fractional part (0.094) by multiplying by 5 and taking the integer part, then continuing with the remaining fraction: 0.094 x 5 = 0.47 (integer part = 0) 0.47 x 5 = 2.35 (integer part = 2) 0.35 x 5 = 1.75 (integer part = 1) 0.75 x 5 = 3.75 (integer part = 3) (Repeat for more precision if necessary). The fractional part is approximately (0.0213)₅. Hence, (127.094)₁₀ is approximately (1002.0213)₅.

You might also like