1. The followings are 8-bit words is stored in the memory. Suppose when the words were read from the memory, the check bits are calculated to be 0010. Using Hamming error correction code, find the he check bits stored together with the word, the syndrome word and the word fetched from the memory for the word given below.
   1. 0110 1010                                                                                                                     
   2. 1111 0001                                                                                                                     

(JAVA)

We will write a program to check the spelling of the word entered by user, using data from a dictionary, which is text file. The program will ask user to enter a word for spell check, and then check in the text file (dictionary.txt) if the word exists. (The dictionary.txt file is provided) If the word exists in text file, the output will be “Word is correctly spelled”. If the word doesn’t exist in the text file, program will write the message “Word doesn’t exist in the Dictionary” and will request user to enter “yes” or “no” to save the word in another text file. If user wants to write the word in a text file, user will enter “yes” (This text file can be named anything, for example “PersonalDictionary.txt”). Note: at this step, you need to write the word in the text file and display the message “****** is saved successfully in the file” (Asterisks denote the word entered by the user). If user doesn’t want to write/save the word in the file, user will enter “no” and the program will display a message “****** is not stored in the file” (Where asterisks denote the word). After this, program will ask the user to enter another word or enter some key (for example: -1) to exit the program. The program will use “dictionary.txt” file to read the list of words to be compared with. The program will create and write into a file (you can name it anything, for example “updateDictionary.txt”), the list of words that don’t match.

1. (60 points) Program runs successfully

a. (10 points) Inputs word from the user using a Scanner object.

b. (10 points) Reads the dictionary text file and save the data in a variable

c. (10 points) Repeats until user exit the program (Using Sentinel value to stop)

d. (15 points) Writes the word into a new personal dictionary file

e. (15 points) Outputs the final summary correctly for spelling check

2. (40 points) Program contents follow readability standards including:

a. (10 points) Correct use of arrayLists or any other data type

b. (10 points) Successfully write and use a method outside of the main method

c. (10 points) Correct variable types with Useful, Camel-case identifiers and proper tabbing.

d. (10 points) Document your code with at least 5 helpful comments

i. Put comments above the lines of code they are documenting, not to the right

I cannot attach the dictionary.txt file i appologize

Using your language, 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

Using your language, 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

In Java

A palindrome is a word or sequence of characters which reads the same backward and forward, such as madam, dad, racecar, 5885. In java Write a program that asks user to enter a word and prints if the word is a palindrome or not.

Write a program to perform the following two tasks:

1. The program will accept a string as input in which all of the words are run together, but the first character of each word is uppercase. Convert the string to a string in which the words are separated by spaces and only the first word starts with an uppercase letter. For example, the string "StopAndSmellTheRose" would be converted to "Stop and smell the rose". Display the result string.

2. Then the program will convert each word in the result string of task 1 into "Pig Latin" and display the result string. In one version of Pig Latin, you convert a word by removing the first letter, placing that letter at the end of the word, and then appending "ay" to the word.

For example, for the result string "Stop and smell the roses" in task 1, the Pig Latin string should be "topSay ndaay mellsay hetay osesray"

Hints:

1. In the first task, the first letter of a sentence should always be uppercase. Starting from the second letter to the last letter, if the letter is an uppercase (be cautious with I), that means it is the beginning of a new word. What you need to do is to insert a space before that uppercase letter, and change that uppercase letter to lowercase.

Python has isupper() function to check if a string or a character is uppercase, islower to check if a string or a character is lowercase

you may need a variable to remember the beginning index of a word and the ending index of a word. So you can use the two indexes to extract the word from the input phrase.

to add a space after a word, you can use the + operator as long as both operands are strings/characters

2. In the second task (pig Latin task), the result string of the first task should be passed as argument when you call the function you define for the second task.

You may need to use:

the index to access individual character (particularly the first character of each word in the sentence)

move the first character to the end of the word

add "ay" at the end of the word

Requirements:

• Algorithm must be modularized
• Pseudocode in .txt file or .docx file
• Python program (upload your .py file)

Write a program to perform the following two tasks:

1. The program will accept a string as input in which all of the words are run together, but the first character of each word is uppercase. Convert the string to a string in which the words are separated by spaces and only the first word starts with an uppercase letter. For example, the string "StopAndSmellTheRose" would be converted to "Stop and smell the rose". Display the result string.

2. Then the program will convert each word in the result string of task 1 into "Pig Latin" and display the result string. In one version of Pig Latin, you convert a word by removing the first letter, placing that letter at the end of the word, and then appending "ay" to the word.

For example, for the result string "Stop and smell the roses" in task 1, the Pig Latin string should be "topSay ndaay mellsay hetay osesray"

Hints:

1. In the first task, the first letter of a sentence should always be uppercase. Starting from the second letter to the last letter, if the letter is an uppercase (be cautious with I), that means it is the beginning of a new word. What you need to do is to insert a space before that uppercase letter, and change that uppercase letter to lowercase.

Python has isupper() function to check if a string or a character is uppercase, islower to check if a string or a character is lowercase

you may need a variable to remember the beginning index of a word and the ending index of a word. So you can use the two indexes to extract the word from the input phrase.

to add a space after a word, you can use the + operator as long as both operands are strings/characters

2. In the second task (pig Latin task), the result string of the first task should be passed as argument when you call the function you define for the second task.

You may need to use:

the index to access individual character (particularly the first character of each word in the sentence)

move the first character to the end of the word

add "ay" at the end of the word

Requirements:

• Algorithm must be modularized
• Pseudocode in .txt file or .docx file
• Python program (upload your .py file)

c++ question

Question 2: X = 7777
Modify the code below and use conditional branching (if, else, etc.)
to print the following:
if X is between 0 and 33333 then print the word: red
if X is between 33334 and 66666 then print the word: blue
if X is between 66667 and 99999 then print the word: green
if none of the above condition matches then print the word: white