Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
3. Bobby and Jack like to play a guesting game called "Guess the food." First Bobby thinks of a food. Then Jack has to ask a set of questions to figure out what food Bobby picked. Each question asks about some food's characteristic, and then Bobby answers "yes" or "no." Jack: "Is the food crispy?" Bobby: "No" Jack: "Is the food sweet?" Bobby: "Yes" Jack: "Are there chocolate chips in the food?" Bobby: "Yes" Jack: "Is the food flat and round?" Bobby: "Yes" Jack: "Then I guess chocolate chip cookie." Bobby: "Correct!" The "viable set" is the set of all food items with characteristics consistent with Bobby's questions so far. Jack will keep asking questions until the viable set only has one food. At that point Jack makes his guess. In each question, Jack will pick a characteristic of the food in the viable set to ask about. He never asks the same characteristic twice. Given all of the food and their characteristics Bobby and Jack know, what is the maximum number of "yes" answers before Jack can guess? Utilize a hashtable in your solution. You can use Java STL hashtable, book codes can be copied to write the hashtable, cite your sources. No other plagiarism allowed. Submit your Java files. INPUT FORMAT The first line of input contains the number of food, (2

3. Bobby and Jack like to play a guesting game called "Guess the food." First Bobby thinks of a food. Then Jack has to ask a set of questions to figure out what food Bobby picked. Each question asks about some food's characteristic, and then Bobby answers "yes" or "no." Jack: "Is the food crispy?" Bobby: "No" Jack: "Is the food sweet?" Bobby: "Yes" Jack: "Are there chocolate chips in the food?" Bobby: "Yes" Jack: "Is the food flat and round?" Bobby: "Yes" Jack: "Then I guess chocolate chip cookie." Bobby: "Correct!" The "viable set" is the set of all food items with characteristics consistent with Bobby's questions so far. Jack will keep asking questions until the viable set only has one food. At that point Jack makes his guess. In each question, Jack will pick a characteristic of the food in the viable set to ask about. He never asks the same characteristic twice. Given all of the food and their characteristics Bobby and Jack know, what is the maximum number of "yes" answers before Jack can guess? Utilize a hashtable in your solution. You can use Java STL hashtable, book codes can be copied to write the hashtable, cite your sources. No other plagiarism allowed. Submit your Java files. INPUT FORMAT The first line of input contains the number of food, (2

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
Question

provide your own code, please

3. Bobby and Jack like to play a guesting game called "Guess the food." First Bobby thinks of a food. Then Jack has to ask a set of questions to figure out what food Bobby picked. Each question asks about some food's characteristic, and then Bobby answers "yes" or "no." Jack: "Is the food crispy?" Bobby: "No" Jack: "Is the food sweet?" Bobby: "Yes" Jack: "Are there chocolate chips in the food?" Bobby: "Yes" Jack: "Is the food flat and round?" Bobby: "Yes" Jack: "Then I guess chocolate chip cookie." Bobby: "Correct!" The "viable set" is the set of all food items with characteristics consistent with Bobby's questions so far. Jack will keep asking questions until the viable set only has one food. At that point Jack makes his guess. In each question, Jack will pick a characteristic of the food in the viable set to ask about. He never asks the same characteristic twice. Given all of the food and their characteristics Bobby and Jack know, what is the maximum number of "yes" answers before Jack can guess? Utilize a hashtable in your solution. You can use Java STL hashtable, book codes can be copied to write the hashtable, cite your sources. No other plagiarism allowed. Submit your Java files. INPUT FORMAT The first line of input contains the number of food, (2<N<1002<N<100). Each of the next N lines describes a food item. The line starts with the food name, then an integer K (1<K<1001<K<100), then K characteristics of that food. Food names and characteristics are strings, size 20 max. No two food items have exactly the same characteristics. OUTPUT FORMAT Output the maximum number of "yes" answers before game ends. SAMPLE INPUT: 4 cookie 2 sweet soft pizza 5 cheesy salty soft awesome saucy chips 3 cheesy salty crispy ramen 2 salty awesome SAMPLE OUTPUT: 3 In this example, Jack can ask a maximum of 3 "yes" questions, for example, to guess "pizza" or "chips"
Transcribed Image Text:3. Bobby and Jack like to play a guesting game called "Guess the food." First Bobby thinks of a food. Then Jack has to ask a set of questions to figure out what food Bobby picked. Each question asks about some food's characteristic, and then Bobby answers "yes" or "no." Jack: "Is the food crispy?" Bobby: "No" Jack: "Is the food sweet?" Bobby: "Yes" Jack: "Are there chocolate chips in the food?" Bobby: "Yes" Jack: "Is the food flat and round?" Bobby: "Yes" Jack: "Then I guess chocolate chip cookie." Bobby: "Correct!" The "viable set" is the set of all food items with characteristics consistent with Bobby's questions so far. Jack will keep asking questions until the viable set only has one food. At that point Jack makes his guess. In each question, Jack will pick a characteristic of the food in the viable set to ask about. He never asks the same characteristic twice. Given all of the food and their characteristics Bobby and Jack know, what is the maximum number of "yes" answers before Jack can guess? Utilize a hashtable in your solution. You can use Java STL hashtable, book codes can be copied to write the hashtable, cite your sources. No other plagiarism allowed. Submit your Java files. INPUT FORMAT The first line of input contains the number of food, (2<N<1002<N<100). Each of the next N lines describes a food item. The line starts with the food name, then an integer K (1<K<1001<K<100), then K characteristics of that food. Food names and characteristics are strings, size 20 max. No two food items have exactly the same characteristics. OUTPUT FORMAT Output the maximum number of "yes" answers before game ends. SAMPLE INPUT: 4 cookie 2 sweet soft pizza 5 cheesy salty soft awesome saucy chips 3 cheesy salty crispy ramen 2 salty awesome SAMPLE OUTPUT: 3 In this example, Jack can ask a maximum of 3 "yes" questions, for example, to guess "pizza" or "chips"
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 5 steps with 3 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Single Table
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
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