Create database for car application, Database Management System

Assignment Help:

The Database

MySQL scripts cars_for_sale.sql and car_details.sql containing the data to use for this task have been supplied. To complete this task, you need to first create a database called inb104 and two tables called cars_for_sale and car_details. how to enter data into the two tables by using the supplied scripts. (Note that the supplied scripts are not database 'dumps', so you cannot just 'import' the whole database. You need to manually set up the database first and then run the scripts.) The two tables you must create in the inb104 database must contain the following fields. For the cars_for_sale table:

CarId    VARCHAR(45)

make     VARCHAR(45)

model    VARCHAR(45)

 For the car_details  table:

 CarId       VARCHAR(45)

seriesyear   VARCHAR(45)

price             INT(11)

kilometres   VARCHAR(45)

color              VARCHAR(100)

transmission  VARCHAR(45)

CarId is the Primary Key for both tables.

As usual we have supplied Python 'question' template files for you to complete, containing unit tests that your functions must pass. You should rename these files, removing the "_Q" suffixes, and complete your solutions in the places indicated.

Specific Tasks

The specific things you must do to complete this portfolio task are as follows.

1.  Create a database named inb104 containing  two tables called cars_for_sale and car_details, as explained above, to import the data into.

2.  Import the  vehicle  data  via the  cars_for_sale.sql and  car_details.sql scripts.

3.  Write  a Python function named  top_N_makes(N)  that  extract the  number of occurrences of each make in the car dataset and prints the top N most frequent makes together with their corresponding number of occurrences, one make per line.  Parameter N indicates the number of makes to be printed. 

For example, if BMW appears in 100 rows in the table cars_for_sale, its frequency will be 100.  If BMW and KIA are the top two most frequent makes, occurring 100 and 89 times,  respectively, your function is expected to produce the following result for the function call top_N_makes(2).

>>> top_N_makes(2) 

BMW 100

KIA 89

Note that if more results are requested than there are distinct makes in the database then all makes must be listed.  Also note that if two makes have the same frequency of occurrence then they should appear alphabetically.


Related Discussions:- Create database for car application

Economics, Economics: It is now usually accepted that it costs less to make...

Economics: It is now usually accepted that it costs less to make a system of smaller computers with the equivalent power of a one large computer. It is more cost-effective to get s

What is deadlock, What is deadlock? How can it be avoided? How can it be re...

What is deadlock? How can it be avoided? How can it be resolved once it occurs? Deadlock happens when two transactions are each waiting on a resource that the other transaction

Implementation of integrity rules, Question 1 Describe the following- ...

Question 1 Describe the following- Clustering Indexing Question 2 Explain the following with suitable real time examples- Implementation of Integrity rules

Datawarehouse, How to define a job scheduling strategy that will meet busin...

How to define a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes? Show the job scheduling dependencies in a

Abstract data structures, The C_Artist  application will be developed using...

The C_Artist  application will be developed using the C language (C99 standards) and will be able to compile without warnings and link and run in the Swinburne computer laboratorie

Structure of distributed database, Structure Of Distributed Database: A di...

Structure Of Distributed Database: A distributed database system haves of a collection of sites, each of which keeps a local databases system. Every site is able to process local

Define deadlock term, a. Define the term "deadlock". There are four conditi...

a. Define the term "deadlock". There are four conditions that must hold before deadlock is possible. Name them. b. Outline an algorithm that detects whether there is a deadlock.

Write short notes on schema diagram, Write short notes on Schema diagram. ...

Write short notes on Schema diagram. A database schema along with primary key and foreign key dependencies can be depicted pictorially by schema diagram. Every relation appears

List two restrictions that are applied on the modification, List two restri...

List two restrictions that are applied on the modification (updation, insertion or deletion) of base tables through view.  Ans: The two restrictions are: 1. If a view

Write short notes on tuple relational calculus, Write short notes on tuple ...

Write short notes on tuple relational calculus. The tuple relational calculation is anon procedural query language. It defines the desired information without giving a particul

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd