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
Vinvika [58]
3 years ago
7

What sugar is used in a DNA molecule​

Computers and Technology
2 answers:
Sliva [168]3 years ago
5 0

Answer:

Ribose and Deoxyribose. The 5-carbon sugars ribose and deoxyribose are important components of nucleotides, and are found in RNA and DNA, respectively. The sugars found in nucleic acids are pentose sugars; a pentose sugar has five carbon atoms. A combination of a base and a sugar is called a nucleoside.

Explanation:

mario62 [17]3 years ago
3 0

Answer:

Deoxyribose and ribose

Explanation:

The backbone of DNA is based on a repeated pattern of a sugar group and a phosphate group. The full name of DNA, deoxyribonucleic acid, gives you the name of the sugar present - deoxyribose. Deoxyribose is a modified form of another sugar called ribose.

You might be interested in
What can be designed to create annoying glitches or destroy data
Katen [24]

I guess the best answer is Virus.

Virus is a malicious computer program that is designed to create annoying glitches or destroy data.

3 0
3 years ago
Read 2 more answers
. Each ____ on a menu performs a specific action.
Fofino [41]
The answer would be d, none kf the above.
4 0
3 years ago
Which example best demonstrates an impact of computers on the economy?
Lana71 [14]

Answer:

a

Explanation:

7 0
3 years ago
Handhed computer is otherwise called as<br> 1.laptop<br> 2.Notebook<br> 3.Palmtop
NikAS [45]

Answer:

personal digital assistants (PDAs)palmtop

3 0
3 years ago
Suppose that we have a set of activities to schedule among a large number of lecture halls, where any activity can take place in
laiz [17]

Answer:

By Using the Greedy- Activity- Selection algorithm

Explanation:

The Greedy- Activity- Selection algorithm in this case involves

First finding a maximum size set S1, of compatible activities from S for the first lecture hall.

Then using it again to find a maximum size set S2 of compatible activities from S - S1 for the second hall.

This is repeated till all the activities are assigned.

It requires θ(n2) time in its worse .

8 0
3 years ago
Other questions:
  • Camera shock might happen if you do which of the following to your camera?
    6·2 answers
  • What is the top folder of the file tree called
    5·2 answers
  • The architecture that the large paper company Mohawk adopted enables the company to scale technology services up and down instan
    14·1 answer
  • Given the scenario, before leaving the office, you ask the CIO to provide which formal document authorizing you to perform certa
    11·1 answer
  • The Windows taskbar is generally found _____. at the top of the screen in the Start menu at the bottom of the screen at the righ
    14·2 answers
  • Who invented the speaker?
    14·2 answers
  • Some websites are dedicated to cataloguing information. Since these sites contain so much data, these sites are usually organize
    11·2 answers
  • Explain mechanical computer ,electromechanical and electronic computer with example<br>​
    11·1 answer
  • Help
    7·1 answer
  • assume there are K sorted lists, each of n/k elements. We want to merge them into a single sorted list of n elements. Give an op
    7·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!