Question 4 Write a C++ program to implement a queue using a linked list as data structure. The queue must allow to store any record type consist of up to two data only. Your program must implement the following operations: • Insert a record in the queue. • Retrieve the first record in the queue. Retrieve the last record in the queue. Return the number of records in the queue.

Question 4 Write a C++ program to implement a queue using a linked list as data structure. The queue must allow to store any record type consist of up to two data only. Your program must implement the following operations: • Insert a record in the queue. • Retrieve the first record in the queue. Retrieve the last record in the queue. Return the number of records in the 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

See similar textbooks

Similar questions

C# language Write a program that creates a Queue or Stack (your choice) that represents a list of work orders. This program should use loop, allowing the user to push and pop items on the stack / queue. The program should also allow the user to print all the items in the stack / queue to the console.
Write a C++ code using C++ STL to a. Create 2 lists first list of size 3 and second with size 2 elements in each list. (elements inserted in 2 list are scanned from user) b. Reverse each list using stack. c. Store the two lists in a queue d. Print queue without deleting elements in it
need help on this. Thanks in advance!
C++ In this project you will implement two small programs. One program will show an example of stack use and another program will show the use of a Queue 1. Use the STL to create your data structures 2. You should have the following features: a. Add a record b. Find a record c. Delete a record e. View all records
Solve the following C++ Program Quickly Please. create a link list with following operation insert a node at start and insert a node at end delete a value from start delete a value from end of link list. display all values.
If this is needed to program, please use c++ language thanks!
Write a C++ code using C++ STL to a. Create 2 lists first list of size 3 and second with size 2 elements in each list. (elements inserted in 2 list are scanned from user) b. Reverse each list using stack. c. Store the two lists in a queue d. Print queue without deleting elements in it
Modify the given code to make it work using the keywords (undo,redo,display and exit) instead of the case statment. It will insert by default but when it reads one of the keywords it will go the function we call. Example: Enter the element to be inserted in the queue: hello Enter the element to be inserted in the queue: world Enter the element to be inserted in the queue:display hello world Enter the element to be inserted in the queue:undo Enter the element to be inserted in the queue:display hello Enter the element to be inserted in the queue:redo Enter the element to be inserted in the queue:display hello world ***************************** The Code #include <stdio.h>#include <stdlib.h>struct node{char data[100];struct node *link;}*front, *rear; struct node *list=NULL;void insert(){struct node *temp;temp = (struct node*)malloc(sizeof(struct node));printf("Enter the element to be inserted in the queue: ");scanf("%s",temp->data);temp->link = NULL;if (rear ==…
Using Dyanmic LL write a C++ program to do the following: Create a Dynamic LL Add anode: a) When the List is empty b) In the beginning of the List c) In the end of the List d) Somewhere between the beginning and the end of the List. e) Purge the LL The ADD algorithm is to determine where the new node to be placed in the List. The user is not be asked where the new node should be inserted. Delete a node: a) When the List is empty b) From the beginning of the List c) From the end of the List d) From somewhere between the beginning and the end of the List. The DELTE algorithm is to determine where the targeted node is placed in the List. The user is not be asked about the location of the targeted node. Search for a node and display its contents. The Search is done based on a key field from the node (i.e a name, or an ID) The Search algorithm is to locate the targeted node and to display it The user is not be asked about the location of the targeted node.…
Write a c++ program that reads in input commands related to a queue with no more than ten elements and performs the specified operations. Note that you should create three files, one for the main, one for Queue.h, and one for Queue.cpp. Those commands are: 'E', which will be followed by a number. You should enqueue that number 'D', which will dequeue the value from the front of the queue and print it, followed by a new line 'K'. which will peek at the value at the front of the queue and print it, followed by a new line 'Q', which will quit the program You can assume that all the input is valid.
C++
Use C++ to Solve This. 4: Write a program for Queue operation. The program must display the address of element being Pushed or Popped after every Push and Pop operation.