Chapter 18, Problem 15PE

Create a queue application with 1. an empty queue of integers 2. add numbers to the queue, 3. calculate and print the difference between the first and the last element. Example: Input : 2, 3, 4, 5, 6, 7, 8, 9 Output : 7 * Explanation: Last element is 9, first element is 2, the difference is 7

The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.

If the elements “A”, “B”, “C” and “D” are placed in a queue and are removed one at a time, in what order will they be removed?

Write a 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. Display4. 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.

Machine Problem: Write a Java  program that will display the given menu: NOTE: adding a string must accept a word/phrase/sentence                 Menu   1. Add a string 2. Display list of strings 3. Display list of  uppercase words 4. Display list of lowercase words 5. Delete an uppercase word 6. Delete a lowercase word 7. End program     When 1 is chosen, ask the user to enter a string and add it to a list using a linked list When 2 is chosen, display the list of strings. When 3 is chosen, display all uppercase words found in the list of strings in ascending order. (create a linked list containing all uppercase words) When 4 is chosen, display all lowercase words found in the list of strings in ascending order. (create a linked list containing all lowercase words) When 5 is chosen, display the list of uppercase words then ask the user the index of the word he wants to delete. Index of the first word in the list is 0 When 6 is chosen, display the list of lowercase words then…

Write a program SentenceReverser that reverses the words in a sentence by reading words into a Stack until you find a period.  Your program should then pop off the words from the stack.  Begin your reverse sentence with a capital letter and end it with a period.   Your program should be able to handle multiple sentences.  Use while (scan.hasNext()) to capture your input.    Mary had a little lamb.  His fleece was as white as snow. Becomes:   Lamb little a had mary. Snow as white as was fleece his.   Note: Your test input should include multiple sentences as shown above.  There should NOT be a space before your periods.

A singly linked circular list is a linked list where the last node in the list points to the first node in the list. A circular list does not contain NULL pointers. A good example of an application where a circular linked list should be used is an item in the shopping cart In an online shopping cart, the system must maintain a list of items and must calculate the total bill by adding the amount of all the items in the cart, Implement the above scenario using a Circular Link List of data structure in C++ Programming. Do Following: First create a class Item having id, name, price, and quantity provide appropriate methods and then Create Cart/List class which holds an items object to represent total items in the cart and next pointer Implement the method to add items in the array, remove an item and display all items. Now in the main do the following Insert Items in the list Display all items. Traverse the link list so that each item's bill gets calculated (by multiplying quantity with…

If the elements “A", "B", “C"and "D" are placed in a queue and are deleted one at a time, in what order will they be removed? а. АВCD b. DCBA c. DCAB O d. ABCD

A singly linked circular list is a linked list where the last node in the list points to the first node in the list. A circular list does not contain NULL pointers. A good example of an application where circular linked list should be used is a items in the shopping cart In online shopping cart, the system must maintain a list of items and must calculate total bill by adding amount of all the items in the cart, Implement the above scenario using Circular Link List. Do Following: First create a class Item having id, name, price and quantity provide appropriate methods and then Create Cart/List class which holds an items object to represent total items in cart and next pointer Implement the method to add items in the array, remove an item and display all items.   Now in the main do the following Insert Items in list Display all items. Traverse the link list so that each items bill gets calculated (by multiplying quantity with price) and also calculate and display Total bill in the end.…