Professional Documents
Culture Documents
Descriptive Statistics
A classified statistical data may sometimes be described as distributed around some value
called the central value or average is some sense. It gives the most representative value of the
entire data. Different methods give different central values and are referred to as the measures
of central tendency.
Thus, the most important objective of statistical analysis is to determine a single value that
represents the characteristics of the entire raw data. This single value representing the entire
data is called ‗Central value ‘or an average‘. This value is the point around which all other
values of data cluster. Therefore, it is known as the measure of location and since this value is
located at central point nearest to other values of the data it is also called as measures of
central tendency.
Different methods give different central values and are referred as measures of central
tendency. The common measures of central tendency are a) Mean b) Median c) Mode.
These values are very useful not only in presenting overall picture of entire data, but also for
the purpose of making comparison among two or more sets of data.
2. It is rigidly defined.
4. What is Geometric Mean (GM) and state its merits and demerits. (Jan 2015)
(3,6Marks)
The GM is nth root of product of quantities of the series. It is observed by multiplying the
values of items together and extracting the root of the product corresponding to the number of
items. Thus, square root of the products of two items and cube root of the products of the
three items are the Geometric Mean.
In the field of business management various problems often arise relating to average
percentage rate of change over a period of time. In such cases, the arithmetic mean is not an
appropriate average to employ, so, that we can use geometric mean in such case. GM are
highly useful in the construction of index numbers
Merits of GM
a. It is based on all the observations in the series.
b. It is rigidly defined.
Demerits of GM
a. It is not simple to understand.
10. What is Standard Deviation? List the merits and demerits. (July 2014) (6Marks)
Standard deviation is the root of sum of the squares of deviations divided by their numbers. It
is also called ‘Mean error deviation’. It is also called mean square error deviation (or) Root
mean square deviation. It is a second moment of dispersion. Since the sum of squares of
deviations from the mean is a minimum, the deviations are taken only from the mean (But not
from median and mode).
The standard deviation is Root Mean Square (RMS) average of all the deviations from the
mean. It is denoted by sigma
Merits
1. It is based on all observations.
11. What do you mean by Central tendency? What are the different measures of it? List
the pre-requisites of good measures of central tendency? (Dec 2018/Jan 2019)(10
Marks)
UNIT 2
Regression analysis is a statistical process for estimating the relationships among variables.
It includes many techniques for modelling and analysing several variables, when the focus is
on the relationship between a dependent variable and one or more independent variables (or
'predictors'). More specifically, regression analysis helps one understand how the typical
value of the dependent variable (or 'criterion variable') changes when any one of the
independent variables is varied, while the other independent variables are held fixed. Most
commonly, regression analysis estimates the conditional expectation of the dependent
variable given the independent variables – that is, the average value of the dependent variable
when the independent variables are fixed. Less commonly, the focus is on a quintile, or
DEPT.OF MBA/SJBIT Page 5
BSA 18MBA14
other location parameter of the conditional distribution of the dependent variable given the
independent variables. In all cases, the estimation target is a function of the independent
variables called the regression function. In regression analysis, it is also of interest to
characterize the variation of the dependent variable around the regression function which can
be described.
Whereas, in the case of a partial correlation we study more than two variables, but consider
only two among them that would be influencing each other such that the effect of the other
influencing variable is kept constant. Such as, in the above example, if we study the
relationship between the yield and fertilizers used during the periods when certain average
temperature existed, then it is a problem of partial correlation.
UNIT-3
Probability Distribution
For example, if two coins are flipped the chance of both being heads is .
4. Explain i) Mutually exclusive events ii)not mutually exclusive events (Jan 2014) (8
Marks)
sided die is
For example, when drawing a single card at random from a regular deck of cards, the chance
of getting a heart or a face card (J,Q,K) (or one that is both) is ,
because of the 52 cards of a deck 13 are hearts, 12 are face cards, and 3 are both: here the
possibilities included in the "3 that are both" are included in each of the "13 hearts" and the
"12 face cards" but should only be counted once.
Conditional probability is the probability of some event A, given the occurrence of some
For example, in a bag of 2 red balls and 2 blue balls (4 balls in total), the probability of taking
a red ball is ; however, when taking a second ball, the probability of it being either a red
ball or a blue ball depends on the ball previously taken, such as, if a red ball was taken, the
probability of picking a red ball again would be since only 1 red and 2 blue balls would
have been remaining.
Describes the probability of an event, based on conditions that might be related to the event.
For example, suppose one is interested in whether Addison has cancer. Furthermore, suppose
that Addison is age 65. If cancer is related to age, information about Addison's age can be
used to more accurately assess his or her chance of having cancer using Baye’s' Theorem.
Where A and B are events.
Where
The normal distribution is remarkably useful because of the central limit theorem. In its most
general form, under mild conditions, it states that averages of random variables independently
drawn from independent distributions are normally distributed. Physical quantities that are
expected to be the sum of many independent processes (such as measurement) often have
distributions that are nearly normal.[3] Moreover, many results and methods (such as
propagation and least squares parameter fitting) can be derived analytically in explicit form
when the relevant variables are normally distributed.
10. List out the classification of probability distribution? ?(June /July 2019)(3 marks)
1.What are the objectives of time series Analysis? Brief about components of time series
?(Dec 2018/Jan 2019)(7marks)
Description
Explanation
Prediction
Control
Description
The first step in the analysis is to plot the data and obtain simple descriptive measures (such
as plotting data, looking for trends, seasonal fluctuations and so on) of the main properties of
the series
Explanation
Observations were taken on two or more variables, making possible to use the variation in
one time series to explain the variation in another series. This may lead to a deeper
understanding. Multiple regression model may be helpful in this case.
Prediction
Given an observed time series, one may want to predict the future values of the series. It is an
important task in sales of forecasting and is the analysis of economic and industrial time
series. Prediction and forecasting used interchangeably.
Control
When time series generated to measure the quality of a manufacturing process (the aim may
be) to control the process. Control procedures are of several different kinds. In quality
control, the observations are plotted on a control chart and the controller takes action as a
result of studying the charts. A stochastic model is fitted to the series. Future values of the
series are predicted and then the input process variables are adjusted so as to keep the process
on target.
Trend
Seasonal Variations
Cyclic Variations
2.Bring out the utility of time series analysis?(Dec 2018/Jan 2019)(3 marks)
UNIT– 5
Linear Programming
2. Explain briefly the Structure of linear program model. (July 2014) (6 Marks)
The general structure of the Linear Programming model essentially consists of three
Components.
i) The activities (variables) and their relationships
ii) The objective function and
iii) The constraints
The activities are represented by X1 X2, X3 ……..Xn.
These are known as Decision variables.
The constraints: These are the set of linear inequalities and/or equalities which impose
restriction of the limited resource
to deviate from the optimal path, Linear Programming can quite easily evaluate the associated
costs or penalty.
5. Focus on Grey-Areas. Highlighting of grey areas or bottlenecks in the production process
is the most significant merit of Linear Programming. During the periods of bottlenecks,
imbalances occur in the production department. Some of the machines remain idle for long
periods of time, while the other machines are unable toffee the demand even at the peak
performance level.
6. Flexibility. Linear Programming is an adaptive & flexible mathematical technique and
hence can be utilized in analyzing a variety of multi-dimensional problems quite successfully.
7. Creation of Information Base. By evaluating the various possible alternatives in the light
of the prevailing constraints, Linear Programming models provide an important database
from which the allocation of precious resources can be don rationally and judiciously.
technique of LP would loosen its effectiveness and may fail to provide optimal solutions to
the problem.
However, in real life practical situations often it is not possible to determine the coefficients
of objective function and the constraints equations with absolute certainty. These variables in
fact may, lie on a probability distribution curve and hence at best, only the Iikelil1ood of their
occurrence can be predicted. Move over, often the value’s change due to extremely as well as
internal factors during the period of study. Due to this, the actual applicability of Linear
Programming tools may be restricted.
3. No Scope for Fractional Value Solutions.
There is absolutely no certainty that the solution to a LP problem can always be quantified as
an integer quite often, Linear Programming may give fractional-varied answers, which are
rounded off to the next integer. Hence, the solution would not be the optimal one. For
example, in finding out 'the pamper of men and machines required to perform a particular
job, a fractional Larson-integer solution would be meaningless.
4. Degree Complexity.
Many large-scale real life practical problems cannot be solved by employing Linear
Programming techniques even with the help of a computer due to highly complex and
Lengthy calculations. Assumptions and approximations are required to be made so that $e,
given problem can be broken down into several smaller problems and, then solve separately.
Hence, the validity of the final result, in all such cases, may be doubtful
5. Multiplicity of Goals.
The long-term objectives of an organisation are not confined to a single goal. An
organisation, at any point of time in its operations has a multiplicity of goals or the goals
hierarchy - all of which must be attained on a priority wise basis for its long term growth.
Some of the common goals can be Profit maximization or cost minimization, retaining
market share, maintaining leadership position and providing quality service to the consumers.
In cases where the management has conflicting, multiple goals, Linear Programming model
fails to provide an optimal solution. The reason being that under Linear Programming
techniques, there is only one goal which can be expressed in the objective function. Hence in
such circumstances, the situation or the given problem has to be solved by the help of a
different mathematical programming technique called the "Goal Programming".
6. Flexibility.
Once a problem has been properly quantified in terms of objective function and the constraint
equations and the tools of Linear Programming are applied to it, it becomes very difficult to
incorporate any changes in the system arising on account of any change in the decision
parameter. Hence, it lacks the desired operational flexibility.
The Transportation problem is one of the subclasses of linear programming problem where
the objective is to transport various quantities of a single homogeneous product that are
initially stored at various origins, to different destinations in such a way that the total
transportation is minimum.
F.I. Hitchaxic developed the basic transportation problem in 1941. However it could be
solved for optimally as an answer to complex business problem only in 1951, when George
B. Danzig applied the concept of Linear Programming in solving the Transportation models.
7. List the different Methods of finding initial basic feasible solution. (June 2014) (3
Marks)
The solution algorithm to a transpiration problem can be summarized into following steps:
i. North West Corner Rule (NWCR)
9. Explain briefly the steps involved in Modified Distribution Method (MODI). (Jan 14)
It is a method for computing optimum solution of a transportation problem.
STEPS
Step 1
Determine an initial basic feasible solution using any one of the three methods given below:
• North West Corner Rule
• Matrix Minimum Method
• Vogel Approximation Method
Step 2
Determine the values of dual variables, ui and vj, using ui + vj = cij
Step 3
Compute the opportunity cost using cij – ( ui + vj ).
Step 4
Check the sign of each opportunity cost. If the opportunity costs of all the unoccupied cells
are either positive or zero, the given solution is the optimum solution. On the other hand, if
one or more unoccupied cell has negative opportunity cost, the given solution is not an
optimum solution and further savings in transportation cost are possible.
Step 5
Select the unoccupied cell with the smallest negative opportunity cost as the cell to be
included in the next solution.
Draw a closed path or loop for the unoccupied cell selected in the previous step. Please note
that the right angle turn in this path is permitted only at occupied cells and at the original
unoccupied cell.
Step 7
Assign alternate plus and minus signs at the unoccupied cells on the corner points of the
closed path with a plus sign at the cell being evaluated.
Step 8
Determine the maximum number of units that should be shipped to this unoccupied cell. The
smallest value with a negative position on the closed path indicates the number of units that
can be shipped to the entering cell. Now, add this quantity to all the cells on the corner points
of the closed path marked with plus signs and subtract it from those cells marked with minus
signs. In this way an unoccupied cell becomes an occupied cell.
Step 9
Repeat the whole procedure until an optimum solution is obtained.
10. What is Degeneracy? (June 2015)
In a transportation problem, degeneracy occurs when the number of Allocations are less than
(Rows +Columns – 1), where
M= number of rows
N=number of columns
This is also called as Rim condition. If rim condition is satisfied, the solution is not
degenerate. But if number of allocations are less than (m + n – 1), then the solution is
degenerate. To remove degeneracy, we need to take Epsilon Є which is an imaginary
allocation almost equal to zero.
12. Explain briefly the steps involved in Hungarianmethod (June 2013) (3 Marks)
Step 1.Determine the cost table from the given problem.
(i) If the no. of sources is equal to no. of destinations, go to step 3.
(ii) If the no. of sources is not equal to the no. of destination, go to step2.
Step 2.Add a dummy source or dummy destination, so that the cost table becomes a square
matrix. The cost entries of the dummy source/destinations are always zero.
Step 3.Locate the smallest element in each row of the given cost matrix and then subtract the
same from each element of the row.
Step 4.In the reduced matrix obtained in the step 3, locate the smallest element of each
column and then subtract the same from each element of that column. Each column and row
now have at least one zero.
Step 5.In the modified matrix obtained in the step 4, search for the optimal assignment as
follows :(a) Examine the rows successively until a row with a single zero is found. En
rectangle this row () and cross off (X) all other zeros in its column. Continue in this manner
until all the rows have been taken care of.
(b) Repeat the procedure for each column of the reduced matrix.
(c) If a row and/or column have two or more zeros and one cannot be chosen by inspection
then assign arbitrary any one of these zeros and cross off all other zeros of that row / column.
(d) Repeat (a) through (c) above successively until the chain of assigning () or cross (X) ends.
Step 6. If the number of assignment () is equal to n (the order of the cost matrix), an optimum
solution is reached.
If the number of assignment is less than n(the order of the matrix), go to the next step.
Step7. Draw the minimum number of horizontal and/or vertical lines to cover all the zeros
of the reduced matrix.
Step 8.Develop the new revised cost matrix as follows:
(a)Find the smallest element of the reduced matrix not covered by any of the lines.
(b)Subtract this element from all uncovered elements and add the same to all the elements
laying at the intersection of any two lines.
15.Bring out the special cases in linear programming problem, With illustration.
(June/July)(7 marks)
Infeasible solution
Unbounded solution
Degenerated solution
identified through its graph. For example, let us consider the following linear programming
problem.
Minimize z = 200x1 + 300x2
subject to
2x1 +3x2 ≥1200
x1 +x2 ≤ 400
2x1 + 1.5x2 ≥ 900
x1, x2 ≥ 0
The region located on the right of PQR includes all solutions, which satisfy the first and the
third constraints. The region located on the left of ST includes all solutions, which satisfy the
second constraint. Thus, the problem is infeasible because there is no set of points that satisfy
all the three constraints.
3.. Unbounded Solutions
It is a solution whose objective function is infinite. If the feasible region is unbounded then
one or more decision variables will increase indefinitely without violating feasibility, and the
value of the objective function can be made arbitrarily large. Consider the following model:
Minimize z = 40x1 + 60x2
subject to
2x1+x2 ≥70
x1 +x2 ≥40
x1 + 3x2 ≥ 90
x1, x2 ≥ 0
The point (x1, x2) must be somewhere in the solution space as shown in the figure by shaded
portion.
The three extreme points (corner points) in the finite plane are:
P = (90, 0); Q = (24, 22) and R = (0, 70) The values of the objective function at these
extreme points are: Z(P) = 3600, Z(Q) = 2280 and Z(R) = 4200.
In this case, no maximum of the objective function exists because the region has no boundary
for increasing values of x1 and x2. Thus, it is not possible to maximize the objective function
in this case and the solution is unbounded.
UNIT-6
Project Management
different, and as such requires the development of distinct technical skills and management
strategies.
The critical path method (CPM) is a project modelling technique developed in the late 1950s
by Morgan R. Walker of DuPont and James E. Kelley, Jr. of Remington Rand.Kelley and
Walker related their memories of the development of CPM in 1989 Kelley attributed the term
"critical path" to the developers of the Program which was developed at about the same time
by Booz Allen Hamilton and the U.S. Navy. The precursors of what came to be known as
Critical Path were developed and put into practice by DuPont between 1940 and 1943 and
contributed to the success of the Manhattan Project.
CPM is commonly used with all forms of projects, including construction, aerospace and
defence, software development, research projects, product development, engineering, and
plant maintenance, among others. Any project with interdependent activities can apply this
method of mathematical analysis. Although the original CPM program and approach is no
longer used, the term is generally applied to any approach used to analyze a project network
logic diagram.
4. Write a note on Dummy Activity, Event and Network. (Jan 2014) (6 Marks)
• Event
• Network
– Shows the sequential relationships among activities using nodes and arrows
Activity-on-node (AON)
Arrows represent activities and nodes are events for points in time
– Pessimistic time (tp ) - the time the activity would take if things did not go well
– Most likely time (tm ) - the consensus best estimate of the activity’s duration
– Optimistic time (to ) - the time the activity would take if things did go well
PERT analysis
Analyze the paths through the network and find the critical path.
The length of the critical path is the mean of the project duration probability
distribution which is assumed to be normal
The standard deviation of the project duration probability distribution is computed by
adding the variances of the critical activities (all of the activities that make up the
critical path) and taking the square root of that sum
Probability computations can now be made using the normal distribution table.
• Crashing
Crash time
– An amount of time an activity is reduced
• Crash cost
– cost of reducing activity time
• Goal
– reduce project duration at minimum cost
9. What are the Differences between CPM and PERT.? (June 2014)
CPM PERT