• Goal: Unscramble permuted words by generating all permutations of Jumble string and searching for a word in Unix dictionary.
• Unix Dictionary: dict.txt

Details:

1. Write a method called get_permutations that inputs a string like "dog". Your method should return an array of all permutations of the Jumble string. . For example:

   s = "dog" perms = get_permutations(a) print(perms) Output: ['dog', 'dgo', 'odg', 'ogd', 'gdo', 'god'] 

   Rewrite the script for obtaining permutations and the end of the Comments, Hints, and Observersions section below to a script that defines the method get_permutations.
2. Compare the words in the Unix dictionary to the permutation strings in the array. Print any matches that are found. Here is some pseudocode that might help you:

   Define get_permutations method (Item 2. # Start main script. # Indicate in a comment the Jumble strings you # use for testing. Include at least two test strings. Input Jumble string from keyboard. Obtain array of permutations from array using get_permutations method. Open Unix dictionary file to obtain file object fin. Get first line of dictionary file. while more lines in dictionary file get line Get word from current line by removing at end of line. if word starts with a lower case letter for each permutation in array called perm if perm is equal to word print word exit script (optional) end end end Get next line of dictionary file. end Close file object fin. 

   The reason we only consider words that start with lower case letters is that Jumble strings never represent proper names.

Python Programming.