- Strength to Increase Rep
- +0
- Strength to Decrease Rep
- -0
- Upvotes Received
- 1
- Posts with Upvotes
- 1
- Upvoting Members
- 1
- Downvotes Received
- 1
- Posts with Downvotes
- 1
- Downvoting Members
- 1
Exercise 11.1. Write a function that reads the words in words.txt and stores them as keys in a dictionary. It doesn’t matter what the values are. Then you can use the in operator as a fast way to check whether a string is in the dictionary. Trying to figure this … |
|
Hi again all, I have been tussling with this program all day. I can't seem to get pickle.dumps (or f.write..tried that earlier) to save without saving over itself. If I do a deposit(option 1) and then a withdraw(option 2), and then history(option 3), it only shows the last option ran … |
|
This is for part of my homework in an Object Oriented Programming class. I debugged the top part to make it workable. I need help on how to delete a searched item and also think I am missing closing the database file at the end. The search function #2 is … |
|
I am trying this example from Byte of Python, Chapter 10. I can't seem to get this zip to work. I am not sure if the syntax for windows is written correctly or not. I have tried running from interpreter and as a script and both return Backup FAILED. Anyone … |
|
def is_anagram(t,u): if sorted(t)== sorted (u): return True else: return False print is_anagram('realtor', 'rotlear') # True print is_anagram('superpuff','local') # False print is_anagram('alla', 'lala') # True print is_anagram('tools', 'stool') # True print is_anagram('double', 'trouble') # False |
|
def is_sorted(t): if t == sorted(t): return True else: return False print is_sorted([1,2,2]) # True print is_sorted(['b','a']) # False print is_sorted([3, 1, 5, 2, 4]) # False print is_sorted(['d', 'a', 'c', 'b']) # False print is_sorted(['a', 'b', 'b', 'd', 'e', 'e', 'f', 'g']) # True |
|
Re:
What are advantieges of Ruby over Python and vise versa? Then in your opinion wich one is better for all around programming on linux and windows? |