Name: __________________________________________

Specifications:

1. Create a class called WordMaker that is passed characters one at a time and assembles them into words.

2. As long as the characters passed to it are letters, it builds a word by placing each character on the end of a string.

3. When a character that is not part of a word (i.e., is not a letter) is encountered, the class signals that the word is complete, and makes a string containing the word available to its client.

4. After encountering a non-letter, it will continue to ignore whitespace passed to it until it encounters a letter, in which case it will signal that a new word is being built.

5. Apostrophes are a special case. Even if they occur within a word (e.g., surrounded on each side by a letter), they should be ignored.

6. The class will have the following public member functions:

public void reset()

Resets the WordMaker so that it is ready to start building a word.

   public void addChar(newChar);

Adds a character to the WordMaker. If it is a letter and

WordMaker is making a word, it adds it to the end of the word. If

it is a letter and WordMaker is not making a word, it erases the

current word, and starts a new word with the letter. If it is not a

letter and WordMaker is making a word, it ends the word (unless

it is an apostrophe, treated specially as described above). If it is not

a letter and WordMaker is not making a word, it is ignored.

             public boolean wordReady()

Returns true if the WordMaker has finished constructing a word,

false otherwise. After a reset, or when the WordMaker is first

constructed, it returns false. When a word has just been completed

(i.e., the first non-letter character has been added), it returns true.

Otherwise it returns false.

   public String getWord()

Returns the word that the WordMaker has created when

WordReady returns true. It should not be called when WordReady

returns false.

7. A test plan should accompany this project.
   1. List a description of the various test cases you will program.
   2. Give each test in your test plan a number.
   3. Annotate each line in the methods with the number of a test case that tests it to verify that your code coverage is complete.
   4. Also annotate your output to make clear what your test plan tests.
   5. The test plan will be assessed based on its thoroughness and clarity.

def main():
    # keeping asking user for a word or name until user enters 0
    while True:
        word = input('Enter a word/name to convert (enter 0 to quit): ').upper()
      if word == '0': break
        print(convert_to_soundex(word))

Whenever i try to run the program it tells me unintend doesn't match any outer identation level !!!!

For our current programming assignment I need to create a CleanWord method that reads in one variable string at a time and returns a cleaned word without any non letters. The instructions given to us are listed below:

“Clean word” method:

 This is to be implemented as a separate method, so it can be called for either a dictionary word or book word.

 The function will remove any non-letters, except an apostrophe (‘) and numbers from the word.

 All letters will changed to lower case.

 It will then return the updated word. The word could now be blank. The calling method will need to deal with this correctly.

I would appreciate the help!

1. Write a program that prompts the user enter a word, and determines the first half and second half of the word. Print the first and second half of the word on different lines. Sample runs of the program are shown below. Note: If the word is an odd number of letters, the first half should contain fewer letters (as shown in sample run #2)

SAMPLE PROGRAM RUN #1                    

Enter a word: carrot

First half: car

Second half: rot

SAMPLE PROGRAM RUN #2                            

Enter a word: plant

First half: pl

Second half: ant

Complete your answer by typing code below

import java.util.Scanner;

public class WordHalves

{

public static void main(String[] args)

{

Scanner reader = new Scanner(System.in);

System.out.print("Enter a word: ");

String word = reader.nextLine();

}

}

For each of the following propositions the first word in your answer should be the word True or the word False followed by a brief explanation as to why the proposition is true or false.

assume that Frank and Athena can produce either chairs or tables. If Athena has a comparative advantage in producing chairs, then she would be able to sell chairs for a higher price than Frank.

Write a function bracket_by_len that takes a word as an input argument and returns the word bracketed to indicate its length. Words less than five characters long are bracketed with << >>, words five to ten letters long are bracketed with (* *), and words over ten characters long are bracketed with /+ +/. Your function should require the calling function to provide as the first argument, space for the result, and as the third argument, the amount of space available.

Program: C

Consider the word CAT

a) What would the hexadecimal representation of this word be in ASCII?

c) If we rotated the bits that represent this word 8 bits to the right, what would the word become (in letters)?

d)  If we rotated the bits that represent CAT 8 places to the left, what would the word become (in letters)?

e) What would the results be (in letters) if we XORed the bits that represent CAT with the hexadecimal value 20 20 20?

f) What would the results be (in letters) if we XORed the bits that represent CAT with the hexadecimal value 13 08 13?

Use this constant dictionary as a global variable:

tile_dict = { 'A': 1, 'B': 3, 'C': 3, 'D': 2, 'E': 1, 'F': 4, 'G': 2, 'H': 4, 'I': 1, 'J': 8, 'K': 5, 'L': 1, 'M': 3, 'N': 1, 'O': 1, 'P': 3, 'Q': 10, 'R': 1, 'S': 1, 'T': 1, 'U': 1, 'V': 4, 'W': 4, 'X': 8, 'Y': 4, 'Z': 10 }

Implement function scrabblePoints(word) that returns the calculated points for the word based on the tile_dict above. The word parameter is a string. This function takes the string and evaluates the points based on each letter in the word (points per letter is set by the global dictionary). P or p is worth the same points. No points calculated for anything that is not A-Z or a-z.

[You may use upper() and isalpha() ONLY and no other method or built-in function]

Examples:

word = “PYTHON”

print(scrabblePoints(word))

returns:

14

word = “hello!!”

print(scrabblePoints(word))

returns:

8

word = “@#$=!!”

print(scrabblePoints(word))

returns:

0

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< Stack < String >> queue = new LinkedList<>();
      visited = new LinkedList<>();
      Stack< String > copiedStack = new Stack<>();
    // Left as exercise
   

   }   

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

}
       

Given a string sentence that consists of some words separated by a single space, and a string searchWord.

Write a function isPrefix to check if searchWord is a prefix of any word in sentence. A prefix of a string S is any leading contiguous substring of S. It returns the index of the word in sentence where searchWord is a prefix of this word (1-indexed).

If searchWord is a prefix of more than one word, return the index of the first word (minimum index). If there is no such word return -1.

Input: sentence = this problemo is an easy problemo, searchWord = pro

Output: 2

Explanation: pro is prefix of problemo which is the 2nd and the 6th word in the sentence, but we return 2 as it's the minimal index.