Class mid points and class interval or width, Mathematics

Assignment Help:

Class Mid points

This is very significant values which mark the center of a provided class. They are acquired by adding together the two limits of a provided class and dividing the result by 2.

Class interval or width

It is the difference between a lower class boundary and upper class boundary. The value normally measures the length of a provided class.

Age (yrs)

No. of Students (f)

mid points (x)

x-a = d

D/c = u

fu

15 - 19

21

17

-15

-3

-63

20 - 24

35

22

-10

-2

-70

25 - 29

38

27

-5

-1

-38

30 - 34

49

32(A)

0

0

0

35 - 39

31

37

+5

+

31

40 - 44

19

42

+10

+2

38

 

193

 

 

 

-102


Related Discussions:- Class mid points and class interval or width

Tower of hanoi, how to create an activity of tower of hanoi

how to create an activity of tower of hanoi

Find homeomorphisms - complex root, All numbers refer to exercises (and not...

All numbers refer to exercises (and not "computer exercises") in Gallian. §22: 8, 16, 22, 24, 28, 36. In addition: Problem 1: Let a be a complex root of the polynomial x 6 +

Find out the volume of the solid -y = (x -1) ( x - 3)2, Find out the volume...

Find out the volume of the solid obtained by rotating the region bounded by y = (x -1) ( x - 3) 2 and the x-axis about the y-axis. Solution Let's first graph the bounded r

Triangles are resolute, a) How many equivalence relations on {a, b, c, d, e...

a) How many equivalence relations on {a, b, c, d, e, f} have b)  How many arrangements are there of c)  How many triangles are resolute by the vertices of a regular polygon w

Concept, uses of maths concept

uses of maths concept

Prove - digraph of a partial order has no cycle more than 1, Prove that the...

Prove that the Digraph of a partial order has no cycle of length greater than 1. Assume that there exists a cycle of length n ≥ 2 in the digraph of a partial order ≤ on a set A

Dimensions and degree of an expression, Binomials, Trinomials and P...

Binomials, Trinomials and Polynomials which we have seen above are not the only type. We can have them in a single variable say 'x' and of the form x 2 + 4

Prove that prims algorithm produces a minimum spanning tree, Prove that Pri...

Prove that Prim's algorithm produces a minimum spanning tree of a connected weighted graph. Ans: Suppose G be a connected, weighted graph. At each iteration of Prim's algorithm

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