Answer:
- Create partitions on each hard disk drives.
- Mount the partition created on each hard drive so they are accessible by the the operating system.
- Format the partitions created with a filesystem recognized by Linux.
Explanation:
Having purchased the two new SCSI hard disk drives with the controller cards for each and installed them properly, before using them for data storage and retrieval he must first use the fdisk command to create one or more partitions on each of the hard disk drives then mount any partitions created on the two hard drives so that they are accessible by the operating system before then proceeding to format any partitions created with a valid filesystem recognized by Linux.
import java.util.Scanner;
public class MyClass1 {
public static void main(String args[]) {
Scanner scan = new Scanner(System.in);
int smallest = 0, largest = 0, num, count = 0;
while (true){
System.out.println("Enter a number (-1 to quit): ");
num = scan.nextInt();
if (num == -1){
System.exit(0);
}
else if (num < 0){
System.out.println("Please enter a positive number!");
}
else{
if (num > largest){
largest = num;
}
if (num < smallest || count == 0){
smallest = num;
count++;
}
System.out.println("Smallest # so far: "+smallest);
System.out.println("Largest # so far: "+largest);
}
}
}
}
I hope this helps! If you have any other questions, I'll do my best to answer them.
MYbe show a picture next time so we can see what the problem is about ?
Explanation:
This is easily solvable with a for loop. Something like:
(I assume c++)
#include <iostream>
#include <string>
int main() {
take_input: //tag
std::string input;
cin >> input; //take the input
int spaceCount = 0;
char checking;
for(unsigned int i = 0; i == input.length(); ++i) {
checking = spaceCount[i];
if(checking == ' ')
spaceCount++;
}
if(spaceCount >= 1 && input.length >= 5)
std::cout << "Your name is " + input;
else
goto take_input; // reasks for input if the conditions are not met
return 0;
};
**remove all spaces before using the code, the if statements are messed up
