Answer:
A spanning tree is a subset of Graph G, which has all the vertices covered with minimum possible number of edges. Hence, a spanning tree does not have cycles and it cannot be disconnected.. By this definition, we can draw a conclusion that every connected and undirected Graph G has at least one spanning tree.
Answer:
True
Explanation:
When communication exchange that does not verify the identity of endpoints of communication is true
Answer:
public class print{
public static void fillArray(int[] arr, int initialValue){
int n = arr.length;
for(int i=0;i<n;i++){
arr[i] = initialValue++;
}
for(int i=0;i<n;i++){
System.out.print(arr[i]+" ");
}
}
public static void main(String []args){
int[] array = new int[5];
int initialValue =3;
fillArray(array,initialValue);
}
}
Explanation:
Create the function with two parameter first is array and second is integer.
Then, declare the variable and store the size of array.
Take the for and fill the array from the incremented value of initialValue by 1 at every run of loop.
After loop, print the element of the array.
Create the main function which is used for calling the function and also declare the array with size 5 and initialValue with 3. After that, call the function with this argument.
Answer:
Check the explanation
Explanation:
#include <iostream>
using namespace std;
void hex2dec(string hex_num){
int n = 0;
//Loop through all characters in string
for(int i=0;i<hex_num.size();i++){
//take ith character
char c = hex_num[i];
//Check if c is digit
if(c>='0' && c<='9'){
n = 16*n + (c-48);
}
//Convert c to decimal
else{
n = 16*n + (c-55);
}
}
cout<<hex_num<<" : "<<n<<endl;
}
int main()
{
hex2dec("EF10");
hex2dec("AA");
return 0;
}
The Output can be seen below :
