Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
You group has been hired by TrainingrUs.com to keeps track of training revenues. TrainingrUS.com wants you to keep scheduling.
COURSE table contains following information:
Note: Primary Key (PK) is COURSE ID
Identify FK, if any
TRAINEE table contains following information:
Note: PK is (Trainee ID, Course_ID)
Training session signed for is the same as Course ID in COURSE table
Following sample data is available:
COURSE Sample data
Course ID
Price ($)
Instructor Name
Instructor Address
S111
2850
Harry
UB
S121
3200
Polly
S145
1200
Smith
Loyola
H111
500
Morton
JHU
H123
2200
David
TRAINEE sample data
Trainee ID
Course_ID
Trainee Name
Date of training
A101
Sam Paper
10/02/2009
Sam paper
10/03/2009
A110
Mary Poppins
11/01/2009
B112
Alex Johnson
11/02/2009
11/06/2009
B222
John Watt
10/01/2009
10/05/2009
C111
Jong Chu
F456
Jerry Long
11/08/2009
F555
Willy Polk
X123
Shirley Dent
PART A:
Table 1 (identify PK and FK relationships)
Table Name
COURSE
TRAINING
Primary Key (PK)
Foreign Key (FK)
Submit this table as Part A (section 2) requirement to be submitted see below
PART B:
Develop the following queries in ACCESS and run (execute) them
1. List the course ID and its cost, format the output appropriately.2. Give the trainee name and the number of classes each trainee is taking.3. How many trainees are taking classes on November 6th? (Give a count)4. Give the training sessions and their dates (make sure there is no repetition of session and corresponding date).5. How many students are registered per training section?6. How many courses are there?7. How many classes John Watt is taking?8. Give the total amount paid by Willy Polk9. Give the names of instructors teaching on November 6th
What is a B+-Tree index? A B+-Tree index takes the form of a balanced tree in which each path from the root of the root of the root of the tree to a leaf of the tree is of the
Define blocks? The database system resides eternally on non-volatile storage, and is into fixed-length storage units known as blocks.
how design database from begining
List the steps for converting state diagram to the code. a) Finding major control path b) Finding the conditional statements c) Finding the loops d) Finding error ro
Give short note on the following terms:Dirty pages and ETL a.) Dirty pages. These are buffer pages which comprise modifications which haven't been written to disk. b.
NEED ER DIAGRAM WITH MINIMUM ENTITY AND RELATIONSHIP of Hospital Management System
.#question. Discuss the problem which may arise during concurrency control and recovery in distributed database which are not encountered in controlized database environment.
What is known as clustering file organization? In the clustering file organization, records of several dissimilar relations are stored in the similar file.
What is the difference between SQL Server 2000 clustered and nonclustered indexes? With a clustered index, the data are kept in the bottom level of the index and in the similar
Design a generalization–specialization hierarchy for a motor-vehicle sales company. The company sells motorcycles, passenger cars, vans, and buses. Justify your placement of attrib
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd