L29bits - Bit Manipulation when every bit counts Questions...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
Bit Manipulation when every bit counts
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Questions on Bit Manipulation ?
Background image of page 2
Why Bit Manipulation extremely efficient and compact way of data storage and processing a way of low-level interaction with peripheral devices: mice, disks, scanners, etc. memory and compute cycles are cheap, bit manipulating programs are cryptic. Do not use unless you have to
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Bit - elementary unit of information storage can store either 1 or 0 Electronic circuits are most robust and dependable if they have at most two stable states computer data is stored and processed as sequences of bits more complex data types are encoded in bit sequences How are signed/unsigned integers are represented? Floating point data? Characters? base for numeric representation can be decimal, octal or hexadecimal octal constant has leading 0 : 012 == 10 hexadecimal has leading 0x : 0x12 == 19 octal and hexadecimal simplify binary operations octal digit represents three binary digits
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/22/2010 for the course CS 23021 taught by Professor Staff during the Spring '08 term at Kent State.

Page1 / 6

L29bits - Bit Manipulation when every bit counts Questions...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online