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.

Posted Date: 3/1/2013 6:35:09 AM | Location : United States

Ask an Expert

Related Discussions:- Create records in a table - data structures, Assignment Help, Ask Question on Create records in a table - data structures, Get Answer, Expert's Help, Create records in a table - data structures Discussions

Write discussion on Create records in a table - data structures
Your posts are moderated

Write your message here..

Related Questions

State the design of associations, State the Design of Associations Bef... State the Design of Associations Before designing associations, it is essential to know the way they are used. For this, analysis of association traversals is required. It is

single products ordered, For Colorado customers calculate the number of si... For Colorado customers calculate the number of single products ordered. If a product is purchased on multiple orders, it should be counted only single time. The result should conta

Explain two phase locking protocol, Explain Two phase locking protocol ... Explain Two phase locking protocol A transaction is consider as to follow the two-phase locking protocol if all locking operations precede the first unlock operation in the tra

Support by adding indexes, Support by Adding Indexes Multiple indexes c... Support by Adding Indexes Multiple indexes can be used to access a data file by multiple access paths. In such a scheme only single copy of the data is consider, only the numbe

What are the different kinds of database end users, What are the different ... What are the different kinds of database end users? Discuss the major activities of each? End-Users - End-users are the people whose jobs need access to the database for que

Determine the statement- state as location within a program, State as Locat... State as Location within a Program In this traditional approach, location of control inside a program totally defines the program state. Any finite state machine may be implem

Attribute inheretence, a brief definition a brief definition

Define an operator that a relational algebra does not have, Define an opera... Define an operator that a Relational Algebra does not have Ans: Relational Algebra does not have Aggregation operators.

Components of a typical database environment, Question: (a) List four d... Question: (a) List four disadvantages of the File Processing System as compared to the Database Systems. (b) The integrity of a database is enforced by integrity rules. One

Write short notes on schema diagram, Write short notes on Schema diagram.  ... Write short notes on Schema diagram.  A database schema along with primary key and foreign key dependencies can be depicted pictorially by schema  diagram. Every relation appea