Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
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

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
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 АВА АВ
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
steps

Step by step

Solved in 2 steps with 7 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Instruction Format
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
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS