A double-ended queue or deque is a generalization of a stack and a queue that supports adding and removing items from either the front or the back of the data structure. This assignment has two parts: Part-1 Create a doubly linked list based DeQueDLL class that implements the DequeInterface. The class skeleton and interface are provided to you. Implement a String toString () method that creates and returns a string that correctly represents the current deque. Such a method could prove useful for testing and debugging the class and for testing and debugging applications that use the class. Assume each queued element already provides its own reasonable toString method. Part-2 Create an application program that gives a user the following three options to choose from – insert, delete, and quit. If the user selects ‘insert’, the program should accept the integer input from the user and insert it into the deque in a sorted manner. If the user selects ‘delete’, the program should accept the integer input from the user and delete that integer from the deque. The program should continue to prompt the user for options until the user chooses to quit. Display the contents of deque after each insert/delete operation. You can make the following assumptions: User always tries to insert/delete an integer value only In case of repeated values, delete operation will delete the first occurrence only Sample execution of code is provided on next page. Ensure that your program works well by checking it against different test cases. At the minimum, submit three new and different test case reports with your program submission.

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

Related questions

Concept explainers

Question

A double-ended queue or deque is a generalization of a stack and a queue that supports adding and removing items from either the front or the back of the data structure.

This assignment has two parts:

Part-1

Create a doubly linked list based DeQueDLL class that implements the DequeInterface. The class skeleton and interface are provided to you.
Implement a String toString () method that creates and returns a string that correctly represents the current deque. Such a method could prove useful for testing and debugging the class and for testing and debugging applications that use the class. Assume each queued element already provides its own reasonable toString method.

Part-2

Create an application program that gives a user the following three options to choose from – insert, delete, and quit. If the user selects ‘insert’, the program should accept the integer input from the user and insert it into the deque in a sorted manner. If the user selects ‘delete’, the program should accept the integer input from the user and delete that integer from the deque. The program should continue to prompt the user for options until the user chooses to quit. Display the contents of deque after each insert/delete operation. You can make the following assumptions:

User always tries to insert/delete an integer value only
In case of repeated values, delete operation will delete the first occurrence only

Sample execution of code is provided on next page.

Ensure that your program works well by checking it against different test cases. At the minimum, submit three new and different test case reports with your program submission.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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.

Similar questions