Consider an airport management system. Each airport has a unique id (e.g. Montreal:YUL). Let us introduce the types AIRPORT and CITY . We also introduce variable airports that contains associations between airport id’s and their corresponding host cities. A possible state of the system is shown below:airports ={YUL → Montreal,LCY → London_UKLHR → London_UK,MIL → Milan,SFO → San_Francisco,SDQ → Santo_Domingo}1. (PROGRAMMING) Define global variable airports in Common LISP and populate it with the above data. Demonstrate that the variable indeed contains the ordered pairs as shown above.2. Provide a declaration of variable monitored that holds all airport id’s.3. What kind of variable is airports? Provide a formal definition together with any and all applicable properties.4. Describe what data structure you would deploy to model variable airports. Note that you may not use a Dictionary. Should this be an ordered or an unordered structure? Discuss.5. Provide a formal specification of the state of the system in terms of a Z specification schema.6. Provide a schema for operation AddAirportOK that adds a new airport to the system. With the aid of success and error schema(s), provide a definition for operation AddAirport that the system will place in its exposed interface.  7.(PROGRAMMING) Define function AddAirport in Common LISP.8. Provide a schema for operation UpdateAirportOK that updates the host city of a given airport. With the aid of success and error schema(s), provide a definition for operation UpdateAirport that the system will place in its exposed interface.9. What would be the value of variable airports upon calling UpdateAirport(YUL, Dorval)?10. (PROGRAMMING) Define function UpdateAirport in Common LISP.11. Provide a schema for operation DeleteAirportOK that removes an airport from the system. With the aid of success and error schema(s), provide a definition for operation DeleteAirport that the system will place in its exposed interface.12. (PROGRAMMING) Define function DeleteAirport in Common LISP.13. Provide a schema for operation GetAllAirportsOK that returns all airports hosted by a given city. With the aid of success and error schema(s), provide a definition for operation GetAllAirports that the system will place in its exposed interface.14. (PROGRAMMING) Define function GetAllAirports in Common LISP.   (PLEASE ANSWER ALL. ALL OF THESE ARE CONNECTED. PLEASE PLEASE)

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
icon
Concept explainers
Question

Consider an airport management system. Each airport has a unique id (e.g. Montreal:YUL). Let us introduce the types AIRPORT and CITY . We also introduce variable airports that contains associations between airport id’s and their corresponding host cities. A possible state of the system is shown below:
airports =
{
YUL → Montreal,
LCY → London_UK
LHR → London_UK,
MIL → Milan,
SFO → San_Francisco,
SDQ → Santo_Domingo
}
1. (PROGRAMMING) Define global variable airports in Common LISP and populate it with the above data. Demonstrate that the variable indeed contains the ordered pairs as shown above.
2. Provide a declaration of variable monitored that holds all airport id’s.
3. What kind of variable is airports? Provide a formal definition together with any and all applicable properties.
4. Describe what data structure you would deploy to model variable airports. Note that you may not use a Dictionary. Should this be an ordered or an unordered structure? Discuss.
5. Provide a formal specification of the state of the system in terms of a Z specification schema.
6. Provide a schema for operation AddAirportOK that adds a new airport to the system. With the aid of success and error schema(s), provide a definition for operation AddAirport that the system will place in its exposed interface. 

7.(PROGRAMMING) Define function AddAirport in Common LISP.
8. Provide a schema for operation UpdateAirportOK that updates the host city of a given airport. With the aid of success and error schema(s), provide a definition for operation UpdateAirport that the system will place in its exposed interface.
9. What would be the value of variable airports upon calling UpdateAirport(YUL, Dorval)?
10. (PROGRAMMING) Define function UpdateAirport in Common LISP.
11. Provide a schema for operation DeleteAirportOK that removes an airport from the system. With the aid of success and error schema(s), provide a definition for operation DeleteAirport that the system will place in its exposed interface.
12. (PROGRAMMING) Define function DeleteAirport in Common LISP.
13. Provide a schema for operation GetAllAirportsOK that returns all airports hosted by a given city. With the aid of success and error schema(s), provide a definition for operation GetAllAirports that the system will place in its exposed interface.
14. (PROGRAMMING) Define function GetAllAirports in Common LISP.

 

(PLEASE ANSWER ALL. ALL OF THESE ARE CONNECTED. PLEASE PLEASE)

AI-Generated Solution
AI-generated content may present inaccurate or offensive content that does not represent bartleby’s views.
steps

Unlock instant AI solutions

Tap the button
to generate a solution

Knowledge Booster
Heuristic System
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