Answer:
A is the input array
B = []
; %B is initially an empty array
for i = 1:length(A)/2 %iterates over A until the midpoint of A
B(i) = A(i) + A(end + 1 - i); %This adds the numbers from the first half and %second half of A, and stores in B
end
disp(B)
Answer:
#include <iostream>
using namespace std;
int main()
{
char str[100][20];
int n;
cout<<"Strings you want to enter"<<endl;
cin>>n;
cout<<"enter n strings"<<endl;
for(int i=0;i<n;i++)
cin>>str[i];
for(int i=0;i<n;i++)
{
if((int)str[i][0]==98) //ascii value b is 98
cout<<str[i]<<endl;
}
return 0;
}
Explanation:
The above written code is for printing the strings which starts with the letter b.
To check if the string starts with a letter b we are checking the ascii value 98 which corresponds to b and then printing those strings.
Answer:
research and development team
Explanation:
Research and development team is a team in an organization that have the expertise, experience and responsibility to come up with innovative activities that will be undertaken by the corporations or organization in other to develop new services or products, or improve on existing ones.
Answer:
(a) 1 to 8
(b) 1 to 6
Explanation:
A "leaf" is a node at the end of a binary tree (in other words, it has no "children"). All other nodes are "non-leaf" nodes.
The smallest number of leaves is 1. That would be a binary tree that's just a straight line; each node will have only 1 child, until you get to the last node (the leaf).
To find the largest number of leaves, we start drawing a full binary tree. A complete tree with 15 nodes has 7 non-leaf nodes and 8 leaf nodes. A full tree with 6 non-leaf nodes can have up to 6 leaf nodes.
Well according to the name of the function, I would say <span>A) the mean value of a set of numbers</span>
