All categories

2 years ago

O How basic blocks are identified and how the blocks are used to construct control flow graphs

1 answer:

5 0

Basic blocks are identified because they are known to be a straight line that is known also as a code sequence that tends to have no branches in regards to its in and out branches and its exception is only to the entry and at the end.

Note that Basic Block is said to be a composition of statements that is known to be one that often always executes one after other, and this is often done in a sequence.

<h3>How do you create a flow graph from the basic blocks?</h3>

Flow graph is gotten by:

Lets Block B1 be the initial node and also Block B2 will tend to follows B1, so from B2 to B1 there is seen a kind of an edge.

Note that the first task is for a person to partition a sequence of three-address code and this is done into basic blocks.

Hence, Basic blocks are identified because they are known to be a straight line that is known also as a code sequence that tends to have no branches in regards to its in and out branches and its exception is only to the entry and at the end.

Learn more about basic blocks from

brainly.com/question/132319

#SPJ1

You might be interested in

On Microsoft teams, how do teachers know that you are on a different page?

emmasim [6.3K]

Answer:

they can view if you left the page on the teacher side of the website

Explanation:

i have made a page just for this

6 0

3 years ago

Read 2 more answers

1. What words might you add to the Microsoft spelling dictionary?

weqwewe [10]

1. ain't, your name, your last name.
2. to ensure a fulfilled document
3. to find what you want then select it

4 0

3 years ago

The undo function allows the user to cancel up to _____ previous typing actions.

GalinKa [24]

C 20 previous typing actions

4 0

3 years ago

Consider the following code: x=random.randint (1, 100) The randint is a ____.

Mrrafil [7]

Random integer, in this case betweeen 1 and 100

5 0

3 years ago

Greedy Algorithm Design

Alik [6]

Answer:

The algorithm is as follows:

1. Start

2. Get the number of items (n)

3. Get the current price of the n items (a1, a2..... an)

4. Get the possible hiked price of the n items (b1, b2..... bn)

5. Calculate the difference between the current and hiked prices for each item i.e. $d_i = b_i - a_i$

6. Sort the differences in descending order (i.e. from the greatest to the least)

7. Buy items in this order of difference

8. Stop

Explanation:

The algorithm is self-explanatory; however, what it does is that:

It takes a list of the current price of items (say list a)

E.g: $a = [100, 150, 160]$

Then take a list of the hiked price of the items (say list b)

E.g: $b = [110, 180, 165]$

Next, it calculates the difference (d) between corresponding prices $d_i = b_i - a_i$

$d = [(110 - 100),(180-150),(165-160)]$

$d = [10,30,5]$

Sort the difference from greatest to lowest (as the difference is sorted, lists a and b are also sorted)

$d = [30,10,5]$

$a = [150, 100, 160]$

$b = [180, 110, 165]$

If there is no hike up to item k, the couple would have saved (i = 1 to d[k-1])

Assume k = 3

The couple would have saved for 2 item

$Savings = d[1] + d[2]$

$Savings = 30 +10$

$Savings = 40$

The saved amount will then be added to the kth item in list a i.e. a[k](in this case k = 3) in order to buy b[k]

Using the assumed value of k

$a[k] = a[3]$

$a[3] = 160$

$b[3] = 165$

Add the saved amount (40) to a[3]

$New\ Amount = 40 + 160$

$New\ Amount = 200$

This new amount can then be used to buy b[3] i.e. 165, then they save the change for subsequent items

8 0

3 years ago