Reference no: EM133087556
Lab4-Strings, Substrings and Files
Exercise
Question 1. Write a program to count and display how many times the substring notice appears in the string:
Question 2. Write a program that splits each line of the following limerick into two halves and displays them on alternating lines with dashes taking up the space of the 'left' half (before the 'right' half is printed):
The limerick packs laughs astronomical
Into space that is quite economical
But the good ones I've seen
Very seldom are clean
And the clean ones so seldom are comical.
Question 3. Write a program that opens the provided file alice_in_wonderland.txt and reads it into a list of lines (don't forget to close the file when you've done so!).Then, ask the user to enter a word to search for. Once you have a word, search through all the lines of text in the book counting how many times that word occurs in a case-insensitive manner, and then display the final count.
Question 4. Write a program that takes a string from the user and converts it into MiXeDCaSe- that is, each alphabetical character in the string should alternate between upper and lower case (don't try to change digits or punctuation into upper or lower case).
Question 5. Here's a function that calculates the prime numbers between an interval and returns a list of those values:
defget_primes_in_range(start, end):
prime_list = []
fornum in range(start, end + 1):
if num> 1:
found_divisor = False
fori in range(2, int(num/2)+1):
if (num % i == 0):
found_divisor = True
break
if (found_divisor == False):
prime_list.append(num)
return prime_list
So if you ran get_primes_in_range(2, 10) it would return you the list [2, 3, 5, 7, 9]
Write a program that asks the user for two integer values and a string for a filename. Then run the get_primes_in_range() function with the values the user provided and get the returned list.
Question 6. CHALLENGE TASK: Write a program that programmatically prints out the following poem. Think about how you might go about it - design it on paper if you like. It's definitely a problem, but not a terribly hard one - and when you break it down there's really only just a handful of steps involved.