Rose added a discussion to the group CS608 Software Verification and Validation

Rose added a discussion to the group CS608 Software Verification and Validation
Thumbnail

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

Software Verification and Validation (CS608)Fall 2020Assignment # 01        Total marks = 20                                                                               Due Date:28th November, 2020 Please carefully read the following instructions before attempting assignment.INSTRUCTIONSIt 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 NOTENo 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)        {int i, tv, sum;double av;i = 0; tv = 0; sum = 0;while (i < MAX)            { if (value[i] >= MIN && value[i] <= MAX)                {tv++;sum = sum + value[i];                }i++;            }if (tv > 0)av = (double)sum / tv;elseav = (double)-999;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. Your solution must be uploaded on or before 28th Nov 2020   vSee More


from Latest Activity on Virtual University of Pakistan https://ift.tt/3nBAekW

0 comments:

Post a Comment