DISCRETE MATHEMATICS LOOSELEAF
8th Edition
ISBN: 9781264309689
Author: ROSEN
Publisher: MCG
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 12.3, Problem 16E
Use NOR gates to construct circuits for the outputs given in Exercise 15.
*15. Use ND gates to construct circuits with these outputs.
a) x
b) x+y
c) xy
d) x y
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Pidgeonhole Principle
1. The floor of x, written [x], also called the integral part, integer part, or greatest integer, is defined
as the greatest integer less than or equal to x. Similarly the ceiling of x, written [x], is the smallest
integer greater than or equal to x. Try figuring out the answers to the following:
(a) [2.1]
(b) [2]
(c) [2.9]
(d) [2.1]
(e) [2]
(f) [2.9]
2. The simple pidgeonhole principle states that, if you have N places and k items (k> N), then at
least one hole must have more than one item in it. We tried this with chairs and students: Assume you
have N = 12 chairs and k = 18 students. Then at least one chair must have more than one student on
it.
3. The general pidgeonhole principle states that, if you have N places and k items, then at least one
hole must have [] items or more in it. Try this out with
(a) n = 10 chairs and k = 15 students
(b) n = 10 chairs and k = 23 students
(c) n = 10 chairs and k = 20 students
4. There are 34 problems on these pages, and we…
Determine if the set of vectors is linearly independent or linearly dependent.
linearly independent
O linearly dependent
Save Answer
Q2.2
1 Point
Determine if the set of vectors spans R³.
they span R³
they do not span R³
Save Answer
23
Q2.3
1 Point
Determine if the set of vectors is linearly independent or linearly dependent.
linearly independent
O linearly dependent
Save Answer
1111
1110
Q2.4
1 Point
Determine if the set of vectors spans R4.
O they span R4
they do not span IR4
1000;
111O'
The everything combined problem
Suppose that a computer science laboratory has 15 workstations and 10 servers. A cable can be used to
directly connect a workstation to a server. For each server, only one direct connection to that server can be
active at any time.
1. How many cables would you need to connect each station to each server?
2. How many stations can be used at one time?
3. How many stations can not be used at any one time?
4. How many ways are there to pick 10 stations out of 15?
5. (This one is tricky) We want to guarantee that at any time any set of 10 or fewer workstations can
simultaneously access different servers via direct connections. What is the minimum number of direct
connections needed to achieve this goal?
Chapter 12 Solutions
DISCRETE MATHEMATICS LOOSELEAF
Ch. 12.1 - Prob. 1ECh. 12.1 - Find the values, if any, of the Boolean...Ch. 12.1 - a) Show that(1.1)+(0.1+0)=1 . b) Translate the...Ch. 12.1 - a) Show that(10)+(10)=1 . b) Translate the...Ch. 12.1 - Use a table to express the values of each of these...Ch. 12.1 - Use a table to express the values of each of these...Ch. 12.1 - Use a 3-cubeQ3to represent each of the Boolean...Ch. 12.1 - Use a 3-cubeQ3to represent each of the Boolean...Ch. 12.1 - What values of the Boolean...Ch. 12.1 - How many different Boolean functions are there of...
Ch. 12.1 - Prove the absorption lawx+xy=x using the other...Ch. 12.1 - Show thatF(x,y,z)=xy+xz+yz has the value 1 if and...Ch. 12.1 - Show thatxy+yz+xz=xy+yz+xz .Ch. 12.1 - 3Exercises 14-23 deal the Boolean algebra {0, 1}...Ch. 12.1 - Exercises 14-23 deal with the Boolean algebra {0,...Ch. 12.1 - Prob. 16ECh. 12.1 - Exercises 14-23 deal with the Boolean algebra {0,...Ch. 12.1 - Prob. 18ECh. 12.1 - Prob. 19ECh. 12.1 - Prob. 20ECh. 12.1 - Prob. 21ECh. 12.1 - Prob. 22ECh. 12.1 - Exercises 4-3 deal with the Boolean algebra {0, 1}...Ch. 12.1 - Prob. 24ECh. 12.1 - Prob. 25ECh. 12.1 - Prob. 26ECh. 12.1 - Prove or disprove these equalities. a)x(yz)=(xy)z...Ch. 12.1 - Find the duals of these Boolean expressions. a)x+y...Ch. 12.1 - Prob. 29ECh. 12.1 - Show that ifFandGare Boolean functions represented...Ch. 12.1 - How many different Boolean functionsF(x,y,z) are...Ch. 12.1 - How many different Boolean functionsF(x,y,z) are...Ch. 12.1 - Show that you obtain De Morgan’s laws for...Ch. 12.1 - Show that you obtain the ab,sorption laws for...Ch. 12.1 - In Exercises 35-42, use the laws in Definition 1...Ch. 12.1 - In Exercises 35-42, use the laws in Definition to...Ch. 12.1 - Prob. 37ECh. 12.1 - Prob. 38ECh. 12.1 - In Exercises 35-42, use the laws in Definition 1...Ch. 12.1 - Prob. 40ECh. 12.1 - Prob. 41ECh. 12.1 - Prob. 42ECh. 12.1 - Prob. 43ECh. 12.2 - Find a Boolean product of the Boolean...Ch. 12.2 - Find the sum of products expansions of these...Ch. 12.2 - Find the sum-of-products expansions of these...Ch. 12.2 - Find the sum-of-products expansions of the Boolean...Ch. 12.2 - Find the sum-of -products expansion of the Boolean...Ch. 12.2 - Find the sum-of-products expansion of the Boolean...Ch. 12.2 - Another way to find a Boolean expression that...Ch. 12.2 - Prob. 8ECh. 12.2 - Prob. 9ECh. 12.2 - Another way to find a Boolean expression that...Ch. 12.2 - Prob. 11ECh. 12.2 - Express each of these Boolean functions using the...Ch. 12.2 - Express each of the Boolean functions in...Ch. 12.2 - Show that a)x=xx . b)xy=(xy)(xy) . c)x+y=(xx)(yy)...Ch. 12.2 - Prob. 15ECh. 12.2 - Show that{} is functionally complete using...Ch. 12.2 - Express each of the Boolean functions in Exercise...Ch. 12.2 - Express each of the Boolean functions in Exercise...Ch. 12.2 - Show that the set of operators{+,} is not...Ch. 12.2 - Are these sets of operators functionally complete?...Ch. 12.3 - In Exercises 1—5 find the output of the given...Ch. 12.3 - In Exercises 1—5 find the output of the given...Ch. 12.3 - In Exercises 1—5 find the output of the given...Ch. 12.3 - In Exercises 1—5 find the output of the given...Ch. 12.3 - In Exercises 1—5 find the output of the given...Ch. 12.3 - Construct circuits from inverters, AND gates, and...Ch. 12.3 - Design a circuit that implements majority voting...Ch. 12.3 - Design a circuit for a light fixture controlled by...Ch. 12.3 - Show how the sum of two five-bit integers can be...Ch. 12.3 - Construct a circuit for a half subtractor using...Ch. 12.3 - Construct a circuit for a full subtractor using...Ch. 12.3 - Use the circuits from Exercises 10 and 11 to find...Ch. 12.3 - Construct a circuit that compares the two-bit...Ch. 12.3 - Construct a circuit that computes the product of...Ch. 12.3 - Use NAND gates to construct circuits with these...Ch. 12.3 - Use NOR gates to construct circuits for the...Ch. 12.3 - Construct a half adder using NAND gates.Ch. 12.3 - Construct a half adder using NOR gates.Ch. 12.3 - Construct a multiplexer using AND gates, OR gates,...Ch. 12.3 - Find the depth of a) the circuit constructed in...Ch. 12.4 - Prob. 1ECh. 12.4 - Find the sum-of-products expansions represented by...Ch. 12.4 - Draw the K-maps of these sum-of-products...Ch. 12.4 - Use a K-map to find a minimal expansion as a...Ch. 12.4 - a) Draw a K-map for a function in three variables....Ch. 12.4 - Use K-maps to find simpler circuits with the same...Ch. 12.4 - Prob. 7ECh. 12.4 - Prob. 8ECh. 12.4 - Construct a K-map for F(x,y,z) =xz + yz+y z. Use...Ch. 12.4 - Draw the 3-cube Q3 and label each vertex with the...Ch. 12.4 - Prob. 11ECh. 12.4 - Use a K-map to find a minimal expansion as a...Ch. 12.4 - a) Draw a K-map for a function in four variables....Ch. 12.4 - Use a K-map to find a minimal expansion as a...Ch. 12.4 - Find the cells in a K-map for Boolean functions...Ch. 12.4 - How many cells in a K-map for Boolean functions...Ch. 12.4 - a) How many cells does a K-map in six variables...Ch. 12.4 - Show that cells in a K-map for Boolean functions...Ch. 12.4 - Which rows and which columns of a 4 x 16 map for...Ch. 12.4 - Prob. 20ECh. 12.4 - Prob. 21ECh. 12.4 - Use the Quine-McCluskey method to simplify the...Ch. 12.4 - Use the Quine—McCluskey method to simp1i’ the...Ch. 12.4 - Prob. 24ECh. 12.4 - Use the Quine—McCluskey method to simplify the...Ch. 12.4 - Prob. 26ECh. 12.4 - Prob. 27ECh. 12.4 - Prob. 28ECh. 12.4 - Prob. 29ECh. 12.4 - Prob. 30ECh. 12.4 - Prob. 31ECh. 12.4 - Prob. 32ECh. 12.4 - show that products of k literals correspond to...Ch. 12 - Define a Boolean function of degreen.Ch. 12 - Prob. 2RQCh. 12 - Prob. 3RQCh. 12 - Prob. 4RQCh. 12 - Prob. 5RQCh. 12 - Prob. 6RQCh. 12 - Explain how to build a circuit for a light...Ch. 12 - Prob. 8RQCh. 12 - Is there a single type of logic gate that can be...Ch. 12 - a) Explain how K-maps can be used to simplify...Ch. 12 - a) Explain how K-maps can be used to simplify...Ch. 12 - a) What is a don’t care condition? b) Explain how...Ch. 12 - a) Explain how to use the Quine-McCluskev method...Ch. 12 - Prob. 1SECh. 12 - Prob. 2SECh. 12 - Prob. 3SECh. 12 - Prob. 4SECh. 12 - Prob. 5SECh. 12 - Prob. 6SECh. 12 - Prob. 7SECh. 12 - Prob. 8SECh. 12 - Prob. 9SECh. 12 - Prob. 10SECh. 12 - Prob. 11SECh. 12 - Prob. 12SECh. 12 - Prob. 13SECh. 12 - Prob. 14SECh. 12 - Prob. 15SECh. 12 - Prob. 16SECh. 12 - How many of the 16 Boolean functions in two...Ch. 12 - Prob. 18SECh. 12 - Prob. 19SECh. 12 - Design a circuit that determines whether three or...Ch. 12 - Prob. 21SECh. 12 - A Boolean function that can be represented by a...Ch. 12 - Prob. 23SECh. 12 - Prob. 24SECh. 12 - Given the values of two Boolean variablesxandy,...Ch. 12 - Prob. 2CPCh. 12 - Prob. 3CPCh. 12 - Prob. 4CPCh. 12 - Prob. 5CPCh. 12 - Prob. 6CPCh. 12 - Prob. 7CPCh. 12 - Prob. 8CPCh. 12 - Prob. 9CPCh. 12 - Given the table of values of a Boolean function,...Ch. 12 - Prob. 11CPCh. 12 - Prob. 12CPCh. 12 - Prob. 1CAECh. 12 - Prob. 2CAECh. 12 - Prob. 3CAECh. 12 - Prob. 4CAECh. 12 - Prob. 5CAECh. 12 - Prob. 6CAECh. 12 - Prob. 7CAECh. 12 - Describe some of the early machines devised to...Ch. 12 - Explain the difference between combinational...Ch. 12 - Prob. 3WPCh. 12 - Prob. 4WPCh. 12 - Find out how logic gates are physically...Ch. 12 - Explain howdependency notationcan be used to...Ch. 12 - Describe how multiplexers are used to build...Ch. 12 - Explain the advantages of using threshold gates to...Ch. 12 - Describe the concept ofhazard-free switching...Ch. 12 - Explain how to use K-maps to minimize functions of...Ch. 12 - Prob. 11WPCh. 12 - Describe what is meant by the functional...
Additional Math Textbook Solutions
Find more solutions based on key concepts
First Derivative Test a. Locale the critical points of f. b. Use the First Derivative Test to locale the local ...
Calculus: Early Transcendentals (2nd Edition)
For Problems 23-28, write in simpler form, as in Example 4. logbFG
Finite Mathematics for Business, Economics, Life Sciences and Social Sciences
Empirical versus Theoretical A Monopoly player claims that the probability of getting a 4 when rolling a six-si...
Introductory Statistics
Testing Hypotheses. In Exercises 13-24, assume that a simple random sample has been selected and test the given...
Elementary Statistics Using The Ti-83/84 Plus Calculator, Books A La Carte Edition (5th Edition)
Find all solutions of each equation in the interval .
Precalculus: A Unit Circle Approach (3rd Edition)
The largest polynomial that divides evenly into a list of polynomials is called the _______.
Elementary & Intermediate Algebra
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.Similar questions
- Can you help me with D and Earrow_forwardQ1.1 1 Point Any set {V1, V2, V3, V4} that consists of four different vectors from R cannot possibly span Rº. True False Save Answerarrow_forwardFind: lim x →-6 f (x) limx-4 f (x) lim x-1 f (x) lim x →4 f (x) (-6,3) • (-1,5) -8 -7 (-6,-2) 4+ (4,5) (4,2) • (-1,1) -6arrow_forward
- 3 2 Find: ƒ(1) lim f(x) 14-x 2 ƒ(2) lim f(x) x-2- lim f(x) x+2+ lim f(x) x→4 3 y=f(x)arrow_forwardFor each graph below, state whether it represents a function. Graph 1 24y Graph 2 Graph 3 4 2 -8 -6 -4 -2 -2 2 4 6 Function? ○ Yes ○ No ○ Yes ○ No Graph 4 Graph 5 8 Function? Yes No Yes No -2. ○ Yes ○ No Graph 6 4 + 2 4 -8 -6 -4 -2 2 4 6 8 Yes -4++ Noarrow_forwardStudents were asked to simplify the expression (secØ - cosØ)/secØ Two students' work is given.Student A: step 1 secØ/secØ - cosØ/secØstep 2 cosØ/1 - (1/cosØ)step 3 1 - cos^2Østep 4 sin^2ØStudent B: step 1 (1/cosØ)-cosØ)/secØstep 2 (1 - cos^2Ø/cosØ)/secØstep 3 sin^2Ø/cos^2Østep 4 tan^2ØPart A: Which student simplified the expression incorrectly? Explain the errors that were made or the formulas that were misused.Part B: Complete the student's solution correctly, beginning with the location of the error.arrow_forward
- Although 330° is a special angle on the unit circle, Amar wanted to determine its coordinates using the sum and difference formulas.Part A: Determine cos 330° using the cosine sum identity. Be sure to include all necessary work.Part B: Determine sin 330° using the sine difference identity. Be sure to include all necessary work.arrow_forwardA public health researcher is studying the impacts of nudge marketing techniques on shoppers vegetablesarrow_forward4. Let A {w, e, s, t, f, i, e, l, d, s, t, a, t, e}. (a) How many different words (they do not have to make sense) can you spell with the letters in A? (b) Is your answer from above the same as the cardinality of the powerset of A, i.e. of P(A)? (c) What is |A|?arrow_forward
- what can the answer be pls helparrow_forward5. How many numbers can you make out of the digits 1, 2, 3, 4, 6 if the rule is that every digit has to be larger than the digit preceding it? For example 124 is ok, 122 is not ok. Every digit can be used only once, but you do not have to use every digit. A tree might help.arrow_forward5 plsarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Algebra for College StudentsAlgebraISBN:9781285195780Author:Jerome E. Kaufmann, Karen L. SchwittersPublisher:Cengage Learning
Algebra for College Students
Algebra
ISBN:9781285195780
Author:Jerome E. Kaufmann, Karen L. Schwitters
Publisher:Cengage Learning
Graph Theory: Euler Paths and Euler Circuits; Author: Mathispower4u;https://www.youtube.com/watch?v=5M-m62qTR-s;License: Standard YouTube License, CC-BY
WALK,TRIAL,CIRCUIT,PATH,CYCLE IN GRAPH THEORY; Author: DIVVELA SRINIVASA RAO;https://www.youtube.com/watch?v=iYVltZtnAik;License: Standard YouTube License, CC-BY