Simple answers but work shown thank you!

(a) In how many different ways can the letters of the word wombat be arranged?

(b) In how many different ways can the letters of the word wombat be arranged if the letters wo must remain together (in this order)?

(c) How many different 3-letter words can be formed from the letters of the word wombat? And what if w must be the first letter of any such 3-letter word?

JAVA CODE, BEGINERS; Please use comments to explain

For all of the following words, if you move the first letter to the end of the word, and then spell the result backwards, you will get the original word:

• banana dresser grammar potato revive uneven assess

Write a program that reads a word and determines whether it has this property. Continue reading and testing words until you encounter the word quit. Treat uppercase letters as lowercase letters.

Translate this algorithm to code on C

compare(char array[ ])

word = split(array, " "); //gets the first word before the blank space

if word == Hello {

print("I am saying hello");

}else if (word == Bye)

print("I am saying goodbye");

}

Example---------------------

char array = "Hello Ana";

compare(array);

char array1 = "Bye Ana"

compare(array1);

result

"I am saying hello"

"I am saying goodbye"

Write a function in python that accepts a sentence as the argument and converts each word to “Pig Latin.” In one version, to convert a word to Pig Latin, you remove the first letter and place that letter at the end of the word. Then you append the string “ay” to the word. Here is an example: English: I SLEPT MOST OF THE NIGHTPIG LATIN: IAY LEPTSAY OSTMAY FOAY HETAY IGHTNAY. Please, I want the coding indented and then the results screen shot.

Program Zeus:    Complete the Count Vowels program (Count Vowels.cpp template provided at the end) to include two user defined functions (which you will write!). Code lenguage is C++

bool isVowel (char c)       // returns true if c is a vowel and false otherwise

int countVowels (string s) // returns the number of vowels in s.

You can access each character of s by using s.at(i) where i ranges from 0 to s.length()-1.

countVowels () should call isVowel (s.at(i)) to check if character i is a vowel.

Run the program once with the following inputs. For full credit, your output should be the same as the output below.

Please enter a word or type "quit" to exit: apple

apple has 2 vowels.

Please enter a word or type "quit" to exit: twang

twang has 1 vowel.

Please enter a word or type "quit" to exit: xyz

xyz has 0 vowels.

Please enter a word or type "quit" to exit: aeiou

aeiou has 5 vowels.

Please enter a word or type "quit" to exit: antidisestablishmentarianism

antidisestablishmentarianism has 11 vowels.

Please enter a word or type "quit" to exit: quit

Goodbye!

Template for Program:

#include<iostream>

#include<iomanip>

#include<fstream>

using namespace std;

bool isVowel(char);

int countVowels(string); .

int main ( )

{

string word;

int numVowels;cout << "Please enter a word or type \"quit\" to exit: ";

cin >> word;

while ()

{

cout << "Please enter a word or type \"quit\" to exit: ";

cin >> word;

}

cout << "Goodbye!" << endl;

return 0;

}

// This function returns the number of vowels in s.

// This function will call isVowel.

int countVowels(string s)

{

}

// This function returns true if c is a vowel and false otherwise

bool isVowel(char c)

{

}

You can turn a word into pig-Latin using the following two rules:

• If the word starts with a consonant, move that letter to the end and append 'ay'. For example, 'happy' becomes 'appyhay' and 'pencil' becomes 'encilpay'.
• If the word starts with a vowel, simply append 'way' to the end of the word. For example, 'enter' becomes 'enterway' and 'other' becomes 'otherway'. For our purposes, there are 5 vowels: a, e, i, o, u (we consider y as a consonant).

Write a function pig() that takes a word (i.e., a string) as input and returns its pig-Latin form. Your function should still work if the input word contains upper case characters. Your output should always be lower case.

For example, if you enter

pig('happy')

The output should be

'appyhay'

If you enter

pig('Enter')

The output should be

'enterway'

If all permutations of the letters of the word "BEFORE" are arranged in the order as in a dictionary. What is the 32 word?

Please complete in Python and neatly explain and format code. Use snake case style when defining variables. Write a program named wordhistogram.py which takes one file as an argument. The file is an plain text file(make your own) which shall be analyzed by the program. Upon completing the analysis, the program shall output a report detailing the shortest word(s), the longest word(s), the most frequently used word(s), and a histogram of all the words used in the input file.

If there is a tie, then all words that are of the same length for that classification (longest, shortest, most frequent) are displayed as part of that class.

A word histogram shows an approximate representation of the distribution of words used in the input file. An example text, The_Jungle_Upton_Sinclair.txt, is provided as a starting point for analyzing natural language. Draw your histogram by listing the word first and then print up to 65 * characters to represent the frequency of the word.

Since there is limited space on a terminal, ensure that your histogram does not wrap along the right edge of the terminal. Assume that the width of the histogram can not be wider than 65 characters. In calculating your histogram, map the highest frequency to 65 characters. For example, if the text has a word that appears 2000 times and it is the most frequently used word, then divide 2000 by 65 to approximate that each * character represents 30 occurrences of the word in question in the text. Thus if a word should appear less than 30 times, it receives zero * characters, a word that appeared 125 time would receive 4 * characters (0-30, 31-60, 61-90, 91-120, 120-150).

Print the order of the histogram from most frequent to least frequent.

The program must have a class named WordHistogram. This class must be the data structure that keeps track of the words that appear in the input text file and can return the histogram as a single string. The main function is responsible for opening and reading the the input text file.

Make sure your WordHistogram class has data members that are correctly named (use the underscore character!), has an initializer, and any necessary methods and data members.

In your main, use the given function to read from the filehandle.

def word_iterator(file_handle):
""" This iterates through all the words of a given file handle. """
  for line in file_handle:
    for word in line.split():
      yield word

DO NOT COMPUTE OR STORE THE HISTOGRAM OUTSIDE OF AN OBJECT named WordHistogram

Please use this code to get started:

#!/usr/bin/env python3

import sys

def main():

if len(sys.argv) < 2:

print("Provide an input file. Exiting");

exit(1)

wh = WordHistogram( )

with open(sys.argv[1], "r") as fh:

for word in word_iterator(fh):

wh.insert(word)

print(wh.report( ))

if __name__ == '__main__':

main()

Example Output

$ ./wordhistogram.py Candide_Voltaire.txt
Word Histogram Report
the (2179) ******************************************************************
of (1233) *************************************
to (1130) **********************************
and (1127) **********************************
a (863) **************************
in (623) ******************
i (446) *************
was (434) *************
that (414) ************
he (410) ************
with (395) ***********
is (348) **********
his (333) **********
you (317) *********
said (302) *********
not (276) ********
...
$