QI Answer QI(a)-QI(c) based on the information given in FIGURE QI. 1*This program allows user to enter product information to be linked list. Each product information contains stored in a product name, quantity, and price per unit.*/ #include #include tinclude define MAX_NUM 5 int main (){ struct Product{ char name [20]: int quantity: double unitPrice; I/product name I/ quantity I/price per unit typedef struct Product Product; struct Node Product myProduct; struct Node "next: typedef struct Node Node; Node front - NULL, "ptrl; char inputName [20]; int inputQuantity: double inputUnitPrice: int i; for (i-1; i<-MAX_NUM; i++) printf ("\nEnter product name: "); scanf ("ss", sinputName); printf("\nEnter quantity: "); scanf ("id", &inputQuantity): printf("\nEnter price per unit: "): scanf ("lf", sinputunitPrice); ptrl = malloc (sizeof (Node)); strepy (ptrl->myProduct.name, inputName); ptrl->myProduct.quantity = inputQuantity: ptrl->myProduct.unitPrice = inputUnitPrice; ptrl ->next- NULL; if (front !- NULL) ptrl->next - front: front = ptrl; return 0;} FIGURE QI

QI Answer QI(a)-QI(c) based on the information given in FIGURE QI. 1This program allows user to enter product information to be linked list. Each product information contains stored in a product name, quantity, and price per unit./ #include #include tinclude define MAX_NUM 5 int main (){ struct Product{ char name [20]: int quantity: double unitPrice; I/product name I/ quantity I/price per unit typedef struct Product Product; struct Node Product myProduct; struct Node "next: typedef struct Node Node; Node front - NULL, "ptrl; char inputName [20]; int inputQuantity: double inputUnitPrice: int i; for (i-1; i<-MAX_NUM; i++) printf ("\nEnter product name: "); scanf ("ss", sinputName); printf("\nEnter quantity: "); scanf ("id", &inputQuantity): printf("\nEnter price per unit: "): scanf ("lf", sinputunitPrice); ptrl = malloc (sizeof (Node)); strepy (ptrl->myProduct.name, inputName); ptrl->myProduct.quantity = inputQuantity: ptrl->myProduct.unitPrice = inputUnitPrice; ptrl ->next- NULL; if (front !- NULL) ptrl->next - front: front = ptrl; return 0;} FIGURE QI

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 18PE

See similar textbooks

Similar questions

Please fill in the blanks from 26 to 78 in C. /*This program will print students’ information and remove students using linked list*/ #include<stdio.h> #include<stdlib.h> //Declare a struct student (node) with 5 members //each student node contains an ID, an age, graduation year, // 1 pointer points to the next student, and 1 pointer points to the previous student. struct student { int ID; int age; int classOf; struct student* next; struct student* prev; }; /* - This function takes the head pointer and iterates through the list to get all 3 integers needed from the user, and save it to our list - Update the pointer to point to the next node.*/ void scanLL(struct student* head) { while(head != NULL) //this condition makes sure the list is not at the end { printf("Lets fill in the information. Enter 3 integers for the student's ID, age, and graduation year: "); scanf("%i %i %i",&&head->ID, &head->age, &head->classOf); //in order: ID, age, graduation…
Computer Science In c++ (There should be three different files, "main.cpp", "sourcefile.cpp" and "header.cpp" your solution must have those three different files): Write a function that checks if the nodes in a linked list is sorted in ascending order. The function should return true if the values are sorted, otherwise false. Take user input. Call the funciton in the main function to show it is working.
Please fill in the blanks for C /* This program will print students’ information and remove students using linked list: */ #include<stdio.h> #include<stdlib.h> //Declare a struct student (node) with 5 members //each student node contains an ID, an age, graduation year, // 1 pointer points to the next student, and 1 pointer points to the previous student. struct student { int ID; int age; int classOf; __1__ __2__ next; __3__ __4__ prev; }; /* - This function takes the head pointer and iterates through the list to get all 3 integers needed from the user, and save it to our list - Update the pointer to point to the next node. */ __5__ scanLL(__6__ __7__ head) { while(__8__ __9__ __10__) //this condition makes sure the list is not at the end { printf("Lets fill in the information. Enter 3 integers for the student's ID, age, and graduation year: ");…
Implement the following function using C++ remove_redundant() This method will clear out the duplicate numbers in your linked list. It is also imperative that you will use an instance of this Linked List class to hold the numbers that you have already checked and use the methods in this instance. In the example 10 -> 10 -> 20 -> 30 -> 10, calling remove_redundant() will remove the other 2 10's that occurred later, hereby making the list 10 -> 20 -> 30. Limitation: You cannot have a nested loop here nor use methods that employ loops as the performance of our linked list will suffer.
Create two linked lists and then make a concatList(NODE **list1, NODE **list2) function that concatenates the two lists. The concatenated list must be a linked list. Fill in the "Write code here" sections appropriately.
Write a struct ‘Student’ that has member variables: (string) first name, (int) age and (double) fee. Create a sorted (in ascending order according to the age) linked list of three instances of the struct Student. The age of the students must be 21, 24 and 27. Write a function to insert the new instances (elements of the linked list), and insert three instance whose member variable have age (i) 20, (ii) 23 and (iii) 29. Write a function to remove the instances from the linked list, and remove the instances whose member variables have age (i) 21 and (ii) 29. Write a function to count the elements of the linked list. Write a function to search the elements from the linked list, and implement the function to search an element whose age is 23. Write a function to print the linked list on the console. Consider the Student struct as defined above. Create a stack of 5objects of the class. Implement the following (i) push an element to the stack (ii) pop an element from the stack (iii) get the…
Topic: Singly Linked ListImplement the following functions in C++ program. Read the question carefully. (See attached photo for reference) int removeAt(int pos) Removes the number in the posth position of the list and returns the element removed. Performing removeAt(3) in the example list will remove the 3rd element of the linked list and the updated list will be: 10 -> 30 -> 50 When the value of pos is greater than the size or less than one, return -1. int removeAll(int num) Removes all instances of num in the linked list and returns the number of instances removed. In this list 10 -> 10 -> 20 -> 30 -> 10, performing removeAll(10) will remove all three 10's and the list will look like this: 20 -> 30. Then, it will return the number of instances removed, in this case, 3. int contains(int num) This will return the position of the first instance of the element num in the list. If num is not found, return 0. In the example, having the method contains(30) will…
linked_list_stack_shopping_list_manager.py This is a file that includes the class of linked list based shopping list manager. This class contains such methods as init, insert_item, is_list_empty, print_item_recursive_from_top, print_items_from_top, print_item_recursive_from_bottom, print_items_from_bottom, getLastItem, removeLastItem. In addition, this class requires the inner class to hold onto data as a linked list based on Stack. DO NOT use standard python library, such as deque from the collections module. Please keep in mind the following notes for each method during implementation: Init(): initializes linked list based on Stack object to be used throughout object life. insert_item(item): inserts item at the front of the linked list based on Stack. Parameters: item name. is_list_empty (): checks if the current Stack object is empty (ex. check if head is None). print_item_recursive_from_top(currentNode): a helper method to print linked list based on Stack item recursively. Note:…
Define the function (siftNum lst). This function should resolve to all the numbers in the list, lst. For example: (siftNum '(a 8 2 1 m l 90 p 2)) resolves to '(8 2 1 1 90 2).
Code an application program that keeps track of student information at your college. Include their names, identification numbers, and grade point averages in a fully encapsulated, homogeneous sorted singly linked list structure. When launched, the user will be asked to input the initial number of students and the initial data set. Once this is complete, the user will be presented with the following menu: Enter: 1 to insert a new student's information, 2 to fetch and output a student's information, 3 to delete a student's information, 4 to update a student's information 5 to output all the student information in sorted order, and 6 to exit the program. The program should perform an unlimited number of operations until the user enters a 6 to exit the progrqm Please use java use deep copy
Using the following struct: typedef char DATA; struct node{ DATA d; struct node *next; }; Write a program in C to build a single linked list using a loop. Your list should be built in such a way that the new item is added at the beginning of the list. A good solution with comments on the code is appreciated
Using user-defined function, create a C++ or Java application implementing a linked list datastructure. The application should be able to perform the following operations on the datastructure can with the following operations. i. insertion into the listii. deletion from the list iii. printing the content of the list