Sie sind auf Seite 1von 2

Term End Examination - November 2012

Course

: MAT503

- Higher Mathematics

Slot: D1+TD1

Class NBR : 5054


Time

: Three Hours

Max.Marks:100

PART A (5 X 8 = 40 Marks)
Answer any FIVE Questions
1.

Write the characteristics of a Markov Process.

2.

A T.V. repairman finds that the time spent on his jobs has an exponential distribution
with mean 30 minutes. If he repairs sets in the order in which they came in, and if the
arrival of sets is approximately Poisson with an average rate of 10 per 8 hour day, what
is repairmans expected Idle Time each day? Also find the expected number of T.V.
sets in the system.

3.

Show that R S can be derived from the premises P (Q S ), R P and Q .

4.

Prove that (x)(P(x) Q(x) ) (x)P(x) (x)Q(x)

5.

Define Lattice. Show that the power set P(A) of any set A is a Lattice under Union and
Intersection.

6.

Show that if G is a Tree of n vertices then it has n 1 edges.

7.

Show that a Connected graph is a Tree iff every edge is Cut edge.

8.

State and prove the Euler - Fermats Theorem. And solve the congruence 5x 3
mod24).
PART B (3 X 20 = 60 Marks)
Answer any THREE Questions

9.

a) Derive Lq , Ls ,Wq & Ws for a Poisson exponential, single server and infinite
population queueing model.
b) A post office has two counters, which handles the business of money orders
registration letters etc. It has been found that the service time distributions for both
the counters are exponential with mean service time 4 minutes per customer. The
customers are found to come in each counter in a Poisson fashion with mean arrival
of 11 per hour. Calculate.

Page 1 of 2

(i) Probability of having to wait for service of a customer.


(ii) Average waiting time in the queue.(iii) Expected number of idle counters.
10.

a) Obtain the P.C.N.F. and P.D.N.F. of ( P Q)(P R) by ordering and uniqueness of


normal forms.
b) Show that (x)(P(x) Q(x) ) (x)P(x) (x)Q(x)

11.

a) Which of the two lattices Sn , D for n=30 and n=45 are complemented? Are these
lattices distributive? ( S n be the set of all divisors of n and D means division)
b) Obtain the sum-of-products and product of sums canonical forms of the Boolean
expression given by x1 x2 .

12.

a) Show that the closure of a graph G (i.e. C (G)) is well defined or Unique.
b) Write the Floyds algorithm for All Pairs Shortest Path problem.

13.

a) State and prove the Chinese Remainder theorem and solve the congruence
25x15(mod120).
b) State and prove the fundamental theorem of arithmetic.

14.

a) Show that the set premises J S , S H , A H , and S A are in-consistent.


b) Cars arrive in a pollution testing centre according to Poisson distribution at an
average rate of 15 cars per hour. The testing centre can accommodate at maximum
15 cars. The service time per car is an exponential with mean rate 10 per hour. Find
the following:
(i) The effective arrival rate of at the pollution testing centre.
(ii) The probability the arriving car has not to wait for testing.
(iii) The probability the arriving car will find a vacant place in the testing
centre.
(iv) The expected waiting time in the system.

Page 2 of 2

Das könnte Ihnen auch gefallen