Let B be the set of binary strings* of length 5. Define f: B(0, 1, 2,...

 

Transcribed Image Text:

Let B be the set of binary strings* of length 5. Define f: B(0, 1, 2, 3, 4, 5), where f(s) is the number of 1's in the strings. Define g: {0, 1, 2, 3, 4, 5)→ B, where 5} g(n) is the binary string consisting of n 1's, followed by 5-n 0's. (a) Find f(11011), f(01101), and f(11000). Is f invert- ible? If not, why not? (Be specific.) (b) Find g(0), g(2), and g(4). Is g invertible? If not, why not? (Be specific.) (c) Find (fog)(2), (fog)(0), (gof)(11010), (go f)(11100). (d) Are f and g inverses of each other? Let B be the set of binary strings* of length 5. Define f: B(0, 1, 2, 3, 4, 5), where f(s) is the number of 1's in the strings. Define g: {0, 1, 2, 3, 4, 5)→ B, where 5} g(n) is the binary string consisting of n 1's, followed by 5-n 0's. (a) Find f(11011), f(01101), and f(11000). Is f invert- ible? If not, why not? (Be specific.) (b) Find g(0), g(2), and g(4). Is g invertible? If not, why not? (Be specific.) (c) Find (fog)(2), (fog)(0), (gof)(11010), (go f)(11100). (d) Are f and g inverses of each other?

Answer rating: 100% (QA)

a Lets find f11011 f01101 and f11000 1 f11011 counts the number of 1s in the binary string 11011 whi... View the full answer