Answer:
The code to this question can be given as:
Code:
int lastVector = newScores.size() -1; //define variable lastVector that holds updated size of newScores.
newScores = oldScores; //holds value.
for (i = 0; i < SCORES_SIZE - 1; i++) //define loop.
{
newScores.at(i) = newScores.at(i+1); //holds value in newScores.
}
newScores.at(lastVector) = oldScores.at(0); //moving first element in last.
Explanation:
- In the given C++ program there are two vector array is defined that are "oldScores and newScores". The oldScores array holds elements that are "10, 20, 30, 40".
- In the above code, we remove the array element at first position and add it to the last position. To this process, an integer variable "lastVector" is defined.
- This variable holds the size of the newScores variable and uses and assigns all vector array elements from oldScores to newScores. In the loop, we use the at function the removes element form first position and add in the last position.
- Then we use another for loop for print newScores array elements.
The answers are 1, 3, and 5.
Answer:
If the responsibilities are distributed ,the disputes amongst people wont take place because their wont be any partiality, everyone would be equal. Moreover it is difficult for one person to control everything at once and multiple people would help the work to be organized as everyone will have their own part of work which is supposed to be fulfilled.
Answer:
Yeah sure, mines aatelophxbia, i'm 14. what games you play?
Answer:
For undirected graph n(n-1) for directed graph 
Explanation:
The maximum number of edges for a undirected graph is given by 
, where n is number of vertices
The maximum number of edges in directed graph is given by , where n is number of vertices
The maximum number of edges is greater in undirected graph than directed graph
