StudyDaddy Computer Science

Answered You can buy a ready-made answer or pick a professional tutor to order an original one.

QUESTION

May 01, 2017

Write a C++ program to implement a queue using linked lists. The program should provide the following functionality:

Homework program writing

Enqueue data into queue
Dequeue data from queue
Print data at the front
Print data at the back
Print the entire queue
Check if the queue is empty
Print the number of elements in the queue

Test your program using at least the following test cases (considering the queue includes integers):

Check if the queue is empty: Option F.
Enqueue 7 into the queue: Option A.
Enqueue 4 into the queue: Option A.
Check if the queue is empty: Option F.
Dequeue data form the queue.
Print the number of elements in the queue: Option G.
Enqueue 5 into the queue: Option A.
Print the number of elements in the queue: Option G.
Check if the queue is empty: Option F.
Print data at the front: Option C.
Print data at the back: Option D.
Print entire queue: Option E.

prof-2

@
25 orders completed

ANSWER: Tutor has posted answer for $20.00. See answer's preview

$20.00

******** ********************** <stdlibh>struct node{ *** info; ****** **** ********************************* ******************* ******* ********** ********** empty();void ************** create();void *************** count * ****** ******* *** ** ch ** ********** * * ******** ********** * * ******** printf("\n * * ***** ********** printf("\n * * ******** ********** 5 * ******* printf("\n 6 - Display"); printf("\n 7 * ***** ******* create(); ***** *** * ********** ***** ****** * *** ********** &ch); ****** (ch) { case ** ************* **** * "); scanf("%d" &no); ******** ****** **** ** ****** ****** **** ** e * *************** ** ** != ** printf("Front element : *** e); else ********** ** front ******* in ***** ** queue is ******** break; **** ** ******** break; **** ** ******** case ** ********** break; **** 7: ************ ****** ******** ************* ****** ****** enter ******* ****** *** ****** } }}/* ****** an empty ***** */void ********* ***** * **** * ******** Returns queue size ****** ************ printf("\n Queue **** * *** ********** Enqueing *** ***** ****** ******* data){ ** ***** ** ***** * **** * ******* **** *)malloc(1*sizeof(struct ******* ************ * ***** ************* * ***** ***** * rear; * **** * ************ node ************************ node)); ************ * ***** ************* = ***** ************ = NULL; **** * ***** * count++;}/* ********** *** ***** elements ****** ********** ****** = ****** ** ******** ** NULL) ********** ***** == ****** { ************* ** ******** ******* * ***** ******* != rear) * ********** " ***************** ****** * front1->ptr; } ** (front1 ** ***** *********** ******************** ******** *** ***** ****** deq(){ ****** * ****** if ******* ** NULL) * printf("\n ****** ****** ** ******* ******** **** empty queue"); return; } **** if (front1->ptr != NULL) { ****** * front1->ptr; ********** Dequed value * %d" **************** ************ ***** = ******* * else * ********** ****** ***** : %d" **************** free(front); ***** * ***** **** * NULL; * *********** ******* *** ***** ******* ** ***** */int *************** ** ******* ** ***** ********** ***** ** ****** *********************** else ****** ***** ******* ** queue ** ***** or *** */void ******** ** ((front ** NULL) ********** (rear == ****** printf("\n ***** ******** else ************* *** *********

or Buy custom answer