Answer:
C. <loc>
Explanation:
We need to mention the below details:
- location
- changed frequency
- last changed
- priority of page
We have the XML file for a sitemap, and we need to enter the above details for each of the Url. We need to enter the location, last changed, changed frequency and priority of the page for each of the URLs. And the URL of the home page is surrounded by the Loc tag. And hence, the correct option for this post is the C.<Loc> option.
Answer:
See explaination
Explanation:
Keep two iterators, i (for nuts array) and j (for bolts array).
while(i < n and j < n) {
if nuts[i] == bolts[j] {
We have a case where sizes match, output/return
}
else if nuts[i] < bolts[j] {
this means that size of nut is smaller than that of bolt and we should go to the next bigger nut, i.e., i+=1
}
else {
this means that size of bolt is smaller than that of nut and we should go to the next bigger bolt, i.e., j+=1
}
}
Since we go to each index in both the array only once, the algorithm take O(n) time.
Answer:
data
Explanation:
got it right on edgenuity
Answer:
The answer is "Option A"
Explanation:
In the given java code, a class "Test" is defined, inside the main method try and catch block is used, inside the try block method "p()" is called, that print a message. in this block two catch block is used, that works on "NumberFormatException" and "RuntimeException". In the method "p" declaration, a string variable "s" is defined, that holds double value, that is "5.6", and converts its value into the wrong integer, and other wrong option can be described as follows:
- In option B, it is wrong, it is not followed by after call method.
- In option C, It is not followed by runtime exception, that's why it is incorrect.
- Option D and Option E both were wrong because they can't give run time and compile-time error.
