It uses a special 'language' or code to tell it what to do a what times, why, and how. It gives the Computer an 'easier' Operating System (OS) to run on / off of. The OS makes The Computer easier for us, to use and understand.
Answer:
10
Explanation:
To convert decimal to binary, you just count like normal, but instead of regrouping when adding 1 when you reach 9, you regroup when you reach 1.
in this case, you would count like this:
0
1
10
Answer:
The answer to this question is given below in the explanation section.
Explanation:
The value stored by a variable can be changed after it is assigned(true).
The value of a variable can be changed after it is assigned, for example:
int a=10;
and we can change the value of variable a in letter program such as:
a=15;
Variables are a name for a spot in the computer's memory (true).
it is true, because the variables value stored in the computer's memory and we can access theses values by their name (variable name). so Variables are a name for a spot in the computer's memory.
Variable names can be words: such as temperature or height (true).
Yes, the variable name can be words such as height, width, temperature etc.
The value stored by a variable cannot be changed after it is assigned (false).
It is noted that the value stored by a variable can be changed after it is assigned. However, it is noted that is some programming language, you can't change the value of static variable.
Answer:
Close or disable all unused running apps.
Explanation:
Closing programs running in the background on your computer or mobile device helps to free up system resources for your other programs. These problems can be resolved where your system is running slowly or two programs are trying to use the same device hence causing the device or system to drag.
Answer:
see explaination
Explanation:
void insertion( int e,int *x, int start, int end)
{
if (e >= x[end])
x[end+1] = e;
else if (start < end)
{
x[end+1] = x[end];
insertion(e, x, start, end-1);
}
else
{
x[end+1] = x[end];
x[end] = e;
}
}
void insertion_recurssion(int *b, int start, int end)
{
if(start < end)
{
insertion_sort_recur(b, start, end-1);
insertion(b[end], b, start, end-1);
}
}
void main()
{
insertion_recurssion(x,0,5);
}
