Consider the following representation of a queue ADT that is implemented using an array data structure: Queue front rear 63 8204 0 1 2 3 4 5 Write the required C++ computer program instructions for the following functions: a) printNext()- which displays the next element in the Queue to be processed b) enqueueAt(data, position) - which insert data at location position in the Queue c) dequeueFrom(position) - which removes the Queue's element from location position, and ensures that all elements in the queue are adjacent (i.e. there are no gaps between elements in the queue) d) howMany(data) - which searches the Queue for data, and then returns the amount of elements in front of data before it is processed

Consider the following representation of a queue ADT that is implemented using an array data structure: Queue front rear 63 8204 0 1 2 3 4 5 Write the required C++ computer program instructions for the following functions: a) printNext()- which displays the next element in the Queue to be processed b) enqueueAt(data, position) - which insert data at location position in the Queue c) dequeueFrom(position) - which removes the Queue's element from location position, and ensures that all elements in the queue are adjacent (i.e. there are no gaps between elements in the queue) d) howMany(data) - which searches the Queue for data, and then returns the amount of elements in front of data before it is processed

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 21SA

See similar textbooks

Similar questions

Prepare a menu-driven C program for Inserting and deletionoperation for both a queue structure and a linked list of studentinformation which has the following structure declaration.struct student{ char Student_name[30];int TC;char address[20];char email[30];char mobile[12];char department[2];/* CE=Computer Engineering, E=English */};Define the following Initialized array of structure in your program.struct student HKU [10]={”Ahmet Osman”, 12005310,”Gaziantep”,”Ahmet@gmail.com”,“05531001020”,“CE”,”Sevgi Mert”, 12005311,”Konya”,” Sevgi@gmail.com”,“05531141990”,“E”,”Osman Kemal”, 12005312,”Istanbul”,” Osman@gmail.com”,“05531331023”,“CE”,”Mert Osman”, 12005313, ”Antalya”,” Mert@gmail.com”,“05531041424”,“CE”,”Ayse Omer”, 12005314,”Ankara”,” Ayse@gmail.com”,“05531087412”,“E”,”Kemal ali”, 12005315, ”Izmir”,” Kemal@gmail.com”,“05535471028”,“CE”,”Lale Can”, 12005316, ,”Trabzon”,” Lale@gmail.com”,“05534712036”,“E”,”Sefer Mert”, 12005317, ”Mardin”,” Sefer@gmail.com”,“05531078621”,“CE”,”Meral…
To write a COMPLETE C program)Prepare a menu-driven C program forInserting and deletion operation for both a queue structure and a linked list of student informationwhich has the following structure declaration.====================================================struct student { char Student_name[30]; int TC;char address[20];char email[30];char mobile[12];char department[2];/* CE=Computer Engineering, E=English */};Define the following Initialized array ofstructure in your program.struct student HKU [10]={”Ahmet Osman”, 12005310,”Gaziantep”,”Ahmet@gmail.com”,“05531001020”,“CE”,”Sevgi Mert”, 12005311,”Konya”,” Sevgi@gmail.com”,“05531141990”,“E”,”OsmanKemal”, 12005312,”Istanbul”,” Osman@gmail.com”,“05531331023”,“CE”,”Mert Osman”, 12005313, ”Antalya”,” Mert@gmail.com”,“05531041424”,“CE”,”AyseOmer”, 12005314,”Ankara”,” Ayse@gmail.com”,“05531087412”,“E”,”Kemal ali”, 12005315,”Izmir”,” Kemal@gmail.com”,“05535471028”,“CE”,”Lale Can”, 12005316, ,”Trabzon”,”…
(To write a COMPLETE C program)Prepare a menu-driven C program for Inserting and deletionoperation for both a queue structure and a linked list of studentinformation which has the following structure declaration. struct student{ char Student_name[30];int TC;char address[20];char email[30];char mobile[12];char department[2];/* CE=Computer Engineering, E=English */};Define the following Initialized array of structure in your program.struct student HKU [10]={”Ahmet Osman”, 12005310,”Gaziantep”,”Ahmet@gmail.com”,“05531001020”,“CE”,”Sevgi Mert”, 12005311,”Konya”,” Sevgi@gmail.com”,“05531141990”,“E”,”Osman Kemal”, 12005312,”Istanbul”,” Osman@gmail.com”,“05531331023”,“CE”,”Mert Osman”, 12005313, ”Antalya”,” Mert@gmail.com”,“05531041424”,“CE”,”Ayse Omer”, 12005314,”Ankara”,” Ayse@gmail.com”,“05531087412”,“E”,”Kemal ali”, 12005315, ”Izmir”,” Kemal@gmail.com”,“05535471028”,“CE”,”Lale Can”, 12005316, ,”Trabzon”,” Lale@gmail.com”,“05534712036”,“E”,”Sefer Mert”, 12005317, ”Mardin”,”…
(JAVA)Almost a priority queue. Design a data structure that supports the followingoperations for almost a priority queue:(i) FindSecondSmallest() which returns the second smallest item in the data structure.(ii) Insert(x) which inserts item x to the data structure.(iii) DeleteSecondSmallest() which removes the second smallest item from the datastructure.Your data structure should implement the operation FindSecondSmallest() in O(1), andthe other two operations in O(log n), where n is the number of elements in the datastructure.Problem 4: Binomial heaps. Let H1 and H2 be two binomial heaps. We would like tomerge H1 and H2 to obtain the binomial heap H and also to find the minimum key in H.A standard approach would be to perform the following sequence of operationsH = Merge(H1, H2);m = Min(H).Alternatively, we may perform the following sequence of operationsm1 = Min(H1);m2 = Min(H2);m = min{m1, m2};H = Merge(H1, H2).
To write a COMPLETEC program)Prepare a menu-driven C program forInserting and deletion operations for a queue structure of teacher informationwhich has the following structure declaration.Structure of a queue will be defined as follows.struct teacher{ char F_name[12]; char L_name[12]; int TC;char address[20]; char email[30];char mobile[12];char department[2];/* CE=ComputerEngineering, E=English */};struct queue{struct teacher std_info[10]; int front, rear;};Define the following Initialized array of structure in your program.struct teacher HKU [10]={”Ahmet”,”Osman”, 12005310,”Gaziantep”,”Ahmet@gmail.com”,“05531001020”,“CE”,”Sevgi” ,”Mert”, 12005311,”Konya”,” Sevgi@gmail.com”,“05531141990”,“E”,”Osman”,”Kemal”, 12005312,”Istanbul”,” Osman@gmail.com”,“05531331023”,“CE”,”Mert”, ”Osman”, 12005313,”Antalya”,” Mert@gmail.com”,“05531041424”,“CE”,”Ayse”,”Omer”,12005314,”Ankara”,” Ayse@gmail.com”,“05531087412”,“E”,”Kemal”, “ali”, 12005315,”Izmir”,” Kemal@gmail.com”,“05535471028”,“CE”,”Lale”,…
While implementing a queue using Array what type of a problem occurs when inserting and deleting an item takes place at constant time? Q-. What is the proposed solution to the above problem and what changes are made in enqueue( ) and dequeue( ) operation when solving the issue in data structure using C++? Subject : C++ Department: Computer Science
Write a C++ program to simulate the working of queues using an array provide the following operation: i) Insert ii) Delete iii) DisplayAssume that the size of the queue is 5. Define the following functions in the class Queue enqueue ( ) --- to add value to queue display ( ) --- Display the values in list dequeue ( ) --- to delete the value from the queue Note: While inserting the element to the queue if the Queue is full then print "Queue Overflow" in the main method. While deleting the element from the queue if the Queue is empty then print "Queue Underflow" in the dequeue ( ) method. While displaying the elements from the queue if the Queue is empty then print "Queue is empty" in the display( ) method. Input and Output Format: Refer sample input and output for formatting specifications. [All text in bold corresponds to input and the rest corresponds to output] Sample Input and Output 1 : 1.Insert element to queue2.Delete element from queue3.Display all…
Given a pointer based queue below: A B C D E F G Assuming the front is on A and the rear is on G, what is the result of enqueueing X and dequeueing one element?
CODE IN PYTHON build the queue data structure using linked list for the following elements ['D','A','T','A' S,'T','R',U',C','U',T','R','E','S'] with the following operations (i)enqueue (ii)dequeue (iii)display (iv)isnull
Write a C code for the structure types of a dynamic linked list implementation of a “queue”. Each node of the queue will have the following information: Name of the queue: library_tComponents of the queue:Book_Name (name of the book)Writter_Name (name of the writter)ID (identification number of the book)Edition (edition of the book)Link: pointer/link to next node Write functions to add and remove the nodes of the queue and use printf() to show that the code is working properly
Write a C code for the following. Let ‘Q’ be a queue data structure of integers. Write a ‘C’ code to remove the values which contains number divisible by 10 from the queue. For this purpose you are allowed to use additional queues, but not any other temporary storage unit. Use only queue operations. Example input : (bottom of the queue) 20,23,45,60,52 Expected output : 23,45,52
Write a c program for implementing queue using linked lists, for which you should use a structure to create a node with data and the next pointer. The program should be able to insert, delete and display nodes in the queue. The user will be asked to enter his choice either to insert a node (enqueue), delete a node (dequeue), display or to exit from the program. The options for the user should be as the following: 1. Insert a node (Enqueue) 2. Delete a node (Dequeue) 3. Display 4. Exit  For example if user selected option 1 then the following should appear in the output: Enter the value to insert: Node is inserted  If user selected option 2 then the following should appear in the output: Deleted Element is:  If the user selected option 3 then the program should display the elements that are available in the queue The program will keep on running and taking inputs from the user until he selects the 4th option to exit.