.... How to Find Your Subject Study Group & Join ....   .... Find Your Subject Study Group & Join ....  

We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Study Groups By Subject code Wise (Click Below on your university link & Join Your Subject Group)

[ + VU Study Groups Subject Code Wise ]  [ + COMSATS Virtual Campus Study Groups Subject Code Wise ]

Looking For Something at vustudents.ning.com?Search Here


Assignment No.4


Semester Fall 2016 CS504 - Software Engineering-I



Total Marks: 15




Due Date: 13/02/2017



To learn and understand the basic concepts of Testing .






Please read the following instructions carefully before solving & submitting assignment: Assignment should be in your own wordings not copied from net, handouts or books.    It should be clear that your assignment will not get any credit (zero marks) if:



  • The assignment is submitted after due date.
  • The submitted assignment does not open or file corrupt.
  • The assignment is copied (from other student or copy from handouts or internet).



For any query about the assignment, please communicate at CS504@vu.edu.pk


You are advised to please upload the assignment in MS Word format only (other formats i.e.

.pdf, images etc. will not be accepted.).



Question No 1:                                                                                                     15 Marks


Cyclomatic complexity (CC) is a technique, which is used to measure the source code complexity in a program during testing phase. It is calculated by developing a Control Flow Graph of the code that measures the number of linearly-independent paths through a program module. For the code given below:


void function(int x, int y)


for(int i=0; i<100; i++)


if(x != i)

 print x-i;


 Print x*i;




while(x>0 and x != y)






 print x+y;




a)    Draw the control flow graph (Check the handouts carefully)

b)    Calculate the Cyclomatic Complexity

c)     Identify all the possible traversable paths

This Content Originally Published by a member of VU Students.

Views: 10795

See Your Saved Posts Timeline


Replies to This Discussion

D3W4N4 node 1 void function sy start ho gi ya for lopp sy kindly bata dain

hosh karo cs504 walo assignment ai hoi hai koe to discuss karo....................

please check Handout page no 208 Lec No. 39

hope it will help us

please send solved assignment

Please Discuss here about this assignment.Thanks

Our main purpose here discussion not just Solution

We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions. Read More>>



For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.

For how you can view all the Featured discussions click on the Back to Subject Name Discussions link below the title of this Discussion & then under featured Discussion corner click on the view all link.

Or visit this link 

Click Here For Detail.


.•°How to Download past papers from study groups°•.


Please Click on the below link to see…

.... How to Find Your Subject Study Group & Join .... 


  1. 1-2-4-1-10
  2. 1-3-4-1-10
  3. 1-5-6-9-10
  4. 1-5-7-8-9-10
  5. 1-5-6-9-5-7-8-9-10

amjad shafiq kaya ye paths bilkul thik hain

it depends how you numbering the code.

pleas koi idea dy.

amjad bhai.. please review your assignment....
and please tell what is the cyclomatic complexity of this source code.? im waiting for your reply



© 2017   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service