Annamalai University 2007-1st Year B.C.A Computer Application , : ( ) ( PART - III ): ( - I ): SCIENTIFIC COMPUTING : . - Question Paper

B.C.A. DEGREE EXAMINATION, 2007
( 1st YEAR )
( PART - III )
( PAPER - I )
530. SCIENTIFIC COMPUTING
( New Regulations )
May ] [ Time : three Hours
Maximum : 100 Marks
ans any 5 ques..
All ques. carry equal marks.
(5 × 20 = 100)
1. (a) A manufacturer of furniture makes two
products chairs and tables. Processing of
these products in done on machines - A
and B. A chair requires two hours on
machine - A and six hours on machine - B.
A table requires five hours on machine - A
and no time on machine - B. There are
16 hours of time per day available on
machine - A and 30 hours of time on
machine - B. Profit gained by the
manufacturer from the chair and table is
Rs. two and Rs. 10 respectively. What should
be the daily production of every of the
two products ? (10)
(b) Use simplex method to solve the LPP
maximize z = 5x1 + 3x2
subject to constraints
x1 + x2 < 2
5x1 + 2x2 < 10
3x1 + 8x2 < 12
x1, x2 > 0. (10)
2. (a) Solve the subsequent LPP by using its dual :
maximize z = 2x1 + x2
subject to constraints
x1 + 2x2 < 10
x1 + x2 < 6
x1 ? x2 < 2
x1 ? 2x2 < 1,
x1, x2 > 0.
(b) Solve the subsequent assignment issue :
(10)
3. Use revised simplex method to solve LPP
Maximize z = 2x1 + x2
subject to constraints
3x1 + 4x2 < 6
6x1 + x2 < 3
x1, x2 > 0.
4. obtain the optimal sequences for processing the
jobs on four machines whose processing times
are provided as
M1 M2 M3 M4
J1 25 15 14 24
J2 22 12 20 22
J3 23 13 16 25
J4 26 10 13 29
E F G H
A 18 26 17 11
B 13 28 14 26
C 38 19 18 15
D 19 26 24 10
5. (a) Show that every equivalence relation
described on a set decomposes the set into
disjoint equivalent classes. (10)
(b) obtain all the partition of
X = { a, b, c, d }. (10)
6. Write an algorithm for multiplying two
polynomials P and Q.
7. Suppose G is a finite cycle for graph with at
lowest 1 edge, show that G has at lowest two
vertices of degree 1.
8. Show that language L is recognizable by a
Turing machine M if L is a kind O language.

Earning:   Approval pending.