Dictionary Walk Program Using Java, write a program which takes two words as inputs and walks through the dictionary and creates a list of words between them. Two words are “adjacent” if you can change one word into the other by adding, deleting, or changing a single letter. A “word list” is an ordered list of unique words where successive words are adjacent. Use the official Scrabble word list as your dictionary of valid words. Examples: hate → love: hate, have, hove, love dogs → wolves: dogs, does, doles, soles, solves, wolves man → woman: man, ran, roan, roman, woman flour → flower: flour, lour, dour, doer, dower, lower, flower Questions What is the shortest list between “crawl” and “run”? What is the shortest list between “mouse” and “elephant”? Does your program necessarily return the shortest list? What assumptions did you make in your program? How did you test your program? What is the Big-O complexity of your program? Additional Questions, answer three Suppose each letter had a point value. Discuss (but don’t code) how your algorithm would change if you wanted to find the list with the lowest possible point total. Sometimes the shortest list isn’t unique. Discuss (but don’t code) how your algorithm would change if you needed to return all of the shortest list between two words. Discuss (don’t code) how you might change your program if your concern was minimizing memory usage. Discuss (don’t code) how you might change your program if your concern was minimizing CPU time. Discuss (don’t code) how you might change your program if your concern was minimizing programmer time. Discuss (but don’t code) how your algorithm would change if you wanted to find the longest list between two words.

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

Related questions

Concept explainers

Question

100%

Dictionary Walk Program Using Java, write a program which takes two words as inputs and walks through the dictionary and creates a list of words between them. Two words are “adjacent” if you can change one word into the other by adding, deleting, or changing a single letter. A “word list” is an ordered list of unique words where successive words are adjacent. Use the official Scrabble word list as your dictionary of valid words. Examples: hate → love: hate, have, hove, love dogs → wolves: dogs, does, doles, soles, solves, wolves man → woman: man, ran, roan, roman, woman flour → flower: flour, lour, dour, doer, dower, lower, flower Questions What is the shortest list between “crawl” and “run”? What is the shortest list between “mouse” and “elephant”? Does your program necessarily return the shortest list? What assumptions did you make in your program? How did you test your program? What is the Big-O complexity of your program? Additional Questions, answer three Suppose each letter had a point value. Discuss (but don’t code) how your algorithm would change if you wanted to find the list with the lowest possible point total. Sometimes the shortest list isn’t unique. Discuss (but don’t code) how your algorithm would change if you needed to return all of the shortest list between two words. Discuss (don’t code) how you might change your program if your concern was minimizing memory usage. Discuss (don’t code) how you might change your program if your concern was minimizing CPU time. Discuss (don’t code) how you might change your program if your concern was minimizing programmer time. Discuss (but don’t code) how your algorithm would change if you wanted to find the longest list between two words.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

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.

Similar questions