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
kenny6666 [7]
3 years ago
9

Consider the unsigned decimal number 35. What is the value in hexadecimal? 3510 = _______ 16

Computers and Technology
1 answer:
Lena [83]3 years ago
4 0

Answer:

(35_{10}) = (23)_{16}

Explanation:

The Hexa-decimal numbers have base 16 and includes numbers:

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E and F

The given steps are performed to convert a decimal number to hexa-decimal number, here to convert decimal number 35 to hexa-decimal number:

  • Divide 35 by 16
  • Note the remainder, r which is 3 here and quotient which is 2
  • Again divide 2 (quotient) by 16 and note the remainder, r' which is 2 and quotient is 0
  • We will stop here as the quotient is now 0. Usually division by 16 is repeated until we get quotient = 0
  • Now arrange the remainder in reverse order to get the hexa-decimal number as r'r
  • The hexa-decimal number is (23)_{16}
You might be interested in
Your job is to choose a data structure to implement polynomials whose coefficients are positive integers, such as 17x^4+4x^3+0x^
tatuchka [14]

Answer:

3

Explanation:

8 0
2 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
1 year ago
________ is a utility program included with most operating systems that allows you to move or eliminate files and give your oper
Sholpan [36]

Disk Defragmenter

A disk defragmenter is a utility that reorganizes the files and unused space on a computer's hard disk so that the operating system accesses data more quickly and programs run faster.

6 0
2 years ago
Who was responsible for the development of the rocket motor?
kiruha [24]

Answer: Robert H. Goddard

Explanation: he developed and flew the first liquid-propellant rocket

6 0
3 years ago
Read 2 more answers
Consider the steps for debugging. First, you should
SCORPION-xisa [38]

Answer:

run the code to see where the error is

Explanation:

4 0
2 years ago
Other questions:
  • what properties are associated with all Microsoft Office files and include author, title, and subject
    5·1 answer
  • Look at the circuit shown in the figure above. Switch S1 is open as shown, and R1 and R2 each have a value of 100 k. If you conn
    11·1 answer
  • An iframe is an inline table for a website. True False i need an answer fast
    15·1 answer
  • Which of the following is true regarding the use of instance variable j in class B1?
    15·1 answer
  • Write an if-else statement for the following: If user_tickets is less than 5, assign 1 to num_tickets. Else, assign user_tickets
    6·1 answer
  • What is the family access code right now?
    5·1 answer
  • I made a mistake. I'm building my first PC and I bought a Ryzen 7 3800x and planning on getting a 2070 super (if I can). What I
    9·1 answer
  • When preparing a technical document, do all of the following EXCEPT:_______.
    12·1 answer
  • PLEASE HELP! WILL MARK AS BRAINLIEST!
    6·2 answers
  • ____ storage is not recommended for long-term archiving because the storage media can degrade over time
    15·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!