Welcome to the Software Testing Laboratory

Here is the list of experiments

1. Design and develop a program to solve the triangle problem. Analyze it from the perspective of Decision-table approach. Derive test cases for your program, execute the test cases and discuss the results.
   • Theory
   • Execution
2. Design and develop a program to solve the triangle problem. Analyze it from the perspective of Boundary-value analysis. Derive test cases for your program, execute the test cases and discuss the results.
   • Theory
   • Execution
3. Design and develop a program to solve the triangle problem. Analyze it from the perspective of Equivalence class partitioning. Assume that the upper limit for the size of any side is 10. Derive test cases for your program, execute the test cases and discuss the results.
   • Theory
   • Execution
4. Design and develop a program to solve the commission problem. Analyze it from the perspective of Decision-table approach. Derive different test cases, execute these test cases and discuss the test results.
   • Theory
   • Execution
5. Design and develop a program to solve the commission problem. Analyze it from the perspective of Boundary-value analysis. Derive different test cases, execute these test cases and discuss the test results.
   • Theory
   • Execution
6. Design and develop a program to solve the commission problem. Analyze it from the perspective of Equivalence class partitioning. Derive different test cases, execute these test cases and discuss the test results.
   • Theory
   • Execution
7. Design and develop a program to solve the commission problem. Analyze it from the perspective of Dataflow testing. Derive different test cases, execute these test cases and discuss the test results.
   • Theory
   • Execution
8. Design and develop a program to implement the Binary Search algorithm. Determine the basis paths and using them derive different test cases, execute these test cases and discuss the test results.
   • Theory
   • Execution
9. Design and develop a program to implement the Quick Sort algorithm. Determine the basis paths and using them derive different test cases, execute these test cases and discuss the test results.
   • Theory
   • Execution
10. Design and develop a program to implement an Absolute Letter Grading procedure, making suitable assumptions. Determine the basis paths and using them derive different test cases, execute these test cases and discuss the test results.
    • Theory
    • Execution
11. Design and develop a program to implement the NextDate function. Analyze it from the perspective of Boundary-value testing. Derive different test cases, execute these test cases and discuss the test results.
    • Theory
    • Execution
12. Design, develop, code and run the program in any suitable language to implement the NextDate function. Analyze it from the perspective of equivalence class value testing, derive different test cases, execute these test cases and discuss the test results.
    • Theory
    • Execution