Consider the following program segment

Assignment Help Software Engineering
Reference no: EM1312992

Q1) Use the following method printPrimes() for questions a-f below.

1. /** *****************************************************

2. * Finds and prints n prime integers

4. ********************************************************* */

5. private static void printPrimes (int n)

6. {

7. int curPrime; // Value currently considered for primeness

8. int numPrimes; // Number of primes found so far.

9. boolean isPrime; // Is curPrime prime?

10. int [] primes = new int [MAXPRIMES]; // The list of prime numbers.

11.

12. // Initialize 2 into the list of primes.

13. primes [0] = 2;

14. numPrimes = 1;

15. curPrime = 2;

16. while (numPrimes < n)

17. {

18. curPrime++; // next number to consider ...

19. isPrime = true;

20. for (int i = 0; i <= numPrimes-1; i++)

21. { // for each previous prime.

22. if (isDivisible (primes[i], curPrime))

23. { // Found a divisor, curPrime is not prime.

24. isPrime = false;

25. break; // out of loop through primes.

26. }

27. }

28. if (isPrime)

29. { // save it!

30. primes[numPrimes] = curPrime;

31. numPrimes++;

32. }

33. } // End while

34.

35. // Print all the primes out.

36. for (int i = 0; i <= numPrimes-1; i++)

37. {

38. System.out.println ("Prime: " + primes[i]);

39. }

40. } // end printPrimes

(a) Draw the control flow graph for the printPrimes() method.

(b) Consider test cases t1 = (n = 3) and t2 = (n = 5). Although these tour the same prime paths in printPrimes(), they do not necessarily find the same faults. Design a simple fault that t2 would be more likely to discover than t1 would.

(c) For printPrimes(), find a test case such that the corresponding test path visits the edge that connects the beginning of the while statement to the for statement without going through the body of the while loop.

(d) Enumerate the test requirements for node coverage, edge coverage, and prime path coverage for the graph for printPrimes().

(e) List test paths that achieve node coverage but not edge coverage on the graph.

(f) List test paths that achieve edge coverage but not prime path coverage on the graph.

 

Q2) Consider the following program segment

main()

{

char string[80];

int index;

printf("Enter the string for checking its characters");

scanf("%s", string):

for(index=0; string[index] !='\0'; ++index) {

            if((string[index] >='0'&&(string[index] <='9'))

                        printf("%c is a digit", string[index]);

            else if ((string[index] >='A' && string[index] < 'Z') || (string[index] >='a' && string[index] < 'z'))

                        printf("%c is an Alphabet", string[index]);

            else

                        printf("%c is a Special Character", string[index]);

}

}

(a)    Draw the DD graph for the program

(b)   Calculate the cyclomatic complexity of the program using all the methods.

(c)    List all the independent paths

(d)   Design test cases from independent paths.

 

Q3) A program has been designed to determine the nature of root of quadratic equation. The quadratic equation takes three input values from the range [0, 100]. Design the test cases using cause effect graphing technique.

 

Q4)      Draw a decision table for US Income Tax System;

If income is                          Tax is

$0 - 20K                      15% of total income

$20 -50K                     $3K + 25% of amount over $20K

Above $50K               $10.5K + 40% of amount over $50K

 

Q5)      Draw program's Flow Graph for the following code fragment and Find minimal number of test cases for the following coverage types:

a)      Statement Coverage

b)      Path Coverage

c)      Branch Coverage

d)     Basic Path Coverage

1          d = b + c;

2          if (d > 20)

3          a = 3 * a + d;

4          if (b < a) {

5              a = 1;

6              if (d < 2 * b)

7                  b = 2;

8          }

 

Q6) Explain the significance of boundary value analysis. What is the purpose of worst case testing?

Reference no: EM1312992

Describe two major erp systems

Create a 7-to10-slide presentation comparing and contrasting two major ERP systems from different ERP software providers. You may use various sources including the companies

Draw fully annotated e-r diagram showing entities

Find the case requirements and analyze them. A fully annotated E-R diagram 1 and 2 showing the entities, primary and foreign keys, composite keys and relationships.

Relationship of application development methodologies-models

Explain the relationships between application development methodologies, models, and tools. Compare and contrast the various generations of programming languages.

Importance of various system analysis

In this class, we've stressed the importance of various system analysis and design tools and techniques. By now you should have a "toolbox" full of useful design and analys

Describing the steps the program will perform

An algorithm in pseudocode describing the steps the program will perform. This pseudocode algorithm would consist of a list of steps explaining the sequence of tasks the pro

Construct an entity-­relationship model for the database

Construct an entity-­relationship (ER) model for the database. Make sure you include in your model details of entities, relationships, attributes, keys and cardinality for r

Viruses and malicious software

Viruses and Malicious Software  Web Strategies and Protocols (browsers, cryptographic posture, and server and protocol securities)

Calculate the monthly management fee payable

Which manages rental properties and charges the owner a management fee - the For Realz Accountant has devised the following rules to calculate the monthly management fee payab

Reviews

Write a Review

 
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd