#include <\/p>\n
#include <\/p>\n
#include <\/p>\n
#include <\/p>\n
#define TITLE_LEN 100<\/p>\n
#define NAME_LEN 30<\/p>\n
#define ROOM_LEN 20<\/p>\n
\/\/ SCOURCE FILE FOR THE OTHER FUNCTIONS \/\/<\/p>\n
#include “book.h”<\/p>\n
#include “readline.h”<\/p>\n
struct book *add_to_end(struct book *list){<\/p>\n
\/\/add code<\/p>\n
struct book *prev_book = NULL, *end = list;<\/p>\n
struct book *new_book = NULL;<\/p>\n
new_book = malloc(1 * sizeof(struct book));<\/p>\n
if (new_book == NULL) { \/\/ make sure that here is still a memory in allocate<\/p>\n
printf(“Error: malloc failed in add_to_list\\n”);<\/p>\n
exit(EXIT_FAILURE);<\/p>\n
}<\/p>\n
printf(“Enter the Book’s title: “); \/\/ Ask the user to enter the title,<\/p>\n
read_line(new_book->title,TITLE_LEN); \/\/ read the input<\/p>\n
printf(“Enter the Author’s first name: “); \/\/ Ask the user to enter the author first name<\/p>\n
read_line(new_book->first,NAME_LEN); \/\/ read the input<\/p>\n
printf(“Enter the Author’s last name: “); \/\/ Ask the user to enter the author last name<\/p>\n
read_line(new_book->last,NAME_LEN); \/\/ read the input<\/p>\n
printf(“Enter Classroom: “); \/\/ Ask the user to enter classroom<\/p>\n
read_line(new_book->classroom,ROOM_LEN); \/\/ read the input<\/p>\n
new_book->next = NULL; \/\/ go for the next book<\/p>\n
\/\/ add the book yo the list<\/p>\n
if (!list) {<\/p>\n
\/\/ if the list is empty<\/p>\n
printf(“Enter the price of the book: “);<\/p>\n
scanf(“%lf”, &new_book->price);<\/p>\n
return new_book;<\/p>\n
}<\/p>\n
\/\/ if the list is not empty<\/p>\n
while (end != NULL) { \/\/ cheack is the book is already there by comparing it<\/p>\n
if (!strncmp(new_book->title, end->title, TITLE_LEN + 1) &&<\/p>\n
!strncmp(new_book->first, end->first, NAME_LEN + 1) &&<\/p>\n
!strncmp(new_book->first, end->first, NAME_LEN + 1)) {<\/p>\n
printf(“Book is already exists\\n”); \/\/ if there is a book with the same title, author, classrom<\/p>\n
free(new_book);<\/p>\n
return list;<\/p>\n
} else { \/\/ if nott we add it to the end<\/p>\n
prev_book = end;<\/p>\n
end = end->next;<\/p>\n
}<\/p>\n
}<\/p>\n
\/\/ if there is no book does not exists<\/p>\n
printf(“Enter the price of the book: “); \/\/ ask the user to enter the price for it<\/p>\n
scanf(“%lf”, &new_book->price);<\/p>\n
prev_book->next = new_book; \/\/ the new book go next to the end of the linked list<\/p>\n
return list; \/\/ return to the list<\/p>\n
}<\/p>\n
void search(struct book *list)<\/p>\n
{<\/p>\n
\/\/ add code<\/p>\n
char search_title[TITLE_LEN+1]; \/\/ string for the search input<\/p>\n
struct book *p;<\/p>\n
printf(“\\nEnter title book: “);<\/p>\n
read_line(search_title, TITLE_LEN); \/\/ read the input<\/p>\n
\/* a for loop that goes over all the list and search for the same title name<\/p>\n
and stops when p == NULL *\/<\/p>\n
for (p = list; p != NULL; p = p->next)<\/p>\n
\/\/ if statent to compare the input title with the title in the lists<\/p>\n
if (!strncmp(search_title, p->title, TITLE_LEN + 1)){<\/p>\n
\/\/ if found it print the book name<\/p>\n
printf(“%-18s %s %-7s %.2f %s\\n”, p->title, p->first, p->last, p->price, p->classroom);<\/p>\n
}<\/p>\n
else<\/p>\n
\/\/ if not found print a message that didnt found<\/p>\n
printf(“book dont found\\n”);<\/p>\n
return; \/\/ return empty<\/p>\n
}<\/p>\n
void print_list(struct book *list){<\/p>\n
\/\/add code<\/p>\n
\/\/ print all lists<\/p>\n
printf(“Book Title Auther Name price Classroom\\n”);<\/p>\n
struct book *p;<\/p>\n
\/\/ a for loop that make sure it goes over all the books and stop in NULL<\/p>\n
for(p= list; p!=NULL; p = p->next)<\/p>\n
\/\/ print: title, authors first and last name, price, and classroom<\/p>\n
printf(“%-18s %s %-7s %.2f %s\\n”, p->title, p->first, p->last, p->price, p->classroom);<\/p>\n
printf(“\\n”);<\/p>\n
}<\/p>\n
void clear_list(struct book *list)<\/p>\n
{<\/p>\n
\/\/add code<\/p>\n
struct book *p;<\/p>\n
\/\/ a while loop that free the list and go to the next till its empty<\/p>\n
while(list != NULL)<\/p>\n
{<\/p>\n
p = list;<\/p>\n
list = list->next;<\/p>\n
if( p!= NULL)<\/p>\n
free(p);<\/p>\n
}<\/p>\n
}<\/p>\n","protected":false},"excerpt":{"rendered":"
#include #include #include #include #define TITLE_LEN 100 #define NAME_LEN 30 #define ROOM_LEN 20 \/\/ SCOURCE FILE FOR THE OTHER FUNCTIONS \/\/ #include “book.h” #include “readline.h” struct book *add_to_end(struct book *list){ \/\/add code struct book *prev_book = NULL, *end = list; struct book *new_book = NULL; new_book = malloc(1 * sizeof(struct book)); if (new_book == NULL) […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[10],"class_list":["post-79161","post","type-post","status-publish","format-standard","hentry","category-research-paper-writing","tag-writing"],"_links":{"self":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/posts\/79161","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/comments?post=79161"}],"version-history":[{"count":0,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/posts\/79161\/revisions"}],"wp:attachment":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/media?parent=79161"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/categories?post=79161"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/tags?post=79161"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}