Data Representation

-

Number Systems

  • Human beings use decimal (base 10) number systems for counting and measurements.
  • Computers use binary (base 2) number system, as they are made from binary digital components (known as transistors) operating in two states - on and off.
  • In computing, we also use hexadecimal (base 16) or octal (base 8) number systems, as a compact form for represent binary numbers.

Decimal (Base 10) Number System

  • Decimal number system has ten symbols: 0, 1, 2, 3, 4, 5, 6, 7, 8, and 9, called digits.
  • It uses positional notation. That is, the least-significant digit (right-most digit) is of the order of 10^0 (units or ones), the second right-most digit is of the order of 10^1 (tens), the third right-most digit is of the order of 10^2 (hundreds), and so on. 
  • For example,
                               735 = 7×10^2 + 3×10^1 + 5×10^0

Binary (Base 2) Number System

  • Binary number system has two symbols: 0 and 1, called bits. 
  • It is also a positional notation.
  • for example, 10110B = 1×2^4 + 0×2^3 + 1×2^2 + 1×2^1 + 0×2^0

Hexadecimal (Base 16) Number System

  • Hexadecimal number system uses 16 symbols: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, and F, called hex digits. It is a positional notation. 
  • For example, A3EH = 10×16^2 + 3×16^1 + 14×16^0

Conversion from Hexadecimal to Binary

  • Replace each hex digit by the 4 equivalent bits, for examples,
          A3C5H = 1010 0011 1100 0101B 
          102AH = 0001 0000 0010 1010B

Conversion from Binary to Hexadecimal

  • Starting from the right-most bit (least-significant bit), replace each group of 4 bits by the equivalent hex digit (pad the left-most bits with zero if necessary), for examples,
          1001001010B = 0010 0100 1010B = 24AH 
          10001011001011B = 0010 0010 1100 1011B = 22CBH

Conversion from Base r to Decimal (Base 10)

  • Given a n-digit base r number: dn-1 dn-2 dn-3 ... d3 d2 d1 d0 (base r), the decimal equivalent is given by: 
                        dn-1 × r^(n-1) + dn-2 × r^(n-2) + ... + d1 × r^1 + d0 × r^0

Conversion from Decimal (Base 10) to Base r

  • Use repeated division/remainder. 
  • For example,
    • To convert 261D to hexadecimal: 
    • 261/16 quotient=16 remainder=5 
    • 16/16 quotient=1 remainder=0 
    • 1/16 quotient=0 remainder=1 
    • (quotient=0 stop) Hence, 261D = 105H

Comments

Post a Comment

Popular posts from this blog

Pentium microprocessors

-
Image
A 32-bit microprocessor introduced by Intel in 1993. It contains 3.3 million transistors. Since 1993, Intel has developed the Pentium III and more recently the Pentium 4 microprocessors.   Pentium III Pentium III Mainboard Layout Intel builds on the technology it developed with the Pentium II microprocessors.  The Pentium III processor comes with a Synchronized Dynamic Random Access Memory (SDRAM), allowing for an extremely fast transfer of data between the microprocessor and the memory. 70 new instructions, called Streaming SIMD Extensions, enhance multimedia and 3D performance.  Launched February 1999 - Available in speed levels of 450, 500, 550, and 600MHz. 32KB of Level 1 Cache (operating at CPU's full core speed). 512KB of Level 2 Cache (operating at ½ of CPU's core speed). 100 MHz bus speed. The branch prediction/recovery pipeline was doubled to include 10-stages from the P-II.   Pentium IV The next generation of microprocessors from Intel. Pe
Read more

Multilevel Organization of Cache Memory

-
Image
A multilevel cache hierarchy consists of n levels of caches. C1, C2, .......,Ci,....... Cn. A processor reference is serviced by the cache closest to the processor that contains the data.  At the same time that cache provides information to the caches on the path between itself and the processor. Multilevel cache hierarchy for multi- processors neither a local LRU nor a global LRU. Where all references to a Ci cache are percolated to its parent for rear-ranging the LRU stack at the Ci+i level. Multilevel caches Another issue is the fundamental tradeoff between cache latency and hit rate.  Larger caches have better hit rates but longer latency. To address this tradeoff, many computers use multiple levels of cache, with small fast caches backed up by larger, slower caches. Multi-level caches generally operate by checking the smallest level 1 (L1) cache first. If it hits, the processor proceeds at high speed.  If the smaller cache misses, the next larger cache (L2) is c
Read more