Counting Internet Addresses.ppt

Counting Internet Addresses In IPv4 (Version 4 of the Internet Protocol) an address is a string of 32 bits: network number (netid) + host number (hostid). Three forms of addresses: Class A: 0 + 7-bit netid + 24-bit hostid (largest network). Class B: 10 +14-bit netid + 16-bit hostid (medium-sized network). Class C: 110 +21-bit netid + 8-bit hostid (small network). 1111111 is not available as netid of a class A network. No hostids with all 0s or all 1s. How many different IPv4 addresses are available? Problem How many positive integers between 100 and 999 inclusive are divisible by 7? are odd? have the same three decimal digits? are not divisible by 4? are divisible by 3 or 4 are not divisible by either 3 or 4 are divisible by 3 but not by 4? are divisible by 3 and 4? Problem How many functions are there from the set { 1, 2, . . ., n }, where n is a positive integer to the set { 0, 1 } -- that are one-to-one? that assign 0 to both 1 and n? that assign 1 to exactly one of the positive integers less than n? Problem A Palindrome is a string whose reversal is identical to itself (e.g., madam, tenet) How many bit strings of length n are palindromes? Example (Application of pigeonhole principle) Announcement 5.3 Permutations and Combinations 5.3 Permutations and Combinations 5.3 Permutations and Combinations 5.3 Permutations and Combinations 5.3 Permutations and Combinations 5.3 Permutations and Combinations 5.3 Permutations and Combinations Theorem: P(n, r) = n *(n-1)*(n-2) …. (n-r+1). Corollary 1: P(n, r) = n! / (n-r)!. Problem: How many ways are there to select a first-prize winner, a second-prize winner and a third-prize winner from 100 different people who have entered a contest? Problem: How many permutations of the letters ABCDEFGH contain the string ABC? r-combination (of a set of n distinct elements) is an unordered selection of r elements from the set. (The number of all r-combinations is denoted as C(n, r).) The set (of 6 elements) 3 different 3-pe