Questions on Checking the Software Solution (1 Viewer)

[velox]

What is the maximum number of paths that a module of code containing five binary selections could have?

 

[raymes]

if every binary selection was sequential (ie, not nested), there would be 2^5=32 paths -- i think...somone correct me if im wrong

 

[velox]

ah ic, i thought it was 5! . Thanks, I have a couple of more questions though
Desk checking can be a laborious task. Describe tools available to assist when desk checking source code.

I know there are CASE tools but thats about it. (I think!)

 

[raymes]

ah ic, i thought it was 5! . Thanks, I have a couple of more questions though
Desk checking can be a laborious task. Describe tools available to assist when desk checking source code.

I know there are CASE tools but thats about it. (I think!)

this is difficult because strictly speaking a desk check requires only a pen and paper! being performed by hand (ie desk) rather than on computer means that there are few tools available to assist desk checking so IMO, its a flawed question. Nonethless, if you wanted to be less picky about the question, you could go on to talk about things like watch expressions and sinlge line stepping. Most programming IDEs allow variables to be selected to be placed in a "watch" window. In this window, the values of selected variables are displayed and updated as the program executes. By executing the program slowly (e.g., using single line stepping to increment program execution), the values of variables can be tracked and could be logged by the IDE or written down by hand. In this way it is possible to perform a sort of desk check. If you wanted to go even further, you could talk about CASE tools that automate the testing process but i think this is getting too far away from the concept of a desk check.

 

[velox]

I think it means CASE tools though..but ill talk about the points you raised aswell.

 

[velox]

any idea on case tools?