COSI 155b Chapter Notes - Chapter 3: Power Set, Empty Set, Subset

113 views2 pages

cerisesnake319

5 Jun 2018

School

Department

Course

Professor

For unlimited access to Textbook Notes, a Class+ subscription is required.

Subsets and Power Sets

Subsets

If A is a subset of B, then every element in A must also be in B.

Note: If A⊆ �, then the subset A can be equal to B, unlike A⊂ � where A must be smaller than

The empty set is a subset of every set.

A power set of A, p(A), is the set containing all possible subsets of A.

Given set A = {a,b}, p(A) = {{}, {a}, {b}, {a,b}}.

Cardinality of Power Sets

If |A| = n, then |p(A)| = 2|A| = 2n .

• Given |A| = 5, |p(A)| = 2|A| = 25 = 32.

The Power Set of the Empty Set

p({}) = {{}}

p({{}}) = {{}, {{}}}

Relations between the Subset and the Power Set

A is not the subset of p(A) for any A.

A is an element of p(A) for any A.

Power Set of a Power Set

The elements of p(p({})): p({{}}) = {{},{{}}}.

Examples of Subsets

When A = {} and B = {{}}, the set A is an element of B and A is a subset of B.

Prove that A is a subset of C if A is a subset of B and B is a subset of C.

find more resources at oneclass.com

Unlock document

This preview shows half of the first page of the document.
Unlock all 2 pages and 3 million more documents.

Already have an account? Log in

Document Summary

If a is a subset of b, then every element in a must also be in b. Note: if a , then the subset a can be equal to b, unlike a where a must be smaller than. The empty set is a subset of every set. A power set of a, p(a), is the set containing all possible subsets of a. Given set a = {a,b}, p(a) = {{}, {a}, {b}, {a,b}}. If |a| = n, then |p(a)| = 2|a| = 2n : given |a| = 5, |p(a)| = 2|a| = 25 = 32. The power set of the empty set p({}) = {{}} p({{}}) = {{}, {{}}} Relations between the subset and the power set. A is not the subset of p(a) for any a. A is an element of p(a) for any a. When a = {} and b = {{}}, the set a is an element of b and a is a subset of b.

Related Questions

8. Write a class called WordSet representing a set of String objects which can contain an arbitrary number of strings, limited only by the memory available to the Java Virtual Machine. A set is a collection of elements, however, unlike a list, a set cannot contain duplicate elements. Therefore, as its name implies, a WordSet object cannot contain duplicate Strings that is, if one attempts to da String to a Wordset, and the wordset already contains an element which is equal to this string, the attempt will fail and the state of the Wordset will not change. All String comparisons performed in the methods defined in the Wordset class are done in a Case SENSITIVE manner. Note that in the method descriptions below, the phrase "this Wordset" means "the Wordset on which the method in question is called." Your Wordset class MUST provide the following INSTANCE methods • A constructor, which takes no parameters and initializes the new Wordset ohject so that it contains no elements • A method called add(), which takes as its only parameter a string and returns a value of type boolean. If this Wordset already contains a string which is equal to the parameter string, or the parameter String is null, then the state of this Wordset does not change and the method return false; otherwise, the parameter String is added to this Wordset. and the method returns true. • A method called remove().which takes as its only parameter a string and returns a value of type boolean. If this wordSet contains a string which is equal to the parameter String this string is removed from the WordSet and the method returns true. On the other hand, if the string parameter is null or this Wordset does not contain a string which is equal to the parameter string, then the state of this wordset does not change, and the method return false. • A method called get.size(), which takes no parameters and returns the number of strings currently stored in this Wordset. This method MUST NOT change the state of this Wordset. • A method called isMember(). which takes as its only parameter a string and retumsa value of type boolean which is true if this wordset contains the parameter String false otherwise. If the parameter String is null, this method also return false. This method MUST NOT change the state of this wordset. • A method called computebirrerence().which takes as its only parameter a Wordset and returns a new Wordset representing the difference between this wordset and the parameter Wordset: in other words, the WordSet returned by this method contains all the strings that are in this wordset, but not in the parameter Wordset. If the parameter Wordset contains all the elements of this WordSet or this WordSet contains no elements, then this method returns a new Wordset containing no elements. Finally, if the parameter Wordset is null or contains ne strings, then this method returns a new wordset which contains all the elements of this wordset. This method MUST NOT change the state of this wordset or the parameter Wordset. • A method called tostring , which takes the parameters and turns a string which is the textual representation of this wordset. This textual representation consists of the concatena tion of the following clements - The String - The text representation of each clement in the WordSet; cach pair of adjacent clements is separated by the String", but this String MUST NOT appear before the first clement or after the last element - The String") The order in which the elements of this Wordset appear in the textual representation generated by the tostring() method does not matter. If the WordSet contains to Brings, then the textual representation returned by this method is ". Note that you MUST respect proper encapsulation practices that is, the attributes and methods of your class MUST be declared using the proper visibility modifier NINT Um an array list (of string) to keep track of the string stored in a wordt ob joot Is there a method defined in the Array loist class which determines whether in clementis already wored in an array ist, and which will do a case-sensitive comparison when liked on an Arraylint of strings? See the pages 24-26 of this examination for information about potentially useful methods defined by the ArrayList class WRITE YOUR Wordset CLASS IN THE SPACE BELOW:

