computer
Project Description:
#include
#include
struct node {
int data;
struct node *next;
};
int main() {
struct node *first, *p, *first2, *p2;
int value;
first = 0;
scanf ("%d", &value);
while (value != -9999){
p = first;
first = (struct node *) malloc (sizeof(struct node));
first -> data = value;
first -> next = p;
scanf("%d", &value);
}
for (p = first; p != 0; p = p -> next){
printf("%d ", p -> data);
}
first2 = 0; p2 = 0;
for (p = first; p != 0; p = p -> next){
p2 = first2;
first2 = (struct node *) malloc (sizeof(struct node));
first2 -> data = p -> data;
first2 -> next = p2;
}
for (p2 = first2; p2 != 0; p2 = p2 -> next){
printf("%d ", p2 -> data);
}
printf("\n");
return 0;
}
Declare first2 and p2 to be local variables along with the other locals as follows:
struct node *first, *p, *first2, *p;
int value;
Translate the complete program to pep/9 assembly language.
8 years ago
8
- MOS 5425 Advanced Toxicology WK 5 Article Review
- 495 UNIT 2 DB
- math and numerical analysis
- math and numerical analysis
- MBA 5652: Research Methods
- Knowledge in database
- 6 page for "pntrickkiiriu41r"
- Attn brilliant answers
- Needed Two Assignments to complete
- CIS 336 WK 2 Assignment 1 - Models for Competitive Dynamics