cp13_14_ps11_s04

# cp13_14_ps11_s04 - loop exit when Flag:= True if A< 100...

This preview shows pages 1–2. Sign up to view the full content.

C13-14 The problems in this problem set cover lectures C13 and C14 1. a. Define a robust algorithm to carry out integer division using repeated subtraction. Your algorithm accepts two integers and returns the quotient and the remainder. Hint : What are the preconditions and postconditions of your algorithm? b. Implement your algorithm as an Ada95 program, using exception handling to provide robustness. Turn in a hard copy of your algorithm and code listing, and an electronic copy of your code. 2. a. What is the cyclomatic complexity of the code fragment shown below?

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: loop exit when Flag := True; if A < 100 and B > 200 then if A > 50 then Sum := Sum + 2 ; else Sum := Sum + 1 ; end if ; else if B < 300 then Sum:= Sum -1 ; else Sum := Sum -2 ; end if ; end if ; end loop ; Hint : Draw the control flow graph b. What is the minimum number of test cases needed to test the fragment of code shown below? Justify your answer . if A < 100 and B > 200 then if A > 50 then Sum := Sum + 2 ; else Sum := Sum + 1 ; end if ; else if B < 300 then Sum:= Sum -1 ; else Sum := Sum -2 ; end if ; end if ;...
View Full Document

## This note was uploaded on 01/28/2012 for the course AERO 16.01 taught by Professor Markdrela during the Fall '05 term at MIT.

### Page1 / 2

cp13_14_ps11_s04 - loop exit when Flag:= True if A< 100...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online