00:01
Hello students, today we will discuss about this question.
00:04
In this question we are given that we need to find which subset of, so here we need to find subset that is equal to question mark, that of x7, x6 up to x1, x0 is 1, x0 is 1 15th on the list of subsets of s when the base two arithmetic generating scheme that is used.
00:47
So here we can see that in this question, that is here, x4, x1, x0, we can write these as 1 -011.
01:02
So for these base two algorithm, for generating the subset of, that is x -n minus 1 comma, up to x2, x1 x0 that can be given by.
01:17
So here find the smallest integer j that is between n minus 1 to 0 such that a j is equal to 0 where the entire subset that is where the entire subset that is a n minus 1 comma up to a 2 a 1 a 0 so replace a j that is equals to here we need to to replace aj is equal to 1 and replace each of replace each of aj minus 1 up to a2, a1, a0 with 0.
02:07
So for 1 -011 .j that is equal to 2...