PONJESLY COLLEGE OF ENGINEERING

INTERNAL ASSESSMENT-1 (2018-2019)

MBA STATISTICS FOR MANAGEMENT (BA 5106) MARKS-70

PART-A

Answer all the questions: (9x2=18)

1. Define regression:

2. What are the uses of time series analysis?

3. Define scatter diagram:

4. What are the properties of correlation coefficient:

5. What is curve of regression:

6. What are the components of time series?

7. What are the normal equations of a parabola?

8. Define rank correlation:

9. Write the spearman’s coefficient of rank correlation:

PART-B

Answer all the questions: (4x13=52)

1. Calculate the coefficient of correlation and obtain the lines of regression for the following:

X: 1 2 3 4 5 6 7 8 9

Y: 9 8 10 12 11 13 14 16 15

Obtain the estimate of Y which should which correspond to the value X=6.2

2. The prices of a commodity during 1993-98 are given below. Fit a parabola 𝒚 = 𝒂 + 𝒃𝒙 + 𝒄𝒙𝟐 to

these data. Calculate the trend values. Estimate the price of the commodity for the year 1999.

Year : 1993 1994 1995 1996 1997 1998

Price : 100 107 128 140 181 192

3. Ten competition in a beauty contest are ranked by three judges in the following order.

A : 1 6 5 10 3 2 4 9 7 8

B : 3 5 8 4 7 10 2 1 6 9

C : 6 4 9 8 1 2 3 10 5 7

Find which pair of judges have the nearest approach to common taste of beauty.

4. The following are the annual profits in thousands of rupees in a business

Year : 1971 1972 1973 1974 1975 1976

Profit (in Rs‘000) : 83 92 71 90 169 191

Calculate trend values by method of least squares. Also estimate the profit for the year 1979?
 PONJESLY COLLEGE OF ENGINEERING

INTERNAL ASSESSMENT-1 (2018-2019)

MBA STATISTICS FOR MANAGEMENT (BA 5106) MARKS-70

PART-A

Answer all the questions: (9x2=18)

1. Write any two uses of regression analysis:

2. Define time series analysis:

3. Define scatter diagram:

4. What are the properties of correlation coefficient:

5. What is curve of regression:

6. What are the components of time series?

7. What is the “line of best fit”

8. What are the normal equations of a straight line trend?

9. Write the rank correction coefficient formula when there is repeated ranks:

PART-B

Answer all the questions: (4x13=52)

1. The following table gives the profits of a concern for five years ending 1983.

Year : 1979 1980 1981 1982 1983

Profits : 1.6 4.5 13.8 40.2 125.0

Fit a curve for 𝒚 = 𝒂𝒃𝒙

2. The following data relate to marketing expenditure in lakhs of rupees and the corresponding

sales of a product in crores of rupees. Estimate the marketing expenditure to attain a sales

target of Rs.40 crores:

Marketing Expenditure : 10 12 15 20 23

Product sales : 14 17 23 21 25

Also find the coefficient of correlation between marketing expenditure and sales.

3. Fit a second degree polynomial equation for the following data:

Year : 1976 1977 1978 1979 1980 1981 1982 1983 1984

Sales : 50 65 70 85 82 75 65 90 95

4. The following are the ranks obtained by 10 students in Statistics and Mathematics. To what

extent is knowledge of students in statistics related to knowledge in mathematics?

Statisics : 1 2 3 4 5 6 7 8 9 10

Mathematics : 2 4 1 5 3 9 7 10 6 8
 PONJESLY COLLEGE OF ENGINEERING
INTERNAL ASSESSMENT-1 (2018-2019)
ME - CN APPLIED MATHEMATICS FOR COMMUNICATION ENGINEERS(MA5154) MARKS-68
PART-A

Answer all the questions: (10x2=20)

