subject

In each of the following queries, use SQL to obtain the desired results using the data shown in the Colonial Preview the documentAdventure Tour DatabasePreview the document listing found on the homepage under the databases heading. Also, found there is a file containing the SQL commands needed to create the database in a DBMS such as MySQL. You might want to create the database to use when answering the questions. If so, just copy the commands and paste them into MySQL. You will have 3 attempts to get the activity correct and the computer will automatically grade your answers after each attempt. When an answer consists of more than one word be careful about spacing. Leave only one space between words and ooperators.
Give the SQL statement to list the trip name and state for each trip that occurs during one of the Fall seasons that is Early Fall, Spring and Late Fall. Sort by State. Use the wildcard for the season.
SELECT TripName, State
FROM Trip
WHERE Season
State;
Answer 1:
='Spring'
Answer 2:
ORDER BY TripName,
Give the SQL statement to display the number of trips that originate in Vermont (VT) or Connecticut (CT)??
SELECT
FROM Trip
WHERE ;
Answer 1:
COUNT(*)
Answer 2:
State='VT' or State='CT'
Give the SQL statement to display the number of reservations that include a trip with a price that is greater than or equal to $20 but less than or equal to $50.
SELECT
FROM
WHERE TripPrice ;
Answer 1:
COUNT(*)
Answer 2:
Reservation
Answer 3:
>= 20 AND TripPrice <= 50​​​​​​​

ansver
Answers: 1

Another question on Computers and Technology

question
Computers and Technology, 22.06.2019 12:40
How do i get the most points, without any effort?
Answers: 2
question
Computers and Technology, 22.06.2019 18:00
When is it appropriate to use an absolute reference
Answers: 1
question
Computers and Technology, 23.06.2019 10:20
Suppose there is a relation r(a, b, c) with a b+-tree index with search keys (a, b).1. what is the worst-case cost of finding records satisfying 10 < a < 50 using this index, in terms of the number of records n1, retrieved and the height h of the tree? 2. what is the worst-case cost of finding records satisfying 10 < a < 50 and 5 < b < 10 using this index, in terms of the number of records n2 that satisfy this selection, as well as n1 and h defined above? 3. under what conditions on n1 and n2, would the index be an efficient way of finding records satisfying the condition from part (2)?
Answers: 1
question
Computers and Technology, 24.06.2019 05:30
If you combine two cells into one, what action are you performing? a.  adding a new row or column      b.  splitting the cells      c.  removing a new row or column      d.  merging the cells
Answers: 2
You know the right answer?
In each of the following queries, use SQL to obtain the desired results using the data shown in the...
Questions
question
Mathematics, 07.05.2020 02:11
question
Mathematics, 07.05.2020 02:11
Questions on the website: 13722363