get_points("safe", "loft") // => List(A,A,C,A) get_points("safe", "gate") // => List(A,C,A,C) get_points("safe", "star") // => List(C,A,P,A) get_points("safe", "sums") // => List(C,A,A,P) Create a function called get_points which calculates the returns ,as shown above in the tests, by comparing the second word with the first word. The get_points function should output a list of 4 elements of type Letter. if a letter is present in the first word and in the correct place it should return with a "C". If the letter is present but not in the right place it should be a "P". And if the letter is not in the hidden_word then it should an "A"  To do this you need to use the finder function to calculate if all the letters that are present in the first word ex. finder("safe", "loft") -> List(f) using the fix_spot function recursively analyse whether if the letter should be A,C or P. The finder function is a wrapper for the fix_spot function calling the fix_spot function with appropriate arguments. def finder(hidden_word: String, str: String) : List[Char] = def fix_spot(hidden_word: List[Char], str: List[Char], finder: List[Char]) : List[Letter] = def get_points(hidden_word: String, str: String) : List[Letter] =

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
icon
Related questions
Question

get_points("safe", "loft") // => List(A,A,C,A)
get_points("safe", "gate") // => List(A,C,A,C)
get_points("safe", "star") // => List(C,A,P,A)
get_points("safe", "sums") // => List(C,A,A,P)

Create a function called get_points which calculates the returns ,as shown above in the tests, by comparing the second word with the first word. The get_points function should output a list of 4 elements of type Letter.
if a letter is present in the first word and in the correct place it should return with a "C". If the letter is present but not in the right place it should be a "P".
And if the letter is not in the hidden_word then it should an "A" 

To do this you need to use the finder function to calculate if all the letters that are present in the first word
ex. finder("safe", "loft") -> List(f)

using the fix_spot function recursively analyse whether if the letter should be A,C or P. The finder function is a wrapper for the fix_spot function calling the fix_spot function with appropriate arguments.

def finder(hidden_word: String, str: String) : List[Char] =

def fix_spot(hidden_word: List[Char], str: List[Char], finder: List[Char]) : List[Letter] =

def get_points(hidden_word: String, str: String) : List[Letter] =

Expert Solution
steps

Step by step

Solved in 7 steps with 2 images

Blurred answer
Knowledge Booster
Concept of memory addresses in pointers
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.
Similar questions
  • SEE MORE QUESTIONS
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