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).
<span>When you protect a workbook, you control the ability users have, to make changes to the file. This is t</span><span>o prevent other users from making changes, functions like adding, moving, deleting, or hiding worksheets, and renaming worksheets, you can </span>protect<span> it </span><span>with a password. </span>
Answer:Start with the algorithm you are using, and phrase it using words that are easily transcribed into computer instructions.
Indent when you are enclosing instructions within a loop or a conditional clause Avoid words associated with a certain kind of computer language.
Explanation:
Answer:
True.
Explanation:
The statement written in the question is True.We can use one memory location and use it with different values.
For example:- When we are using a loop be it for,while or do-while.The counter that we use for iteration is one and we use that counter to run the loop.We are using a single memory location and we are updating the count in that memory location many times.
for(int i=0;i<1000;i++)
{
//body.
}
We are using i's memory location and changing it 1000 times.