Given the following main program

#main
a = [5,2,9,6,3] doubleList(a) print a

Implement the function named doubleList that takes one list argument and modifies the list so that each element in the list is doubled. The statement print(a) in the main program will then have to print [10,4,18,12,6]
Given the following main program

#main
a = [5,2,9,6,3]
b = reversedList(a) print b
print a

Implement the function named reversedList that takes one list argument and returns a list that contains the elements in the list argument in reverse order. The statement print(b) in the main program will then have to print [3,6,9,2,5]. The statement print(a) must print the original list [5,2,9,6,3] unaffected. This means your function should not modify the list argument.
Given the following main program

#main
a = [5,2,9,6,3] reverseList(a) print a

Implement the function named reverseList that takes one list argument and reverses the list so that the modified list contains the same elements in reverse order. The statement print(a) in the main program will then have to print [3,6,9,2,5]
What is the return value of the functions doubleList, reversedList and reverseList in questions 1, 2, and 3 above?

Given the following main program

#main
a = [5,2,9,6,3]
b = evenElements(a) print b

Implement the function named evenElements that takes one list argument and returns a list that contains the elements in the list argument that are even integers. The statement print(b) in the main program will then have to print [2,6]. What is the return value of the function? Your function should not modify the list argument.
Given the following main program

#main
a = [5, 2, 9, 6, 3, 7, 19, 4, 8, 17, 21, 20, 15] removeOddElements(a)
print a

Implement the function named removeOddElements that takes one list argument and modifies the list so that all odd integers in the list are removed. The statement print(a) in the main program will then have to print [2,6,4,8,20]. What is the return value of the function?
Part A
#Main program A=[5,8,2,0,-5,3] n=-5
answer = isFound(A, n) if answer == True:

print "The integer is found in the list" else:

print "The integer is not found in the list."

Consider the main program shown above. Write a Python function named isFound that takes a list of integers and an integer as arguments and returns True if the integer is found in the list; otherwise it returns False.

Remark: You are NOT allowed to use the in operator or any other built in function when you write this function. Instead, you must write a loop to go through the elements of the list.

Part B

Give the following main program

#main
A = [5,2,9,6,3]
B = [2,4,3,9,7,1,6,5]
flag = isList1InList2(A, B) if flag:

print "The list", A, "is contained in the list", B else:

print "The list", A, "is not contained in the list", B

Implement the function named isList1InList2 that takes two list arguments and returns True if and only if each element of the first list argument are found in the second list argument; otherwise it returns False.

Remark: You are NOT allowed to use the in operator or any other built in function when you write this function. Instead, if you wish, you can use the function you wrote in Part A.

For the lists shown in the main program, your function must return True because each element of list A is found in list B.

A given List is known as Palindrome List if the reverse of the List contains the same elements in the same order of the original List. For example the List of integers [2, 5, 0, 3, 3, 0, 5, 2] is a Palindrome because the reverse of the List which is [2, 5, 0, 3, 3, 0, 5, 2] contains the same elements in the same order as the given List. However the List [1, 2, '2', 1] is not Palindrome because its reverse which is [1, '2', 2, 1] does not contain the same elements in the same order as the given List.

