1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Sladkaya [172]
4 years ago
7

Algorithm for converting decimal into binary.

Computers and Technology
1 answer:
belka [17]4 years ago
7 0
The simplest way is to make for loop first you need to<span> generate 1,2,4,8,16,32,64,128,256....and others number in Array. Then you will check every number. Like this.</span>
<span>Decimal </span>Input 84;
64 is closest to 84.
84-64=20
<span>Write: </span>1
20-32=-12(Because It's negative you will write 0)
Write:10
20-16=4
<span>Write: </span>101
4-8=-4 (Negative)
Write:1010
4-4=0
<span>Write: </span>10101
0-2=-2
0-1=-1
<span>Write: </span><span>1010100 = 84</span>
You might be interested in
ASSIGNMENT FORM 2 1. Evaluate the following without using mathematical tables 0.36 x 6(142 +58) 21.44 - 10.64​
liq [111]
9251.44 or 231286/25 or 9251(11/25)

0.36*6*200*21.44-10.64
becomes
9262.08-10.64
gives you the result
8 0
2 years ago
A(n ________ is a program that is used to create, process, and administer a collection of self-describing integrated records.
babymother [125]
V
JJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJ
3 0
3 years ago
SI TENGO: ¿R = 255, G0 =, B = 0, QUE COLOR OBTENGO?
Ymorist [56]

Answer:

Rojo

Explanation:

No, valores de otros colores 255 para rojo. Esto conducirá al color rojo.

5 0
3 years ago
Choose 2 statements that correctly describe the time complexity of data structures with N data.
Softa [21]

The  statements that correctly describe the time complexity of data structures with N data are:

  • The average time complexity of the data lookup in a hash table is O(N).
  • The average time complexity of inserting data into a heap is O(logN)

<h3>What is time complexity of data structures?</h3>

Time Complexity of an algorithm is known to be the depiction of the amount of time needed by the algorithm to carry out to completion.

Note that The  statements that correctly describe the time complexity of data structures with N data are:

  • The average time complexity of the data lookup in a hash table is O(N).
  • The average time complexity of inserting data into a heap is O(logN)

Learn more about data from

brainly.com/question/17350816

#SPJ1

6 0
2 years ago
What feature did the 32X add to the Sega Genesis?
il63 [147K]

Answer:

ngl why would i know this

Explanation:

5 0
3 years ago
Other questions:
  • Trisha is looking for a new table style. What is the fastest way for her to preview how different styles in the gallery would lo
    13·1 answer
  • Maria is developing an online gaming website. She is working on an interactive game that has a central character guiding the vis
    14·2 answers
  • What is a strictly layered pattern, provide an example of its usage.
    13·1 answer
  • Assuming that each of the resistors in the circuit shown in the figure above has a resistance value of 100 k ohms, what will be
    11·2 answers
  • What is a computer network?
    5·1 answer
  • One software license model allows software to be freely distributed, downloaded, and installed without paying a license fee but
    15·1 answer
  • Ohanians “great big secret” is that:
    8·1 answer
  • Difference between a port and a connector
    10·1 answer
  • Which statement best describes what happens when a computer starts?
    9·1 answer
  • ________ is interpreted. Group of answer choices A. Python B. C C. C D. Ada E. Pascal
    13·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!