1. Define surplus variables:
2. Define feasible solution:
3. What are the properties of Linear programming model?
4. Define convex region:
5. Define degenerate basic solution:
6. What are the characteristics of standard form:
7. What are the different types of solution of a Linear programming problem:
8. What are the characteristics of canonical form:
9. Define slack variables:
10. Define optimal solution:
PART-B
Answer all the questions: (3x16=48)
1. Solve the following L.P.P by graphical method: Max 𝒛 = 𝒙𝟏 − 𝟐𝒙𝟐 subject to
constraints −𝒙𝟏 + 𝒙𝟐 ≤ 𝟏, 𝟔𝒙𝟏 + 𝟒𝒙𝟐 ≥ 𝟐𝟒, 𝟎 ≤ 𝒙𝟏 ≤ 𝟓, 𝟐 ≤ 𝒙𝟐 ≤ 𝟒 where the
restrictions are 𝒙𝟏 , 𝒙𝟐 ≥ 𝟎
2. Solve the following L.P.P by graphical method: Max 𝒛 = 𝟏𝟎𝟎𝒙𝟏 + 𝟒𝟎𝒙𝟐 subject to
constraints 𝟓𝒙𝟏 + 𝟐𝒙𝟐 ≤ 𝟏𝟎𝟎𝟎, 𝟑𝒙𝟏 + 𝟐𝒙𝟐 ≤ 𝟗𝟎𝟎, 𝒙𝟏 + 𝟐𝒙𝟐 ≤ 𝟓𝟎𝟎 where the
restrictions are 𝒙𝟏 , 𝒙𝟐 ≥ 𝟎
3. Use Simplex method to solve the following L.P.P to Max 𝒛 = 𝟒𝒙𝟏 + 𝟏𝟎𝒙𝟐 subject to the
constraints 𝟐𝒙𝟏 + 𝒙𝟐 ≤ 𝟓𝟎 , 𝟐𝒙𝟏 + 𝟓𝒙𝟐 ≤ 𝟏𝟎𝟎, 𝟐𝒙𝟏 + 𝟑𝒙𝟐 ≤ 𝟗𝟎 & 𝒙𝟏 , 𝒙𝟐 ≥ 𝟎
 PONJESLY COLLEGE OF ENGINEERING
INTERNAL ASSESSMENT-1 (2018-2019)
ME – CN(MA5154) APPLIED MATHEMATICS FOR COMMUNICATION ENGINEERS MARKS-68
PART-A
Answer all the questions: (10x2=20)
1. What are the properties of Linear programming model?
2. Define convex region:
3. A firm manufactures two types of products A & B and sells them at a profit of Rs.2 on type A
and Rs.3 on type B. Each product is produced on two machines 𝑴𝟏 &𝑴𝟐 . Type A requires
1 minute of processing time in 𝑴𝟏 & and 2 minutes on 𝑴𝟐 .Type B requires 1 minute on 𝑴𝟏 and
1 minute on 𝑴𝟐 . 𝑴𝟏 is not available for more than 6 hours 40 minutes while 𝑴𝟐 is available for
10 hours during working day. Formulate the problem as a L.P.P so as to maximize the profit.
4. What are the different types of solution of a Linear programming problem:
5. Define feasible solution:
6. Define surplus variables:
7. What are the characteristics of canonical form:
8. Define slack variables:
9. Define optimal solution:
10. What are the characteristics of standard form:
PART-B
Answer all the questions: (3x16=48)
1. Solve the following L.P.P by graphical method: Max 𝒛 = 𝟑𝒙𝟏 + 𝟐𝒙𝟐 subject to constraints
−𝟐𝒙𝟏 + 𝒙𝟐 ≤ 𝟏, 𝒙𝟏 ≤ 𝟐, 𝒙𝟏 + 𝒙𝟐 ≤ 𝟑 where the restrictions are 𝒙𝟏 , 𝒙𝟐 ≥ 𝟎
2. A company making cool drinks has 2 bottle plants, located at towns 𝑻𝟏 &𝑻𝟐 .Each plant
produces 3 drinks A, B & C. Their producing capacity per day is given below
Cool Drink 𝑻𝟏 𝑻𝟐
A 6000 2000
B 1000 2500
C 3000 3000
The marketing department of the company forecasted a demand of 80000 bottles of A,
22000 bottles of B & 40000 bottles of C .During the month of June, the operating cost per day
of plants 𝑻𝟏 & 𝑻𝟐 are Rs. 6000 and Rs. 4000 respectively. Find graphically the number of days
for which each plant must run in June and so as to minimize the operating cost by meeting the
marketing demand.
3. Use Simplex method to solve the following L.P.P to Max 𝒛 = 𝟒𝒙𝟏 + 𝟏𝟎𝒙𝟐 subject to the
constraints 𝟐𝒙𝟏 + 𝒙𝟐 ≤ 𝟓𝟎 , 𝟐𝒙𝟏 + 𝟓𝒙𝟐 ≤ 𝟏𝟎𝟎, 𝟐𝒙𝟏 + 𝟑𝒙𝟐 ≤ 𝟗𝟎 & 𝒙𝟏 , 𝒙𝟐 ≥ 𝟎
 PONJESLY COLLEGE OF ENGINEERING
