1) Create a struct called CourseInfo to store info about a course (Include varia

Question

1) Create a struct called CourseInfo to store info about a course (Include variables for courseNum, courseName, & grade)

2) Change the type for the 'data' member variable in the node struct to CourseInfo (see #1) and rename it to 'courseData'

3) Modify the createNode function to receive a CourseInfo struct as a parameter. It should also display the address of the new node that is created. Display the address in both hex and decimal form.

4) Modify the display function to display the address of each node that is currently in the list. It should also display the course info data stored in the current node as well as the address of the next node in the list. Display the addresses in both hex and decimal form.

5) Modify the insertStart function to receive a CourseInfo struct as a parameter. It should also display the address of the new node that is inserted. Display the address in both hex and decimal form.

6) Comment out the following functions for now: insertPosition, deleteFirst, deleteLast, deletePosition

7) Create a function called getCourseInfo to get the course info data from the user. It should return a CourseInfo struct type that can be passed into both the createNode and insertStart functions

Explanation / Answer

#include using namespace std; struct node { int data; node *next; }; class list { private: node *head, *tail; public: list() { head=NULL; tail=NULL; } void createnode(int value) { node *temp=new node; temp->data=value; temp->next=NULL; if(head==NULL) { head=temp; tail=temp; temp=NULL; } else { tail->next=temp; tail=temp; } } void display() { node *temp=new node; temp=head; while(temp!=NULL) { coutnext=head; head=temp; } void insert_position(int pos, int value) { node *pre=new node; node *cur=new node; node *temp=new node; cur=head; for(int i=1;inext; } temp->data=value; pre->next=temp; temp->next=cur; } void delete_first() { node *temp=new node; temp=head; head=head->next; delete temp; } void delete_last() { node *current=new node; node *previous=new node; current=head; while(current->next!=NULL) { previous=current; current=current->next; } tail=previous; previous->next=NULL; delete current; } void delete_position(int pos) { node *current=new node; node *previous=new node; current=head; for(int i=1;inext; } previous->next=current->next; } }; int main() { list obj; obj.createnode(25); obj.createnode(50); obj.createnode(90); obj.createnode(40); cout

Related Questions

Navigate

• Browse (All)
• Browse 1
• Subjects

---