4.
Design and develop a program in a language of your choice to solve the triangle problem
defined as follows: Accept three integers which are supposed to be the three sides of a
triangle and determine if the three values represent an equilateral triangle, isosceles
triangle, scalene triangle, or they do not form a triangle at all. Assume that the upper limit
for the size of any side is 10. Derive test cases for your program based on equivalence
class partitioning, execute the test cases and discuss the results.
5.
Design, develop, code and run the program in any suitable language to solve the commission
problem. Analyze it from the perspective of equivalence class testing, derive different test
cases, execute these test cases and discuss the test results.
6.
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.
7.
Design and develop a program in a language of your choice to solve the triangle problem
defined as follows: Accept three integers which are supposed to be the three sides of a
triangle and determine if the three values represent an equilateral triangle, isosceles triangle,
scalene triangle, or they do not form a triangle at all. Derive test cases for your program
based on decision-table approach, execute the test cases and discuss the results.
8.
Design, develop, code and run the program in any suitable language to solve the commission
problem. Analyze it from the perspective of decision table-based testing, derive different test

cases, execute these test cases and discuss the test results.
9.
Design, develop, code and run the program in any suitable language 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.
10.
Design, develop, code and run the program in any suitable language 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.
11.
Design, develop, code and run the program in any suitable language to implement the
quicksort algorithm. Determine the basis paths and using them derive different test cases,
execute these test cases and discuss the test results.
12.
Design, develop, code and run the program in any suitable language 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
Laboratory Outcomes
: The student should be able to:
•
List out the requirements for the given problem
•
Design and implement the solution for given problem in any programming
language(C,C++,JAVA)
•
Derive test cases for any given problem
•
Apply the appropriate technique for the design of flow graph.


You've reached the end of your free preview.
Want to read all 111 pages?
- Winter '19
- manu
- Computer Science, Data Structures, The Bible, The Land, embedded system