{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# Hw10 - fill in the K-maps below and find the minimal logic...

This preview shows pages 1–2. Sign up to view the full content.

COCO HW10 F09 ___________ ________________________ Section name ECSE-2610 Computer Components and Operations Homework # 10 Due Wednesday, November 11, 2009, in studio 1. (3 points) Wakerly, problem 7.4. 2. (3 points) Wakerly, problem 7.6. 3. (9 points) Given below is an incomplete state transition table for a 2-bit up/down counter using D flip-flops. An up/down counter has a mode bit M. If M = 0, then the counter counts up to the next highest 2-bit number (00 01 10 11 00 …). If M = 1, then the counter counts down to the next lower 2-bit number (00 11 10 01 00 …). a. (5 points) Fill in the missing next states and the DA and DB columns in the table below. M (up/down) A B A* B* DA DB 0 0 0 0 1 0 0 1 1 0 0 1 0 0 1 1 1 0 0 1 1 1 0 1 0 0 1 1 0 1 1 1 b. (4 points) Carefully

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document