ch_11_probs - CHAPTER Combinational Logic II Karnaugh Maps...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
243 CHAPTER 11 Combinational Logic II: Karnaugh Maps
Background image of page 1

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

View Full DocumentRight Arrow Icon
244 Chapter 11: Combinational Logic II: Karnaugh Maps CHAPTER 11: PROBLEMS 11.1 For the K-map below, circle terms to implement the minimized SOP (sum of products) form for the function F represented by the map. “X” means “don’t care”. (a) Determine the minimized SOP boolean expression for F. (b) Using only inverters, two-input AND gates and two input OR gates, draw the schematic of the circuit. (c) Using the same K-map, write the minimized SOP form for F (the complement of F), then find the POS expression for F. 11.2 For the K-map below, circle terms to implement the minimized SOP (sum of products) form for the function F represented by the map. “X” means “don’t care”. (a) Determine the minimized SOP boolean expression for F. (b) Draw a schematic representation which implements the expression from (a) using only NAND gates. (c) Using the same K-map, write the minimized SOP form for F (the complement of F), then find the POS expression for FC D C DC D A B 1011 A B 0X01 AB X0XX 1001 D C D A B 111X A B 0100 X01X X001
Background image of page 2
245 Digital Electronics 11.3 For the K-map below, circle terms to implement the minimized SOP (sum of products) form for the function F represented by the map. “X” means “don’t care”. (a) Determine the minimized SOP boolean expression for F. (b) Using only inverters, two-input AND gates and two input OR gates, draw the schematic of the circuit. (c) Using the same K-map, write the minimized SOP form for F (the complement of F), then find the POS expression for F. 11.4 For the K-map below, circle terms to implement the minimized SOP (sum of products) form for the function F represented by the map. “X” means “don’t care”. (a) Determine the minimized SOP boolean expression for F. (b) Draw a schematic representation which implements the expression from (a) using only NAND gates (any number of inputs is allowed).
Background image of page 3

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

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 07/14/2008 for the course ECE 18100 taught by Professor Williams during the Fall '07 term at Carnegie Mellon.

Page1 / 10

ch_11_probs - CHAPTER Combinational Logic II Karnaugh Maps...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online