Solution Found!
The function f : 5binary strings6 S 5binary strings6. In
Chapter 5, Problem 8(choose chapter or problem)
The function \(f\) : {binary strings} \(\rightarrow\) {binary strings}. In each case, find \(f(S)\).
a. S = {000, 1011, 10001}, \(f(x)\) = the second bit in \(x\)
b. S = {111, 100, 0111}, \(f(x)\) = the binary string that is the sum of the first and last bit
c. S = {001, 11, 101}, \(f(x)\) = the binary string that is equal to \(x + 1\)
Questions & Answers
QUESTION:
The function \(f\) : {binary strings} \(\rightarrow\) {binary strings}. In each case, find \(f(S)\).
a. S = {000, 1011, 10001}, \(f(x)\) = the second bit in \(x\)
b. S = {111, 100, 0111}, \(f(x)\) = the binary string that is the sum of the first and last bit
c. S = {001, 11, 101}, \(f(x)\) = the binary string that is equal to \(x + 1\)
Step 1 of 3
Given, \(f:\{\text { binary strings }\} \rightarrow\{\text { binary strings }\}\) and \(S=\{000,1011,10001\}\).
Also, \(f(x)=\text { the second bit in } \mathrm{x}\)
The second bit in every string is 0. Thus \(f(S)=\{0\}\).