Write a c++ program that ask the user for a file with a letter matrix and...

Transcribed Image Text:

Write a c++ program that ask the user for a file with a letter matrix and a word to find in that matrix. The matrix file, the first line of the file is the number of rows and second line is the number of columns. When looking for a word in the matrix it should be case insensitive. Your program should then find a continuous path thought the matrix that spells the word. Your program should only move left (col -1), right (col +1), up (row -1) and down (row+1). If there is such a path in the matrix, that path should be printed to console, using 'V' for down, 'N' for up,'' for right, '<' for left, *' where the path ends and for all other positions in the matrix. and write it so it will use a stack and no recursion. You must write your own templated stack class that is implemented using a linked list. Your stack must have a peek, pop, push and isEmpty function. Your solution should not have any recursion. Examples 1 Name of the file with the matrix TestFile.txt PEH W V Z LLOB VLP V H HWQDO What word are you looking for hello 11 Example 2 Name of the file with the matrix TestFile.txt E H W V L L O B P Z V L P V H H W Q D O What word are you looking for beans No path found Write a c++ program that ask the user for a file with a letter matrix and a word to find in that matrix. The matrix file, the first line of the file is the number of rows and second line is the number of columns. When looking for a word in the matrix it should be case insensitive. Your program should then find a continuous path thought the matrix that spells the word. Your program should only move left (col -1), right (col +1), up (row -1) and down (row+1). If there is such a path in the matrix, that path should be printed to console, using 'V' for down, 'N' for up, '>' for right, '<' for left, *' where the path ends and for all other positions in the matrix. and write it so it will use a stack and no recursion. You must write your own templated stack class that is implemented using a linked list. Your stack must have a peek, pop, push and isEmpty function. Your solution should not have any recursion. Examples 1 Name of the file with the matrix TestFile.txt PEH W V Z LLOB VLP V H HWQDO What word are you looking for hello 11 Example 2 Name of the file with the matrix TestFile.txt E H W V L L O B P Z V L P V H H W Q D O What word are you looking for beans No path found Write a c++ program that ask the user for a file with a letter matrix and a word to find in that matrix. The matrix file, the first line of the file is the number of rows and second line is the number of columns. When looking for a word in the matrix it should be case insensitive. Your program should then find a continuous path thought the matrix that spells the word. Your program should only move left (col -1), right (col +1), up (row -1) and down (row+1). If there is such a path in the matrix, that path should be printed to console, using 'V' for down, 'N' for up,'' for right, '<' for left, *' where the path ends and for all other positions in the matrix. and write it so it will use a stack and no recursion. You must write your own templated stack class that is implemented using a linked list. Your stack must have a peek, pop, push and isEmpty function. Your solution should not have any recursion. Examples 1 Name of the file with the matrix TestFile.txt PEH W V Z LLOB VLP V H HWQDO What word are you looking for hello 11 Example 2 Name of the file with the matrix TestFile.txt E H W V L L O B P Z V L P V H H W Q D O What word are you looking for beans No path found Write a c++ program that ask the user for a file with a letter matrix and a word to find in that matrix. The matrix file, the first line of the file is the number of rows and second line is the number of columns. When looking for a word in the matrix it should be case insensitive. Your program should then find a continuous path thought the matrix that spells the word. Your program should only move left (col -1), right (col +1), up (row -1) and down (row+1). If there is such a path in the matrix, that path should be printed to console, using 'V' for down, 'N' for up, '>' for right, '<' for left, *' where the path ends and for all other positions in the matrix. and write it so it will use a stack and no recursion. You must write your own templated stack class that is implemented using a linked list. Your stack must have a peek, pop, push and isEmpty function. Your solution should not have any recursion. Examples 1 Name of the file with the matrix TestFile.txt PEH W V Z LLOB VLP V H HWQDO What word are you looking for hello 11 Example 2 Name of the file with the matrix TestFile.txt E H W V L L O B P Z V L P V H H W Q D O What word are you looking for beans No path found

Answer rating: 100% (QA)

include include include template class Stack private struct Node T data Node next NodeT val dataval ... View the full answer