#include main() { int a, b, c,d; clrscr(); printf("enter the two variables a,b"); scanf("%d %d",&a,&b); printf("enter the option 1: Addition, 2:subtraction, 3: multiplication, 4: division"); scanf("%d", &c); switch(c) { case 1:da+b; printf("Addition of two no.=%d", d); break; case 2:d = a-b; printf("Subtraction of two no.=%d", d); break; case 3:d = a*b; printf("Multiplication of two no.=%d", d); break; case 4:d = a/b; printf("division of two no.-%d",d); break; } } (a) Draw the DD graph for the program. (b) Calculate the cyclomatic complexity of the program using all four methods. (c) List all independent paths. (d) Design all test cases from independent paths. (e) Derive all du-paths and dc-paths using data flow testing.
#include main() { int a, b, c,d; clrscr(); printf("enter the two variables a,b"); scanf("%d %d",&a,&b); printf("enter the option 1: Addition, 2:subtraction, 3: multiplication, 4: division"); scanf("%d", &c); switch(c) { case 1:da+b; printf("Addition of two no.=%d", d); break; case 2:d = a-b; printf("Subtraction of two no.=%d", d); break; case 3:d = a*b; printf("Multiplication of two no.=%d", d); break; case 4:d = a/b; printf("division of two no.-%d",d); break; } } (a) Draw the DD graph for the program. (b) Calculate the cyclomatic complexity of the program using all four methods. (c) List all independent paths. (d) Design all test cases from independent paths. (e) Derive all du-paths and dc-paths using data flow testing.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question

Transcribed Image Text:#include <stdio.h>
main()
{
int a, b, c,d;
clrscr();
printf("enter the two variables a,b");
scanf("%d %d",&a,&b);
printf("enter the option 1: Addition,
2:subtraction, 3: multiplication, 4: division");
scanf("%d", &c);
switch(c)
{
case 1:da+b;
printf("Addition of two no.=%d", d);
break;
case 2:d = a-b;
printf("Subtraction of two no.=%d", d);
break;
case 3:d = a*b;
printf("Multiplication of two no.=%d", d);
break;
case 4:d = a/b;
printf("division of two no.-%d",d);
break;
}
}
(a) Draw the DD graph for the program.
(b) Calculate the cyclomatic complexity of the program using all four methods.
(c) List all independent paths.
(d) Design all test cases from independent paths.
(e) Derive all du-paths and dc-paths using data flow testing.
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps

Recommended textbooks for you

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON

Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education