Example on relational database schema, Database Management System

Assignment Help:

Question:

The following relational database schema corresponds to a part of a database used by the Registry Department of a university.

DEPARTMENT (d#, d-name, head-of-dept)
MODULE (m#, m-name, m-level, d#)
CANDIDATE (c#, c-name, c-address)
RESULT (c#, m#, cw-grade, exam-grade, final-grade)

The following explanations are given for this schema:

(i) d# represents department number, m# represents module number, and c# represents candidate number;

(ii) d-name represents department name, m-name represents module name, and c-name represents candidate name;

(iii) each module is run by a particular department;

(iv) each module has a particular level associated with it, indicated by its m-level (level 1, level 2, or level 3);

(v) results achieved by a candidate for a particular module are recorded as coursework grade (cw-grade), exam grade (exam-grade) and overall grade (final-grade). The highest grade is 16.

Express the following queries firstly in Relational algebra and secondly in Relational Calculus:

(i) Find the names and numbers of those candidates who have achieved one or more final grade between 11 and 16.

(ii) Find the candidate number, module number and final grade for those candidates attending modules run by the departments named ‘Business' or ‘Computing'.

(iii) Find the numbers of those candidates who are not attending any level 3 module run by the department named ‘Computing'.

(iv) Find the numbers of those candidates who are attending all level 3 modules run by the department named ‘computing'.


Related Discussions:- Example on relational database schema

Secondary indexes, Secondary Indexes Let consider the student database ...

Secondary Indexes Let consider the student database and its clustering index and primary (only one will be applicable at a time). Now consider the state when the database is to

Implementing a data mining algorithm, i need to implememnt a treee based mi...

i need to implememnt a treee based mining algorithm. do you have an expert that can do that?

Creation of indexes, Creation of Indexes Automatically: When a primar...

Creation of Indexes Automatically: When a primary key or Unique constraint is show in a table definition then a unique index is formed automatically. Manually: User can

How can we classify the operations on classes, How can we Classify the oper...

How can we Classify the operations on classes  This step fundamentally means all three models functional, object and dynamic (studied in last section) must be combined so that

Explain what is aggregation, Explain what is Aggregation ? Aggregation...

Explain what is Aggregation ? Aggregation: This is used whenever we intend to show a relationship between an entity and the relationship. There is no provision for this in th

Which operator is cartesian product in relational algebra, Which operator i...

Which operator is Cartesian product in relational algebra? Cartesian product in relational algebra is a binary operator. (It requires two operands. e.g., P X Q)

Recovery concepts, recovey techniques based on deferred update and immediat...

recovey techniques based on deferred update and immediate update

What are the uses of the information in the data dictionary, What are the u...

What are the uses of the information in the Data dictionary? The following information is directly taken from the Data dictionary: Information on fields displayed with

Illustrate system design of an object oriented approach, System Design: An ...

System Design: An Object Oriented Approach Any software systems always try to change and evolve as technology and business rules evolve. The development of information systems

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