Node Statement (1) while (x<100) { 30 (2) if (a[x] 2 300 == 0) { parity = 0; } else { parity = 1; } switch (parity) { case 0: println("a[“ + i + »] is even"); case 1: println("a[“ + i + ] is odd"); default: (7) (8) (9) } (10) x++; } (11) p = true; println("Unexpected error"); Example of a Java program and its corresponding flowgraph 3 2 4 5 6 8 (10 11 Synopsis: The following pseudocode finds all prime numbers less then n. Eratosthenes (n) { e[1]: = 0 for i: = p: = = 2 2 to n do e[i]: = 1 while p*2
Node Statement (1) while (x<100) { 30 (2) if (a[x] 2 300 == 0) { parity = 0; } else { parity = 1; } switch (parity) { case 0: println("a[“ + i + »] is even"); case 1: println("a[“ + i + ] is odd"); default: (7) (8) (9) } (10) x++; } (11) p = true; println("Unexpected error"); Example of a Java program and its corresponding flowgraph 3 2 4 5 6 8 (10 11 Synopsis: The following pseudocode finds all prime numbers less then n. Eratosthenes (n) { e[1]: = 0 for i: = p: = = 2 2 to n do e[i]: = 1 while p*2
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
I need a flow graph that contains a start node and a terminal node. and continue solving b and c
I have provided an example of Java code and its corresponding flow graph. I would like you to solve the question using the same approach.
![Node Statement
(1) while (x<100) {
30
(2)
if (a[x] 2
300
==
0) {
parity
=
0;
}
else {
parity =
1;
}
switch (parity) {
case 0:
println("a[“ + i + »] is even");
case 1:
println("a[“ + i + ] is odd");
default:
(7)
(8)
(9)
}
(10)
x++;
}
(11)
p =
true;
println("Unexpected error");
Example of a Java program and its corresponding flowgraph
3
2
4
5
6
8
(10
11](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F757162cb-0e42-4121-907b-d44395b18f9f%2F61093c5c-66e0-49ec-ba69-bb70592844fe%2Fqk502y_processed.png&w=3840&q=75)
Transcribed Image Text:Node Statement
(1) while (x<100) {
30
(2)
if (a[x] 2
300
==
0) {
parity
=
0;
}
else {
parity =
1;
}
switch (parity) {
case 0:
println("a[“ + i + »] is even");
case 1:
println("a[“ + i + ] is odd");
default:
(7)
(8)
(9)
}
(10)
x++;
}
(11)
p =
true;
println("Unexpected error");
Example of a Java program and its corresponding flowgraph
3
2
4
5
6
8
(10
11
![Synopsis:
The following pseudocode finds all prime numbers less then n.
Eratosthenes (n) {
e[1]: = 0
for i: =
p:
=
= 2
2 to n do e[i]: = 1
while p*2<n do {
j: = p*2
while (j<n) do {
e[j]: = = 0
j: = j+p
}
repeat p:
=
p+1 until e[p] = 1
}
return(a)
}
Do the Following:
You are required to provide :
a) Draw the flow graph notation for the code.
b) construct the decomposition notation by decomposing the graph to the prime graphs to represent the
graphs' sequencing and nesting.
○ Calculate the depth of nesting a using the extracted notation.
○ Calculate the Formal length v using the extracted notation.
O Calculate number of node n and number of edge e using the extracted notation.
c) Calculate the cyclomatic complexity number v using the graph.
○
Calculate the cyclomatic complexity number directly from the code by identifying the line
number you use for your calculation.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F757162cb-0e42-4121-907b-d44395b18f9f%2F61093c5c-66e0-49ec-ba69-bb70592844fe%2Fusbhp4_processed.png&w=3840&q=75)
Transcribed Image Text:Synopsis:
The following pseudocode finds all prime numbers less then n.
Eratosthenes (n) {
e[1]: = 0
for i: =
p:
=
= 2
2 to n do e[i]: = 1
while p*2<n do {
j: = p*2
while (j<n) do {
e[j]: = = 0
j: = j+p
}
repeat p:
=
p+1 until e[p] = 1
}
return(a)
}
Do the Following:
You are required to provide :
a) Draw the flow graph notation for the code.
b) construct the decomposition notation by decomposing the graph to the prime graphs to represent the
graphs' sequencing and nesting.
○ Calculate the depth of nesting a using the extracted notation.
○ Calculate the Formal length v using the extracted notation.
O Calculate number of node n and number of edge e using the extracted notation.
c) Calculate the cyclomatic complexity number v using the graph.
○
Calculate the cyclomatic complexity number directly from the code by identifying the line
number you use for your calculation.
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