Write a function named enqueue () with 3 parameters to insert the elements in a queue.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

struct Book {
int bookNo;
char bookName [100]:
struct Book* next;
};
struct Queue {
struct Book *front, *rear;
};
struct Book* newNode (int bNo, char bName [10]) {
struct Book* temp = (struct Book*) malloc (sizeof (struct Book) ) :
temp->bookNo = bNo;
strepy (temp->bookName, bName);
temp->next = NULL;
return temp;
};
struct Queue createQueue () {
struct Queue* q = (struct Queue* ) malloc (sizeof (struct Queue) );
q->front = q->rear = NULL;
return q;
};
int main () {
struct Queue* g = createQueue () ;
enQueue (q, 01, "The History of Geumga Plaza");
enQueue (g, 02, "Unbeatable of Vincenzo Casano");
deQueue (q) :
enQueue (q, 03, "The Rackless Babel Company");
deQueue (q) ;
enQueue (q, 04, "It It's Okay to Not Be Okay");
printf("First Queue of the book : d Book Title : $s\n",
g->Iront->DOOKNO, g->Iront->bookName);
printf ("Last Queue of the book : $d Book Title : is\n",
q->rear->bookNo, g->rear->bookName);
return 0;
Figure Q3
a)
Write a function named enqueue () with 3 parameters to insert the
elements in a queue.
Transcribed Image Text:struct Book { int bookNo; char bookName [100]: struct Book* next; }; struct Queue { struct Book *front, *rear; }; struct Book* newNode (int bNo, char bName [10]) { struct Book* temp = (struct Book*) malloc (sizeof (struct Book) ) : temp->bookNo = bNo; strepy (temp->bookName, bName); temp->next = NULL; return temp; }; struct Queue createQueue () { struct Queue* q = (struct Queue* ) malloc (sizeof (struct Queue) ); q->front = q->rear = NULL; return q; }; int main () { struct Queue* g = createQueue () ; enQueue (q, 01, "The History of Geumga Plaza"); enQueue (g, 02, "Unbeatable of Vincenzo Casano"); deQueue (q) : enQueue (q, 03, "The Rackless Babel Company"); deQueue (q) ; enQueue (q, 04, "It It's Okay to Not Be Okay"); printf("First Queue of the book : d Book Title : $s\n", g->Iront->DOOKNO, g->Iront->bookName); printf ("Last Queue of the book : $d Book Title : is\n", q->rear->bookNo, g->rear->bookName); return 0; Figure Q3 a) Write a function named enqueue () with 3 parameters to insert the elements in a queue.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY