Tutorial 5, Q1.

DESCRIPTION

Tutorial 5, Q1. Briefly describe the purpose and principles of program slicing. Tutorial 5, Q2. Consider the program below. a. By inspection give the dataflow slice wrt (10,{sqs}) b What is the smallest possible slice of the program? What criterion would give this slice?. count := 0;

Download

1 / 2

Aug 21, 2014

Télécharger la présentation

Tutorial 5, Q1.

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

Tutorial 5, Q1. • Briefly describe the purpose and principles of program slicing.
Tutorial 5, Q2 • Consider the program below. a. By inspection give the dataflow slice wrt (10,{sqs}) b What is the smallest possible slice of the program? What criterion would give this slice? • count := 0; • sum := 0; • sqs := 0; • read(x); • while( x >= 0) do • count := count + 1; • sum := sum + x; • sqs := sqs + (x*x); • read(x); • write(count,sum,sqs)