Electronics > EXAM > Daytona State College CET 3116 Digital Technology Homework #6 with correct answers highlighted (All)

Daytona State College CET 3116 Digital Technology Homework #6 with correct answers highlighted

Document Content and Description Below

Digital Technology Homework #6 Question 1 Looping on a K-map always results in the elimination of: Question 1 options: variables within the loop that appear only in their un-complemented form. va ... riables that remain unchanged within the loop. variables within the loop that appear in both complemented and un-complemented form. variables within the loop that appear only in their complemented form. Question 2 In a K-Map the number of squares in a cover (loop) is always a power of two. Question 2 options: True False Question 3 What theorem is used when two terms in adjacent squares are combined? Question 3 options: Uniting Elimination Multiplying and factoring Consensus Question 4 What law of Boolean algebra justifies using a 1 on a map in two or more covers (loops)? Question 4 options: Commutative laws Associative laws Distributive laws Idempotent laws Question 5 For a three-variable map, which squares are "adjacent" to square 6? Question 5 options: 2,3,4,7 2,4,7 2,4 None of the above. Question 6 For a four-variable map, which squares are "adjacent" to square 8? Question 6 options: 8,9,12,13 9,10,12 0,9,10,12 None of the above. Question 7 The figure above shows the truth table of a four variable F(A,B,C,D) and four K-maps. Which K-Map corresponds to the function F? Question 7 options: A B C D None of the above [Show More]

Last updated: 3 years ago

Preview 1 out of 17 pages

Buy Now

Instant download

We Accept: