Answer:
First, you need to start the OSPF process by executing the command:
<em>Router (config)# router ospf {process-ID#}</em>
Then, you have to instruct the router to advertise the networks that are directly linked to it by entering this network command with the area ID number for that network:
Router (config-router)# network {192.168.10.0} {255.255.255.0} area {0}
Answer:
The internet allows you to connect with people and information around the world. The internet is more broad and could include searching things up or message-based websites. Emails is more specific, with it being when you send someone a message (called an email) on a mail website (that allows you to get messages from other people, websites, etc.)
Explanation:
In my answer.
Answer:
Merge cells A1:E1 and centre the title text in the merged cell.
Explanation:
In order for the title of the shared spreadsheet document to appear centred in the first row above the other five columns, Patricia will be required to merge the first row A1 with the fifth row E1 and centre the title text in the merged cells. This increases the number of rows and columns of the spreadsheet as the information in the other cells will be shifted down.
Answer:
by learning the right home keys and how to place the fingers
Explanation:
the left hand side : A,S,D,F
the right hand side: :, L, K, J
the two little fingers are guide keys
guide keys: letter A and column
Answer:
// here is code in c++.
#include <bits/stdc++.h>
using namespace std;
// function that return greatest common divisor
int g_c_d(int num1, int num2)
{
if (num1 == 0)
return num2;
return g_c_d(num2 % num1, num1);
}
// main function
int main()
{
// variables
int num1,num2;
cout<<"enter two numbers:";
// read two numbers from user
cin>>num1>>num2;
// call the function and print the gcd of both
cout<<"greatest common divisor of "<<num1<<" and "<<num2<<" is "<<g_c_d(num1.num2)<<endl;
}
Explanation:
Read two numbers from user and assign them to variables "num1" and "num2".Call the function g_c_d() with parameter "num1" and "num2".According to Euclidean algorithm, if we subtract smaller number from the larger one the gcd will not change.Keep subtracting the smaller one then we find the gcd of both the numbers.So the function g_c_d() will return the gcd of both the numbers.
Output:
enter two numbers:5 9
greatest common divisor of 5 and 9 is 1
enter two numbers:-25 15
greatest common divisor of -25 and 15 is 5
