0% found this document useful (0 votes)
52 views7 pages

Insy121 Computational Mathematics For Information Systems

The document is an examination paper for the module 'Computational Mathematics for Information Systems' at Manicaland State University, detailing instructions and sections for answering questions. It includes various mathematical problems related to linear equations, optimization, and production costs, divided into two sections with a total of 100 marks. Students are required to answer all questions in Section A and three from Section B, using a non-programmable scientific calculator.

Uploaded by

king
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
52 views7 pages

Insy121 Computational Mathematics For Information Systems

The document is an examination paper for the module 'Computational Mathematics for Information Systems' at Manicaland State University, detailing instructions and sections for answering questions. It includes various mathematical problems related to linear equations, optimization, and production costs, divided into two sections with a total of 100 marks. Students are required to answer all questions in Section A and three from Section B, using a non-programmable scientific calculator.

Uploaded by

king
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

;

MANICALAND STATE UNIVERSITY


OF
APPLIED SCIENCES

FACULTY OF APPLIED SCIENCES & TECHNOLOGY


DEPARTMENT OF COMPUTER SCIENCE & INFORMATION SYSTEMS

MODULE: COMPUTATIONAL MATHEMATICS FOR


INFORMATION SYSTEMS
CODE: INSY121

SESSIONAL EXAMINATIONS
APRIL 2023

DURATION: 3 HOURS
EXAMINER: DR. W. GOVERE

INSTRUCTIONS

1. Answer All in Section A


2. Answer three questions in Section B.
3. Start a new question on a fresh page
4. Total marks 100

Additional material(s): Non-programmable electronic scientific calculator.

Page 1 of 7
SECTION A (ANSWER ALL QUESTIONS) [40 MARKS]

A1

Solve the following system of linear equations by Gauss-Jordan


elimination method:

2𝑥 + 𝑦 − 𝑧 = −1

−2𝑥 + 𝑦 + 2𝑧 = 1

𝑥+𝑦+𝑧 =2

[5]

A2.
4 3 3
Suppose the array [2 1 0] represents the orders placed by three individuals
4 4 2
at Nandos Samora Macheal Avenue/6th Street. The first-person orders 4 burgers,
3 pet drinks, and 3 fries; the second orders 2 burgers and 1 pet drink, and the third
orders 4 burgers, 4 pet drinks, and 2 fries, burgers cost $2 each, pet drinks $1 each
and fries $1.50 each.
(a) Show that the amounts owed by these persons may be represented as a
function 𝑦 = 𝑓(𝑥), where 𝑓(𝑥) is equal to the array given above times a
certain vector.
(b) Compute the amounts owed in this case by performing the appropriate
multiplication.
(c) Change the matrix for the case in which the second person orders an
additional pet drink and 2 fries, and recompute the costs.

[3, 4, 3]

Page 2 of 7
A3

National Foods Stockfeeds company markets two types of feed for cattle.
The first mix, Fertilex, requires at least twice the amount of wheat as barley.
The second mix, Multiplex, requires at least twice the amount of barley as
wheat. Wheat costs $2.50 per kg and 1000 kg is available per month. Barley
costs $2.25 per kg and 1200kg is available per month. Fertilex sells for $2.80
per kg up to 99kg and every additional kilogram sells for $2.65. Multiplex
sells for $2.70 per kg up to 99kg and each additional kilogram sells for $2.55.
CSC farms will buy any and all amounts of both mixes of National Foods
Stockfeeds company. Formulate the mathematical model for this problem.
[5]

A4
A manufacturer of Puma clothing makes Puma pants and Puma jackets.
The profit on a pair of Puma pants is $2.00 and on a Puma jacket is $1.50.
Both pants and jackets require the work of sewing operators and cutters.
There are 60 minutes of sewing operator time and 48 minutes of cutter time
available. It takes 8 minutes to sew one pair of Puma pants and 4 minutes
to sew one Puma jacket. Cutters take 4 minutes on pants and 8 minutes on
a jacket. Find the maximum profit and the amount of pants and jackets to
maximize the profit.

a) Let 𝑥 = Puma pants and 𝑦 = Puma jackets. Since there cannot be


negative pants or jackets, write two inequalities to represent that situation.
b) Express the cutters’ time to make pants and jackets as an inequality.
c) Express the sewing operators’ time to make pants and jackets as an
inequality.
d) Write an equation for the anticipated profit.
e) Graph the constraints.
f) Use the corner points to find the maximum profit.

Page 3 of 7
g) What is the maximum profit?
h) How many Puma pants and Puma jackets have to be made to maximize
profit?

[3, 1, 1, 2, 6, 3, 2, 2]

SECTION B (ANSWER ANY THREE QUESTIONS) [60 MARKS]

B5

1 4 −2
a) If A= ( 2 5 1 )
−1 3 −3

i) Evaluate |𝐴| and hence find 𝐴−1 .


ii) Evaluate 𝐴2 − 2𝐴.
iii) Use the method of inverses to solve 𝐴𝑋 = (2, 5, −1)𝑇 .
1
iv) Prove that det (𝐴−1 )= .
det(𝐴)

b) Find the value(s) of 𝑎 and 𝑏 for which the systems of equations

𝑦 + 3𝑧 = 2
𝑥 + 𝑦 − 2𝑧 = 5
𝑥 + 𝑦 + 𝑎𝑧 = 3𝑏.

have

i) a unique solution
ii) no solution
iii) many solutions.

[3, 4, 5, 3, 5]

B6

Page 4 of 7
Each coffee table produced by T.V Sales Designers nets the firm a profit
of $9. Each bookcase yields a $12 profit. T.V Sales is a small firm, and its
resources are limited. During any given production period (of one week),
10 litres of varnish and 12 lengths of high quality redwood are available.
Each coffee table requires approximately 1 litres of varnish and 1 length of
redwood. Each bookcase takes 1 litres of varnish and 2 lengths of wood.

(a). Formulate TV Sales production mix decision as a linear programming


problem.
(b). Solve this problem using the Simplex method. Determine how many tables
and bookcases should be produced each week?
(c). What would be the maximum profit?
[5, 10, 5]

B7

(a) Use the graphical solution technique to find the optimal solution to the
model below:

Maximize 𝑍 = 10𝑥1 + 20𝑥2


subject to
2𝑥1 + 𝑥2 ≤ 40
5𝑥1 − 2𝑥2 ≤ 20
𝑥1 ≥ 25
𝑥1 , 𝑥2 ≥ 0

(b) A computer centre has five expert programmers. The centre wants three
application programs to be developed. The head of the computer centre,
after carefully studying the programs to be developed, estimates the
time (in minutes) required by the experts for developing the application
programs as given in the following table:

Page 5 of 7
Programmer
Program
𝑨 𝑩 C D 𝑬
𝑰 120 100 80 90 130
𝑰𝑰 80 90 110 70 110
𝑰𝑰𝑰 110 140 120 130 160

Assign the programmers to the programs in such a way that the


minimum total time is taken for developing the programs.

[5, 15]

B8

A product is produced by four factories A, B, C and D. Their unit


production costs are $2, $3, $1, and $5 respectively. The production
capacities in each factory are 50 units, 70 units, 30 units and 50 units
respectively. These factories supply the units to four stores P, Q, R, and S,
the demands of which are 25, 35, 105, and 20 units, respectively. Unit
transportation cost in dollars from each factory to each store is given in the
following table:

Stores
Factories
𝐏 𝐐 𝐑 S

𝐀 2 4 6 11

𝐁 10 8 7 5

𝐂 13 3 9 12

D 4 6 8 3

Page 6 of 7
Determine the extent of deliveries from each of the factories to each of the
stores so that the total transportation and the production cost is minimum.

[20]

END OF QUESTION PAPER

Page 7 of 7

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy