Consider the intermediate code given below:
1. i = 1
2. j = 1
$3. t_{1} = 5 * i$
$4. t_{2} = t_{1} + j$
$5. t_{3} = 4 * t_{2}$
$6. t_{4} = t_{3}$
$7. a [t_{4}] = - 1$
8. j = j + 1
9. if j < = 5 goto (3)
10. i = i + 1
11. if i < 5 goto (2)
The number of nodes and edges in the control-flow-graph constructed for the above code respectively, are

5 and 5

No worries! We‘ve got your back. Try BYJU‘S free classes today!

7 and 8

No worries! We‘ve got your back. Try BYJU‘S free classes today!

5 and 7

No worries! We‘ve got your back. Try BYJU‘S free classes today!

6 and 7

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

Open in App

Solution

The correct option is D 6 and 7

Number of nodes = 6
Number of edges = 7

Suggest Corrections

Similar questions

Q. Consider the following C code segment.
for (i = 0; i < n; i ++)
{
for (j = 0; j < n; j ++)
{
if (i % 2)
{ x + = (4 * j + 5 * i);
y + = (7 + 4 *j);
}
}
}
which one of the following is false?

Q. Consider the C program given below. What does it print?

# include <stdio.h>
int main ( )
{
int i, j;
int a[8] = {1, 2, 3, 4, 5, 6, 7, 8};
for (i = 0; i < 3; i++)
{
a[i] = a[i]+1;
i++;
}
i - - ;
for (j = 7; j > 4, j- -)
{
int i = j/2;
a[i] = a[i] - 1;
}
print ("%d, %d", i, a [i]);
}

Let $θ \in (0, \frac{π}{4}) a n d t_{1} = (t a n θ)^{t a n θ}, t_{2} (t a n θ)^{c o t} t_{3} = (c o t θ)^{t a n θ} a n d t_{4} (c o t θ)^{t a n θ}$ , then

Q. Consider the following ANSI C program:

#include<stdio.h>
int main( )
{
int arr [4] [5] ;
int i, j;
for (i = 0; i < 4; i++)
{
for (j = 0; j<5; j++)
{
arr [i] [j] = 10 * i + j;
}
}
printf("%d", *(arr[i] + 9));
return 0;
}

What is the output of the above program?

Q. If the position vectors of the vertices

A, B

and

C

of a

△ A B C

are respectively

4^i + 7^j + 8^k, 2^i + 3^j + 4^k

and

2^i + 5^j + 7^k

, then the position vector of the point, where the bisector of

∠ A

meets

B C

is :

Join BYJU'S Learning Program

Consider the intermediate code given below: 1. i = 1 2. j = 1 3. t1 = 5∗i 4. t2=t1+j 5. t3=4∗t2 6. t4=t3 7. a[t4]=−1 8. j = j + 1 9. if j < = 5 goto (3) 10. i = i + 1 11. if i < 5 goto (2) The number of nodes and edges in the control-flow-graph constructed for the above code respectively, are

The correct option is D 6 and 7 Number of nodes = 6 Number of edges = 7

The correct option is D 6 and 7

Number of nodes = 6
Number of edges = 7