Abit is a 0 or a 1. a bit string is a sequence of digits, all of which are either 0 or 1. for example, there are 8 possible bit strings of length 3 -- they are 000, 001, 010, 011, 100, 101, 110, and 111. for the problem below, consider a bit string of length 7 -- that is, a sequence of 7 digits, all of which are either 0 and 1

For a string length of 1 there are 2 possible strings (2^1)
for a string length of 2 there are 4 possible strings (2^2)
for a string length of 3 there are 8 possible strings (2^3)
So, for string length of 7 there are 128 possible strings (2^7)

No because if you do the higher number minus the lower number you will get a positive. if you do it the other way around you will get a negative number

The academic affairs council is the highest expert body processing academic affairs, as stipulated by the university statutes. specialist aaro häkkinen (educational policy) took part in the council’s meeting. the agenda of the meeting included bachelors’ feedback, the timing of pedagogical studies, the grant system for tuition fees, the standardisation of administrative practices for internships and the situation of foreign-language and multilingual master’s programmes.