Problem specification: In this assignment, you will search for a word in square sized grid of letters. You will write a Java program that reads a grid of letters and a specified word from the user, counts how many times the word appeared in the grid in horizontal orientation (from left to right or from right to left), vertical orientation (from top to bottom or from bottom to top) or diagonal orientation (from upper left to lower right, from lower right to upper left, from upper right to lower left or from lower left to upper right) and prints the total count. An example is shown here where the grid size is 7X7 and you can find the word CAT in all possible orientations. Your program should print how many times in total the specified word appeared in the grid in any of these orientations. CTGO CFX A VAATAC TUTC z P M GDCE sTB 0 HQA ATL DNXC T AK YCAT RCJ Input specification: The input starts with an integer N which represents the grid size (NXN). Next, N lines will follow where each line represents a row of letters. Each line will have exactly N letters in them. The last line is the word you have to search in the grid. The number of characters in the last line does not exceed N. You can assume that the value of N will not exceed 10000. Output specification: The output of your program is a single integer that represents the number of times the word is found in the grid. Note: You must not print anything extraneous (such as “Please enter N" or “the result is"). Sample input: 4 Sample output: WORD OODW RDRO DWOD WORD 3 12 АВА BAB АВА AB
Problem specification: In this assignment, you will search for a word in square sized grid of letters. You will write a Java program that reads a grid of letters and a specified word from the user, counts how many times the word appeared in the grid in horizontal orientation (from left to right or from right to left), vertical orientation (from top to bottom or from bottom to top) or diagonal orientation (from upper left to lower right, from lower right to upper left, from upper right to lower left or from lower left to upper right) and prints the total count. An example is shown here where the grid size is 7X7 and you can find the word CAT in all possible orientations. Your program should print how many times in total the specified word appeared in the grid in any of these orientations. CTGO CFX A VAATAC TUTC z P M GDCE sTB 0 HQA ATL DNXC T AK YCAT RCJ Input specification: The input starts with an integer N which represents the grid size (NXN). Next, N lines will follow where each line represents a row of letters. Each line will have exactly N letters in them. The last line is the word you have to search in the grid. The number of characters in the last line does not exceed N. You can assume that the value of N will not exceed 10000. Output specification: The output of your program is a single integer that represents the number of times the word is found in the grid. Note: You must not print anything extraneous (such as “Please enter N" or “the result is"). Sample input: 4 Sample output: WORD OODW RDRO DWOD WORD 3 12 АВА BAB АВА AB
Chapter8: Advanced Method Concepts
Section: Chapter Questions
Problem 8RQ
Related questions
Topic Video
Question
write this code on java
![Problem specification:
In this assignment, you will search for a word in square sized grid of letters. You will
write a Java program that reads a grid of letters and a specified word from the user,
counts how many times the word appeared in the grid in horizontal orientation (from
left to right or from right to left), vertical orientation (from top to bottom or from
bottom to top) or diagonal orientation (from upper left to lower right, from lower right
to upper left, from upper right to lower left or from lower left to upper right) and prints
the total count. An example is shown here where the grid size is 7X7 and you can find
the word CAT in all possible orientations. Your program should print how many times
in total the specified word appeared in the grid in any of these orientations.
C
TGOCFX
A VAATAC
TUTC z P M
GDC ES TB
O HQ AATL
DN XCT AK
YCATRCJ
Input specification:
The input starts with an integer N which represents the grid size (NXN). Next, N lines will follow where each line
represents a row of letters. Each line will have exactly N letters in them. The last line is the word you have to search in the
grid. The number of characters in the last line does not exceed N. You can assume that the value of N will not exceed
10000.
Output specification:
The output of your program is a single integer that represents the number of times the word is found in the grid.
Note: You must not print anything extraneous (such as “Please enter N" or “the result is").
Sample input:
Sample output:
3
4
WORD
OODW
RDRO
DWOD
WORD
12
АВА
BAB
АВА
АВ](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fdbde897b-b2e6-4656-8b76-823e7b1f9e2d%2F5c7aa5b3-7324-43a8-a7a5-fbdfee9678b2%2Ffx5u03q_processed.png&w=3840&q=75)
Transcribed Image Text:Problem specification:
In this assignment, you will search for a word in square sized grid of letters. You will
write a Java program that reads a grid of letters and a specified word from the user,
counts how many times the word appeared in the grid in horizontal orientation (from
left to right or from right to left), vertical orientation (from top to bottom or from
bottom to top) or diagonal orientation (from upper left to lower right, from lower right
to upper left, from upper right to lower left or from lower left to upper right) and prints
the total count. An example is shown here where the grid size is 7X7 and you can find
the word CAT in all possible orientations. Your program should print how many times
in total the specified word appeared in the grid in any of these orientations.
C
TGOCFX
A VAATAC
TUTC z P M
GDC ES TB
O HQ AATL
DN XCT AK
YCATRCJ
Input specification:
The input starts with an integer N which represents the grid size (NXN). Next, N lines will follow where each line
represents a row of letters. Each line will have exactly N letters in them. The last line is the word you have to search in the
grid. The number of characters in the last line does not exceed N. You can assume that the value of N will not exceed
10000.
Output specification:
The output of your program is a single integer that represents the number of times the word is found in the grid.
Note: You must not print anything extraneous (such as “Please enter N" or “the result is").
Sample input:
Sample output:
3
4
WORD
OODW
RDRO
DWOD
WORD
12
АВА
BAB
АВА
АВ
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 7 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
![Microsoft Visual C#](https://www.bartleby.com/isbn_cover_images/9781337102100/9781337102100_smallCoverImage.gif)
Microsoft Visual C#
Computer Science
ISBN:
9781337102100
Author:
Joyce, Farrell.
Publisher:
Cengage Learning,
![EBK JAVA PROGRAMMING](https://www.bartleby.com/isbn_cover_images/9781337671385/9781337671385_smallCoverImage.jpg)
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
![Microsoft Visual C#](https://www.bartleby.com/isbn_cover_images/9781337102100/9781337102100_smallCoverImage.gif)
Microsoft Visual C#
Computer Science
ISBN:
9781337102100
Author:
Joyce, Farrell.
Publisher:
Cengage Learning,
![EBK JAVA PROGRAMMING](https://www.bartleby.com/isbn_cover_images/9781337671385/9781337671385_smallCoverImage.jpg)
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT