Answer:
#include <iostream>
#include<string.h>
using namespace std;
void printCharacter(string name){
for(int i=0;name[i]!='\0';i++){
cout<<name[i]<<endl;
}
}
int main()
{
string name;
cout<<"enter the name: ";
cin>>name;
printCharacter(name);
}
Explanation:
first include the two libraries iostream for input/output and string library for using the string.
then, create the main function and declare the variable type string.
cout instruction is used o display the message on the screen.
cin is used to store the value in the name variable.
after that, call the function. The program control move to the the function. In the function for loop is used to print the character one by one until end of the name.
Answer:
Electronic Data Interchange (EDI)
Explanation:
Electronic Data Interchange
It is the automated interchange of commercial information using a structured format. A process that allows a company to send information to another company electronically rather than on paper. Commercial entities that conduct business electronically are called business partners.
Numerous commercial documents can be exchanged using electronic data interchange, but the two most common are purchase orders and invoices. At a bottom, EDI interchanges the preparation and handling of mail associated with traditional commercial communication. However, the true power of EDI is that it standardizes the information communicated in commercial documents, which makes a "paperless" exchange possible.
The answer is a <u>sequence structure</u>
Answer:
Can i have a points? Tysmm
Answer:
Some key points to remember, when handling the linked list are as follow:
- Linked list is the linear data structure in which each of the elements contain separate object.
- Linked list components are not store in a contiguous location.
- In the linked list the elements or components are basically use the pointers for linked with another elements.
- The last node of the linked list must contain null value.
- In the linked list, the allocation of the memory is equal to upper node limit.