DISCRETE MATHEMATICS LOOSELEAF
8th Edition
ISBN: 9781264309689
Author: ROSEN
Publisher: MCG
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 11.2, Problem 40E
Suppose that m is a positive integer withm= 2. An m-ary Huffman code for a set ofNsymbols can be constructed analogously to the construction of a binary Huffman code. At the initial step, ((N— 1) mod (m— 1)) + 1 trees consisting of a single vertex with least weights are combined into a rooted tree with these vertices as leaves. At each subsequent step, the m trees of least weight are combined into an m-ary tree.
40. Show that if a game of nim begins with two piles containing different numbers of stones, the first player wins when both players follow optimal strategies.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Find the gcd of 151 and 187 using the Euclidean algorithm. Then write the gcd as a linear combination of these two numbers in 2 different ways
Use Euclid's Algorithm to show that there are integers s and t such that
57s + 73t = 1.
Showing all your working, compute [57]- in Z73.
How many elements of Z73 have a multiplicative inverse?
How would I use the Extended Euclidean Algorithm to express this gcd as a linear combination? I found the gcd of (14,203) is 7.
gcd(14, 203)
Chapter 11 Solutions
DISCRETE MATHEMATICS LOOSELEAF
Ch. 11.1 - Prob. 1ECh. 11.1 - Vhich of these graphs are trees?Ch. 11.1 - Prob. 3ECh. 11.1 - Prob. 4ECh. 11.1 - Prob. 5ECh. 11.1 - Prob. 6ECh. 11.1 - Prob. 7ECh. 11.1 - Prob. 8ECh. 11.1 - Prob. 9ECh. 11.1 - Prob. 10E
Ch. 11.1 - Prob. 11ECh. 11.1 - Prob. 12ECh. 11.1 - Prob. 13ECh. 11.1 - Prob. 14ECh. 11.1 - Let G he a simple graph with n vertices. Show that...Ch. 11.1 - Prob. 16ECh. 11.1 - Prob. 17ECh. 11.1 - Prob. 18ECh. 11.1 - Prob. 19ECh. 11.1 - Prob. 20ECh. 11.1 - Prob. 21ECh. 11.1 - A chain letter starts when a person sends a letter...Ch. 11.1 - A chain letter starts with a person sending a...Ch. 11.1 - Prob. 24ECh. 11.1 - Prob. 25ECh. 11.1 - Prob. 26ECh. 11.1 - Prob. 27ECh. 11.1 - Prob. 28ECh. 11.1 - Prob. 29ECh. 11.1 - Prob. 30ECh. 11.1 - Prob. 31ECh. 11.1 - Prob. 32ECh. 11.1 - Prob. 33ECh. 11.1 - Prob. 34ECh. 11.1 - Prob. 35ECh. 11.1 - Prob. 36ECh. 11.1 - Letnbe a power of 2. Show thatnnumbers can be...Ch. 11.1 - Prob. 38ECh. 11.1 - Prob. 39ECh. 11.1 - Prob. 40ECh. 11.1 - Prob. 41ECh. 11.1 - Prob. 42ECh. 11.1 - Prob. 43ECh. 11.1 - Prob. 44ECh. 11.1 - Draw the first seven rooted Fibonacci trees.Ch. 11.1 - Prob. 46ECh. 11.1 - Prob. 47ECh. 11.1 - Show that the average depth of a leaf in a binary...Ch. 11.2 - Build a binary search tree for the...Ch. 11.2 - Build a binary search tree for the words oenology,...Ch. 11.2 - How many comparisons are needed to locate or to...Ch. 11.2 - How many comparisons are needed to locate or to...Ch. 11.2 - Using alphabetical order, construct a binary...Ch. 11.2 - How many weighings of a balance scale are needed...Ch. 11.2 - How many weighings of a balance scale are needed...Ch. 11.2 - How many weighings of a balance scale are needed...Ch. 11.2 - How many weighings of a balance scale are needed...Ch. 11.2 - One of four coins may be counterfeit. If it is...Ch. 11.2 - Find the least number of comparisons needed to...Ch. 11.2 - Prob. 12ECh. 11.2 - The tournament sort is a sorting algorithm that...Ch. 11.2 - The tournament sort is a sorting algorithm that...Ch. 11.2 - Prob. 15ECh. 11.2 - Prob. 16ECh. 11.2 - Prob. 17ECh. 11.2 - The tournament sort is a sorting algorithm that...Ch. 11.2 - The tournament sort is a sorting algorithm that...Ch. 11.2 - The tournament sort is a sorting algorithm that...Ch. 11.2 - Prob. 21ECh. 11.2 - The tournament sort is a sorting algorithm that...Ch. 11.2 - Prob. 23ECh. 11.2 - The tournament sort is a sorting algorithm that...Ch. 11.2 - Prob. 25ECh. 11.2 - The tournament sort is a sorting algorithm that...Ch. 11.2 - Prob. 27ECh. 11.2 - Prob. 28ECh. 11.2 - Suppose thatmis a positive integer with m>2An...Ch. 11.2 - Suppose that m is a positive integer with m>2 An...Ch. 11.2 - Suppose that m is a positive integer withm= 2. An...Ch. 11.2 - Suppose thatmis a positive integer withm= 2....Ch. 11.2 - Prob. 33ECh. 11.2 - Prob. 34ECh. 11.2 - Suppose that m is a positive integer with m>2 An...Ch. 11.2 - Prob. 36ECh. 11.2 - Suppose that m is a positive integer with m>2 An...Ch. 11.2 - Suppose that m is a positive integer with m>2 An...Ch. 11.2 - Prob. 39ECh. 11.2 - Suppose that m is a positive integer withm= 2. An...Ch. 11.2 - Prob. 41ECh. 11.2 - Suppose that m is a positive integer with m>2 An...Ch. 11.2 - Prob. 43ECh. 11.2 - Prob. 44ECh. 11.3 - Prob. 1ECh. 11.3 - Prob. 2ECh. 11.3 - Prob. 3ECh. 11.3 - Prob. 4ECh. 11.3 - Suppose that the vertex with the largest address...Ch. 11.3 - Prob. 6ECh. 11.3 - Prob. 7ECh. 11.3 - Prob. 8ECh. 11.3 - Prob. 9ECh. 11.3 - Prob. 10ECh. 11.3 - Prob. 11ECh. 11.3 - Prob. 12ECh. 11.3 - Prob. 13ECh. 11.3 - Prob. 14ECh. 11.3 - Prob. 15ECh. 11.3 - Prob. 16ECh. 11.3 - Prob. 17ECh. 11.3 - a) Represent the compound propositionsandusing...Ch. 11.3 - a) Represent(AB)(A(BA))using an ordered rooted...Ch. 11.3 - In how many ways can the stringbe fully...Ch. 11.3 - In how many ways can the stringbe fully...Ch. 11.3 - Draw the ordered rooted tree corresponding to each...Ch. 11.3 - What is the value of each of these prefix...Ch. 11.3 - What is the value of each of these postfix...Ch. 11.3 - Prob. 25ECh. 11.3 - Prob. 26ECh. 11.3 - Prob. 27ECh. 11.3 - Prob. 28ECh. 11.3 - Prob. 29ECh. 11.3 - Prob. 30ECh. 11.3 - Show that any well-formed formula in prefix...Ch. 11.3 - Prob. 32ECh. 11.3 - Prob. 33ECh. 11.3 - Prob. 34ECh. 11.4 - How many edges must be removed from a connected...Ch. 11.4 - Prob. 2ECh. 11.4 - Prob. 3ECh. 11.4 - Prob. 4ECh. 11.4 - Prob. 5ECh. 11.4 - Prob. 6ECh. 11.4 - Prob. 7ECh. 11.4 - Prob. 8ECh. 11.4 - Prob. 9ECh. 11.4 - Prob. 10ECh. 11.4 - Prob. 11ECh. 11.4 - Prob. 12ECh. 11.4 - Prob. 13ECh. 11.4 - Prob. 14ECh. 11.4 - Prob. 15ECh. 11.4 - Prob. 16ECh. 11.4 - Prob. 17ECh. 11.4 - Prob. 18ECh. 11.4 - Prob. 19ECh. 11.4 - Prob. 20ECh. 11.4 - Prob. 21ECh. 11.4 - Describe the tree produced by breadth-first search...Ch. 11.4 - Prob. 23ECh. 11.4 - Explain how breadth-first search or depth-first...Ch. 11.4 - Prob. 25ECh. 11.4 - Prob. 26ECh. 11.4 - Prob. 27ECh. 11.4 - Use backtracking to find a subset, if it exists,...Ch. 11.4 - Explain how backtracking can be used to find a...Ch. 11.4 - Prob. 30ECh. 11.4 - Prob. 31ECh. 11.4 - A spanning forest of a graphGis a forest that...Ch. 11.4 - Prob. 33ECh. 11.4 - Prob. 34ECh. 11.4 - Prob. 35ECh. 11.4 - A spanning forest of a graphGis a forest that...Ch. 11.4 - Prob. 37ECh. 11.4 - Prob. 38ECh. 11.4 - Prob. 39ECh. 11.4 - Prob. 40ECh. 11.4 - Prob. 41ECh. 11.4 - Prob. 42ECh. 11.4 - Prob. 43ECh. 11.4 - Prob. 44ECh. 11.4 - Prob. 45ECh. 11.4 - Prob. 46ECh. 11.4 - Prob. 47ECh. 11.4 - Prob. 48ECh. 11.4 - Prob. 49ECh. 11.4 - Prob. 50ECh. 11.4 - Prob. 51ECh. 11.4 - Prob. 52ECh. 11.4 - Prob. 53ECh. 11.4 - Prob. 54ECh. 11.4 - Prob. 55ECh. 11.4 - Prob. 56ECh. 11.4 - Prob. 57ECh. 11.4 - Prob. 58ECh. 11.4 - Prob. 59ECh. 11.4 - Prob. 60ECh. 11.4 - Prob. 61ECh. 11.5 - The roads represented by this graph are all...Ch. 11.5 - Prob. 2ECh. 11.5 - Prob. 3ECh. 11.5 - Prob. 4ECh. 11.5 - Prob. 5ECh. 11.5 - Prob. 6ECh. 11.5 - Prob. 7ECh. 11.5 - Prob. 8ECh. 11.5 - Prob. 9ECh. 11.5 - Prob. 10ECh. 11.5 - Prob. 11ECh. 11.5 - Prob. 12ECh. 11.5 - Prob. 13ECh. 11.5 - Prob. 14ECh. 11.5 - Prob. 15ECh. 11.5 - Prob. 16ECh. 11.5 - Prob. 17ECh. 11.5 - Prob. 18ECh. 11.5 - Prob. 19ECh. 11.5 - Prob. 20ECh. 11.5 - Prob. 21ECh. 11.5 - Prob. 22ECh. 11.5 - Express the algorithm devised in Exercise 22 in...Ch. 11.5 - Prob. 24ECh. 11.5 - Prob. 25ECh. 11.5 - Prob. 26ECh. 11.5 - Prob. 27ECh. 11.5 - Prob. 28ECh. 11.5 - Prob. 29ECh. 11.5 - Prob. 30ECh. 11.5 - Prob. 31ECh. 11.5 - Prob. 32ECh. 11.5 - Prob. 33ECh. 11.5 - Prob. 34ECh. 11.5 - Prob. 35ECh. 11 - Prob. 1RQCh. 11 - Prob. 2RQCh. 11 - Prob. 3RQCh. 11 - Prob. 4RQCh. 11 - Prob. 5RQCh. 11 - Prob. 6RQCh. 11 - Prob. 7RQCh. 11 - a) What is a binary search tree? b) Describe an...Ch. 11 - Prob. 9RQCh. 11 - Prob. 10RQCh. 11 - a) Explain how to use preorder, inorder, and...Ch. 11 - Show that the number of comparisons used by a...Ch. 11 - a) Describe the Huffman coding algorithm for...Ch. 11 - Draw the game tree for nim if the starting...Ch. 11 - Prob. 15RQCh. 11 - Prob. 16RQCh. 11 - a) Explain how backtracking can be used to...Ch. 11 - Prob. 18RQCh. 11 - Prob. 19RQCh. 11 - Show that a simple graph is a tree if and Only if...Ch. 11 - Prob. 2SECh. 11 - Prob. 3SECh. 11 - Prob. 4SECh. 11 - Prob. 5SECh. 11 - Prob. 6SECh. 11 - Prob. 7SECh. 11 - Prob. 8SECh. 11 - Prob. 9SECh. 11 - Prob. 10SECh. 11 - Prob. 11SECh. 11 - Prob. 12SECh. 11 - Prob. 13SECh. 11 - Prob. 14SECh. 11 - Prob. 15SECh. 11 - Prob. 16SECh. 11 - Prob. 17SECh. 11 - Prob. 18SECh. 11 - Prob. 19SECh. 11 - Prob. 20SECh. 11 - Prob. 21SECh. 11 - Prob. 22SECh. 11 - Prob. 23SECh. 11 - The listing of the vertices of an ordered rooted...Ch. 11 - The listing of the vertices of an ordered rooted...Ch. 11 - Prob. 26SECh. 11 - Prob. 27SECh. 11 - Prob. 28SECh. 11 - Prob. 29SECh. 11 - Show that if every circuit not passing through any...Ch. 11 - Prob. 31SECh. 11 - Prob. 32SECh. 11 - Prob. 33SECh. 11 - Prob. 34SECh. 11 - Prob. 35SECh. 11 - Prob. 36SECh. 11 - Prob. 37SECh. 11 - Prob. 38SECh. 11 - Prob. 39SECh. 11 - Prob. 40SECh. 11 - Prob. 41SECh. 11 - Prob. 42SECh. 11 - Prob. 43SECh. 11 - Prob. 44SECh. 11 - Prob. 45SECh. 11 - Show that a directed graphG= (V,E) has an...Ch. 11 - In this exercise we will develop an algorithm to...Ch. 11 - Prob. 1CPCh. 11 - Prob. 2CPCh. 11 - Prob. 3CPCh. 11 - Prob. 4CPCh. 11 - Prob. 5CPCh. 11 - Prob. 6CPCh. 11 - Prob. 7CPCh. 11 - Given an arithmetic expression in prefix form,...Ch. 11 - Prob. 9CPCh. 11 - Given the frequency of symbols, use Huffman coding...Ch. 11 - Given an initial position in the game of nim,...Ch. 11 - Prob. 12CPCh. 11 - Prob. 13CPCh. 11 - Prob. 14CPCh. 11 - Prob. 15CPCh. 11 - Prob. 16CPCh. 11 - Prob. 17CPCh. 11 - Prob. 18CPCh. 11 - Prob. 1CAECh. 11 - Prob. 2CAECh. 11 - Prob. 3CAECh. 11 - Prob. 4CAECh. 11 - Prob. 5CAECh. 11 - Prob. 6CAECh. 11 - Prob. 7CAECh. 11 - Prob. 8CAECh. 11 - Prob. 1WPCh. 11 - Prob. 2WPCh. 11 - Prob. 3WPCh. 11 - DefineAVL-trees(sometimes also known...Ch. 11 - Prob. 5WPCh. 11 - Prob. 6WPCh. 11 - Prob. 7WPCh. 11 - Prob. 8WPCh. 11 - Prob. 9WPCh. 11 - Prob. 10WPCh. 11 - Discuss the algorithms used in IP multicasting to...Ch. 11 - Prob. 12WPCh. 11 - Describe an algorithm based on depth-first search...Ch. 11 - Prob. 14WPCh. 11 - Prob. 15WPCh. 11 - Prob. 16WPCh. 11 - Prob. 17WPCh. 11 - Prob. 18WP
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
- Write out the addition and multiplication tables for 5.arrow_forwardSuppose that the check digit is computed as described in Example . Prove that transposition errors of adjacent digits will not be detected unless one of the digits is the check digit. Example Using Check Digits Many companies use check digits for security purposes or for error detection. For example, an the digit may be appended to a -bit identification number to obtain the -digit invoice number of the form where the th bit, , is the check digit, computed as . If congruence modulo is used, then the check digit for an identification number . Thus the complete correct invoice number would appear as . If the invoice number were used instead and checked, an error would be detected, since .arrow_forwardSomeone used the Euclidean Algorithm to compute gcd(44,140) and found the following. Use this to write the gcd as a linear combination of 44 and 140. Show work. 140 = 3(44) + 8 44 = 5(8) + 4 8 = 2(4) + 0arrow_forward
- 2. Use the Euclidean Algorithm to obtain integers x and y satisfying the following (a) gcd(56,72) = 56x +72y. (b) gcd(24, 138) = 24x + 138y.arrow_forwardUse the extended Euclidean algorithm to find the greatest common divisor of 10,393 and 1,064 and express it as a linear combination of 10,393 and 1,064.arrow_forwardIf a = 282 and b = 34 then find the following: 1) Find gcd(a, b) "use Euclidean algorithm" 2) Write the gcd(a, b) as a linear combination of a and b 3) Write a and b in standard form of prime factorization 4) Find l.c.m(a, b)arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
Linear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage Learning
Elements Of Modern AlgebraAlgebraISBN:9781285463230Author:Gilbert, Linda, JimmiePublisher:Cengage Learning,
Linear Algebra: A Modern Introduction
Algebra
ISBN:9781285463247
Author:David Poole
Publisher:Cengage Learning
Elements Of Modern Algebra
Algebra
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Cengage Learning,
Orthogonality in Inner Product Spaces; Author: Study Force;https://www.youtube.com/watch?v=RzIx_rRo9m0;License: Standard YouTube License, CC-BY
Abstract Algebra: The definition of a Group; Author: Socratica;https://www.youtube.com/watch?v=QudbrUcVPxk;License: Standard Youtube License