Write a Python function named isPalindrome that takes a List as argument and returns True if the argument is a Palindrome List; otherwise it returns False. You don't need to write the main program; just write the function. If you would like to test your function, then it is ok to write the main program too but you will not get any mark for the main program.
Given your function in question #7 above, what is the output of the following code: a=[]

b = [5,2,9,6,3]

print isList1InList2(a,b)
Given your function in question #7 above, what is the output of the following code:

a=[]
b=[]
print isList1InList2(a,b)
Given your function in question #7 above, what is the output of the following code: a = [5,2,9,6,3]

b=[]

print isList1InList2(a,b)

Given the following main program

#main
a=[]
n = readListElements(a)
print "The user entered", n, "elements to the list" print a

Implement the function named readListElements that takes one list argument and modifies the list by repeatedly asking the user to enter integer values and then appending them to the list. The process stops when the user enters -1000. The stopping value -1000 should not be appended to the list. Moreover your function must count the appended elements and return it. Example if the user enters the integers 31, -4, 9, 1,-1000 then your function must modify the list a to a = [31, -4, 9, 1] and return the number elements added which is 4.
Write a function named createRandomList that takes an integer argument n and returns a list with n elements. The elements must be random numbers in the range [0,100]

Given the following main program:

#main

   n = int(input("How many elements do you want in your list? "))
   a = createList(n)
   s1 = sumOfElementsAtEvenIndexes(a)
   print s1

   s2 = sumOfElementsAtOddIndexes(a)
   print s2
   s3 = sumOfAllElements1(a)
   print s3

   s4 = sumOfEvenElements(a)
   print s4
   s5 = sumOfOddElements(a)
   print s5

   s6 = sumOfAllElements2(a)
   print s6
   if (s3 != s6):

         print "Something is wrong in your program."
   else:

         print "Looks like you have done a good job."

Implement the functions as follows:

createList: returns a list object with n elements. The elements are generated randomly so that each element is in the range [15,45]
sumOfElementsAtEvenIndexes: returns the sum of the elements at even indexes. Use a for loop or a while loop.
sumOfElementsAtOddIndexes: returns the sum of the elements at odd indexes. Use a for loop or a while loop.
sumOfAllElements_A: returns the sum of all the elements in the list using the functionssumOfElementsAtEvenIndexes and sumOfElementsAtOddIndexes. Here you are NOT allowed to use any loop; instead make function calls as described.
sumOfEvenElements: returns the sum of the even integer elements in the list. Use a for loop or a while loop.
sumOfOddElements: returns the sum of the odd integer elements in the list. Use a for loop or a while loop.
sumOfAllElementsB: returns the sum of all the elements in the list using the functions sumOfEvenElements and sumOfOddElements. Here you are NOT allowed to use any loop; instead make function calls as described.

17. Most data compression algorithms like winzip, gzip, lzip and etc are based on the frequency distribution of characters in a given string. Write a function named getFreqDistribution that takes a string argument and returns a LIST that has length 26 such that the first element of the list is the number of appearance of 'a' or 'A' in the string, the second element is number of appearance of 'b' or 'B', and so on so forth.

I'm studying python 2 and have a lot of troubles with solving these homework questions.

grayelk171

1.Write a function encipher(s, n) that takes as inputs an arbitrary string s and a non-negative integer n between 0 and 25, and that returns a new string in which the letters in s have been "rotated" by n characters forward in the alphabet, wrapping around as needed. For example:

>>> encipher('hello', 1) result: 'ifmmp'

>>> encipher('hello', 2) result: 'jgnnq'

>>> encipher('hello', 4) result: 'lipps'

Upper-case letters should be "rotated" to upper-case letters, even if you need to wrap around. For example:

>>> encipher('XYZ', 3)

result: 'ABC'

Lower-case letters should be "rotated" to lower-case letters:

>>> encipher('xyz', 3)

result: 'abc'

Non-alphabetic characters should be left unchanged:

>>> encipher('#caesar!', 2)

result: '#ecguct!'

Hints/reminders:

You can use the built-in functions ord and chr convert from single-character strings to integers and back:

>>> ord('a')

result: 97

>>> chr(97)

result: 'a'

You can use the following test to determine if a character is between 'a' and 'z' in the alphabet:

if 'a' <= c <= 'z':

A similar test will work for upper-case letters.

We recommend writing a helper function rot(c, n) that rotates a single character c forward by n spots in the alphabet. We have given you a template for this helper function in ps3pr3.py that checks to ensure that c is a single-character string. We wrote rot13(c) in lecture; rot(c, n) will be very close to rot13(c)! You can test your rot(c, n) as follows:

>>> rot('a', 1)

result: 'b'

>>> rot('y', 2)

result: 'a'

>>> rot('A', 3)

result: 'D'

>>> rot('Y', 3)

result: 'B'

>>> rot('!', 4)

result: '!'

Once you have rot(c, n), you can write a recursive encipher function.

Once you think you have everything working, here are three more examples to try:

>>> encipher('xyza', 1)

result: 'yzab'

>>> encipher('Z A', 2)

result: 'B C'

>>> encipher('Caesar cipher? I prefer Caesar salad.', 25)

result: 'Bzdrzq bhogdq? H oqdedq Bzdrzq rzkzc.'

2.Write a function decipher(s) that takes as input an arbitrary string s that has already been enciphered by having its characters "rotated" by some amount (possibly 0). decipher should return, to the best of its ability, the original English string, which will be some rotation (possibly 0) of the input string s. For example:

>>> decipher('Bzdrzq bhogdq? H oqdedq Bzdrzq rzkzc.')

result: 'Caesar cipher? I prefer Caesar salad.'

Here are two more examples:

>>> decipher('Hu lkbjhapvu pz doha ylthpuz hmaly dl mvynla lclyfaopun dl ohcl slhyulk.')

result: 'An education is what remains after we forget everything we have learned.'

>>> decipher('python')

result: 'eniwdc'

------------------------------------

def rot(c, n):
""" your docstring goes here """
# check to ensure that c is a single character
assert(type(c) == str and len(c) == 1)

def letter_prob(c):
""" if c is the space character (' ') or an alphabetic character,
returns c's monogram probability (for English);
returns 1.0 for any other character.
adapted from:

"""
# check to ensure that c is a single character
assert(type(c) == str and len(c) == 1)

if c == ' ': return 0.1904
if c == 'e' or c == 'E': return 0.1017
if c == 't' or c == 'T': return 0.0737
if c == 'a' or c == 'A': return 0.0661
if c == 'o' or c == 'O': return 0.0610
if c == 'i' or c == 'I': return 0.0562
if c == 'n' or c == 'N': return 0.0557
if c == 'h' or c == 'H': return 0.0542
if c == 's' or c == 'S': return 0.0508
if c == 'r' or c == 'R': return 0.0458
if c == 'd' or c == 'D': return 0.0369
if c == 'l' or c == 'L': return 0.0325
if c == 'u' or c == 'U': return 0.0228
if c == 'm' or c == 'M': return 0.0205
if c == 'c' or c == 'C': return 0.0192
if c == 'w' or c == 'W': return 0.0190
if c == 'f' or c == 'F': return 0.0175
if c == 'y' or c == 'Y': return 0.0165
if c == 'g' or c == 'G': return 0.0161
if c == 'p' or c == 'P': return 0.0131
if c == 'b' or c == 'B': return 0.0115
if c == 'v' or c == 'V': return 0.0088
if c == 'k' or c == 'K': return 0.0066
if c == 'x' or c == 'X': return 0.0014
if c == 'j' or c == 'J': return 0.0008
if c == 'q' or c == 'Q': return 0.0008
if c == 'z' or c == 'Z': return 0.0005
return 1.0

olivemink636

COSI 155b Chapter Notes - Chapter 3: Power Set, Empty Set, Subset

Document Summary

Get access

Related Documents

COSI 155b Chapter Notes - Chapter 2: Well-Ordering Principle

COSI 155b Chapter Notes - Chapter 4: Symmetric Difference

COSI 155b Chapter Notes - Chapter 1: Empty Set, Cardinality

Related Questions