We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 4
4 ¢
‘Three jobs A,B, and C are to be antigned to three machines U,
V, and W.’ The processing coat for each job. machine
‘combination is shown in the matrix given below. Determine the
allocation that minimizes the overall processing cost. (Cost is in
Ra, per unit 0
ae land
_____ Semabionty, Baiect one question from. cnet ante.
END TERM EXAMINATION
bee same ‘Meximam Mar
‘Note: Attempt five questions tn ail including Q.No.1 which ts
Q1 Attempt all questions:
a) Three umns contain 6 red, 4 black; 4 red, 6 black, and § red, 8
‘black balls respectively. One of the ums is selected and a ball is
drawn from it. If the ball drawn is red, find the probability that
itis drawn from the first umn. @)
b) A manufacturer produces two types of models M, and Mj. Each
‘My model requires 4 hours of grinding and 2 hours of polishing,
whereas M; model requires 2 hours of grinding and S hours of
polishing, The manufacturer has 2 grinders and 3 polishers.
Bach grinder works for 40 hours a week and each polisher
‘works for 60 hours a week. Profit on an Mymodel is 3 and on
_an M,model is €4, Whatever is produced in a week is sold in the
market. How should the manufacturer allocate his production
‘capacity to the two types of models so that he may make the
maximum profit in a week. Formulate this as a linear
‘programming problem, 8)
Determine the value of ¢ that makes the function f(x,y) =
(x+y), a joint. probability mass function over points x = 1,2,3
and y = 1,2,3.Find £09 and E(¥). 8)
1d) Find the line of regression or line of best fit for the data given
below: n = 18, Bx = 12.Ey = 18,237 = 60, Dy" = 96,5 xy = 46. (8)
€) Find the moment generating function for the distribution
defined by F(X) = ge X= 12,3, 000 @)
14) Show that Poisson distribution is a limiting ease of Binomial
distribution when m is very large and p is small such that np
fs fixed. If X is a Poisson variate such that P(X =2)=9PQ =
1) +90 P(r =6). Find the mean and standard deviation of X.
8
1b) In the normal distribution,$19% of the items are under 45
‘and 8% are over 64. Determine the mean and variance of the
disuibution? (Given that P(2 <~14) = 008 and P(Z > 05) =
03). a
Pro.
Py
Bo-goR(Given that P@ > 192) 00274 and E> 099) = 04967). (8)
{f Mllowe uniform ditribution in {-2.2), find. PCY <0) and
a(x-11<3) a
Find covariance and correlation for joint probability density
function of the two random variables X and ¥-
flay) = e*Fover range 0 ~0.2236) = 05871). a
‘Suppose that @ random variable X has a continuous uniform
ae
roof ters
Se
{State Central Limit Theorem and use it to find the
‘approximate probability distribution of the sample mean
‘of random sumnple of size n = 40.
(i) Find che mean and variance of the sample mean. (10)
‘You are given a bag of marbles. Inside the bag are 5 red, 4 white
and 3 ‘blue marbles. Using the concept of multinomial
probability distribution, calculate the probability that with 6
{hale, you choose 3 marbles that are red, 1 marble that is white,
fand 3 marbles that are blue, replacing each marble after itis
chosen. 6)
orm
In one sample of 8 observations, the sum of squared of
deviations of the eample valuee from the sample mean was 84.4
Ariata
»
1 OS/06/23
Following are the responses to the question “How many hours
do you atudy before a major Statistics teat?”
6 5 19285 7 887 4 7
‘Use the Wilcoxon test to test the hypothesis at the 5% level of
‘significance that the median number of hours a student studice
before a teat in 3. (Given that, the critical value of T for
n= at 5% level of significance for a two-tailed teat Is 10)
m
The theory predic the proportion of beans in the four
should be in the ratio 9:3:: 1600
‘the same population of standard deviation 2.5 cm. (Given Zeas
= 1.96), ‘-
uray
Solve the following L.P-P by Simplex method:
Maximize 2 Sx,-+ 3x,
subject (0 2+ 2S 2,58; + 2ty S 10,3%, + Bry S 12xy% 20. (8)
Construct the dual of the following LPP and solve the dual
‘using graphical method:
Minimize W = 2y, +49, + 395
subjectto I+ M+ ZLIW AZ LAI ZO.
Pro,(lease write your roll ne. here)
END TERM EXAMINATION
FouRTH SEMESTER [B.TecH] July 2023
Paper Code- ETCS 206 Subject: Theory of Computation |
Time: 3 Hours _ _ Maximum Marks:75
Note: Attempt five questions in all including Q.No.1 which is compulsory.
Select one question from each unit.
Ql Attempt all questions: . (5x5=25)
(a) State the differnces between a NFA and DFA?
(b) Differentiate between Moore and Melay Machines?
(c) Find a regular expression corresponding to the language of all strings
over the alphabet { a, b } that contain exactly two a's.
(d@) State Church’s hypothesis about compuitability of a machine
(e) Prove that the graph coloring problem is NP-complete
UNIT-I
Q2 a) Let 5 = fa, bj and let L = { we B* | we and the first and last
character of w are the same }. Design aDFA for L (6)
b) For the following NFA. Convert it into its equivalent DFAwhere QO is
the initial state and Q2 is the final state. (6.5)
Q3 a) Prove the pumping lemma for regular lanuages with examples. _(6)
b) Minimize the following DFA over alphates as 0,1 (6.5)
UNIT-
Q4 a) What are inherently ambiguous languages. Check whether the
folllowing Grammar is Ambiguous or not-S->A/B, A->aAb /ab, B-
>abB/ € (6)
P.T.O.
1
Sesh 06Qs
6
Q7
Qs
Q9
»)
a)
b)
a)
b)
a)
b)
a)
b)
a)
b2]
What are the steps to simplify a Context Free Grammar. Simplify the
following CFG
S->AbaC, A->BC, B->b/€, C->D/€, D->d (6.5)
What is PDA. Construct a pda to find 2's complemet of a binary
number. (6)
Covert the following grammar into Chomsky Normal Form:
S->ABCa, A->aAbb, A->e, B->bB, B->b, B->AC, C->aCa, C->e (6.8)
§ UNIT- IIT
Design a Turing Machine for the, language {eabac> | n>=1} (6)
Design a Turing Machine to check if a set of parenthesis is well
formed. (6.5)
State and prove the halting problem of Turing Machines (6)
Explain the Closure properties of Recursive Languages (6.5)
UNIT- IV
State and prove the Savitch theorem. (6)
Differentiate between P, NP, NP-hard and NP-complete problems with
examples. (6.5)
State and prove the Cook’s theorem. (6)
Is PSPACE harder than NP? How can you show a problem in PSPACE.
(6.5)
P-2/2.
ETCS-806