In this problem you will fill out three functions to complete the Group ADT and the Diner ADT. The goal is to organize how diners manage the groups that want to eat there and the tables where these groups sit. It is important to take the time to read through the docstrings and the doctests. Additionally, make sure to not violate abstraction barriers for other ADTS, i.e. when implementing functions for the Diner ADT, do not violate abstraction barriers for the Group ADT, and vice versa. # Diner ADT def make_diner (name): """ Diners are represented by their name and the number of free tables they have.""" return [name, 0] def num_free_tables (diner): return diner [1] def name (diner): return diner [0] # You will implement add_table and serve which are part of the Diner ADT # Group ADT def make_group (name): "Groups are represented by their name and their status.""* return [name, 'waiting'] def name (group): return group [0] def status (group): return group [1] def start_eating (group, diner): group [1] = 'eating' # You will implement finish_eating which is part of the Group ADT

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
In this problem you will fill out three functions to complete the Group ADT and the Diner ADT. The goal is to organize how
diners manage the groups that want to eat there and the tables where these groups sit.
It is important to take the time to read through the docstrings and the doctests. Additionally, make sure to not violate
abstraction barriers for other ADTS, i.e. when implementing functions for the Diner ADT, do not violate abstraction barriers for
the Group ADT, and vice versa.
# Diner ADT
def make_diner (name):
""" Diners are represented by their name and the number of free tables they have."""
return [name, 0]
def num_free_tables (diner):
return diner [1]
def name (diner):
return diner [0]
# You will implement add_table and serve which are part of the Diner ADT
# Group ADT
def make_group (name):
Groups are represented by their name and their status."""
return [name, 'waiting']
||||||
def name (group):
return group [0]
def status (group):
return group [1]
def start_eating (group, diner):
group [1] = 'eating'
# You will implement finish_eating which is part of the Group ADT
Map
Transcribed Image Text:In this problem you will fill out three functions to complete the Group ADT and the Diner ADT. The goal is to organize how diners manage the groups that want to eat there and the tables where these groups sit. It is important to take the time to read through the docstrings and the doctests. Additionally, make sure to not violate abstraction barriers for other ADTS, i.e. when implementing functions for the Diner ADT, do not violate abstraction barriers for the Group ADT, and vice versa. # Diner ADT def make_diner (name): """ Diners are represented by their name and the number of free tables they have.""" return [name, 0] def num_free_tables (diner): return diner [1] def name (diner): return diner [0] # You will implement add_table and serve which are part of the Diner ADT # Group ADT def make_group (name): Groups are represented by their name and their status.""" return [name, 'waiting'] |||||| def name (group): return group [0] def status (group): return group [1] def start_eating (group, diner): group [1] = 'eating' # You will implement finish_eating which is part of the Group ADT Map
Implement serve so that the diner uses one of its free tables to seat the group. If there are no free tables, return the string
'table not free'. If there are free tables, the group's status should be updated to 'eating' and the diner should have one less
free table. serve is part of the Diner ADT.
def serve (diner, group):
>>> din = make_diner("Cafe 3")
>>>add_table (din)
>>> g1 = make_group("Vandana's Group")
>>> g2= make_group("Shreya's Group")
>>> serve (din, g1)
>>>status (gl)
'eating'
>>> num_free_tables (din)
0
>>> serve (din, g2)
'table not free'
>>> status (g2)
'waiting'
I
"*** YOUR CODE HERE ***"
Maps
Transcribed Image Text:Implement serve so that the diner uses one of its free tables to seat the group. If there are no free tables, return the string 'table not free'. If there are free tables, the group's status should be updated to 'eating' and the diner should have one less free table. serve is part of the Diner ADT. def serve (diner, group): >>> din = make_diner("Cafe 3") >>>add_table (din) >>> g1 = make_group("Vandana's Group") >>> g2= make_group("Shreya's Group") >>> serve (din, g1) >>>status (gl) 'eating' >>> num_free_tables (din) 0 >>> serve (din, g2) 'table not free' >>> status (g2) 'waiting' I "*** YOUR CODE HERE ***" Maps
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Fibonacci algorithm
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