Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

python question Files to submit: word_search_solver.py Requirements Submit only the files requested Print all real numbers to 2 decimal points unless stated otherwise Restrictions No

python question

Files to submit: word_search_solver.py

Requirements

Submit only the files requested

Print all real numbers to 2 decimal points unless stated otherwise

Restrictions

No global variables may be used

The only code that may appear outside of a function are function definitions and function calls

NEW: You may not import any modules

Description

Write a program called word_search_solver.py that finds all of the hidden words in a word search.

Input

Input will always be valid

Your program will be provided the name of a file that contains the word search

The word search file will be structured as follows

Number_of_rows Number_of_coulmns

The word search

A blank new line

The rest of the file is the words to find with one word to find per line

The word search and the words can be in any case but case should not matter when comparing

EX: cat and CAT are the same word

Additional Details

For each word that is in the word search your program should

Print out the name of that word and the start and end locations of the word

The first row is row 0 and the first column is column 0

Words should be displayed in alphabetical order

Words should be displayed in all caps

Examples

User input has underlined to help you differentiate what is user input and what is program output. You do not need to underline anything.

The file WordSearch1.txt contains the following

15 15 J H C J B E H U C Y M J A L Q N Q Q H K C B V T E X U F A E W O T A X E J K G N B P V M D C H C O U I R D P O F X X Z B Q M F R C P L P B H X K S L S H L I E A R F C Q V O H M D D K V F V P E A S Y Q P Z O J L H K Z N L T V G P C N G H D L R R Z V B S H D S M X Y T L B N A A R D A G G Q S I S D N A O Y F W O M W E I L P X J R Z Y D F C R W O S A U Z Y O T W K H M E E A L N C C G X L F B L Z F F S K Q I E L A R S S B X Z O H P D M J W Y C V D P A BOBCAT CAKE cat easy HONEY MASTERPIECE MONEY PEASY 

Example 1

Enter the name of the file that contains the word search: WordSearch1.txt BOBCAT starts at (2, 10) and ends at (7, 5) CAKE starts at (3, 2) and ends at (0, 5) CAT starts at (5, 7) and ends at (7, 5) EASY starts at (6, 5) and ends at (6, 8) HONEY starts at (4, 9) and ends at (0, 9) MASTERPIECE starts at (10, 5) and ends at (0, 5) MONEY starts at (10, 5) and ends at (14, 9) PEASY starts at (6, 4) and ends at (6, 8)

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Graph Databases New Opportunities For Connected Data

Authors: Ian Robinson, Jim Webber, Emil Eifrem

2nd Edition

1491930896, 978-1491930892

More Books

Students also viewed these Databases questions

Question

Why is the System Build Process an iterative process?

Answered: 1 week ago