1 / 25

Computer SCIENCE

Data Representation and Machine Concepts. Computer SCIENCE. Section 1.1. Instructor: Lin Chen. August 2013. 1 Data Storage. 1.1 Bits and Their Storage. Boolean Operations Gates and Flip-Flops Binary Notation (1.5) Hexadecimal Notation Convert Binary Notation to Decimal Notation (1.5)

lucius
Télécharger la présentation

Computer SCIENCE

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Data Representation and Machine Concepts Computer SCIENCE Section 1.1 Instructor: Lin Chen August 2013

  2. 1 Data Storage 1.1 Bits and Their Storage Boolean Operations Gates and Flip-Flops Binary Notation (1.5) Hexadecimal Notation Convert Binary Notation to Decimal Notation (1.5) Convert Decimal Notation to Binary Notation (1.5) Convert Binary Notation to Hexadecimal Notation Convert Hexadecimal Notation to Binary Notation

  3. 1.1 Bits and Their Storage Boolean Operations Bit is the basic unit of information in computing have one of two values can be 0 or 1 used to represent numeric value, characters, images, sound, … Physical Representation 1. Two positions of an electrical switch 2. Two distinct voltage or current levels 3. Two distinct levels of light intensity 4. Two stable states of a flip-flop …

  4. 1.1 Bits and Their Storage Boolean Operations Bit and Byte Bit takes 0 or 1 value Byte is a unit of digital information, usually consists of 8bits (1.2) Byte Example: 0000 0000 1001 0101

  5. 1.1 Bits and Their Storage Boolean Operations Question: Check your flash disk, tell us what is the brand and the size, make sure it is larger than 2 GB

  6. = 1.1 Bits and Their Storage Boolean Operations Boolean a data type with only two possible values: true or false, 1 or 0 P Q P Q AND = P and Q are statements P: You are a new student at TCC Q: You are female P and Q: You are a new female student at TCC Question: Show us your (P and Q)

  7. = 1.1 Bits and Their Storage Boolean Operations Boolean a data type with only two possible values: true or false, 1 or 0 P Q P Q OR = P and Q are statements P: You are a new student at TCC Q: You are female P or Q: You are a new student at TCC or you are female Question: Show us your (P or Q)

  8. = 1.1 Bits and Their Storage Boolean Operations Boolean a data type with only two possible values: true or false, 1 or 0 P Q P Q XOR = P and Q are statements P: You are a new student at TCC Q: You are female Question: Show us your (P xor Q)

  9. = 1.1 Bits and Their Storage Boolean Operations Boolean a data type with only two possible values: true or false, 1 or 0 P P NOT = P is a statement P: You are a new student at TCC Question: Show us your (not P)

  10. = 1.1 Bits and Their Storage Gates and Flip-Flops Gate A device that produces the output of a Boolean operation with the input values XOR OR AND NOT Input Output

  11. = 1.1 Bits and Their Storage Gates and Flip-Flops Flip-Flops A circuit that produces an output value of 0 or 1 A temporary pulse from another circuit causes the value shift to the other value Output depends not only on the current inputs, but also on previous inputs and outputs A simple flip-flop circuit

  12. = 1.1 Bits and Their Storage Gates and Flip-Flops Flip-Flops Both inputs are remain 0 Not change output Two different stable states if both inputs are 0

  13. = 1.1 Bits and Their Storage Gates and Flip-Flops Change 1: Change upper input to 1 output will be 1

  14. = 1.1 Bits and Their Storage Gates and Flip-Flops Change 2: Change upper input back to 0 output will remain 1

  15. = 1.1 Bits and Their Storage Binary Notation Binary number Base-2 number Each bit takes either 1 or 0 Used internally by almost all modern computers Implemented in digital electronic circuitry using logic gates

  16. = 1.1 Bits and Their Storage Hexadecimal Notation Hexadecimal number Base-16 number Each bit takes 1,2,3,4,5,6,7,8,9,A,B,C,D,E,F Simply the binary notation

  17. = 1.1 Bits and Their Storage Binary Notation to Decimal Notation Decimal number 375 = 3 * 100 + 7 * 10 + 5 = 3 * 102 + 7 * 101 + 5 * 100 2 1 0 Index 375 = 3 * 102 + 7 * 101 + 5 * 100 Value 375 Base 10

  18. = 1.1 Bits and Their Storage Binary Notation to Decimal Notation Binary number to decimal number 10012 = 1 * 23 + 0 * 22 + 0 * 21 + 1 * 20 = 910 3 2 1 0 Index 10012 = 1 * 23 + 0 * 22+ 0 * 21+ 1* 20 = 910 Value 1 0 0 1 Base 2 Question: Convert 101101010011 to decimal number

  19. = 1.1 Bits and Their Storage Decimal Notation to Binary Notation Binary number to decimal number

  20. = 1.1 Bits and Their Storage Decimal Notation to Binary Notation Binary number to decimal number

  21. = 1.1 Bits and Their Storage Decimal Notation to Binary Notation Binary number to decimal number

  22. = 1.1 Bits and Their Storage Decimal Notation to Binary Notation Binary number to decimal number Read the binary number from bottom to up 910 = 10012 Question: Convert 173 to binary number Check Solution: http://www.mathsisfun.com/binary-decimal-hexadecimal-converter.html

  23. = 1.1 Bits and Their Storage Binary Notation to Hexadecimal Notation 1000101010111 1000101010111 0001000101010111 1 1 5 7 Question: Convert 10101010101 to hexadecimal number

  24. = 1.1 Bits and Their Storage Hexadecimal Notation to Binary Notation 1 1 5 7 0001000101010111 Question: Convert 555 to binary number

  25. = References J. Glenn Brookshear, Computer Science: Data Representation And Machine Concepts, 2008, Pearson Custom. 2. http://www.mathsisfun.com/binary-decimal-hexadecimal-converter.html

More Related