Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
t of words (below). Your task is to create a program which finds the location of e grid by printing out the position of the first and last character. Bear in mind t O is located at the top left char of the grid. Also, some of the words inside the li thin the grid, you need to alert the user which words cannot be found. You sho Iving skills to design and implement an algorithm which finds these words in w ant. Play the game first using the wordsearch.jpg file which has the grid already ore readable format. Whilst you play it, make a note of what strategy your usin en be applied within your searching algorithm. Here is the list of words: RUESOME MARRIED SCATTERED YOUTHFUL FEDERAL NITED POISED WONDERFUL DISTINCT ABROAD IPORTANT FREQUENT WOLVES РОСКЕTS ADVANCED structions on how to play a word search: mu are given a grid of jumbled up letters which have words hidden inside them. here those words are, if this was on paper, you would highlight those words usi. e using an array and java code, you will only need to print out the position of w e words are placed using different orientations, meaning some are written vert agonally. u can use the following set of steps to implement your code: 1. Within the WordSearchSolver.java file, you'll be given a 2D array within t create an array of strings to store all the words (above) you're trying to fi 2. Using a series of loops, pick the first word from the word array. Then loo individual characters within the 2D array and match it with the first lette

t of words (below). Your task is to create a program which finds the location of e grid by printing out the position of the first and last character. Bear in mind t O is located at the top left char of the grid. Also, some of the words inside the li thin the grid, you need to alert the user which words cannot be found. You sho Iving skills to design and implement an algorithm which finds these words in w ant. Play the game first using the wordsearch.jpg file which has the grid already ore readable format. Whilst you play it, make a note of what strategy your usin en be applied within your searching algorithm. Here is the list of words: RUESOME MARRIED SCATTERED YOUTHFUL FEDERAL NITED POISED WONDERFUL DISTINCT ABROAD IPORTANT FREQUENT WOLVES РОСКЕTS ADVANCED structions on how to play a word search: mu are given a grid of jumbled up letters which have words hidden inside them. here those words are, if this was on paper, you would highlight those words usi. e using an array and java code, you will only need to print out the position of w e words are placed using different orientations, meaning some are written vert agonally. u can use the following set of steps to implement your code: 1. Within the WordSearchSolver.java file, you'll be given a 2D array within t create an array of strings to store all the words (above) you're trying to fi 2. Using a series of loops, pick the first word from the word array. Then loo individual characters within the 2D array and match it with the first lette

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

My way was rejected because it's not using this format, any help?

word you're looking for is WOLVES, you should be checking a total of 6 letters surrounding the initial letter of W. You will then check for O, if it's there, then check for L etc. 4. If the word is found, print out the coordinates of the first letter and last letter. 5. If the word is not found, print out the word followed by "is not found within this grid."
Transcribed Image Text:word you're looking for is WOLVES, you should be checking a total of 6 letters surrounding the initial letter of W. You will then check for O, if it's there, then check for L etc. 4. If the word is found, print out the coordinates of the first letter and last letter. 5. If the word is not found, print out the word followed by "is not found within this grid."
This assessment will test your knowledge of arrays in Java. You will be given a file called WordsearchSolver.java which will contain a 2D char array (word search grid). You will also be given a list of words (below). Your task is to create a program which finds the location of those words within the grid by printing out the position of the first and last character. Bear in mind that in Java, position 0,0 is located at the top left char of the grid. Also, some of the words inside the list below do not exist within the grid, you need to alert the user which words cannot be found. You should use your problem- solving skills to design and implement an algorithm which finds these words in whichever way you want. Play the game first using the wordsearch.jpg file which has the grid already laid out for you in a more readable format. Whilst you play it, make a note of what strategy your using, this logic should then be applied within your searching algorithm. Here is the list of words: GRUESOME MARRIED SCATTERED YOUTHFUL FEDERAL UNITED POISED WONDERFUL DISTINCT ABROAD IMPORTANT FREQUENT WOLVES РОСКЕTS ADVANCED Instructions on how to play a word search: You are given a grid of jumbled up letters which have words hidden inside them. Your job is to find where those words are, if this was on paper, you would highlight those words using a marker but as we are using an array and java code, you will only need to print out the position of where these words are. The words are placed using different orientations, meaning some are written vertically, horizontally, or diagonally. You can use the following set of steps to implement your code: 1. Within the WordSearchSolver.java file, you'll be given a 2D array within the main. You should create an array of strings to store all the words (above) you're trying to find. 2. Using a series of loops, pick the first word from the word array. Then loop through all the individual characters within the 2D array and match it with the first letter of the word. 3. Then apply another condition which checks the second letter of the word with the surrounding characters of the first letter. Do this for the remaining length of the word, for example, if the
Transcribed Image Text:This assessment will test your knowledge of arrays in Java. You will be given a file called WordsearchSolver.java which will contain a 2D char array (word search grid). You will also be given a list of words (below). Your task is to create a program which finds the location of those words within the grid by printing out the position of the first and last character. Bear in mind that in Java, position 0,0 is located at the top left char of the grid. Also, some of the words inside the list below do not exist within the grid, you need to alert the user which words cannot be found. You should use your problem- solving skills to design and implement an algorithm which finds these words in whichever way you want. Play the game first using the wordsearch.jpg file which has the grid already laid out for you in a more readable format. Whilst you play it, make a note of what strategy your using, this logic should then be applied within your searching algorithm. Here is the list of words: GRUESOME MARRIED SCATTERED YOUTHFUL FEDERAL UNITED POISED WONDERFUL DISTINCT ABROAD IMPORTANT FREQUENT WOLVES РОСКЕTS ADVANCED Instructions on how to play a word search: You are given a grid of jumbled up letters which have words hidden inside them. Your job is to find where those words are, if this was on paper, you would highlight those words using a marker but as we are using an array and java code, you will only need to print out the position of where these words are. The words are placed using different orientations, meaning some are written vertically, horizontally, or diagonally. You can use the following set of steps to implement your code: 1. Within the WordSearchSolver.java file, you'll be given a 2D array within the main. You should create an array of strings to store all the words (above) you're trying to find. 2. Using a series of loops, pick the first word from the word array. Then loop through all the individual characters within the 2D array and match it with the first letter of the word. 3. Then apply another condition which checks the second letter of the word with the surrounding characters of the first letter. Do this for the remaining length of the word, for example, if the
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS