Dynamic Testing: Black Box Testing — past-year questions

Questions asked on Dynamic Testing: Black Box Testing

1. 1.

   Explain mutation testing in software testing and illustrate its working with a suitable example.

   5M1× seenlast asked 2026
2. 2.

   Differentiate between Black Box Testing and White Box Testing based on their characteristics, techniques, and applications.

   10M1× seenlast asked 2026
3. 3.

   A program accepts an angle as input within the range [0°, 360°] and determines the quadrant in which the angle lies. Design appropriate test cases using the Equivalence Class Partitioning (ECP) technique.

   10M1× seenlast asked 2026
4. 4.

   Consider following C code. main() { int number, index; 1. printf("Enter a number"); 2. scanf("%d",&number); 3. index=2; 4. while(index<=number-1) 5. { 6. if(number%index==0) 7. { 8. printf("Not a prime number"); 9. break; 10. } 11. index++; 12. } 13. if(index==number) 14. printf("prime number"); 15. } // end main Draw the control flow graph of the given pseudocode. Determine the cyclomatic complexity of the graph. List all the independent paths and design test cases from all the independent paths.

   10M1× seenlast asked 2026
5. 5.

   A program reads an integer number within the range [1,100] and determines whether it is a prime number or not. Design test cases for this program using BVC, robust testing, and worst-case testing methods.

   10M1× seenlast asked 2025
6. 6.

   Explain Mutation Testing in detail.

   10M1× seenlast asked 2025
7. 7.

   What are graph metrics? Explain with an example how to calculate cyclomatic complexity using graph metrics.

   10M1× seenlast asked 2025
8. 8.

   Inspection

   5M1× seenlast asked 2025
9. 9.

   Compare Static and Dynamic Testing.

   5M1× seenlast asked 2024
10. 10.

    A program takes an angle as input within the range [0,360] and determines in which quadrant the angle lies. Design test cases using equivalence class partitioning method.

    10M1× seenlast asked 2024
11. 11.

    Consider the program for calculating the factorial of a number. It consists of main() program and the module fact(). Calculate the individual cyclomatic complexity number for main() and fact() and then, the cyclomatic complexity for the whole program. main() { int number; int fact(); clrscr(); printf("Enter the number whose factorial is to be found out"); scanf("%d", &number); if(number <0) printf("Facorial cannot be defined for this number"); else printf("Factorial is %d", fact(number)); } int fact(int number) { int index; int product =1; for(index=1; index<=number; index++) product = product * index; return(product); }

    10M1× seenlast asked 2024
12. 12.

    Explain Error Guessing in Dynamic Testing.

    5M1× seenlast asked 2024
13. 13.

    Consider the following program segment: main() { int number, index; 1. printf("Enter a number"); 2. scanf("%d", &number); 3. index = 2; 4. while(index <= number - 1) 5. { 6. if (number % index == 0) 7. { 8. printf("Not a Prime number"); 9. break; 10. } 11. index++; 12. } 13. if(index == number) 14. printf("Prime number"); 15. } //end main (a) Draw the DD graph for the program. (b) Calculate the cyclomatic complexity of the program using all the methods. (c) List all independent paths. (d) Design test cases from independent paths.

    10M1× seenlast asked 2024

Want the answers to these questions?

The questions above are free to read. Create a free account to get AI model answers for Software Testing and QA, a curated set of the questions that matter most, flashcard revision, and a study plan built around your exam date.

Other topics in ITDO7014

• Introduction, Goals of Software Testing, Software Testing Definitions
• Verification and Validation
• Validation Activities
• Test Management
• Efficient Test Suite Management
• Automation and Testing Tools
• Study of testing tools
• Agile Testing, Agile Testing Life Cycle, Testing in Scrum phases, Challenges in Agile Testing