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 M

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
100%
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
```python
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
```python
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
```
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 ```python 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 ```python 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 ```
```python
def finish_eating(group, diner):
    """
    >>> din = make_diner("Foothill")
    >>> add_table(din)
    >>> g1 = make_group("Nick's Group")
    >>> serve(din, g1)
    >>> num_free_tables(din)
    0
    >>> finish_eating(g1, din)
    >>> num_free_tables(din)
    1
    >>> status(g1)
    'finished'
    >>> finish_eating(g1, din) # g1 has already finished eating so this should do nothing
    >>> num_free_tables(din)
    1
    >>> status(g1)
    'finished'
    """
    # *** YOUR CODE HERE ***
```

**Explanation:**

The function `finish_eating(group, diner)` is designed to set a group's status to 'finished' and free the table they were using, which allows the diner to have one more free table. If the status of the group is already 'finished', the function does nothing. This function is a part of the Group Abstract Data Type (ADT).

**Example Usage:**

1. A diner named "Foothill" is created.
2. A table is added to this diner.
3. A group named "Nick's Group" is created and served at the diner.
4. The number of free tables is initially zero after the group has been served.
5. After calling `finish_eating(g1, din)`, the number of free tables increases to one, and the group's status is set to 'finished'.
6. Re-calling `finish_eating(g1, din)` has no effect since the group's status is already 'finished'; thus, the number of free tables remains one.
Transcribed Image Text:```python def finish_eating(group, diner): """ >>> din = make_diner("Foothill") >>> add_table(din) >>> g1 = make_group("Nick's Group") >>> serve(din, g1) >>> num_free_tables(din) 0 >>> finish_eating(g1, din) >>> num_free_tables(din) 1 >>> status(g1) 'finished' >>> finish_eating(g1, din) # g1 has already finished eating so this should do nothing >>> num_free_tables(din) 1 >>> status(g1) 'finished' """ # *** YOUR CODE HERE *** ``` **Explanation:** The function `finish_eating(group, diner)` is designed to set a group's status to 'finished' and free the table they were using, which allows the diner to have one more free table. If the status of the group is already 'finished', the function does nothing. This function is a part of the Group Abstract Data Type (ADT). **Example Usage:** 1. A diner named "Foothill" is created. 2. A table is added to this diner. 3. A group named "Nick's Group" is created and served at the diner. 4. The number of free tables is initially zero after the group has been served. 5. After calling `finish_eating(g1, din)`, the number of free tables increases to one, and the group's status is set to 'finished'. 6. Re-calling `finish_eating(g1, din)` has no effect since the group's status is already 'finished'; thus, the number of free tables remains one.
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
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