www.vustudents.ning.com

# CS608 Assignment No 01 Fall 2020 Solution & Discussion Due Date: 28-11-2020

 Software Verification and Validation (CS608) Fall 2020 Assignment # 01 Total marks = 20                                                                                 Due Date: 28th November, 2020 Please carefully read the following instructions before attempting assignment. INSTRUCTIONS It should be clear that your assignment would not get any credit if: The assignment is submitted after the due date. The submitted assignment does not open or file is corrupt. Strict action will be taken if submitted solution is copied from any other student or from the internet. You should concern the recommended books to clarify your concepts as handouts are not sufficient. You are supposed to submit your assignment in .doc or docx format. Any other formats like scanned images, PDF, zip, rar, ppt and bmp etc. will not be accepted.   Topics Covered: ·         Control Flow Graph NOTE No assignment will be accepted after the due date via email in any case (whether it is the case of load shedding or Internet issues etc.). Hence refrain from uploading assignment in the last hour of deadline. It is recommended to upload solution file well before its closing date. If you find any mistake or confusion in the assignment (Question statement), please consult with your Instructor before the deadline. After the deadline no queries will be entertained in this regard. For any query, feel free to email at cs608@vu.edu.pk

Question No. 1.                                                                                                          (Marks 12)

Draw the Control Flow Graph for the following piece of code.

namespace AssigmntONE

{

public class MyAverage

{

public double ReturnAverage(int[] value, int MIN, int MAX)

{

1. int i, tv, sum;
2. double av;
3. i = 0; tv = 0; sum = 0;
4. while (i < MAX)

{

1. if (value[i] >= MIN && value[i] <= MAX)

{

1. tv++;
2. sum = sum + value[i];

}

1. i++;

}

1. if (tv > 0)
2. av = (double)sum / tv;
3. else
4. av = (double)-999;
5. return (av);

}

}

}

Question No. 2.                                                                                                          (Marks 8)

Find all the independent paths for the graph developed in question 1.

Note:

• You should use Microsoft Visio or some other drawing tool to develop the required Graph for question#1.
• The diagram should be pasted in the MS Word file as an image, and the MS Word (.docx) file should be uploaded on VULMS.

v

Views: 592

Attachments:

### Replies to This Discussion

Our main purpose here discussion not just Solution

Students having same subject can start discussion here to solve assignment, GDB & Quiz and can clear their concepts until solution is provided.

P.S:    Please always try to add the discussion in proper format title like “CS101 Assignment / GDB No 01 Solution & Discussion Due Date: ___________”

Then copy Questions from assignment file and paste in Discussion.

http://bit.ly/vucodes (For Assignments, GDBs & Online Quizzes Solution)

http://bit.ly/papersvu (For Past Papers, Solved MCQs, Short Notes & More)

ksi n bnai h yr assignment?

Kindly Koi solution post kr dy

CS608 Solution Assignment#01 Fall 2020

CS608_Assignment_No_01_Solution_Fall_2020

CS608 Complete Solution Assignment#01 Fall 2020

CS608_Complete_Solution-Assignment#01_Fall_2020

CS608 Solution Assignment#01 Fall 2020

CS608_Assignment_No_01_Solution_Fall_2020

cs608 assignment no 1 solution

CS608 Assignment 1 solution 2020

Question No. 1. (Marks 12)
Draw the Control Flow Graph for the following piece of code.

namespace AssigmntONE
{
public class MyAverage
{
public double ReturnAverage(int[] value, int MIN, int MAX)
{
1. int i, tv, sum;
2. double av;
3. i = 0; tv = 0; sum = 0;
4. while (i < MAX)
{

5. if (value[i] >= MIN && value[i] <= MAX)
{
6. tv++;
7. sum = sum + value[i];
}
8. i++;
}
9. if (tv > 0)
10. av = (double)sum / tv;
11. else
12. av = (double)-999;
13. return (av);
}

}
}

Solution:

Question No. 2. (Marks 8)
Find all the independent paths for the graph developed in question 1.
Independent paths = 13-12+2
Independent paths = 3

CS608 Complete Solution Assignment#01 Fall 2020

CS608_Complete_Solution-Assignment#01_Fall_2020

1

2

3

4

5

## Latest Activity

shanzy muskan updated their profile
1 hour ago
shanzy muskan joined + M.Tariq Malik's group

### PSY406 Educational Psychology

1 hour ago
shanzy muskan joined + M.Tariq Malik's group

### ISL201 Islamic Studies

1 hour ago
shanzy muskan joined + M.Tariq Malik's group

### ENG506 World Englishes

1 hour ago
shanzy muskan joined + M.Tariq Malik's group

### ENG503 Introduction to English Language Teaching

1 hour ago
shanzy muskan joined + M.Tariq Malik's group

### ENG201 Business and Technical English Writing

1 hour ago
shanzy muskan joined + M.Tariq Malik's group

1 hour ago