Answer:
Refer below.
Explanation:
Binary DOC records regularly contain more content organizing data (just as contents and fix data) than some other document designs like Rich Text Format and Hypertext Markup Language, however are normally less broadly good.
The DOC documents made with Microsoft Word renditions contrast. Microsoft Word forms before Word 97 ("8.0") utilized an alternate organization from the OLE/CFBF-based Microsoft Word 97 – 2003.
In Microsoft Word 2007 and later, the binary document design was supplanted as the default position by the Office Open XML group, however Microsoft Word can in any case produce DOC records.
Answer:
u have to give me more points
Explanation:
sorry
Answer:
Hi, I'm going to put the code answer here and you put in the corresponding line to not copy all the code in the answer.
replace the following line or adjust to the following code
/*
* CODE HERE
while(personSelect <= 0 || personSelect > 5) {
System.out.println("Wrong number, try to input the number in range 1 to 5" );
personSelect = scan.nextInt();
}
if(personSelect == 1){
person1.setGpa(newGPA);
printInfo()
}
else if(personSelect == 2){
person2.setGpa(newGPA);
printInfo()
}
else if(personSelect == 3){
person3.setGpa(newGPA);
printInfo()
}
else if(personSelect == 4){
person4.setGpa(newGPA);
printInfo()
}
else {
person5.setGpa(newGPA);
printInfo()
}
*/
Explanation:
According to the description of code, we have to add some lines to resolve the questions.
a):
In base on the input, we have to modify the <em>attribute GPA</em> with the method <em>setGpa</em> depending on the person chosing. We call the person chosen before and also call the method setGpa( ) and pass as <em>parameter</em> the GPA value obtained in tha last input
b)
In this case we have to <em>create a loop</em> for iterate the times that is necesary to get a value of person that is permit in <em>range 1 to 5</em>, and hence that we create and individual if condition to assign the GPA to the person chosen.
I hope it's help you.
Answer:
Worst case time of Heapsort is better than worst case time of Quicksort.
Explanation:
Worstcase of Heapsort is nlog(n). Worstcase time of Quicksort is (n^2). Heapsort is comparison based sorting algorithm. Heapsort divides input into sorting. It is a selection sort in which we send maximum inputs for maximum elements at end. Quicksort is divide and conquer algorithm. It is considered as efficient sourcing algorithm.
Answer:
Image result for what is the name of the fields in an x.509 digital certificate that are used when the parties negotiate a secure connection?
Common applications of X. 509 certificates include SSL/TLS and HTTPS for authenticated and encrypted web browsing, signed and encrypted email via the S/MIME protocol, code signing, document signing, client authentication, and government-issued electronic ID.
Explanation:
