Create records in a table - data structures, Database Management System

Assignment Help:

In this exercise you will create ten records, each containing the following fields: student name, class:  Freshman, Sophomore, Junior or Senior, Major:  Liberal Arts or General Science and ten randomly generated test scores between 0 and 100 for each student.  You will also incorporate the following calculated fields into your record:  Mean, median, mode and standard deviation.  Once record is prepared properly, you will insert it into a Binary Search Tree so that a list of students can be printed in ascending order by standard deviation.

Rules and definition of terms:

1. While the mean or standard deviation may be a floating point number, the grades MUST be integers.  Acceptable grades 89, 72, 91, etc.  Unacceptable grades 65.4, 38.7, etc. (you can not have a floated grade)

2. The mean is calculated by dividing the sum of the grades by the number of tests.  The result is often, but not always, floating point.

3. The median is the grade that is physically located in the middle of the ten grades.  This cannot be floating point.

4. The mode is the most commonly achieved grade; the one that appears more often.  There are problems with this however.  What happens if there is not common grade; that is, the grade does not appear more than once.  The mode would then be the average of all the grades.  What happens if there is more than one mode?  If the modes are physically adjacent to each other, then find their average.  If not, then you have a bimodal or, perhaps, multimodal situation.  List each mode.

5. The standard deviation requires some specialized math on your part.  Firstly, find the mean grade of the ten grades.  Secondly, subtract the mean from each grade.  Thirdly, square the differences and add them up.  Fourthly, divide this value by the number of tests and you will now have what is called "the mean squared deviation" or the variance.  Lastly, take the square root of the variance and you should now have the standard deviation.

6. Again, all of this information is placed into each record and then is displayed via Binary Search Tree.

To complete this work successfully, it must be GRAPHICAL with a nice G.Frame, must contain your source listing and executable file.  The names, classes and majors of your students are of your own choosing.  Test grades, of course, are randomly generated.


Related Discussions:- Create records in a table - data structures

State the two-way associations, Two-way Associations Mostly, associati...

Two-way Associations Mostly, associations are travel in both directions, although not usually with same frequency. There are three approaches for the implementation. In

What are the causes of bucket overflow in a hash file, What are the causes ...

What are the causes of bucket overflow in a hash file organization? What can be done to reduce the occurrence of bucket overflow? When a record is inserted, the bucket to that

A step-wise distributed database design methodology, A step-wise distribute...

A step-wise distributed database design methodology Following is a step-wise methodology for distributed database design. (1) Examine the nature of distribution. Find out wh

By which techniquestransaction processing is associated, By which technique...

By which techniquesTransaction processing is associated? Transaction processing is associated by producing detail, summary, or exception reports and recording a business activi

Lack of redundancy, Lack of Redundancy We have talked about the problems o...

Lack of Redundancy We have talked about the problems of repetition of information in a database. Such repetition should be stay away as much as possible. Let us state once again t

State the object design for processing, State the Object Design for Process...

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

What is bankers algorithm, What is banker's algorithm?  Banker's algori...

What is banker's algorithm?  Banker's algorithm is a deadlock avoidance algorithm that is applicable to a resource-allocation system with multiple instances of each resource ty

Explain outer join, Explain outer join? Outer Join - If there are any...

Explain outer join? Outer Join - If there are any values in one table which do not have corresponding value(s) in the other, in an equi-join which will not be chosen. Such ro

#, How to use Oracle

How to use Oracle

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