Posts

Showing posts from November 30, 2017

Sample Questions and Approach to Solve them

Image
Critical chapter of Foundation syllabus is Test design Technique. So, i want to start from there. Calculate Statement, Branch/Decision and Path coverage for code below ? Read X,Y; If (X>Y) Then print" X is greater"; End If If (X+Y > 100) Then print "large";    If (Y == 50)     Then print "X should be more than 50";    End If End If Answer:  Lets draw flow diagram for this code which will help us solve the problem easily. Statement Coverage: Now, lets calculate statement coverage, find out the shortest path covering  all nodes . If we consider exam above. Then Statement Coverage = 1A- 2C- 3D -4F -5G-6I-7J-K So, traversing in one path all the nodes are covered. Hence statement coverage in this case is 1. Branch Coverage: To calculate Branch/decision coverage we need to find out minimum number of paths covering  all the edges.  In this case, with path 1A-2C-3D -4F -5G-6I-7J-K maximum number of edges can be covered howev