Define buffer capacity. A) Buffer capacity is B) Buffer capacity is C) Buffer capacity is D) Buffer capacity is its effectiveness. E) Buffer capacity is the amount of acid that can be added until all of the acid is used up. the amount of acid that can be added until all of the base is used up. the amount of base that can be added until all of the base is used up. the amount of acid or base that can be added to a buffer without destroying 19) 20) the amount of base that can be added until all of the acid is used up.

A(n) is a small bit of text separated from the rest of the paragraph at the top of a column or page.

Write c function that can replace all the positive elements to 0 and negative to 1 in undefined length one-dimensional array. test your program in the main program by defining one-dimensional array of 6 elements

3. (6 pts) internally in the computer, with few exceptions, all numerical computation is done using binary numbers. output, however, often uses ascii, which is formed by appending 011 to the left of a bcd code. thus, an algorithm that directly converts a binary integer to a bcd integer is very useful. here is one such algorithm 1) draw lines to the left of the binary number to bound the expected bcd decades. (each decade is a group of 4 bits.) move the binary number one bit to the left. add 0011 to each bcd decade containing a binary value> 0100 repeat steps 2-3 until the last bit in the binary number has been moved into the least significant decade position. (note that when the last bit has been shifted into bcd decade, step 3 is not repeated.) read the bcd result. 2) 3) 4) 5) a) execute the algorithm for the binary number 1101101 b) execute the algorithm for the binary number 01110101110 4. (4 pts) represent the decimal number 3568 in bcd; excess-3 code; ascil; and hex.