What complications are imposed if one tries to implement a dynamic list using a traditional one-dimensional array

Computers and Technology

1 answer:

zheka24 [161]3 years ago

6 0

Answer: The expansion of the list will be required to move to a new location;

So the complications that will be imposed if one tries to implement a dynamic list using a traditional one-dimensional array is that the expansion of the list will need to move to a new location.

Explanation: When we talk about arrays,we are referring to data structures that are useful when the number of entries that are to be stored inside a list is fixed.

But for one to implement a dynamic list which always grows or shrinks at run-time arrays cannot be useful.This is because any alteration will make the entire array to be altered.

You might be interested in

You are given a class named Clock that has one int instance variable called hours.

Vlad [161]

Answer:

public Clock(int hours) {

this.hours = hours;

}

Explanation:

In Java programming language, Constructors are special methods that are called to initialize the variables of a class when a new object of the class is created with the new keyword. Consider the complete code for the class below;

public class Clock {

private int hours;

public Clock(int hours) {

this.hours = hours;

}

}

In this example above, an object of this class can created with this statement Clock myclock = new Clock(6); This is a call to the constructor and passes a parameter (6) for hours

7 0

3 years ago

Suppose that in a 00-11 knapsack problem, the order of the items when sorted by increasing weight is the same as their order whe

frosja888 [35]

Answer:

Following are the response to the given question:

Explanation:

The glamorous objective is to examine the items (as being the most valuable and "cheapest" items are chosen) while no item is selectable - in other words, the loading can be reached.

Assume that such a strategy also isn't optimum, this is that there is the set of items not including one of the selfish strategy items (say, i-th item), but instead a heavy, less valuable item j, with j > i and is optimal.

As $W_i < w_j$ , the i-th item may be substituted by the j-th item, as well as the overall load is still sustainable. Moreover, because $v_i>v_j$ and this strategy is better, our total profit has dropped. Contradiction.