assume that you want to sort an array have 100000 elements which algorithm (insert sort algorithm or quick sort algorithm) is th
1 answer:
You might be interested in
Answer:
Binary representations of following are:
A) 35 = 100011
B) 3 = 11
C) 27 = 11011
D) 16 = 10000
Explanation:
The method to generate the binary number from a decimal is :
Keep on dividing the number by 2 and keep on tracking the remainder
And the quotient is again divided and remainder is tracked so that the number is completely divided.
And then write the binary digits from bottom to top.
Please have a look at the method in below examples:
A) 35
Writing the remainder from bottom to top.
So, binary number is 100011
B) 3
Writing the remainder from bottom to top.
So, binary equivalent is 11.
C) 27
Writing the remainder from bottom to top.
So, binary equivalent is 11011.
D) 16
Writing the remainder from bottom to top.
So, binary equivalent is 10000.
Answers are:
Binary representations of following are:
A) 35 = <em>100011</em>
B) 3 = <em>11</em>
C) 27 = <em>11011</em>
D) 16 = <em>10000</em>