Which list method allows elements in a sequence to be removed and added at either end of the structure?

Computers and Technology

2 answers:

lesya692 [45]3 years ago

7 0

Answer:

B is right!

Explanation:

Amanda [17]3 years ago

4 0

Answer:

b) queue

Explanation:

Queue is also an abstract data type or a linear data structure, just like stack data structure, in which the first element is inserted from one end called the REAR(also called tail), and the removal of existing element takes place from the other end called as FRONT(also called head).

You might be interested in

What acts as a platform on which application software runs?

Readme [11.4K]

A computing platform

5 0

3 years ago

C++ Question (if and while loops)

IceJOKER [234]

Your while statement is in error

<span>while (wage = 0) assigns 0 to wage.

What you want is to compare wage to 0, ie.:

while (wage == 0).

However, comparing double's to some value is very bad practice due to rounding errors. Much safer is to always have a < or > in there:

while (wage < 0.0001)

If you confuse assignment (=) and comparison (==) often, and you don't have a compiler to warn you for this, you can adopt the coding style to put the constant first:

while(0 == x)</span>

8 0

3 years ago

What is the output of the following code?

Lynna [10]

Answer:

The output is 24

Explanation:

Given

The above code segment

Required

The output

We have (on the first line):