Conditional Probability - Dependable Computing Systems - Homework, Exercises of Computer Science

Main points of this exam are: Conditional Probability, Lifetime of Processor, Exponentially Distributed, Bathtub Curve, Failure-Rate Trend, Proper Interpretation, Combinational Circuit, Steps of Algorithm, Self-Dual Function

Typology: Exercises

2012/2013

Uploaded on 05/18/2013

maazi
maazi 🇮🇳

4.4

(12)

75 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
ECE-C690: Dependable Computing
Homework 1
January 13, 2009
The homework is due in class Monday, January 26, 2009.
Each problem is worth 10 points.
1. The lifetime (measured in years) of a processor is exponentially distributed with a mean lifetime of 2
years. You are told that a processor failed sometime in the interval [4, 8] years. Given this information,
what is the conditional probability that it failed before it was 5 years old?
2. Argue that the bathtub curve, used to represent the failure-rate trend in hardware components, is applica-
ble to software as well with the proper interpretation. For example, let time t= 0 represent the completion of
the first prototype of the software, which is then followed by various pre-release beta versions and, eventually,
the first released version, with the latter ideally occurring at the end of infant mortality.
3. For the combinational circuit shown below, use the D-algorithm to determine a test for line 5 being stuck-
at-0. Show all steps of the algorithm. What other (if any) stuck-at-1 or stuck-at-0 faults will be detected by
the resulting test pattern.
4. For the combinational circuit shown below, use the PODEM algorithm to determine tests for line Lbeing
stuck-at-1 and Mstuck-at-0. Show all steps of the algorithm.
5. Generate a self-dual function f(X) of three variables X= (x1, x2, x3). Recall that a self-dual satisfies the
1
pf2

Partial preview of the text

Download Conditional Probability - Dependable Computing Systems - Homework and more Exercises Computer Science in PDF only on Docsity!

ECE-C690: Dependable Computing

Homework 1

January 13, 2009

The homework is due in class Monday, January 26, 2009.

Each problem is worth 10 points.

  1. The lifetime (measured in years) of a processor is exponentially distributed with a mean lifetime of 2 years. You are told that a processor failed sometime in the interval [4, 8] years. Given this information, what is the conditional probability that it failed before it was 5 years old?
  2. Argue that the bathtub curve, used to represent the failure-rate trend in hardware components, is applica- ble to software as well with the proper interpretation. For example, let time t = 0 represent the completion of the first prototype of the software, which is then followed by various pre-release beta versions and, eventually, the first released version, with the latter ideally occurring at the end of infant mortality.
  3. For the combinational circuit shown below, use the D-algorithm to determine a test for line 5 being stuck- at-0. Show all steps of the algorithm. What other (if any) stuck-at-1 or stuck-at-0 faults will be detected by the resulting test pattern.
  4. For the combinational circuit shown below, use the PODEM algorithm to determine tests for line L being stuck-at-1 and M stuck-at-0. Show all steps of the algorithm.
  5. Generate a self-dual function f (X) of three variables X = (x 1 , x 2 , x 3 ). Recall that a self-dual satisfies the

property f (X) = f¯ ( X¯). How many three-variable self-dual functions can we generate?

  1. Design a 2-of-4 code checker that uses alternating logic and time redundancy to detect faults in the checker circuitry. In general, the function of a checker in the M -of-N code is to verify that the code has exactly M 1s.
  2. Using duplication with comparison and complementary logic, design a 2-bit full-adder. The 2-bit full- adder accepts as inputs two 2-bit binary words and a carry in bit while producing a 2-bit sum and a carry-out bit as outputs. Show the complete logic diagram of the resulting circuit, including the comparator, using only NAND and NOR gates. For the case where the input words are 01 and 11 and the carry-in is 1, show the logical value of each line (including internal lines) within the circuit.