Computer Science Project

Assignment: 1) Explain in detail minimal path set and minimal cut set methods 2) Reliability gradient and border state: a) Definition of border state + a sample. b) Explain formula 5.1.2 c) Explain formula 5.2.4 d) Provide sample for 5.1.1 3) BIM and Construction Spectrum (CS) a) Definition of CS. Explain formula 10.2.3 b) Definition of BIM SPECTRUM (Construction) c) Explain formula 10.3.2 d) Explain the phrase 10.4.1 4) In the given network the vertices are unreliable, edges are reliable. The vertices s,t,r,v are terminal Each vertices is in “UP” mode with probability p. calculate reliability with minimal cut method. b) calculate reliability with path method. c) calculate the BIM of every vertices’ following the definition of BIM. d) build C-Spectrum of the network. Using the C-spectrum calculate the reliability. e) Build (destruction) BIM spectrum for each vertices of the network Depending on the results that you got sort the vertices by their importance. Calculate BIM for each vertices by depending on BIM Spectrum. f) You need to check if the formula is true and right for the given network g) We will now assume that the life expectancy of the vertices is distributed by exp When: You need to evaluate the reliability R(t) for t=2 by depending on the Burtin Pittel phrase. Give a detailed explanation. Note : Please write specifically in Proposal if you solve this.