Answer:
a. file-naming conventions
Explanation:
File names need to follow certain criteria and constraints. Examples include:
- File names must not start with special symbols.
- File names can consist of letters,digits and special characters such as _.
- File name can contain an extension after a dot sign.
- File names must not be duplicates of an existing file.
Such constraints form part of file-naming conventions.
- file-path represents the complete path to the file in the directory structure.
- disk partition segments a hard disk into multiple volumes.
- file-path starts from the root directory and spans one or more subdirectories to the location of the actual file.
Answer:
The first automatic digital computer has been designed by the English mathematician and inventor Charles Babbage. Babbage developed the Analytical Engine Plans for the mid-1830s.
Explanation:
- Babbage has developed the concept of a digital, programmable computer and was a mathematician, philosopher, inventor, and mechanical engineer.
-
Some regard Babbage as a "computer father"
-
The inventing of its first mechanical computer, the difference engine, is attributable to Babbage, which eventually resulted in more complex electronic designs, although Babbage's Analytical Engine is the main source of ideas for modern computers. He was described as the "prime" among the numerous polymaths of his century by his varied work in another field.
Answer:
1. social media and mobile devices may lead to psychological.
2. They may contribute to more serious health conditions such as depression.
3. The overuse of technology may have a more significant impact on developing children and teenagers.
Explanation:
may this help you have a good day
Answer:
boolean isEven = false;
if (x.length % 2 == 0)
isEven = true;
Comparable currentMax;
int currentMaxIndex;
for (int i = x.length - 1; i >= 1; i--)
{
currentMax = x[i];
currentMaxIndex = i;
for (int j = i - 1; j >= 0; j--)
{
if (((Comparable)currentMax).compareTo(x[j]) < 0)
{
currentMax = x[j];
currentMaxIndex = j;
}
}
x[currentMaxIndex] = x[i];
x[i] = currentMax;
}
Comparable a = null;
Comparable b = null;
if (isEven == true)
{
a = x[x.length/2];
b = x[(x.length/2) - 1];
if ((a).compareTo(b) > 0)
m = a;
else
m = b;
}
else
m = x[x.length/2];