DATA HANDLING Hi, I am Kartik and we know very much about the interesting chapter of maths “ Data Handling”. Let’s know more about it. . . Bar Graph
INTRODUCTION The collection, recording and presentation of data which helps us to organise our experiences is known as data handling. Pie Chart
ARITHMETIC MEAN The most common representative value of a group of data is the arithmetic mean. The average or arithmetic mean or simplify mean is defined as follows : Mean = sum of all observations number of observations
RANGE The difference between the highest and the lowest observations gives us the spread of the observations. It can be found by subtracting the lowest observation from the highest observation. It is known as range.
MODE The mode of a set of data is the value in the set that occurs most often. Example : The number of points scored in a series of football games is listed below. Which score occurred most often? 7, 13, 18, 24, 9, 3, 18 Solution: Ordering the scores from least to greatest, we get: 3, 7, 9, 13, 18, 18, 24 Answer: The score which occurs most often is 18.
MEDIAN It means the number in the middle of a distribution. And a distribution is a set of numbers for example : 24, 12, 32, 23, 43, 23, 43 The numbers have to be rearranged in order first In the above distribution, the median is 12, 23, 23, (24), 32, 43, 43
GRAPHS In mathematics, a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected objects are represented by mathematical abstractions called vertices, and the links.
BAR GRAPHS A graph consisting of parallel, usually vertical bars or rectangles with lengths proportional to the frequency with which specified quantities occur in a set of data. Also called bar chart.
PIE CHARTS A pie chart (or a circle graph) is a circular chart divided into sectors, illustrating proportion. In a pie chart, the arc length of each sector (and consequently its central angle and area), is proportional to the quantity it represents.
LINE GRAPHS In graph theory, the line graph L(G) of an undirected graph G is another graph L(G) that represents the adjacencies between edges of G. The name line graph comes from a paper by Harary & Norman (1960) although both Whitney (1932) and Krausz (1943) used the construction before this.