HW8

1. Build Num List.

Write a function, build_num_list, that has no parameters; the function reads integersfrom standard input, one at a time, stopping when a 0 is read.

🔗

Each number read, except the final 0, is appended to a new list (initially empty) created by the function. The function should return the accumulated list.

🔗

Hint:Use a while loop.

🔗

For example:

🔗

Test	Input	Result
build_num_list() 🔗	55 20 20 0 🔗	[55, 20, 20] 🔗
build_num_list() 🔗	0 1 1 🔗	[] 🔗

🔗

2. Get Positive Input.

The function get_pos_input takes no parameters. Instead, it reads integers one at a time from standard input until a positive integer is read. Once a positive integer has been read, that integer is returned.

🔗

Add Python code to implement the get_pos_input function.

🔗

Hint: Use a while loop.

🔗

For example:

🔗

Test	Input	Result
get_pos_input() 🔗	-3 -352034 -42342 -42455222 17 25 3 -2 🔗	17 🔗
get_pos_input() 🔗	0 12 🔗	12 🔗

🔗

3. Sum Nonnegative Input.

The function sum_nonneg_input takes no parameters. Instead, it reads integersone at a time from standard input, maintaining a running sum of numbers entered, until a negative integer is read. Once a negative integer is read, the function returns the current sum. Note: the negative number is not included in the sum.

🔗

Write Python code to implement the sum_nonneg_input function.

🔗

Hint: Use a while loop.

🔗

For example:

🔗

Test	Input	Result
sum_nonneg_input() 🔗	3 35 42 -17 25 3 -2 🔗	80 🔗

🔗

4. Max Float Input.

The function max_float_input takes no parameters. Instead, it reads strings from standard input, one at a time, until the string "stop" is read.

If the string is not "stop", the string is converted to a floating point value (type float) and compared to the largest previous float value entered (if any).

🔗
Otherwise, the function stops and returns the largest floating point value that was entered so far.

🔗

🔗

Note: If the firststring entered is "stop", the function simply returns the Python object None.

🔗

Add Python code to implement the max_float_input function.

🔗

Hint: Use a while loop.

🔗

For example:

🔗

Test	Input	Result
max_float_input() 🔗	2938.3 294184.2 2982.003 3 -23482498.5 stop 🔗	294184.2 🔗
max_float_input() 🔗	stop 🔗	None 🔗

====
from unittest.gui import TestCaseGui
import StringIO
import sys

class myTests(TestCaseGui):

def test1(self):
    sys.stdin = StringIO.StringIO('2938.3\n294184.2\n2982.003\n3\n-23482498.5\nstop')
    res = max_float_input()
    self.assertEqual(res, 294184.2, "<pre>2938.3\n294184.2\n2982.003\n3\n-23482498.5\nstop</pre>")

def test2(self):
    sys.stdin = StringIO.StringIO('stop')
    res = max_float_input()
    self.assertEqual(res, None, "<pre>stop</pre>")

def test3(self):
    sys.stdin = StringIO.StringIO('52.0\n41.2\n73.7\n53.9\n-34.6\nstop')
    res = max_float_input()
    self.assertEqual(res, 73.7, "<pre>52.0\n41.2\n73.7\n53.9\n-34.6\nstop</pre>")

def test4(self):
    sys.stdin = StringIO.StringIO('152.0\n41.2\n73.7\n53.9\n-34.6\nstop')
    res = max_float_input()
    self.assertEqual(res, 152.0, "<pre>152.0\n41.2\n73.7\n53.9\n-34.6\nstop</pre>")

def test5(self):
    sys.stdin = StringIO.StringIO('10.0\n-6.0\n6.0\n19.1\nstop')
    res = max_float_input()
    self.assertEqual(res, 19.1, "<pre>10.0\n-6.0\n6.0\n19.1\nstop</pre>")

def test6(self):
    sys.stdin = StringIO.StringIO('-5.6\n-2.6\n-9.9\n-8.7\nstop')
    res = max_float_input()
    self.assertEqual(res, -2.6, "<pre>-5.6\n-2.6\n-9.9\n-8.7\nstop</pre>")

myTests().main()

🔗

5. Multiplication Quiz.

The function multiplication_quiz(a, b) takes two integer parameters, a and b. The function prompts the user (just once) to enter the product of a times b, and uses a loop to keep checking the input for the correct answer.

🔗

The function keeps a count of how many attempts were needed to get the right answer. When the correct answer is read, the function returns the count.

🔗

Write the code needed to implement this function.

🔗

Hint: Use a while loop.

🔗

Note: You should assume that every input can be converted to an integer.

🔗

For example:

🔗

Test	Input	Result
multiplication_quiz(12, 7) 🔗	17 9 84 83 99 🔗	Printout: What is 12 times 7? Returns: 3 🔗
multiplication_quiz(2, 3) 🔗	10 9 8 7 6 5 4 🔗	Printout: What is 2 times 3? Returns: 5 🔗

====
from unittest.gui import TestCaseGui
import StringIO
import sys

class myTests(TestCaseGui):

def test1(self):
    sys.stdin = StringIO.StringIO('17\n9\n84\n83\n99')
    sys.stdout = StringIO.StringIO()
    count = multiplication_quiz(12, 7)
    printout = sys.stdout.getvalue()
    sys.stdout = sys.__stdout__
    sys.stdin = sys.__stdin__
    self.assertEqual(printout, 'What is 12 times 7?\n', "multiplication_quiz(12, 7)")
    self.assertEqual(count, 3, "<pre>17\n9\n84\n83\n99</pre>")

def test2(self):
    sys.stdin = StringIO.StringIO('55\n44\n2')
    sys.stdout = StringIO.StringIO()
    count = multiplication_quiz(5, 11)
    printout = sys.stdout.getvalue()
    sys.stdout = sys.__stdout__
    sys.stdin = sys.__stdin__
    self.assertEqual(printout, 'What is 5 times 11?\n', "multiplication_quiz(5, 11)")
    self.assertEqual(count, 1, "<pre>55\n44\n2</pre>")

def test3(self):
    sys.stdin = StringIO.StringIO('10\n9\n8\n7\n6\n5\n4')
    sys.stdout = StringIO.StringIO()
    count = multiplication_quiz(2, 3)
    printout = sys.stdout.getvalue()
    sys.stdout = sys.__stdout__
    sys.stdin = sys.__stdin__
    self.assertEqual(printout, 'What is 2 times 3?\n', "multiplication_quiz(2, 3)")
    self.assertEqual(count, 5, "<pre>10\n9\n8\n7\n6\n5\n4</pre>")

def test4(self):
    sys.stdin = StringIO.StringIO('60\n65\n70\n75')
    sys.stdout = StringIO.StringIO()
    count = multiplication_quiz(13, 5)
    printout = sys.stdout.getvalue()
    sys.stdout = sys.__stdout__
    sys.stdin = sys.__stdin__
    self.assertEqual(printout, 'What is 13 times 5?\n', "multiplication_quiz(13, 5)")
    self.assertEqual(count, 2, "<pre>60\n65\n70\n75</pre>")

def test5(self):
    sys.stdin = StringIO.StringIO('33\n11\n12\n13\n44\n144\n155')
    sys.stdout = StringIO.StringIO()
    count = multiplication_quiz(12, 12)
    printout = sys.stdout.getvalue()
    sys.stdout = sys.__stdout__
    sys.stdin = sys.__stdin__
    self.assertEqual(printout, 'What is 12 times 12?\n', "multiplication_quiz(12, 12)")
    self.assertEqual(count, 6, "<pre>33\n11\n12\n13\n44\n144\n155</pre>")

myTests().main()

🔗

6. List Has Repeat (using set).

Write a definition for the function has_repeat(L). The parameter L is a list of immutable items. The function returns True if L has at least one repeated item, otherwise it returns False.

🔗

Hint: If the set of items in L has a shorter length than L itself, return True; otherwise, return False.

🔗

For example:

🔗

Test	Result
has_repeat(list('hello')) 🔗	True 🔗
has_repeat(list('Maybe')) 🔗	False 🔗

🔗

7. Number of Distinct Elements (using set).

Implement the function num_distinct_elements(C). The function takes the parameter C, a collection of type list, string, or tuple, and returns the number of distinct items in C. For example, if C is the list [1, 2, 3, 3, 2, 1, 2, 3, 3, 10], the return value would be 4 (since 1, 2, 3, 10 are the "distinct" elements).

🔗

HINT: The body of the function requires just one or two lines of code.

🔗

NOTE: Use set in your code.

🔗

For example:

🔗

Test	Result
C = [1, 2, 3, 2, 2, 2, 1, 1, 1, 1] num_distinct_elements(C) 🔗	3 🔗
C = "She sells sea shells by the sea shore." num_distinct_elements(C) 🔗	13 🔗
C = ('b', 'a', 'b', 'b', 'l', 'e') num_distinct_elements(C) 🔗	4 🔗

====
from unittest.gui import TestCaseGui
import StringIO
import sys

class myTests(TestCaseGui):

def test1(self):
    n = num_distinct_elements([1, 2, 3, 2, 2, 2, 1, 1, 1, 1])
    self.assertEqual(n, 3, "num_distinct_elements([1, 2, 3, 2, 2, 2, 1, 1, 1, 1])")

def test2(self):
    n = num_distinct_elements(She sells sea shells by the sea shore.)
    self.assertEqual(n, 13, "num_distinct_elements(She sells sea shells by the sea shore.)")

def test3(self):
    n = num_distinct_elements(('b', 'a', 'b', 'b', 'l', 'e'))
    self.assertEqual(n, 4, "num_distinct_elements(('b', 'a', 'b', 'b', 'l', 'e'))")

def test4(self):
    n = num_distinct_elements([2, 3, 5, 7, 11, 13, 15])
    self.assertEqual(n, 7, "num_distinct_elements([2, 3, 5, 7, 11, 13, 15])")

def test5(self):
    n = num_distinct_elements([])
    self.assertEqual(n, 0, "num_distinct_elements([])")

def test6(self):
    n = num_distinct_elements(aaaaaaaaaaaaaaaa)
    self.assertEqual(n, 1, "num_distinct_elements(aaaaaaaaaaaaaaaa)")

def test7(self):
    n = num_distinct_elements(['m', 'i', 's', 's', 'i', 's', 's', 'i', 's', 's', 'i', 'p', 'p', 'i', ' ', 'r', 'i', 'v', 'e', 'r'])
    self.assertEqual(n, 8, "num_distinct_elements(['m', 'i', 's', 's', 'i', 's', 's', 'i', 's', 's', 'i', 'p', 'p', 'i', ' ', 'r', 'i', 'v', 'e', 'r'])")

def test8(self):
    n = num_distinct_elements(Hanover College Panthers!)
    self.assertEqual(n, 16, "num_distinct_elements(Hanover College Panthers!)")

myTests().main()

🔗

8. Get Distinct From Nested.

Write a definition for the function get_distinct_from_nested(C), where the parameter C is a sequence of sequences (e.g., a list of strings or a list of lists of integers). The job of the function is to use set operations to find and return the sortedlist of unique elements in the nested collection C.

🔗

Hint: If S is a set, sorted(S) is a sorted list of the elements in S.

🔗

Another Hint: Use set union to accumulate the set S of distinct inner elements using a single for loop:

🔗

iterate seqover the top-level elements of C

🔗
use S = S.union(seq) to update S with additional items from seq

🔗

This only requires about 5 lines of code.

🔗

For example:

🔗

Test	Result
C = ['Java', 'Jumble', 'BlackJack'] get_distinct_from_nested(C) 🔗	['B', 'J', 'a', 'b', 'c', 'e', 'k', 'l', 'm', 'u', 'v'] 🔗
C = ['app', 'ban', 'can', 'def'] get_distinct_from_nested(C) 🔗	['a', 'b', 'c', 'd', 'e', 'f', 'n', 'p'] 🔗
C = ['!', '!!', '!!!', '!!!!', '!!!!!'] get_distinct_from_nested(C) 🔗	['!'] 🔗

Test

Result

C = ['Java', 'Jumble', 'BlackJack']
get_distinct_from_nested(C)

🔗

['B', 'J', 'a', 'b', 'c', 'e',
 'k', 'l', 'm', 'u', 'v']

🔗

C = ['app', 'ban', 'can', 'def']
get_distinct_from_nested(C)

🔗

['a', 'b', 'c', 'd', 'e',
 'f', 'n', 'p']

🔗

C = ['!', '!!', '!!!', '!!!!', '!!!!!']
get_distinct_from_nested(C)

🔗

['!']

🔗

====
from unittest.gui import TestCaseGui
import StringIO
import sys

class myTests(TestCaseGui):

def test1(self):
    res = get_distinct_from_nested(['Java', 'Jumble', 'BlackJack'])
    self.assertEqual(res, ['B', 'J', 'a', 'b', 'c', 'e', 'k', 'l', 'm', 'u', 'v'], "get_distinct_from_nested(['Java', 'Jumble', 'BlackJack'])")

def test2(self):
    res = get_distinct_from_nested(['app', 'ban', 'can', 'def'])
    self.assertEqual(res, ['a', 'b', 'c', 'd', 'e', 'f', 'n', 'p'], "get_distinct_from_nested(['app', 'ban', 'can', 'def'])")

def test3(self):
    res = get_distinct_from_nested(['!', '!!', '!!!', '!!!!', '!!!!!'])
    self.assertEqual(res, ['!'], "get_distinct_from_nested(['!', '!!', '!!!', '!!!!', '!!!!!'])")

