Convert the following values into binary numbers for each word
and place the binary values in
the two-dimensional array in their proper order of words.
Value
Binary Number Equivalent
Word 0
462,91210
Word 1
1142008
Word 2
5420h
Word 3
20,992d
Word 4
1104208
Word 5
6102008
Word 6
9F88h
Word 7
20,49610
Word 8
502416
Word 9
1101018
Word 10
71082h
Let g(x) be a function so that the following covariance and
expectations are finite numbers. Show that
cov [g(U), g(1 − U)] = (1/2) E {[g(U1) − g(U2)][g(1 − U1) − g(1
− U2)]} ,
where U ∼ U(0, 1), U1 and U2 are iid U(0, 1). Note you need the
fact about the independences of U1 & 1 − U2 as well as 1 − U1
& U2 to show the above identity.
1) Covert the following binary values to decimal. Do this
interpreting the binary as unsigned and signed.
a. 0111 1001
b. 1000 0000
c. 1111 1111
PLEASE EXPLAIN IT IN DETAIL
Suppose I have a list of 128 unsorted numbers. If I use the
binary search to search it, how many comparisons will I have to do
in the worst case, assuming I use a quadratic algorithm to sort the
list first.
Convert the following unsigned numbers
to the requested form:
01100001 binary to: hex, and also decimal
Hex:
Decimal:
b) 136 decimal to: hex, and also binary
Hex:
Binary:
) Subtract the following numbers in binary:
(i) 2576310 – 245410 (ii) 983210 – 243210 (iii) 450610 – 200410
(iv)
900610 – 459810 (AN 4marks)
(ii)Express the following hexadecimal numbers to their
equivalent
binary and octal numbers. (i) 3AC45B.20B (ii) 6754A.2FE (iii)
4596BC.31DF (iv) 2369.2AB7 ( AN 4marks)
(c) What is the range of unsigned and signed decimal numbers as
well
as binary numbers that can be represented in a 10 bit system
Make the following assumptions: Assume a binary search tree
holds integer numbers Write a pseudocode for a binary tree search
algorithm that searches in the tree (starting at root) for a node
which meets the following requirements, and prints a message when
found:
(a) has a value that is one third as large as either its left or
right child node. Think carefully about what steps are needed to do
the search, and review the insert and search methods for...