Answer: system administrator
Explanation:
The responsibilities of the database system administrator are as follows:
1. Should be able to identify the needs of the different users and their associated databases and install software as and when required.
2. making sure that the database is functionally efficiently as well as the associated software's.
3. Updation of the software and their maintenance along with the databases.
4. Backing and restoring of the databases in situation of different data loss hazards.
Answer:
"Using both HTML and CSS allows developers to separate the content of
a web page from the design of a web page."
Explanation:
<h2>Million instructions per second (MIPS)</h2>
Explanation:
Real-life example of measurement:
Like how we measures vegetables & fruits in Kilograms, how we measure water or other liquids in liters, we measure the processing power of a computer with the help of unit called MIPS.
What is processing power?
The number of instruction that a computer can process in one second helps us to calculate the "speed of the computer".
This can also be termed as measuring the clock speed. Its measured in Giga hertz or mega hertz.
Why this is necessary?
- It is to pick the best system to buy. (Also considering the need an budget)
- Purchasing system based on the requirement.
Answer:
Written using C++
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> fibb;
int n1 = 0;
int n2 = 1;
int temp;
for (int nm= 0; nm < 50;nm++) {
fibb.push_back(n1);
temp = n1 + n2;
n1 = n2;
n2 = temp;
}
for (int nm= 0; nm < 50;nm++) {
{
cout<<fibb.at(nm)<<" ";
}
return 0;
}
Explanation:
#include <iostream>
#include <vector>
using namespace std;
int main() {
This line declares the vector as integer
vector<int> fibb;
This line initializes the first term to 0
int n1 = 0;
This line initializes the second term to 1
int n2 = 1;
This line declares a temporary variable
int temp;
The following iteration populates the vector with first 50 Fibonacci series
for (int nm= 0; nm < 50;nm++) {
This push an entry into the vector
fibb.push_back(n1);
The following generate the next Fibonacci element
<em> temp = n1 + n2;</em>
<em> n1 = n2;</em>
n2 = temp;
}
The following iteration prints the generated series
for (int nm= 0; nm < 50;nm++) {
cout<<fibb.at(nm)<<" ";
<em> }</em>
return 0;
}