The following algorithm seeks to compute the number of leaves in a binary tree. ALGORITHM LeafCounter(T )
//Computes recursively the number of leaves in a binary tree
//Input: A binary tree T
//Output: The number of leaves in T
ifT =∅return0
else return LeafCounter(Tleft)+ LeafCounter(Tright)
Is this algorithm correct? If it is, prove it; if it is not, make an appropriate correction.

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.

This technology is used to produce high-quality documents that look good on the computer screen and in print. wiki presentation paint desktop publishing

Awell-diversified portfolio needs about 20-25 stocks from different categories is this true or false?