Answer:
13,33 MIN.
Explanation:
1. Time with Older Computer (OC) = 2 time with New Computer (NC)
2. OC+ NC = 10 MIN.
replacing 1. in 2. OC + OC/2 = 10 min.
1.5 OC =10min
OC=6.66 MIN
NC = 3,33 MIN.
If we replace NC with OC , 3,33 min will take 2 times (6,66 min)
Total Time = 6,66 + 6,66= 13,33 min
Answer:
See explaination for program code.
Explanation:
inputFileName = input("Input filename: ") outputFileName = input("Output filename: ") inputFile = open(inputFileName, "r") outputFile = open(outputFileName, "w") count = 1 for line in inputFile: newLine = str(count).rjust(4, " ") + "> " + line outputFile.write(newLine) print(newLine) count += 1
To unfreeze the mac book pro, there are two ways :
a. <span>Click the apple logo which is at the top
left of the menu bar and then select 'force quit'.
b. Hold down the option,
command, and escape buttons and then select 'force quit'. </span>
If all else fails, best option is to hold down the power button on the keyboard till it shuts down.
Answer:
#include <iostream>
#include<string.h>
using namespace std;
void printCharacter(string name){
for(int i=0;name[i]!='\0';i++){
cout<<name[i]<<endl;
}
}
int main()
{
string name;
cout<<"enter the name: ";
cin>>name;
printCharacter(name);
}
Explanation:
first include the two libraries iostream for input/output and string library for using the string.
then, create the main function and declare the variable type string.
cout instruction is used o display the message on the screen.
cin is used to store the value in the name variable.
after that, call the function. The program control move to the the function. In the function for loop is used to print the character one by one until end of the name.
Answer:
The new root will be 2.
<em></em>
Explanation:
The binary tree is not properly presented (See attachment)
To answer this; first, we need to order the nodes of the tree in a pre-order traversal.
We use pre-order because the question says if something is removed from the left child.
So, the nodes in pre-order form is: 14, 2, 1, 5, 4, 16.
The root of the binary tree is 14 and if 14 is removed, the next is 2.
<em>Hence, the new root will be 2.</em>
