Answer:
The first question you should ask yourself before performing the repair is Option B. Can you find a replacement motherboard.
Explanation:
According to me, I would ask “Can you find a replacement motherboard”.
Because, Always the laptop charge will be more than the charge of a mother board, because motherboard is just a part and the laptop consists of other important parts too. So Option (a) is not the wise selection.
Let’s look into option D. Warranty period should be verified by us and not the technical person, because we have purchased and we have the warranty card.
Let’s look into option C. The technical person will already be well-versed with fixing solution and diagnosing problem. So service manual will be of not much use to him and he would want to make money out of fixing the problem, so we cannot expect him to teach us how to replace a motherboard.
Answer:
C. Internet Corporation for Assigned Names and Numbers.
Explanation:
The Internet Corporation for Assigned Names and Numbers is an institution founded in September, 1998. The ICANN has the role of maintaining internet databases and promoting safe internet operations. The headquarters of this organization is located in Los Angeles, California.
The ICANN is also involved in the registration of internet domain names, formulating new top-level domains, as well as the maintenance of root name servers.
The ICANN is also actively involved in forming new policies that would see to safe internet activities. The internet protocol address spaces for IPv4 and 6 are numbered by the ICANN.
Spreadsheet
Description
A spreadsheet is a computer application for organization, analysis and storage of data in tabular form where Jacob can store the user’s information.
<span>C. Documents that convey buyers, sellers, and purchases made</span>
Answer:
see explaination
Explanation:
#include <iostream>
#include <vector>
using namespace std;
void vector_sort(vector<int> &vec) {
int i, j, temp;
for (i = 0; i < vec.size(); ++i) {
for (j = 0; j < vec.size() - 1; ++j) {
if (vec[j] > vec[j + 1]) {
temp = vec[j];
vec[j] = vec[j + 1];
vec[j + 1] = temp;
}
}
}
}
int main() {
int size, n;
vector<int> v;
cin >> size;
for (int i = 0; i < size; ++i) {
cin >> n;
v.push_back(n);
}
vector_sort(v);
for (int i = 0; i < size; ++i) {
cout << v[i] << " ";
}
cout << endl;
return 0;
}
