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

Three level architecture of dbms-logical architecture, Three Level Architec...

Three Level Architecture of DBMS or Logical DBMS Architecture The logical architecture defines how data in the database is perceived by users. It is not deals with how the da

Calculate the joint probability, Consider the following frequency counts o...

Consider the following frequency counts of some itemsets in a transaction database r : freq({A}, r) = 0.405 freq({B}, r) = 0.510 freq({C}, r) = 0.303 freq({A

Create a e-r diagram or uml class diagram, We require an advanced system fo...

We require an advanced system for a Sports Centre, you are concerned only with representing the data discussed below about bookings and members. (The complete system may contain ot

I need web security expert, I need web security expert , website management...

I need web security expert , website management Project Description: i want professional for the below . website management server management database management

Fragmentation-design of distributed databases, Fragmentation: It is defini...

Fragmentation: It is definite as partitioning of a relation into various fragments.Every fragment can be stored at a dissimilar site.

Differences among the candidate keys and the primary key, Discuss the diffe...

Discuss the differences among the candidate keys and the primary key of a relation. Give instance to describe your answer? A candidate key is one that can be used as primary ke

Define the phases of two phase locking protocol, Define the phases of two p...

Define the phases of two phase locking protocol Growing phase: a transaction may get locks but not release any lock. Shrinking phase: a transaction might be release locks bu

Give example of relational schema, An instance of relational schema R (A, B...

An instance of relational schema R (A, B, C) has distinct values of A including NULL values. then A is a candidate key or not? If relational schema R (A, B, C) has distinct val

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