Write a program in C that performs the following tasks: Store the information about books in the library using a linked list structure. Each book should have the following information: book name, author name, ISBN, and publication year. Allow the user to add a new book to the linked list. Allow the user to delete a book from the linked list based on ISBN. Allow the user to search for a book in the linked list based on book name, author name, ISBN or publication year. Display the list of all books in the library. Note: The program should use the linked list implementation for storing the books and should not use any built-in library functions for linked lists.

Write a program in C that performs the following tasks: Store the information about books in the library using a linked list structure. Each book should have the following information: book name, author name, ISBN, and publication year. Allow the user to add a new book to the linked list. Allow the user to delete a book from the linked list based on ISBN. Allow the user to search for a book in the linked list based on book name, author name, ISBN or publication year. Display the list of all books in the library. Note: The program should use the linked list implementation for storing the books and should not use any built-in library functions for linked lists.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter13: Structures

Section13.4: Linked Lists

Problem 2E

See similar textbooks

Similar questions

Write a program in c++ which will concatenate two single linked lists. The structure is defined below. Assume that head1 contains the starting address of the first list and head2contains the starting address of the second list. You need to join them together so that allthe students’ roll number and name of both the lists will display together with the help of head1pointer.struct link{int rollno;char name[20];struct link *next;};typedef struct link node;node *head1=NULL, *head2=NULL; //global declaration
Write a program which will concatenate two single linked lists. The structure is defined below. Assume that head1 contains the starting address of the first list and head2 contains the starting address of the second list. You need to join them together so that all the students’ roll no and names of both the lists will be displayed together with the help of head1 pointer. struct link { int rollno; char name[20]; struct link *next; }; typedef struct link node; node *head1=NULL, *head2=NULL; //global declaration
Using C++(DSA, Topic: Singly linked list) Write a simple airline ticket reservation program. The program should display a menu with the following operations: reserve a ticket, cancel a reservation, check whether a ticket is reserved for person, and display the passengers. The information is maintained on an alphabetized linked list of names. In a simper version of the program, assume that tickets are reserved for only one flight. In a fuller version, place no limit on the number of flights. Create a linked list of flights with each node including pointer to a linked list of passengers. Note: Screen shot of working Demo will be shown.
Machine Problem: Write a Java program that will display the given menu: Note: Must accept a string of word/phrase/sentence Menu 1. Add a string 2. Display list of strings 3. Display list of uppercase words 4. Display list of lowercase words 5. Delete an uppercase word 6. Delete a lowercase word 7. End program When 1 is chosen, ask the user to enter a string and add it to a list using a linked list When 2 is chosen, display the list of strings. When 3 is chosen, display all uppercase words found in the list of strings in ascending order. (create a linked list containing all uppercase words) When 4 is chosen, display all lowercase words found in the list of strings in ascending order. (create a linked list containing all lowercase words) When 5 is chosen, display the list of uppercase words then ask the user the index of the word he wants to delete. Index of the first word in the list is 0 When 6 is chosen, display the list of lowercase words then ask the user the…
Write a program in three parts. The first part should create a linked list of 26 nodes. The second part should fill the list with the letters of the alphabet. The third part should print the contents of the linked list. NOT USE malloc, only use <iostream>. Do not use global variables. The use of global constants c++
Machine Problem: Write a Java program that will display the given menu: NOTE: adding a string must accept a word/phrase/sentence Menu 1. Add a string 2. Display list of strings 3. Display list of uppercase words 4. Display list of lowercase words 5. Delete an uppercase word 6. Delete a lowercase word 7. End program When 1 is chosen, ask the user to enter a string and add it to a list using a linked list When 2 is chosen, display the list of strings. When 3 is chosen, display all uppercase words found in the list of strings in ascending order. (create a linked list containing all uppercase words) When 4 is chosen, display all lowercase words found in the list of strings in ascending order. (create a linked list containing all lowercase words) When 5 is chosen, display the list of uppercase words then ask the user the index of the word he wants to delete. Index of the first word in the list is 0 When 6 is chosen, display the list of lowercase words then…
This is Java Programming Linked List Basics ( insertFront, insertBack, deleteFront & deleteBack)Question: Given the following code in main and output, please write the Java program which allows main to work: public static void main(String[] args) {LinkedList list = new LinkedList(); // Try to delete from an empty listlist.deleteFront();list.displayLL();list.deleteBack();list.displayLL();// insert 3 nodeslist.insert(18);list.insert(45);list.insert(12);list.displayLL(); // Here are the main “new” lines, not included in code I gave youlist.insertFront(1);list.displayLL();list.insertBack(999);list.displayLL();list.deleteFront();list.displayLL();list.deleteBack();list.displayLL();} // end of main This is Java programming please
Write a program in c++ and make sure it works, that reads a list of students (first names only) from a file. It is possible for the names to be in unsorted order in the file but they have to be placed in sorted order within the linked list.The program should use a doubly linked list.Each node in the doubly linked list should have the student’s name, a pointer to the next student, and a pointer to the previous student. Here is a sample visual. The head points to the beginning of the list. The tail points to the end of the list. When inserting consider all the following conditions:if(!head){ //no other nodes}else if (strcmp(data, head->name)<0){ //smaller than head}else if (strcmp(data, tail->name)>0){ //larger than tail}else{ //somewhere in the middle} When deleting a student consider all the following conditions:student may be at the head, the tail or in the middleBelow, you will find a sample of what the file looks like. Notice the names are in…
Using java, write an easier version of a linked list with only a couple of the normal linked list functions and the ability to generate and utilize a list of ints. The data type of the connection to the following node can be just Node, and the data element can be just an int. You will need a reference like (Java) or either a reference to the first node, as well as one to the last node. (Answer the following questions) 1) Create a method or function that accepts an integer, constructs a node with that integer as its data value, and then includes the node to the end of the list. If the new node is the first one, this function will also need to update the reference to the first node. This function will need to update the reference to the final node. Consider how to insert the new node following the previous last node, and keep in mind that the next reference for the list's last node should be null. 2) Create a different method or function that iteratively explores the list, printing…
Old MathJax webview Old MathJax webview In Java Some methods of the singly linked list listed below can be implemented efficiently (in different respects) (as opposed to an array or a doubly linked list), others not necessarily which are they and why? b. Implement a function to add an element before the first element. c. Implement a function to add an item after the last one element. d. Implement a function to output an element of the list. e. Implement a function to output the entire list. f. Implement a function to output the number of elements. G. Implement a function to delete an item. H. Implement a function to clear the entire list. I. Implement functionality to search for one or more students by first name, last name, matriculation number or course of study. J. Implement functionality to sort the records of the student, matriculation number and course according to two self-selected sorting methods.
In C++, how do I read a file with numbers Such as 1,2 3,4 5,6 and place it into a linked list with x,y values Without stringstream or sstream and vectors
Write a code in Java programming: Suppose a robot is trying to cross a river. The system provides two suggestion lists like the following: Given: list1 = ["swim", "boat", "via bridge A", "airplane"]list2 = ["via bridge B", "swim", "give up"]The robot will pick "swim" [Explain] The robot will pick the solution based on the common suggestion from the two lists. If there is not a common suggestion, it should return null. Additionally, if there are multiple common suggestions in the list, the robot will pick the solution that has the highest sum of the list index. For example, Given: list1 = ["swim", "boat", "via bridge A", "airplane"]list2 = ["via bridge B", "airplane", "swim", "give up"]The robot will pick "airplane" [Explain] both lists have "swim" and "airplane." The index for "swim" in list1 is 0 and in list2 is 2, thus the sum of them is 2. On the other hand, the index for "airplane" in list1 is 3 and in list2 is 1, thus the sum of them is 4. Since the robot should pick the…