This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CS 130 — Spring 2009 Problem Set #3 Software Engineering Due May 13, 11:59a.m. Problem 3.1. (5 points) Which of the following statements are true? 1. 100% path coverage implies 100% branch coverage 2. 100% statement coverage implies 100% branch coverage 3. Suppose test suite T 1 gets 100% branch coverage and test suite T 2 gets 100% statement coverage. There can be an execution path explored in T 2 but not by T 1 . 4. There is a program such that no test suite can get 100% branch cov- erage. 5. There are incomparable coverage metrics; i.e., there are two coverage metrics such that 100% coverage for metric 1 does not imply 100% coverage for metric 2 and vice versa. Problem 3.2. (10 points) Many programs (e.g., for communication protocols) are written as finite state machines, for example, in a language like Statecharts. The program has a set of “states”, a set of “input events”, and a set of “output events”. The program starts in some initial state. At each state, the program waits for an input event. Depending on the currenteach state, the program waits for an input event....
View Full Document
This note was uploaded on 04/28/2010 for the course CS 130 taught by Professor Staff during the Spring '08 term at UCLA.
- Spring '08
- Software engineering