×

# Determine whether f is a function from the set of all bit ## Problem 3E Chapter 2.3

Discrete Mathematics and Its Applications | 7th Edition

• 2901 Step-by-step solutions solved by professors and subject experts
• Get 24/7 help from StudySoup virtual teaching assistants Discrete Mathematics and Its Applications | 7th Edition

4 5 0 412 Reviews
21
0
Problem 3E

Determine whether f is a function from the set of all bit strings to the set of integers ifa) f(S) is the position of a 0 bit in S.________________b) f(S) is the number of I bits in S.________________c) f(S) is the smallest integer i such that the ith bit of, S is 1 and f (s) = 0 when S is the empty string, the string with no bits.

Step-by-Step Solution:

SolutionStep 1FunctionIt is a connection between a set of domains and a set of range with the unique property that each domains of the sets is related with one value of range.Step 2(a)In the Problem it is given that f(S) is the position of a 0 bit in S.But according to the statement that a function from a set of all bits strings to the set of integer.So, function f contain one or more than 0 bit in S or function f contain all 1s. Hence, f(S) is not properly defined.

Step 3 of 4

Step 4 of 4

##### ISBN: 9780073383095

Unlock Textbook Solution

Determine whether f is a function from the set of all bit

×
Get Full Access to Discrete Mathematics And Its Applications - 7 Edition - Chapter 2.3 - Problem 3e

Get Full Access to Discrete Mathematics And Its Applications - 7 Edition - Chapter 2.3 - Problem 3e