This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: The number of ways that a complex event can occur is found by MULTIPLYING the number of ways that each of its simple component events can occur. Example: How many different outcomes are possible if you choose a single card from a standard deck, roll a standard die, and flip a coin? Answer: 52 x 6 x 2 = 624 Fundamental Counting Theorem (FCT) A bit is a Bi nary Digi t (a 0 or a 1) Eight bits makes (what is called) a BYTE How many different sequences of zeroes and ones can there be with 8 bits (1 byte)? 2 x 2 x 2 x 2 x 2 x 2 x 2 x 2 = 256 (by FCT) Basic Definitions American Standard Code for Information Interchange  7 bit representation Extended ASCII 8 bit representation Each bit can be a zero or a one If seven bits, each bit two choices, implies 2 to the 7th power = 128 different representations...
View
Full
Document
This note was uploaded on 12/19/2011 for the course CSCI 101 taught by Professor Dr.ambrose during the Spring '11 term at Community College of Baltimore County.
 Spring '11
 Dr.Ambrose
 Computer Science

Click to edit the document details