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
Define physical and logical data independence. How does this architecture help in achieving these? Data independence entails that change in one view must not need a change in t
A database administrator''s responsibilities and data contents
Partial Key : It is a group of attributes that can uniquely identify small entities and that are related to same base entity. It is sometime named as Discriminator. Altern
Adding Redundant Associations for Efficient Access The expression redundant association means using "duplicate association for proficient access". While analysis, it is not a
State the Object Design for Processing The object design phase comes after analysis and system design phase. The object design phase includes implementation details like as i
Lossless-Join Decomposition Let us show an intuitive decomposition of a relation. We require a better basis for deciding decompositions since intuition may not always be r
Define Atom of domain relational calculus An atom has the outline 1 , x 2 , ... , x n > -> r , in which r stands for a relation on n attributes and x 1 , x 2 , ... , x n ar
List and also explain the dissimilar stages of DDLC ?
3NF Normal Form A relation schema R is in 3NF if it is in 2NF and for each FD X A either of the following is true X is a Super-key of R. A is a prime attribute of R
What is recursive closure? Why is it not possible to describe this operation in relational algebra? Recursive closure is applied to recursive relationship. An instance of rec
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