def test4(self):
    res = get_distinct_from_nested([''])
    self.assertEqual(res, [], "get_distinct_from_nested([''])")

def test5(self):
    res = get_distinct_from_nested([['z', 'i', 'g'], ['z', 'a', 'g'], ['b', 'a', 'g', 'p', 'i', 'p', 'e', 's']])
    self.assertEqual(res, ['a', 'b', 'e', 'g', 'i', 'p', 's', 'z'], "get_distinct_from_nested([['z', 'i', 'g'], ['z', 'a', 'g'], ['b', 'a', 'g', 'p', 'i', 'p', 'e', 's']])")

def test6(self):
    res = get_distinct_from_nested(['apple', 'banana', 'candy', 'donut', 'eggs'])
    self.assertEqual(res, ['a', 'b', 'c', 'd', 'e', 'g', 'l', 'n', 'o', 'p', 's', 't', 'u', 'y'], "get_distinct_from_nested(['apple', 'banana', 'candy', 'donut', 'eggs'])")

myTests().main()

🔗

9. String Intersection.

Write the definition for a function string_intersection(str1, str2), which takes two string parameters and returns a sorted list of the characters the two strings have in common.

🔗

Hint: Use set intersection and the sorted() function.

🔗

For example:

🔗

Test	Result
string_intersection("cats", "caterpillar") 🔗	['a', 'c', 't'] 🔗
string_intersection("cats", "dogs") 🔗	['s'] 🔗
string_intersection("banana", "xylem") 🔗	[] 🔗

====
from unittest.gui import TestCaseGui
import StringIO
import sys

class myTests(TestCaseGui):

def test1(self):
    res = string_intersection('cats', 'caterpillar')
    self.assertEqual(res, ['a', 'c', 't'], "string_intersection('cats', 'caterpillar')")

def test2(self):
    res = string_intersection('cats', 'dogs')
    self.assertEqual(res, ['s'], "string_intersection('cats', 'dogs')")

def test3(self):
    res = string_intersection('banana', 'xylem')
    self.assertEqual(res, [], "string_intersection('banana', 'xylem')")

def test4(self):
    res = string_intersection('dog-eared', 'dog tails')
    self.assertEqual(res, ['a', 'd', 'g', 'o'], "string_intersection('dog-eared', 'dog tails')")

def test5(self):
    res = string_intersection('Venus', 'Mars')
    self.assertEqual(res, ['s'], "string_intersection('Venus', 'Mars')")

def test6(self):
    res = string_intersection('axbxcxd', 'xaxcxfx')
    self.assertEqual(res, ['a', 'c', 'x'], "string_intersection('axbxcxd', 'xaxcxfx')")

myTests().main()

🔗

10. Write a Program to Check for Anagrams.

Write the code to read two strings (str1, str2) from standard input and print a message regarding whether or not the strings are anagrams (rearrangements) of each other.

🔗

Hint: Compare sorted lists of characters for the two strings.

🔗

In addition, if the strings are NOT anagrams of each other, give one of the following explanations: "They do not have the same character sets.", or "They do not have the same character frequencies."

🔗

For example, "DOGS" and "GODS" are anagrams. "DOGS" and "HANOVER" do not have the same character sets, while "HANOVER" and "HANOOOVER" do not have the same character frequencies.

🔗

Use set operations to determine if two non-anagrams have the same character set; if they do share the same set of characters, then you may conclude that their character frequencies are the only difference.

🔗

Your code might be about 12 lines long.

🔗

For example:

🔗

Input	Result
pizzzzzza piizzaaaa 🔗	pizzzzzza and piizzaaaa are NOT anagrams. They do not have the same character frequencies. 🔗
pizza pasta 🔗	pizza and pasta are NOT anagrams. They do not have the same character sets. 🔗
maps spam 🔗	maps and spam are anagrams! 🔗

Input

Result

pizzzzzza
piizzaaaa

🔗

pizzzzzza and piizzaaaa are NOT anagrams.
They do not have the same character frequencies.

🔗

pizza
pasta

🔗

pizza and pasta are NOT anagrams.
They do not have the same character sets.

🔗

maps
spam

🔗

maps and spam are anagrams!

🔗

CS 220 Python Programming Exercises

Section 1.15 HW8

Exercises Exercises

1. Build Num List.

2. Get Positive Input.

3. Sum Nonnegative Input.

4. Max Float Input.

5. Multiplication Quiz.

6. List Has Repeat (using set).

7. Number of Distinct Elements (using set).

8. Get Distinct From Nested.

9. String Intersection.

10. Write a Program to Check for Anagrams.