INTERNAL ASSESSMENT-1(2018-2019)

ME-AE APPLIED MATHEMATICS FOR ELECTRONICS ENGINEERS(MA5152) MARKS-68

PART-A

Answer all the questions: (10X2=20)

1. What are the applications of dynamic programming:

2. State the principle of optimality:

3. Write any two characteristics of dynamic programming:

4. Write the algorithm for dynamic programming problem:

5. Define forward recursion:

6. Define stage variables:

7. Define backward recursion:

8. Define state variables:

9. What are the conditions for optimal subdivision problem:

10. Define a cargo loading problem:

PART-B

Answer all the questions: (3x16=48)

1. Solve Linear programming problem by dynamic programming:

Max 𝒛 = 𝟑𝒙𝟏 + 𝟓𝒙𝟐 subject to 𝒙𝟏 ≤ 𝟒 , 𝒙𝟐 ≤ 𝟔 , 𝟑𝒙𝟏 + 𝟐𝒙𝟐 ≤ 𝟏𝟖 & 𝒙𝟏 , 𝒙𝟐 ≥ 𝟎

2. 𝑴𝒂𝒙 𝒛 = 𝒙𝟐𝟏 + 𝒙𝟐𝟐 + 𝒙𝟐𝟑 subject to 𝒙𝟏 + 𝒙𝟐 + 𝒙𝟑 ≥ 𝟏𝟓, 𝒙𝟏 , 𝒙𝟐 , 𝒙𝟑 ≥ 𝟎

3. A four tonne vessel can be loaded with one or more of the three items. The

following table gives the unit weight 𝒘𝒊 in tonnes and unit revenue in

thousand rupees and 𝒓𝒊 for item 𝒊.

Item 𝒘𝒊 (in tonnes) 𝒓𝒊 (in thousands)

1 2 31

2 3 47

3 1 14

How should the vessel be loaded to maximize the total return.

 PONJESLY COLLEGE OF ENGINEERING

INTERNAL ASSESSMENT-1(2018-2019)

ME-AE APPLIED MATHEMATICS FOR ELECTRONICS ENGINEERS(MA5152) MARKS-68

PART-A

Answer all the questions: (10X2=20)

1. State the Bellman’s optimality principle:

2. Write any two applications of dynamic programming:

3. Define forward recursion:

4. Define state variables:

5. Write any two characteristics of dynamic programming:

6. Write the algorithm for dynamic programming problem:

7. Define stage variables:

8. Define backward recursion:

9. What are the conditions for optimal subdivision problem:

10. Write short notes on cargo loading problem:

PART-B

Answer all the questions: (3x16=48)

1. Solve Linear programming problem by dynamic programming:

Max 𝒛 = 𝟐𝒙𝟏 + 𝟓𝒙𝟐 subject to 𝟐𝒙𝟏 + 𝒙𝟐 ≤ 𝟒𝟑, 𝟐𝒙𝟐 ≤ 𝟒𝟔 & 𝒙𝟏 , 𝒙𝟐 ≥ 𝟎

2. Use dynamic programming to solve 𝒑𝟏 𝒍𝒐𝒈𝒑𝟏 + 𝒑𝟐 𝒍𝒐𝒈𝒑𝟐 + ⋯ + 𝒑𝒏 𝒍𝒐𝒈𝒑𝒏

subject to the constraints 𝒑𝟏 + 𝒑𝟐 + ⋯ + 𝒑𝒏 = 𝟏 & 𝒑𝒊 ≥ 𝟎, 𝒊 = 𝟏, 𝟐, … 𝒏 is

𝟏
minimum when 𝒑𝟏 = 𝒑𝟐 = ⋯ = 𝒑𝒏 = 𝒏 so as to minimize the

quantity ∑ 𝒑𝒊 𝒍𝒐𝒈𝒑𝒊

3. A four tonne vessel can be loaded with one or more of the three items. The

following table gives the unit weight 𝒘𝒊 in tonnes and unit revenue in thousand

rupees and 𝒓𝒊 for item 𝒊.

Item 𝒘𝒊(in tonnes) 𝒓𝒊(in thousands)

1 2 31

2 3 47

3 1 14

How should the vessel be loaded to maximize the total return.