As you see in pp. 638-640, structures are useful to store related data together that defined with different types. Here you are asked to modify the Payroll program that we have been working on previous labs. You are asked to write a program using structures and pointers as shown in the following, and store the in an output file. You may see "Appending a Node to the List" in pp. 1126-1128, and pp. 530-536. #include using namespace std; struct Employee_t { string Fname, Lname; int NofHours; float Hourly Rate; char Major (Computer, Security); float Amount; Employee *next }; Employee *head; void print-record (struct *); //use setw() to align fields properly; First Name Komp Scien Last Name ESU CPSC Your Name Add 7 more of your own here... Create a file, Employee.txt. int main() { # of Hours 30 } 40 40 for (int count = 0; count < NumOfEmp; count++) { print each line on your screen; //Allocate a new node and store. infile >> newNode->fname; infile >> newNode->NofHours; newNode-> = nullptr; print-record(newNode); return 0; Hourly Rate 40 30 35 Amount Comp Sci Y Y Y 2200 2200 3400 Comp Sec N N Y

As you see in pp. 638-640, structures are useful to store related data together that defined with different types. Here you are asked to modify the Payroll program that we have been working on previous labs. You are asked to write a program using structures and pointers as shown in the following, and store the in an output file. You may see "Appending a Node to the List" in pp. 1126-1128, and pp. 530-536. #include using namespace std; struct Employee_t { string Fname, Lname; int NofHours; float Hourly Rate; char Major (Computer, Security); float Amount; Employee next }; Employee head; void print-record (struct *); //use setw() to align fields properly; First Name Komp Scien Last Name ESU CPSC Your Name Add 7 more of your own here... Create a file, Employee.txt. int main() { # of Hours 30 } 40 40 for (int count = 0; count < NumOfEmp; count++) { print each line on your screen; //Allocate a new node and store. infile >> newNode->fname; infile >> newNode->NofHours; newNode-> = nullptr; print-record(newNode); return 0; Hourly Rate 40 30 35 Amount Comp Sci Y Y Y 2200 2200 3400 Comp Sec N N Y

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 18SA

See similar textbooks

Similar questions

Implement the function below void swap(int pos1, int pos2) {} For LinkedList, to maintain integrity of data in the structure, you are not to swap directly the element, nor remove a node. Instead, you are to only change the nodes' next pointers. Inital code to be completed: class LinkedList : public List { node* head; node* tail; int index; node* create_node(int num) { node* n = (node*) malloc(sizeof(node)); n->element = num; n->next = NULL; return n; } public: LinkedList() { index = 0; head = NULL; tail = NULL; } int add(int num) { addTail(num); return index; } int get(int pos) { node* currnode = head; int count =0; while (currnode != NULL){ count++; if (count == pos){ return currnode -> element; }else{ currnode = currnode -> next; } }…
Write in C++ Now, what if Sam wants to insert Eevee after Pikachu but he doesn't know where Pikachu is located in his list. Let's help him search for a Pokemon by its name and insert another Pokemon directly after it. Write a function secondPlace() that takes six parameters and inserts a new Pokemon into a list right after another specified pokemon. Once you find the specified Pokemon, use the insertAfter() function from the previous sub-question to add the new Pokemon. The function should return the new number of strings in the array. Note The same Pokemon may appear in the list multiple times (Sam has a bad memory). Assume that Sam wants every instance of the Pokemon he is searching for to be followed by the Pokemon he is attempting to insert. If the array is already full or if the number of strings that are going to be added to the array plus the current number of strings exceeds the total size of the array, the array should remain unchanged. Assume all inputs are lowercase…
Please provide code in the form of SML language, read directions carefully One file will have the two functions in it, the other file will be a test file with calls to the functions to test that they work. Thank you for any help you can provide. Write a union function that takes two lists that are in order from smallest to largest and produces a list with a single copy of all elements from both lists. The resulting list must also be in order from smallest to largest. Write an intersection function much like union, but with the result containing only those elements that appear in both lists. All lists will be in order from smallest to largest.
Suppose you have two objects of Doubly Linked List D1 and D2. Each object is representing a different Doubly Linked List. Write a function to concatenate both doubly linked lists. The concatenation function must return the address of head node of concatenated Doubly Linked List, and it must take two Node* parameters. You need to keep in mind all exceptional cases for example what if either one of the doubly linked lists is empty? Perform this task on paper, take a clear picture of solution and paste it in answer section.
You will write a C++ program to process the lines in a text file using a linked list ADT and raw pointers. Node class You will create a class “Node” with the following private data attributes: line – line from a file (string) next - (pointer to a Node) Put your class definition in a header file and the implementation of the methods in a .cpp file.Follow the style they use in the book of having a "#include" for the implementation file at the bottom of the header file. You will have the following public methods: Accessors and mutators for each attribute Constructor that initializes the attributes to nulls (empty string and nullptr) LinkedList class You will create a class “LinkedList” with the following private data attributes: headPtr – raw pointer to the head of the list numItems – number of items in the list Put your class definition in a header file and the implementation of the methods in a .cpp file.Follow the style they use in the book of having a "#include" for the…
In C Programming: Write a function printCourseRow() which receives a course pointer and prints all its fields as a single row. Use proper formatting so that when we print 2 or more courses as rows, the same members align below each other. Test the function, but don’t include the testing code in your homework.Upload a screenshot of a sample output.
Write a function that gets a linked list of ints, and reverses it. For example - on input 1 -> 2 -> 3 -> 4, after the function finishes the execution, the list becomes 4 -> 3 -> 2 -> 1 - If the list has one element, then it doesn’t change - If the list is empty, then it doesn’t change You may use the data fields in the struct and the functions provided in LL.h and LL.c. // reverses a linked list void LL_reverse(LL_t* list); Test for the Function: void test_q3() { LL_t* lst = LLcreate(); LL_add_to_tail(lst, 1); LL_add_to_tail(lst, 3); LL_add_to_tail(lst, 8); LL_add_to_tail(lst, 4); LL_add_to_tail(lst, 3); LL_reverse(lst); intcorrect[] = {3,4,8,3,1}; inti; node_t* n = lst->head; for(i=0;i<5;i++) { if (n==NULL) { printf("Q3 ERROR: node %d==NULL unexpected\n", i); return; } if (n->data != correct[i]) { printf("Q3 ERROR: node%d->data==%d, expected %d\n", i, n->data, correct[i]); return; } n = n->next; } if (n==NULL) printf("Q3 ok\n"); } Support…
Write a function that gets a linked list of ints, and reverses it. For example - on input 1 -> 2 -> 3 -> 4, after the function finishes the execution, the list becomes 4 -> 3 -> 2 -> 1 - If the list has one element, then it doesn’t change - If the list is empty, then it doesn’t change You may use the data fields in the struct and the functions provided in LL.h and LL.c. // reverses a linked list void LL_reverse(LL_t* list); Test for the Function; void test_q3() { LL_t* lst = LLcreate(); LL_add_to_tail(lst, 1); LL_add_to_tail(lst, 3); LL_add_to_tail(lst, 8); LL_add_to_tail(lst, 4); LL_add_to_tail(lst, 3); LL_reverse(lst); intcorrect[] = {3,4,8,3,1}; inti; node_t* n = lst->head; for(i=0;i<5;i++) { if (n==NULL) { printf("Q3 ERROR: node %d==NULL unexpected\n", i); return; } if (n->data != correct[i]) { printf("Q3 ERROR: node%d->data==%d, expected %d\n", i, n->data, correct[i]); return; } n = n->next; } if (n==NULL) printf("Q3 ok\n"); } Support File…
Assume that, you have a Linked List class "LL" with a function named "fun1". You can assume that "value" is the value of the nodes and "Next" is the next pointer of the node. You created an instance of the LL class, named "L1", where "head" is the head node. And you inserted the following numbers: 31 -> 32 -> 43 -> 17 -> 34 -> 57 ->91. What will be the output of the linked list L1 after the "fun1" operation to it?* 31 -> 32 -> 43 -> 17 -> 34 -> 57 ->91 31 -> 32 -> 17 -> 34 -> 57 ->91 31 -> 32 -> 43 -> 17 -> 57 ->91 31 -> 32 -> 43 -> 17 -> 34 -> 57 31 -> 32 -> 43 -> 57 ->91 31 -> 32 -> 43 -> 34 -> 57 ->91
I'm utilizing a doubly circular linked list to manipulate/display nodes. In this specific function I am trying to reverse the nodes; however, the first node doesn't properly switch and I cannot figure out as to why. I thought the head and tail pointers must've been misplaced but they seem to be doing their jobs Code in C: //node for reference typedef struct node { int data; struct node *prev, *next; } soldier; soldier *head, *tail; //function that reverses ll soldier* rearrange_circle(soldier* head) { soldier *current, *temp2; current = head; do { temp2 = current->next; current->next = current->prev; current->prev = current; current = temp2; tail = tail->prev; }while(current != head); head = head->next; tail = current; return head; free(current); } Any help as to what might be the problem would be gladly be appreciated.
you are to design a printer queue that is responsible for handling the printing requests coming from different users. You have to take into consideration that users have different levels of priorities. Each user has an identification number and a password, in addition to printing priorities. One good idea is to design the queue using an array or pointers while preserving the first-in first-out concept of the queue. For every printing request received, the program should check the priorities of that request and whether it can be moved forward in the queue to be served by the printer prior to serving the other requests. Using the programming language of your choice (preferably C++), write the printer queue that would handle the user request. The program must allow for requests coming from different users or from one user. Note: I need a working C++ code for this problem, and i need priorities.
Consider the following function that takes reference to head of a Doubly Linked List as parameter. Assume that anode of doubly linked list has previous pointer as prev and next pointer as next.void fun(struct node **head_ref){struct node *temp = NULL;struct node *current = *head_ref;while (current != NULL){temp = current->prev;current->prev = current->next;current->next = temp;current = current->prev;}if(temp != NULL )*head_ref = temp->prev;}Assume that reference of head of following doubly linked list is passed to above function 1 <--> 2 <--> 3 <--> 4 <--> 5 <-->6. What should be the modified linked list after the function call? Note: solve as soon as possible