Establish a linked queue, and run operations in the linked queue. General operations include:Create queue, one element enqueue, one element dequeue, check if the queue is full. Implementation of algorithm Header file typedef int DataType;   typedef struct Node {             DataType data;             struct Node *next; }Lnode; //define node type   typedef struct Qu {             Lnode *front;             Lnode *rear;      } Queue;//queue type   Source file #include #include #include #include #include "queue.h"   Queue * Initiate_queue()//Initial queue with head node, return pointer of the queue. {               }   int Queue_empty (Queue *queue)//Check if the queue if empty. If it is empty return 1 else return0. {               }   void En_queue(Queue *queue, DataType node)//Enqueue {                         }   DataType De_queue(Queue *queue)//Dequeue a node, return its value. {             Lnode *de_node;             int seq;             if(Queue_empty(queue)==1)//Check if the queue is empty                                     {                         printf("The queue is empty! Cannot dequeue");                         return -1;             }                         else//dequeue an element             {                                     }                      }   void displayQueue(Queue *queue)//Display the element in the queue {                         }     void main()// {             Queue *Q;             int i;             Q=Initiate_queue();             printf("Please input  elements\n");             ______________;//generate the linked queue     _______________;//display the elements in queue     ______________;//dequeue an element _______________;//display the elements in queue _______________;//enqueue an element _______________;//display elements in queue }

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
100%
  1. Establish a linked queue, and run operations in the linked queue.

General operations include:Create queue, one element enqueue, one element dequeue, check if the queue is full.

Implementation of algorithm

Header file

typedef int DataType;

 

typedef struct Node {

            DataType data;

            struct Node *next;

}Lnode; //define node type

 

typedef struct Qu

{

            Lnode *front;

            Lnode *rear;     

} Queue;//queue type

 

Source file

#include <stdio.h>

#include <stdlib.h>

#include <string.h>

#include <malloc.h>

#include "queue.h"

 

Queue * Initiate_queue()//Initial queue with head node, return pointer of the queue.

{

           

 

}

 

int Queue_empty (Queue *queue)//Check if the queue if empty. If it is empty return 1 else return0.

{

           

 

}

 

void En_queue(Queue *queue, DataType node)//Enqueue

{

           

           

}

 

DataType De_queue(Queue *queue)//Dequeue a node, return its value.

{

            Lnode *de_node;

            int seq;

            if(Queue_empty(queue)==1)//Check if the queue is empty

                       

            {

                        printf("The queue is empty! Cannot dequeue");

                        return -1;

            }

           

            else//dequeue an element

            {

                       

            }         

           

}

 

void displayQueue(Queue *queue)//Display the element in the queue

{

           

           

}

 

 

void main()//

{

            Queue *Q;

            int i;

            Q=Initiate_queue();

            printf("Please input  elements\n");

            ______________;//generate the linked queue

    _______________;//display the elements in queue

    ______________;//dequeue an element

_______________;//display the elements in queue

_______________;//enqueue an element

_______________;//display elements in queue

}

Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Stack
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education