2. Based on the below code answer the questions that follows: #include Using Namespace std; double...

  

Transcribed Image Text:

2. Based on the below code answer the questions that follows: #include <iostream> Using Namespace std; double total, hours; int main () { endl; } cout << "Charges for the first 3 hours = RM2.00" << endl; cout << "Additional charges for the next hours = RM1.50" << endl; cout << "Maximum charges for any 24 hours = RM20.00" << endl; cout <<"\nPlease insert your hours = "; cin >> hours; if ((hours <=3) && (hours > 0)) else { } else ( } else cout << "\nYour total fee is RM2.00" << endl; if ((hours>3) && (hours<=15)) total = 2.00+ ((hours-3) *1.50); cout << "\nYour total fee is RM" << total << endl; if (hours>15) cout <<"\nYour total fee is RM20.00" << endl; cout <<"\nError! Please insert a valid number of hours" << system("PAUSE"); return 0; a) Draw a Flow Graph for the above procedure. b) Calculate the cyclomatic complexity of Figure 1 procedure. c) Identify and list down all independent paths based on your answer in (a) d) Design a test case to force execution down each independent path. Use a table when designing your test cases. 2. Based on the below code answer the questions that follows: #include <iostream> Using Namespace std; double total, hours; int main () { endl; } cout << "Charges for the first 3 hours = RM2.00" << endl; cout << "Additional charges for the next hours = RM1.50" << endl; cout << "Maximum charges for any 24 hours = RM20.00" << endl; cout <<"\nPlease insert your hours = "; cin >> hours; if ((hours <=3) && (hours > 0)) else { } else ( } else cout << "\nYour total fee is RM2.00" << endl; if ((hours>3) && (hours<=15)) total = 2.00+ ((hours-3) *1.50); cout << "\nYour total fee is RM" << total << endl; if (hours>15) cout <<"\nYour total fee is RM20.00" << endl; cout <<"\nError! Please insert a valid number of hours" << system("PAUSE"); return 0; a) Draw a Flow Graph for the above procedure. b) Calculate the cyclomatic complexity of Figure 1 procedure. c) Identify and list down all independent paths based on your answer in (a) d) Design a test case to force execution down each independent path. Use a table when designing your test cases.

Answer rating: 100% (QA)

b Cyclotic Complexity VG en2 where e is the no of edges n is no of vertices Cyclotic ... View the full answer