SlideShare a Scribd company logo
1 of 4
Download to read offline
School of Science
Term End Examination- Nov 2009
Subject: Higher Mathematics (CSE 501)
Common to M.Tech-ITNet &CSE
Time : 3 Hrs Max.Marks: 100
PART – A
Answer any 5 of the following Questions 5 x 8 = 40 Marks
1. Obtain the principal disjunctive normal form of ( ) ( )( )P P Q Q P⎯⎯→ → ∧ ¬ ¬ ∨ ¬ .
2. Find and draw all fundamental cycles of the given graph with respect to the spanning
tree T, ( ) { }1 2 3 12 7 6 5e ,e ,e ,e ,e ,e ,e=E T
3. Which of the following posets forms a lattice? Justify briefly your answer
(i) (ii) (iii) (iv)
4. a). Let G be a given simple connected graph on ‘n’ vertices such that each edge
of G lies on atmost one cycle. If G has ‘r’ cycles, find the number of edges of G.
1e
2e
7e
5e
4e 6e8e
9e 10e
12e 11e
3e
a
b c
d
e
k
l
m
n o
f
g
h
I
j
kk
l
o
n
m
b).If G represents a graph, whose incidence matrix is given by
I(G) =
0 1 z 1 y 0 1
1 w y 0 0 0 0
0 x 0 0 0 0 0
x 0 z 1 0 y x z
y z x y 0 w w w
⎡ ⎤
⎢ ⎥
⎢ ⎥
⎢ ⎥
⎢ ⎥
+⎢ ⎥
⎢ ⎥+⎣ ⎦
Compute the values of x, y, z, w and the adjacency matrix of G.
5. Find the least positive integer x such that x 5(mod7)≡ and x 7(mod11)≡ and
x 3(mod13)≡
6. Show that R (P Q)∧ ∨ is a valid conclusion from the premises P Q∨ , Q R→ ,
P M→ , M¬
7. a) Let G be a simple graph with n vertices and q edges, such that each vertex of G
is of degree either 3 or 4 . Find the number of vertices of degree 4 in G.
b) Let G be a simple connected graph with all its vertices are of degree 3 or 4.
For all edges e {u,v} E(G) d(u) d(v) 7= ∈ ⇔ + = . Does this graph contains any
cycle of ODD length? Justify your answer.
Also prove that
u X v Y
d(u) d(v)
∈ ∈
=∑ ∑ ,
where X = {u V(G) | d(u) 3}∈ = , Y {v V(G) | d(v) 4}= ∈ =
8. At what average rate must a clerk in a supermarket work in order to ensure a probability
of 0.90 that the customer will not wait longer than minutes? It is assumed that there is
only one counter at which customers arrive in a Poisson fashion at an average rate of 15
per hour and that the length of the service by the clerk has an exponential distribution.
PART – B
Answer any 3 of the following Questions 3 x 20 = 60 Marks
9. Prove that for any prime p , all the coefficients of the polynomial
p 1
f(x) (x 1)(x 2) (x p 1) x 1−
= − − ⋅⋅⋅ − + − + are divisible by p.
10. i. Let L be a Lattice. Prove that the following statements are true.
1. ∨ ∧a a= a ,a a= a
2. ∨ ∨ ∧ ∧a b= b a ,a b= b a
3. ( ) ( ) ( ) ( )∨ ∨ ∨ ∨ ∧ ∧ ∧ ∧a b c = a b c ,a b c = a b c
4. ( ) ( )∨ ∧ ∧ ∨a a b = a ,a a b = a
ii. Compute ( ) ( ) ( ) ( )a c e f a b c e∨ ∧ ∨ ∨ ∨ ∧ ∨⎡ ⎤ ⎡ ⎤⎣ ⎦ ⎣ ⎦
11. i. If T1 and T2 are given two spanning trees of a given connected graph G, then prove
the following :
( ) ( )E( ) E( ) E( ) E( ) E( ) E( )1 2 1 2G T T T G T=− −∩ ∩
ii. Find the Minimum and Maximum Spanning Trees of the following connected
graph.
12. a. Show that ( )x M(x)∃ follows logically from the premises
( )( )x H(x) M(x)⎯⎯→ and ( )x H(x)∃
0
a b
c
e f
I
0v
1 2
9
2
9
3
61
5
6
2
1
8
2
9 1
3
4 1
4
7
7
0u
b. Prove that the total number of vertices of degree 2 of a given tree ‘T’
on ‘q’ edges ( 2)≥q is equal to [ ]
v V(T)
(v) 3
( 1) (v) 1
∈
≥
− − −∑q
d
d .
Also prove that the expression
j
j
j
w V(T)
) 3
2 d(w ) 2
d(w
∈
≥
⎡ ⎤+ −⎣ ⎦∑ represents the total number of
pendent vertices of T
13. Customers arrive at a one-man barber shop according to a Poisson
process with a mean inter arrival time of 12 min. Customers spend an
average of 10 min in the barber’s chair.
(a). What is the expected number of customers in the barber shop and in the
queue
(b). Calculate the percentage of time an arrival can walk straight into the
barber’s chair without having to wait.
(c). How much time can a customer expect to spend in the barber’s shop?
(d). Management will provide another chair and hire another barber , when a
Customer’s waiting time in the shop exceeds 1.25 h. How much must
the average rate of arrivals increase to warrant a second barber?
(e). What is the average time customers spend in the queue?
(f). What is the probability that the waiting time in the system is greater than
30 min
(g) Calculate the percentage of customers who have to wait prior to getting
into the barber’s chair.
(h) What is the probability that more than 3 customers are in the system?

More Related Content

What's hot

Ee693 sept2014midsem
Ee693 sept2014midsemEe693 sept2014midsem
Ee693 sept2014midsemGopi Saiteja
 
Ee693 questionshomework
Ee693 questionshomeworkEe693 questionshomework
Ee693 questionshomeworkGopi Saiteja
 
Ee693 sept2014quiz1
Ee693 sept2014quiz1Ee693 sept2014quiz1
Ee693 sept2014quiz1Gopi Saiteja
 
Linear Cryptanalysis Lecture 線形解読法
Linear Cryptanalysis Lecture 線形解読法Linear Cryptanalysis Lecture 線形解読法
Linear Cryptanalysis Lecture 線形解読法Kai Katsumata
 
Algorithms presentation on Path Matrix, Bell Number and Sorting
Algorithms presentation on Path Matrix, Bell Number and SortingAlgorithms presentation on Path Matrix, Bell Number and Sorting
Algorithms presentation on Path Matrix, Bell Number and SortingRishabh Mehan
 
Day 5 examples u6w14
Day 5 examples u6w14Day 5 examples u6w14
Day 5 examples u6w14jchartiersjsd
 
Day 7 examples u6w14
Day 7 examples u6w14Day 7 examples u6w14
Day 7 examples u6w14jchartiersjsd
 
New Families of Odd Harmonious Graphs
New Families of Odd Harmonious GraphsNew Families of Odd Harmonious Graphs
New Families of Odd Harmonious GraphsIJMIT JOURNAL
 
12 epe11 applied mathematics - june, july 2013
12 epe11  applied mathematics - june, july 201312 epe11  applied mathematics - june, july 2013
12 epe11 applied mathematics - june, july 2013Dover Solutions India
 
2021 preTEST4A Vector Calculus
2021 preTEST4A Vector Calculus2021 preTEST4A Vector Calculus
2021 preTEST4A Vector CalculusA Jorge Garcia
 

What's hot (18)

Ee693 sept2014midsem
Ee693 sept2014midsemEe693 sept2014midsem
Ee693 sept2014midsem
 
Ch04
Ch04Ch04
Ch04
 
mathFin01
mathFin01mathFin01
mathFin01
 
Ee693 questionshomework
Ee693 questionshomeworkEe693 questionshomework
Ee693 questionshomework
 
Chap4
Chap4Chap4
Chap4
 
Ee693 sept2014quiz1
Ee693 sept2014quiz1Ee693 sept2014quiz1
Ee693 sept2014quiz1
 
Linear Cryptanalysis Lecture 線形解読法
Linear Cryptanalysis Lecture 線形解読法Linear Cryptanalysis Lecture 線形解読法
Linear Cryptanalysis Lecture 線形解読法
 
Guia 1
Guia 1Guia 1
Guia 1
 
Algorithms presentation on Path Matrix, Bell Number and Sorting
Algorithms presentation on Path Matrix, Bell Number and SortingAlgorithms presentation on Path Matrix, Bell Number and Sorting
Algorithms presentation on Path Matrix, Bell Number and Sorting
 
Day 5 examples u6w14
Day 5 examples u6w14Day 5 examples u6w14
Day 5 examples u6w14
 
Minimum spanning tree
Minimum spanning treeMinimum spanning tree
Minimum spanning tree
 
M.tech.quiz (1)
M.tech.quiz (1)M.tech.quiz (1)
M.tech.quiz (1)
 
Day 7 examples u6w14
Day 7 examples u6w14Day 7 examples u6w14
Day 7 examples u6w14
 
Notes 3-2
Notes 3-2Notes 3-2
Notes 3-2
 
1.6 all notes
1.6 all notes1.6 all notes
1.6 all notes
 
New Families of Odd Harmonious Graphs
New Families of Odd Harmonious GraphsNew Families of Odd Harmonious Graphs
New Families of Odd Harmonious Graphs
 
12 epe11 applied mathematics - june, july 2013
12 epe11  applied mathematics - june, july 201312 epe11  applied mathematics - june, july 2013
12 epe11 applied mathematics - june, july 2013
 
2021 preTEST4A Vector Calculus
2021 preTEST4A Vector Calculus2021 preTEST4A Vector Calculus
2021 preTEST4A Vector Calculus
 

Viewers also liked (20)

PI5_InspectAdapt
PI5_InspectAdaptPI5_InspectAdapt
PI5_InspectAdapt
 
The Psychology of Waiting Lines
The Psychology of Waiting LinesThe Psychology of Waiting Lines
The Psychology of Waiting Lines
 
Waiting lines
Waiting linesWaiting lines
Waiting lines
 
Waiting Line Management
Waiting Line ManagementWaiting Line Management
Waiting Line Management
 
Psychology of waiting
Psychology of waitingPsychology of waiting
Psychology of waiting
 
OR Unit 5 queuing theory
OR Unit 5 queuing theoryOR Unit 5 queuing theory
OR Unit 5 queuing theory
 
Customers Waiting in Lines - Service Operations - Yolanda Williams
Customers Waiting in Lines - Service Operations - Yolanda WilliamsCustomers Waiting in Lines - Service Operations - Yolanda Williams
Customers Waiting in Lines - Service Operations - Yolanda Williams
 
Waiting line
Waiting lineWaiting line
Waiting line
 
Waiting Line Management Problem Solution, Writer Jacobs (1-15)
Waiting Line Management Problem Solution, Writer Jacobs (1-15)Waiting Line Management Problem Solution, Writer Jacobs (1-15)
Waiting Line Management Problem Solution, Writer Jacobs (1-15)
 
Queuing problems
Queuing problemsQueuing problems
Queuing problems
 
Queueing theory
Queueing theoryQueueing theory
Queueing theory
 
QUEUING THEORY
QUEUING THEORY QUEUING THEORY
QUEUING THEORY
 
Queueing theory
Queueing theoryQueueing theory
Queueing theory
 
Queuing Theory - Operation Research
Queuing Theory - Operation ResearchQueuing Theory - Operation Research
Queuing Theory - Operation Research
 
Queueing Theory and its BusinessS Applications
Queueing Theory and its BusinessS ApplicationsQueueing Theory and its BusinessS Applications
Queueing Theory and its BusinessS Applications
 
Queuing theory
Queuing theoryQueuing theory
Queuing theory
 
Waiting Line Management
Waiting Line Management Waiting Line Management
Waiting Line Management
 
Queuing theory
Queuing theoryQueuing theory
Queuing theory
 
QUEUING THEORY
QUEUING THEORYQUEUING THEORY
QUEUING THEORY
 
Managing demand and capacity and waiting line strategies
Managing demand and capacity and waiting line strategiesManaging demand and capacity and waiting line strategies
Managing demand and capacity and waiting line strategies
 

Similar to m.tech final

A common random fixed point theorem for rational inequality in hilbert space
A common random fixed point theorem for rational inequality in hilbert spaceA common random fixed point theorem for rational inequality in hilbert space
A common random fixed point theorem for rational inequality in hilbert spaceAlexander Decker
 
Theoryofcomp science
Theoryofcomp scienceTheoryofcomp science
Theoryofcomp scienceRaghu nath
 
Divide-and-Conquer & Dynamic ProgrammingDivide-and-Conqu.docx
Divide-and-Conquer & Dynamic ProgrammingDivide-and-Conqu.docxDivide-and-Conquer & Dynamic ProgrammingDivide-and-Conqu.docx
Divide-and-Conquer & Dynamic ProgrammingDivide-and-Conqu.docxjacksnathalie
 
Cs6702 graph theory and applications Anna University question paper apr may 2...
Cs6702 graph theory and applications Anna University question paper apr may 2...Cs6702 graph theory and applications Anna University question paper apr may 2...
Cs6702 graph theory and applications Anna University question paper apr may 2...appasami
 
Banco de preguntas para el ap
Banco de preguntas para el apBanco de preguntas para el ap
Banco de preguntas para el apMARCELOCHAVEZ23
 
Digital Signals and System (April – 2017) [75:25 Pattern | Question Paper]
Digital Signals and System (April  – 2017) [75:25 Pattern | Question Paper]Digital Signals and System (April  – 2017) [75:25 Pattern | Question Paper]
Digital Signals and System (April – 2017) [75:25 Pattern | Question Paper]Mumbai B.Sc.IT Study
 
Stochastic Processes Homework Help
Stochastic Processes Homework HelpStochastic Processes Homework Help
Stochastic Processes Homework HelpExcel Homework Help
 
Notes and formulae mathematics
Notes and formulae mathematicsNotes and formulae mathematics
Notes and formulae mathematicsZainonie Ma'arof
 

Similar to m.tech final (20)

A common random fixed point theorem for rational inequality in hilbert space
A common random fixed point theorem for rational inequality in hilbert spaceA common random fixed point theorem for rational inequality in hilbert space
A common random fixed point theorem for rational inequality in hilbert space
 
Theoryofcomp science
Theoryofcomp scienceTheoryofcomp science
Theoryofcomp science
 
Divide-and-Conquer & Dynamic ProgrammingDivide-and-Conqu.docx
Divide-and-Conquer & Dynamic ProgrammingDivide-and-Conqu.docxDivide-and-Conquer & Dynamic ProgrammingDivide-and-Conqu.docx
Divide-and-Conquer & Dynamic ProgrammingDivide-and-Conqu.docx
 
Escola naval 2015
Escola naval 2015Escola naval 2015
Escola naval 2015
 
Cs6702 graph theory and applications Anna University question paper apr may 2...
Cs6702 graph theory and applications Anna University question paper apr may 2...Cs6702 graph theory and applications Anna University question paper apr may 2...
Cs6702 graph theory and applications Anna University question paper apr may 2...
 
Set 1 mawar
Set 1 mawarSet 1 mawar
Set 1 mawar
 
4th Semester Electronic and Communication Engineering (2013-June) Question Pa...
4th Semester Electronic and Communication Engineering (2013-June) Question Pa...4th Semester Electronic and Communication Engineering (2013-June) Question Pa...
4th Semester Electronic and Communication Engineering (2013-June) Question Pa...
 
M112rev
M112revM112rev
M112rev
 
Banco de preguntas para el ap
Banco de preguntas para el apBanco de preguntas para el ap
Banco de preguntas para el ap
 
4th Semeste Electronics and Communication Engineering (June-2016) Question Pa...
4th Semeste Electronics and Communication Engineering (June-2016) Question Pa...4th Semeste Electronics and Communication Engineering (June-2016) Question Pa...
4th Semeste Electronics and Communication Engineering (June-2016) Question Pa...
 
F.Y.B.Sc(2013 pattern) Old Question Papers:Dr.Kshirsagar
F.Y.B.Sc(2013 pattern) Old Question Papers:Dr.KshirsagarF.Y.B.Sc(2013 pattern) Old Question Papers:Dr.Kshirsagar
F.Y.B.Sc(2013 pattern) Old Question Papers:Dr.Kshirsagar
 
Unit 3
Unit 3Unit 3
Unit 3
 
Unit 3
Unit 3Unit 3
Unit 3
 
IME 2015 - aberta
IME 2015 - abertaIME 2015 - aberta
IME 2015 - aberta
 
4th Semester CS / IS (2013-June) Question Papers
4th Semester CS / IS (2013-June) Question Papers 4th Semester CS / IS (2013-June) Question Papers
4th Semester CS / IS (2013-June) Question Papers
 
Digital Signals and System (April – 2017) [75:25 Pattern | Question Paper]
Digital Signals and System (April  – 2017) [75:25 Pattern | Question Paper]Digital Signals and System (April  – 2017) [75:25 Pattern | Question Paper]
Digital Signals and System (April – 2017) [75:25 Pattern | Question Paper]
 
Stochastic Processes Homework Help
Stochastic Processes Homework HelpStochastic Processes Homework Help
Stochastic Processes Homework Help
 
4th Semester Electronic and Communication Engineering (June/July-2015) Questi...
4th Semester Electronic and Communication Engineering (June/July-2015) Questi...4th Semester Electronic and Communication Engineering (June/July-2015) Questi...
4th Semester Electronic and Communication Engineering (June/July-2015) Questi...
 
Notes and formulae mathematics
Notes and formulae mathematicsNotes and formulae mathematics
Notes and formulae mathematics
 
Alex1 group2
Alex1 group2Alex1 group2
Alex1 group2
 

More from NARAYANASWAMY CHANDRAMOWLISWARAN

More from NARAYANASWAMY CHANDRAMOWLISWARAN (20)

NCM RB PAPER
NCM RB PAPERNCM RB PAPER
NCM RB PAPER
 
ncm SCSVMV
ncm SCSVMVncm SCSVMV
ncm SCSVMV
 
M.tech.quiz (1)
M.tech.quiz (1)M.tech.quiz (1)
M.tech.quiz (1)
 
FDP SumCourse Schedule July 2009 (1)
FDP SumCourse Schedule July  2009 (1)FDP SumCourse Schedule July  2009 (1)
FDP SumCourse Schedule July 2009 (1)
 
FDP
FDPFDP
FDP
 
FDP-libre(1)
FDP-libre(1)FDP-libre(1)
FDP-libre(1)
 
NCM LECTURE NOTES ON LATIN SQUARES(27) (1) (1)
NCM LECTURE NOTES ON LATIN SQUARES(27) (1) (1)NCM LECTURE NOTES ON LATIN SQUARES(27) (1) (1)
NCM LECTURE NOTES ON LATIN SQUARES(27) (1) (1)
 
15
1515
15
 
11
1111
11
 
feedback_IIM_Indore
feedback_IIM_Indorefeedback_IIM_Indore
feedback_IIM_Indore
 
Proceedings
ProceedingsProceedings
Proceedings
 
cryptography_non_abeliean
cryptography_non_abelieancryptography_non_abeliean
cryptography_non_abeliean
 
testimonial-iit_1 (4)
testimonial-iit_1 (4)testimonial-iit_1 (4)
testimonial-iit_1 (4)
 
testimonial_iit_3 (3)
testimonial_iit_3 (3)testimonial_iit_3 (3)
testimonial_iit_3 (3)
 
NCM LECTURE NOTES ON I . n. herestein cryptography(3)
NCM LECTURE NOTES ON  I . n. herestein cryptography(3)NCM LECTURE NOTES ON  I . n. herestein cryptography(3)
NCM LECTURE NOTES ON I . n. herestein cryptography(3)
 
NCM LECTURE NOTES ON LATIN SQUARES(27)
NCM LECTURE NOTES ON LATIN SQUARES(27)NCM LECTURE NOTES ON LATIN SQUARES(27)
NCM LECTURE NOTES ON LATIN SQUARES(27)
 
japan-invite
japan-invitejapan-invite
japan-invite
 
kyoto-seminar
kyoto-seminarkyoto-seminar
kyoto-seminar
 
graceful Trees through Graceful codes (1)
graceful Trees through Graceful codes (1)graceful Trees through Graceful codes (1)
graceful Trees through Graceful codes (1)
 
R.S.A Encryption
R.S.A EncryptionR.S.A Encryption
R.S.A Encryption
 

m.tech final

  • 1. School of Science Term End Examination- Nov 2009 Subject: Higher Mathematics (CSE 501) Common to M.Tech-ITNet &CSE Time : 3 Hrs Max.Marks: 100 PART – A Answer any 5 of the following Questions 5 x 8 = 40 Marks 1. Obtain the principal disjunctive normal form of ( ) ( )( )P P Q Q P⎯⎯→ → ∧ ¬ ¬ ∨ ¬ . 2. Find and draw all fundamental cycles of the given graph with respect to the spanning tree T, ( ) { }1 2 3 12 7 6 5e ,e ,e ,e ,e ,e ,e=E T 3. Which of the following posets forms a lattice? Justify briefly your answer (i) (ii) (iii) (iv) 4. a). Let G be a given simple connected graph on ‘n’ vertices such that each edge of G lies on atmost one cycle. If G has ‘r’ cycles, find the number of edges of G. 1e 2e 7e 5e 4e 6e8e 9e 10e 12e 11e 3e a b c d e k l m n o f g h I j kk l o n m
  • 2. b).If G represents a graph, whose incidence matrix is given by I(G) = 0 1 z 1 y 0 1 1 w y 0 0 0 0 0 x 0 0 0 0 0 x 0 z 1 0 y x z y z x y 0 w w w ⎡ ⎤ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ +⎢ ⎥ ⎢ ⎥+⎣ ⎦ Compute the values of x, y, z, w and the adjacency matrix of G. 5. Find the least positive integer x such that x 5(mod7)≡ and x 7(mod11)≡ and x 3(mod13)≡ 6. Show that R (P Q)∧ ∨ is a valid conclusion from the premises P Q∨ , Q R→ , P M→ , M¬ 7. a) Let G be a simple graph with n vertices and q edges, such that each vertex of G is of degree either 3 or 4 . Find the number of vertices of degree 4 in G. b) Let G be a simple connected graph with all its vertices are of degree 3 or 4. For all edges e {u,v} E(G) d(u) d(v) 7= ∈ ⇔ + = . Does this graph contains any cycle of ODD length? Justify your answer. Also prove that u X v Y d(u) d(v) ∈ ∈ =∑ ∑ , where X = {u V(G) | d(u) 3}∈ = , Y {v V(G) | d(v) 4}= ∈ = 8. At what average rate must a clerk in a supermarket work in order to ensure a probability of 0.90 that the customer will not wait longer than minutes? It is assumed that there is only one counter at which customers arrive in a Poisson fashion at an average rate of 15 per hour and that the length of the service by the clerk has an exponential distribution.
  • 3. PART – B Answer any 3 of the following Questions 3 x 20 = 60 Marks 9. Prove that for any prime p , all the coefficients of the polynomial p 1 f(x) (x 1)(x 2) (x p 1) x 1− = − − ⋅⋅⋅ − + − + are divisible by p. 10. i. Let L be a Lattice. Prove that the following statements are true. 1. ∨ ∧a a= a ,a a= a 2. ∨ ∨ ∧ ∧a b= b a ,a b= b a 3. ( ) ( ) ( ) ( )∨ ∨ ∨ ∨ ∧ ∧ ∧ ∧a b c = a b c ,a b c = a b c 4. ( ) ( )∨ ∧ ∧ ∨a a b = a ,a a b = a ii. Compute ( ) ( ) ( ) ( )a c e f a b c e∨ ∧ ∨ ∨ ∨ ∧ ∨⎡ ⎤ ⎡ ⎤⎣ ⎦ ⎣ ⎦ 11. i. If T1 and T2 are given two spanning trees of a given connected graph G, then prove the following : ( ) ( )E( ) E( ) E( ) E( ) E( ) E( )1 2 1 2G T T T G T=− −∩ ∩ ii. Find the Minimum and Maximum Spanning Trees of the following connected graph. 12. a. Show that ( )x M(x)∃ follows logically from the premises ( )( )x H(x) M(x)⎯⎯→ and ( )x H(x)∃ 0 a b c e f I 0v 1 2 9 2 9 3 61 5 6 2 1 8 2 9 1 3 4 1 4 7 7 0u
  • 4. b. Prove that the total number of vertices of degree 2 of a given tree ‘T’ on ‘q’ edges ( 2)≥q is equal to [ ] v V(T) (v) 3 ( 1) (v) 1 ∈ ≥ − − −∑q d d . Also prove that the expression j j j w V(T) ) 3 2 d(w ) 2 d(w ∈ ≥ ⎡ ⎤+ −⎣ ⎦∑ represents the total number of pendent vertices of T 13. Customers arrive at a one-man barber shop according to a Poisson process with a mean inter arrival time of 12 min. Customers spend an average of 10 min in the barber’s chair. (a). What is the expected number of customers in the barber shop and in the queue (b). Calculate the percentage of time an arrival can walk straight into the barber’s chair without having to wait. (c). How much time can a customer expect to spend in the barber’s shop? (d). Management will provide another chair and hire another barber , when a Customer’s waiting time in the shop exceeds 1.25 h. How much must the average rate of arrivals increase to warrant a second barber? (e). What is the average time customers spend in the queue? (f). What is the probability that the waiting time in the system is greater than 30 min (g) Calculate the percentage of customers who have to wait prior to getting into the barber’s chair. (h) What is the probability that more than 3 customers are in the system?