C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN: 9781337102087
Author: D. S. Malik
Publisher: Cengage Learning
expand_more
expand_more
format_list_bulleted
Question
Chapter 18, Problem 19SA
a.
Program Plan Intro
To calculate the index of last element of a queue.
b.
Program Plan Intro
To find the index of the first element of the queue when the next element from the queue is deleted.
c.
Program Plan Intro
To write an expression to return true when queue is non-empty, false otherwise.
d.
Program Plan Intro
To write a statement that inserts “
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Create a queue, size of queue will be dependent on the user. Insert the numbers in the queue till the queue reaches the size. Create a menu and perform the following function on that queue. This is all done by using oop in C++.
Enqueue: Add an element to the end of the queue
Dequeue: Remove an element from the front of the queue
IsEmpty: Check if the queue is empty
IsFull: Check if the queue is full
Peek: Get the value of the front of the queue without removing it
Write a C++ program to create a queue. The size of the queue will be dependent on the user. Insert the numbers in the queue till the queue reaches the size.
Create a menu and perform the following function on that queue.
Enqueue: Add an element to the end of the queue.
Dequeue: Remove an element from the front of the queue.
IsEmpty: Check if the queue is empty.
IsFull: Check if the queue is full.
Peek: Get the value of the front of the queue without removing it.
7. What is output by the following code section?
QueueInterface aQueue = new QueueReference Based();
int numl, num2;
for (int i = 1; i <= 5; i++) {
aQueue.enqueue(i);
} // end for
for (int i = 1; i <= 5; i++) {
numl = (Integer) aQueue.dequeue ();
num2 (Integer) aQueue.dequeue ();
aQueue.enqueue (numl + num2);
aQueue.enqueue (num2 - numl);
} // end for
while (!aQueue.isEmpty()) {
System.out.print (aQueue.dequeue () +
} // end for
Chapter 18 Solutions
C++ Programming: From Problem Analysis to Program Design
Knowledge Booster
Similar questions
- This is a linked list node class Node { public: int data; Node *next; }; Using the above code write the following functions. Please test in the main function of your program. Please upload all code that you write. 1. Adding and removing a node 2. Removing ever third node 3. Adding the complete list at the end. if you had a list 1,2,3 the new list will be 1,2,3,1,2,3 4. Write a function to find the average of the list 5. Write a function that takes in a list as a parameter and adds it to the current list. This Node add will only happen if list 1 element is less then list 2 element. Example List 1 - 1,2,3 List 2 - 3,1,4 New List - 4,2,7 - It only adds if L2 > L1 List all assumptions.arrow_forwardNote : It is required to done this by oop in C++. Create a queue, size of queue will be dependent on the user. Insert the numbers in the queue till the queue reaches the size. Create a menu and perform the following function on that queue. Enqueue: Add an element to the end of the queue Dequeue: Remove an element from the front of the queue IsEmpty: Check if the queue is empty IsFull: Check if the queue is full Peek: Get the value of the front of the queue without removing itarrow_forwardYou can access any element on a queue. True Falsearrow_forward
- Please code in C language. Please use the starter code to help you solve the deleted node and the reverse list. Here is the starter code: #include <stdio.h> #include <ctype.h> #include <stdlib.h> #include <string.h> #include "linkedlist.h" // print an error message by an error number, and return // the function does not exit from the program // the function does not return a value void error_message(enum ErrorNumber errno) { char *messages[] = { "OK", "Memory allocaton failed.", "Deleting a node is not supported.", "The number is not on the list.", "Sorting is not supported.", "Reversing is not supported.", "Token is too long.", "A number should be specified after character d, a, or p.", "Token is not recognized.", "Invalid error number."}; if (errno < 0 || errno > ERR_END) errno = ERR_END; printf("linkedlist: %s\n", messages[errno]); } node *new_node(int v) { node *p =…arrow_forwardNote : It is required to done this by OOP in C++. Thanks Create a linked list, size of linked list will be dependent on the user. Insert the numbers in the linked list till the linked list reaches the size. Create a menu and perform the following function on that linked list. Traversal: To traverse all the nodes one after another. Insertion: To add a node at the given position. Deletion: To delete a node. Searching: To search an element(s) by value. Updating: To update a node.arrow_forwardCreate a queue, size of queue will be dependent on the user. Insert the numbers in the queue till the queue reaches the size. Create a menu and perform the following function on that queue.Enqueue: Add an element to the end of the queueDequeue: Remove an element from the front of the queueIsEmpty: Check if the queue is emptyIsFull: Check if the queue is fullPeek: Get the value of the front of the queue without removing itarrow_forward
- Develop a C++ project that maintain data in Ascending Order in a Linked List and provide the following options to the user: Options Detail:- This option ask the user to enter a value. The program should insert the node of that value in appropriate position in Linked List. This options ask the user to enter value to delete. The program finds the node containing that value, and delete that node from the Linked List. This option ask the user to enter a value, then tells the user that the entered value exist in the list or not. This option displays all values stored in Linked List. This option exits the program. Develop the program in such a way that when user enters a choice, clear the screen and show the relevant interface. After the completion of operation, the program shows main window again.arrow_forwarddetemine if the following statement are true or false The iterator operation is required by the Iterable interface. A list allows retrieval of information based on the contents of the information.arrow_forwardWrite a c++ code of link list which is used to take your data like name, mob, age , marks. After that you will display the data in Disp() function. Your code will be able to take 5 students data and also check which student marks is greater than from other. At the end you will delete any node from link list Please should create grading_fun(); Bonus > 80 A 70 B 60 C 50 Darrow_forward
- Q1: Write a java application for the stack operations with Linked List. Q2: Write java program to take the order from the customer and display the ordered items and total payment. If customer is entering the wrong name or not following the order to enter the menu it has to display error messages. (Find in the sample code) Sample Output:arrow_forwardC++ A robot is initially located at position (0; 0) in a grid [?5; 5] [?5; 5]. The robot can move randomly in any of the directions: up, down, left, right. The robot can only move one step at a time. For each move, print the direction of the move and the current position of the robot. If the robot makes a circle, which means it moves back to the original place, print "Back to the origin!" to the console and stop the program. If it reaches the boundary of the grid, print \Hit the boundary!" to the console and stop the program. A successful run of your code may look like:Down (0,-1)Down (0,-2)Up (0,-1)Left (-1,-1)Left (-2,-1)Up (-2,0)Left (-3,0)Left (-4,0)Left (-5,0)Hit the boundary! or Left (-1,0)Down (-1,-1)Right (0,-1)Up (0,0)Back to the origin! About: This program is to give you practice using the control ow, the random number generator, and output formatting. You may use <iomanip> to format your output. You may NOT use #include "stdafx.h".arrow_forwardConsider the following statements: linkedStackType<int> stack; linkedQueueType<int> queue; int num; Suppose the input is 28 30 15 11 10 -9 21 8 -3 33 17 14 Write a C++ code that processes these numbers as follows: If the number is an even number, it is pushed onto the stack. If the number is odd and divisible by 3, it is added into the queue; otherwise the top element, if any, of the stack is removed and the square of the number is added onto the stack. After processing these numbers, what is stored in stack and queue?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
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)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education