WordLadder JAVA Program question

Output

Your program must output to the console one word ladder from the start word to the end word. Every word in the ladder must be a word that appears in the dictionary. This includes the given start and end words--if they are not in the dictionary, you should print "There is no word ladder between ..." Remember that there may be more than one ladder between the start word and the end word. Your program may output any one of these ladders. The first output word must be the start word and the last output word must be the end word. If there is no way to make a ladder from the start word to the end word, your program must output "There is no word ladder between ..."

For testing purposes, I provide you with the input file and the expected output.

SAMPLE OUTPUT:

[line, fine]

[dear, fear]

There is no word ladder between stone and money

[fake, lake, lase, last, cast, cost, coat]

[like, line, fine, fire, fore, core, cord, cold, hold, held, help]

There is no word ladder between blue and pink

[face, fake, lake, like]

[help, held, hold, cold, cord, core, fore, fire, fine, find, mind]

[lice, line, fine, fire, fore, core, cord, cold, hold, held, help]

There is no word ladder between door and lice

Starter Code:

• WordLadder.java

WordLadder.java CONTENT

import java.util.*;
import java.io.*;
public class WordLadder {
    private static LinkedList dict;
    private static LinkedList visited;
    private static String start, end;
   public static void main(String[] args) throws IOException{

// TODO Auto-generated method stub
File dictfile = new File("dictionary.txt");
File infile = new File("infile.txt");
dict = new LinkedList<>();
// load the dictionary
try(
   Scanner in = new Scanner(dictfile);){
   while(in.hasNext()) {
       dict.add(in.next());
   }
}

try(Scanner in = new Scanner(infile);) 
   {
      while(in.hasNext()) {
         start = in.next();
         end = in.next();
         if(start.length()!=end.length() || !dict.contains(start) || !dict.contains(end) ){
            System.out.println("There is no word ladder between "+start+ " and "+end);
            continue;
         }
         findLadder(start,end);
      }
   }
}
public static void findLadder(String start,String end) {
   Queue> queue = new LinkedList<>();
   visited = new LinkedList<>();
   Stack copiedStack = new Stack<>();
   // Left as exercise
}

   public static boolean isAnEdge(String w1, String w2) {
        // Left as exercise
    }
}

infile.txt CONTENT

line fine
dear fear
stone money
fake coat
like help
blue pink
face like
help mind
lice help
door lice

dictionary.txt CONTENT

lice
deck
cord
bent
band
cast
bike
cash
card
boat
cold
coat
dear
slow
core
dash
cost
dame
fish
dorm
dine
deer
dear
dime
fast
blue
deme
dive
dish
dinn
door
dome
fake
slow
pink
face
find
fast
fire
fear
fine
finn
help
held
hash
fore
folk
fold
hard
hear
here
host
hold
hire
lase
land
knot
lake
kunn
kuns
last
mind
main
line
lime
like
lost
live
linn
love
lunn
mike
maze
mash
make
mice
meta
mien
milk
vice
silk
neck
mink
mine
must
most
more
nash
sick
nice
rain
pour
pine
nick
pain
nine
nuns
pond
pony
poor
sake
rick
rash
rime
rust
sane
sand
sine
sure
sony
tiny
warm
vide
ward
worm

1. (5) Taking into account identical letters, how many ways are there to arrange the word CALLITRICHIDAE?
2. (5) Taking into account identical letters, how many ways are there to arrange the word CALLITRICHIDAE that start or end with vowels?
3. (5) Taking into account identical letters, how many ways are there to arrange the word CALLITRICHIDAE that contain the substring LITERAL?
4. (5) Taking into account identical letters, how many ways are there to arrange the letters in the word ANTIDISESTABLISHMENTARIANISM?

C++

Project 6-2: Pig Latin Translator

Create a program that translates English to Pig Latin.

Console

Pig Latin Translator

This program translates a sentence

and removes all punctuation from it.

Enter a sentence: 'Tis but a scratch.

Translation:      Istay utbay away atchscray

Specifications

• Convert the English to lowercase before translating.
• Remove all punctuation characters before translating.
• Assume that words are separated from each other by a single space.
• If the word starts with a vowel, just add way to the end of the word.
• If the word starts with a consonant, move all of the consonants that appear before the first vowel to the end of the word, then add ay to the end of the word.
• If a word starts with the letter y, the y should be treated as a consonant. If the y appears anywhere else in the word, it should be treated as a vowel.

Note

• There are no official rules for Pig Latin. Most people agree on how words that begin with consonants are translated, but there are many different ways to handle words that begin with vowels.

CALM = ['good', 'safe', 'well', 'benefit', 'ok'] And some possible worried words: WORRIED = ['bad', 'risk', 'risky', 'nervous', 'problem'] Make sure all of your words are lowercase, and that each string is a word and not a phrase -- keeps things simpler. Now weight the words from the above lists. We’ve started out with lists of calm/worried words, but some of them are stronger than others. For example, the word good is probably more positive than the word ok. Assign a weight to each word in your lists. Use positive weights for calm words and negative weights for worried words. Your lists should be 2-dimensional now, in this format: [[word, weight], [word, weight]...] Use list concatenation (+) to create one big list instead of two separate ones, something like this: ALL_WORDS = CALM + WORRIED Iterate over this new 2-dimensional list and print out each word and its corresponding weight.

(Script for ATOM or REPL to be run)

IN PYTHON

INF 120 – Project #6.5

In project 6.5 we are going to create a program and test cases to test each path/branch through the program.

Our program is going to get a word from the user and check if it is a palindrome. If it is it will output to the user that it is a palindrome. A palindrome is where the word is the same forwards as backwards.

For example racecar.If the word isn’t a palindrome then we will “translate” the word to pig Latin according to the following rules.1. If the word begins with a consonant move the 1st letter to the end of the word and then append “ay”. So dog becomes ogday.2. If the words begins with a vowel just add “ay” to the end of the word. So elk becomes Elkay.

Write your program and get it working.

Answer the following questions about your program.

1. How many paths/branches are in your program.

2. For each path/branch in your program craft a test case.

3. Run your program with each test case and screenshot the result and include them as the answer to this question.

Using your language, don't use any sites (by your understanding), write about the difference between the letter of credit and letter of guarantee

Word Limit for the assignment:
Upper word limit: 1200 words
Lower word limit: 600 words

Write a program that reads a text file and reports the total count of words of each length. A word is defined as any contiguous set of alphanumeric characters, including symbols. For example, in the current sentence there are 10 words. The filename should be given at the command line as an argument. The file should be read one word at a time. A count should be kept for how many words have a given length. For example, the word “frog” is 4 bytes in length; the word “turtle” is 6 bytes in length. The program should report the total word counts of all lengths between 3 and 15 bytes. Words with lengths outside that range should not be counted

Python Programming: Scrambled Word Game

Topics: List, tuple

Write a scrambled word game. The game starts by loading a file containing scrambled word-answer pair separated. Sample of the file content is shown below. Once the pairs are loaded, it randomly picks a scrambled word and has the player guess it. The number of guesses is unlimited. When the user guesses the correct answer, it asks the user if he/she wants another scrambled word.

bta:bat
gstoh:ghost
entsrom:monster

Download scrambled.py (code featured below) and halloween.txt. The file scrambled.py already has the print_banner and the load_words functions. The function print_banner simply prints “scrambled” banner. The function load_words load the list of scrambled words-answer pairs from the file and return a tuple of two lists. The first list is the scrambled words and the second is the list of the answers. Your job is the complete the main function so that the game works as shown in the sample run.

Optional Challenge: The allowed number of guess is equal to the length of the word. Print hints such as based on the number of guess. If it’s the first guess, provides no hint. If it’s the second guess, provides the first letter of the answer. If it’s the third guess, provides the first and second letter of the correct answer. Also, make sure the same word is not select twice. Once all words have been used, the game should tell user that all words have been used and terminate.

Sample run:

__                               _      _            _
/ _\ ___ _ __ __ _ _ __ ___ | |__ | | ___   __| |
\ \ / __|| '__|/ _` || '_ ` _ \ | '_ \ | | / _ \ / _` |
_\ \| (__ | | | (_| || | | | | || |_) || || __/| (_| |
\__/ \___||_|   \__,_||_| |_| |_||_.__/ |_| \___| \__,_|                                                       

Scrambled word is: wbe
What is the word? bee
Wrong answer. Try again!
Scrambled word is: wbe
What is the word? web
You got it!
Another game? (Y/N):Y
Scrambled word is: meizob
What is the word? Zombie
You got it!
Another game? (Y/N):N
Bye!

Provided code (from scramble.py

def display_banner():
    print("""
__                               _      _            _
/ _\ ___ _ __ __ _ _ __ ___ | |__ | | ___   __| |
\ \ / __|| '__|/ _` || '_ ` _ \ | '_ \ | | / _ \ / _` |
_\ \| (__ | | | (_| || | | | | || |_) || || __/| (_| |
\__/ \___||_|   \__,_||_| |_| |_||_.__/ |_| \___| \__,_|                                                       

""")

def load_words(filename):
    #load file containing scrambled word-answer pairs.
    #scrambled word and answer are sparated by :

    scrambled_list = []
    answer_list = []

    with open(filename, 'r') as f:
        for line in f:
            (s,a) = line.strip().split(":")
            scrambled_list += [s]
            answer_list += [a]
    return (scrambled_list, answer_list)

def main():
    display_banner()
    (scrambled_list, answer_list) = load_words('halloween.txt')
    #your code to make the game work.     

main()

Halloween.txt file.

bta:bat
gstoh:ghost
entsrom:monster
ihtcw:witch
meizob:zombie
enetskol:skeleton
rpamevi:vampire
wbe:web
isdepr:spider
umymm:mummy
rboom:broom
nhlwaeeol:Halloween
pkiumnp:pumpkin
kaoa jlern tcn:jack o lantern
tha:hat
claabck t:black cat
omno:moon
aurdclno:caluldron

6. Assume a computer has a physical memory organized into 64-bit words. Using hexadecimal notation, give the word address and offset within the word for each of the following byte addresses.

Write a Python program that will ask the user to input a word, will return the first letter of the input word, and ask the user to put another word, and so on, in the form of a loop. If the user chooses to stop, he or she should input the integer "0" for the loop to stop.