2. We know a subset can be represented by an array of 1's and 0's (1...

 

Transcribed Image Text:

2. We know a subset can be represented by an array of 1's and 0's (1 for an item in the subset and 0 for an item not in the subset). Shown below are some example subsets of A, B, C, D, E) and their array-representation. Note that #(1's in the array) equals the size of the subset. Subsets { A, B, E) (B) A 1 0 0 B 1 1 0 C D E 0 0 1 0 0 0 0 0 0 Array representation [1, 1, 0, 0, 1] [0, 1, 0, 0, 0] [0, 0, 0, 0, 0] What does the following code return when subsetOne and subsetTwo equal the arrays for subsets (A, B, E) and {B}? for (int i-0; i<subsetOne.length; i++) if (subsetOne [i] != subset Two [i]) return (false); return (true); How many times the comparison "subsetOne[i] != subsetTwo[i]" is done? State in English what the code returns, in general, for two input arrays subsetOne and subsetTwo (of 0's and I's and having the same length)? For subsetOne = [1, 1, 0, 0, 1], how many subsetTwo give the return value "true" and what is #(comparison "subse- tOne[i] != subsetTwo[i]") for each of those subsetTwo? For subsetOne = [1, 1, 0, 0, 1], how many subsetTwo give the return value "false" and how many of them have #(com- parison "subsetOne[i] != subsetTwo[i]")= k for each of k= 1, 2, 3, and 4? Give the codes to test each of the following: (a) subsetOne is a subset of subsetTwo, and (b) subsetOne and subset Two are disjoint. 2. We know a subset can be represented by an array of 1's and 0's (1 for an item in the subset and 0 for an item not in the subset). Shown below are some example subsets of A, B, C, D, E) and their array-representation. Note that #(1's in the array) equals the size of the subset. Subsets { A, B, E) (B) A 1 0 0 B 1 1 0 C D E 0 0 1 0 0 0 0 0 0 Array representation [1, 1, 0, 0, 1] [0, 1, 0, 0, 0] [0, 0, 0, 0, 0] What does the following code return when subsetOne and subsetTwo equal the arrays for subsets (A, B, E) and {B}? for (int i-0; i<subsetOne.length; i++) if (subsetOne [i] != subset Two [i]) return (false); return (true); How many times the comparison "subsetOne[i] != subsetTwo[i]" is done? State in English what the code returns, in general, for two input arrays subsetOne and subsetTwo (of 0's and I's and having the same length)? For subsetOne = [1, 1, 0, 0, 1], how many subsetTwo give the return value "true" and what is #(comparison "subse- tOne[i] != subsetTwo[i]") for each of those subsetTwo? For subsetOne = [1, 1, 0, 0, 1], how many subsetTwo give the return value "false" and how many of them have #(com- parison "subsetOne[i] != subsetTwo[i]")= k for each of k= 1, 2, 3, and 4? Give the codes to test each of the following: (a) subsetOne is a subset of subsetTwo, and (b) subsetOne and subset Two are disjoint.

Answer rating: 100% (QA)

Solution for the ab... View the full answer