This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# rainfall_mi is a string that contains the average number of inches of rainfall in Michigan for every month (in inches) with every month separated by a comma. | |
# Write code to compute the number of months that have more than 3 inches of rainfall. | |
# Store the result in the variable num_rainy_months. In other words, count the number of items with values > 3.0. | |
# Hard-coded answers will receive no credit. | |
rainfall_mi = "1.65, 1.46, 2.05, 3.03, 3.35, 3.46, 2.83, 3.23, 3.5, 2.52, 2.8, 1.85" | |
rainfall_mi_split = rainfall_mi.split(",") | |
num_rainy_months = 0 | |
for x in rainfall_mi_split: | |
x = float(x) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# The variable sentence stores a string. | |
# Write code to determine how many words in sentence start and end with the same letter, including one-letter words. | |
# Store the result in the variable same_letter_count. | |
sentence = "students flock to the arb for a variety of outdoor activities such as jogging and picnicking" | |
# Write your code here. | |
same_letter_count = sum(w[0] == w[-1] for w in sentence.split()) | |
print(same_letter_count) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Write code to count the number of strings in list items that have the character w in it. | |
# Assign that number to the variable acc_num. | |
# HINT 1: Use the accumulation pattern! | |
# HINT 2: the in operator checks whether a substring is present in a string. | |
# Hard-coded answers will receive no credit. | |
items = ["whirring", "wow!", "calendar", "wry", "glass", "", "llama","tumultuous","owing"] | |
acc_num = 0 | |
for i in items: |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Write code that counts the number of words in sentence that contain either an “a” or an “e”. | |
# Store the result in the variable num_a_or_e. | |
# Note 1: be sure to not double-count words that contain both an a and an e. | |
# HINT 1: Use the in operator. | |
# HINT 2: You can either use or or elif. | |
# Hard-coded answers will receive no credit. | |
sentence = "python is a high level general purpose programming language that can be applied to many different classes of problems." | |
num_a_or_e = 0 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Write code that will count the number of vowels in the sentence s and assign the result to the variable num_vowels. | |
# For this problem, vowels are only a, e, i, o, and u. Hint: use the in operator with vowels. | |
s = "singing in the rain and playing in the rain are two entirely different situations but both can be fun" | |
vowels = ['a','e','i','o','u'] | |
# Write your code here. | |
num_vowels = sum([1 for i in s if i in vowels]) | |
print(num_vowels) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# 1. Write code to add ‘horseback riding’ to the third position (i.e., right before volleyball) in the list sports. | |
sports = ['cricket', 'football', 'volleyball', 'baseball', 'softball', 'track and field', 'curling', 'ping pong', 'hockey'] | |
sports.insert(2, 'horseback riding') | |
# 2. Write code to take ‘London’ out of the list trav_dest. | |
trav_dest = ['Beirut', 'Milan', 'Pittsburgh', 'Buenos Aires', 'Nairobi', 'Kathmandu', 'Osaka', 'London', 'Melbourne'] | |
trav_dest.pop(7) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#Create a dictionary called low_d that keeps track of all the characters in the string p and notes how many times each character was seen. Make sure that there are no repeats of characters as keys, such that “T” and “t” are both seen as a “t” for example. | |
p = "Summer is a great time to go outside. You have to be careful of the sun though because of the heat." |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Create a tuple called olympics with four elements: “Beijing”, “London”, “Rio”, “Tokyo” | |
olympics=('Beijing','London','Rio','Tokyo') | |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
words = ["water", "chair", "pen", "basket", "hi", "car"] | |
num_words = 0 | |
for i in words: | |
if len(i) > 3: | |
num_words += 1 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
words = ["adopt", "bake", "beam", "confide", "grill", "plant", "time", "wave", "wish"] | |
past_tense = [] | |
for i in words: | |
if(i[len(i)-1] == 'e'): | |
i += 'd' | |
else: | |
i += 'ed' | |
past_tense.append(i) |
OlderNewer