Answer:
1)PERFORMANCE
2)RANGE
Explanation:
A mesh network can be regarded as local network topology whereby infrastructure nodes connect dynamically and directly, with other different nodes ,cooperate with one another so that data can be efficiently route from/to clients. It could be a Wireless mesh network or wired one.
Wireless mesh network, utilize
only one node which is physically wired to a network connection such as DSL internet modem. Then the one wired node will now be responsible for sharing of its internet connection in wireless firm with all other nodes arround the vicinity. Then the nodes will now share the connection in wireless firm to nodes which are closest to them, and with this wireless connection wide range of area can be convered which is one advantage of wireless mesh network, other one is performance, wireless has greater performance than wired one.
Some of the benefits derived from configuring a wireless mesh network is
1)PERFORMANCE
2)RANGE
Answer:
To do this you'll need to use malloc to assign memory to the pointers used. You'll also need to use free to unassign that memory at the end of the program using the free. Both of these are in stdlib.h.
#include <stdlib.h>
#include <stdio.h>
#define SIZE_X 3
#define SIZE_Y 4
int main(void){
int **matrix, i, j;
// allocate the memory
matrix = (int**)malloc(SIZE_X * sizeof(int*));
for(i = 0; i < SIZE_X; i++){
matrix[i] = (int *)malloc(SIZE_Y * sizeof(int));
}
// assign the values
for(i = 0; i < SIZE_X; i++){
for(j = 0; j < SIZE_Y; j++){
matrix[i][j] = SIZE_Y * i + j + 1;
}
}
// print it out
for(i = 0; i < SIZE_X; i++){
for(j = 0; j < SIZE_X; j++){
printf("%d, %d: %d\n", i, j, matrix[i][j]);
}
}
// free the memory
for(i = 0; i < SIZE_X; i++){
free(matrix[i]);
}
free(matrix);
return 0;
}
Answer:
michal jackson i think who credit to people invented viral dances.
Answer:
The program to this question can be given as:
Program:
#include<iostream> //header file
using namespace std;
int main() //main method
{
int x[10],i,largest = 0,second_largest=0,n; //variable
cout << "Enter Number of elements :"; //message
cin>>n;
cout << "Insert array elements :"; //message
for(i=0;i<n;i++) //insert elements in array
{
cin >>x[i];
}
//Finding Largest element
for(i=0;i<n;i++)
{
if (x[i]>largest)
{
largest = x[i];
}
}
//finding second largset element
for(i=0;i<n;i++)
{
if (x[i]>second_largest)
{
if(x[i]==largest)
{
continue; //Ignoring largest in order to get second largest
}
second_largest=x[i];
}
}
//print value
cout <<"Largest Number:"<<largest<<endl;
cout <<"Second Largest Number:"<<second_largest;
return 0;
}
Output:
Enter Number of elements :5
Insert array elements :33
45
75
87
23
Largest Number:87
Second Largest Number:75
Explanation:
In the above program firstly we define the header file then we define the main method in the main method we define the array and other variables. We first input the number for the size of the array. Then we insert array elements after inserting array elements we search the largest number and the second largest number in the array. To search the largest number in the array we use the loop. To search the first largest number we define a condition that array is greater than the largest number and store the value into the largest variable. Then we check the second largest number in the array for this we use two conditions that are array is greater than the second largest number in this we use another condition that is array is equal to the largest number. If the inner condition is true then it will move forward and end of an inner condition. In the outer condition, the value will be stored on the second_largest variable all the conditions will be done inner the loop. At the last we print values.
