Disaccharide sugars, Basic Computer Science

Assignment Help:

Disaccharide Sugars:Disaccharide - Carbohydrate made up of two monosaccharides (a sugar dimer)

  • Condensation reaction between 2 monosaccharides
  • Linkage between

              o    C-1 on one monosaccharide
              o    C-4 or C-6 on the other monosaccharide

  • Link -> Glycosidic linkage
  • E.g. of disaccharides

             o    Maltose -> Glucose + Glucose (1-4 linkage)
             o    Sucrose ->Glucose + Fructose (1-2 linkage)
             o    Lactose ->Glucose + Galactose (1-4 linkage)

 

                                                                                          350_Disaccharide Sugars.png


Related Discussions:- Disaccharide sugars

Backup storage, Backup Storage: Back up (backing) storage, also termed...

Backup Storage: Back up (backing) storage, also termed external storage, is used to hold programs and data which are read into internal storage when required. The most common

What is a Process and process mangemen in operating system? , A process is ...

A process is a chronological program in execution. The constituents of a process are the following: • The object program to be executed ( described the program text in UNIX) • Th

Software development, requirement analysis and specification for online vot...

requirement analysis and specification for online voting

Introduction to FCB , There are two kinds of FCB, the normal, whose length...

There are two kinds of FCB, the normal, whose length is 37 bytes and the expanded one of 44 bytes. The FCB is created of data given by the programmer and by data which it takes dir

Sma* search - artificial intelligence, SMA* Search-Artificial intelligence ...

SMA* Search-Artificial intelligence IDA* search is good from a memory point of view. actually it may  be criticised for not using enough memory - utilizing  more memory may inc

Explain the concept of a transition graph, Question 1 Define the concept o...

Question 1 Define the concept of equivalence relation. Give atleast two examples of equivalence relation Question 2 Prove that a graph G is connected if and only if it has a

Computer generations, Computer Generations: From the early 1940's to t...

Computer Generations: From the early 1940's to the present, computer scientists have been able to identify clear-cut stages in the development of computer technology. With eac

Define jumps and loops , The unconditional jumps in a written program in a...

The unconditional jumps in a written program in assembler language are specified by the jmp instruction; a jump is to moves the flow of the execution of a program by sending the co

What is the definition of instructiion set?, For a processor to be able ...

For a processor to be able to process an instruction, it requires to be able to determine what the instruction is asking to be carried out. For this to take place, the CPU requires

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd