Introduction to Java Programming and Data Structures: Brief Version (11th Global Edition)
11th Edition
ISBN: 9780134671710
Author: Y. Daniel Liang
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 20, Problem 20.10PE
Program Plan Intro
Set Operations on Priority queue
Program plan:
- Import the required packages into the program.
- In the Exercise20_10 class,
- In the main() method,
- Create two objects for Priority Queue.
- Perform union operation and then display the result.
- Perform difference operation and then display the result.
- Perform the intersection operation and then display the result.
- In the main() method,
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Objectives:
The code for the different stack and queue operations in both implementations (array and linked list) are
discussed in the lectures: and are written in the lectures power point. So the main object of this
assignment is to give the student more practice to increase their understanding of the different
implementation of these operations.
- The students also are asked to write by themselves the main methods in the different exercises below;
The Lab procedures:
The following files must be distributed to the students in the Lab
// it represents an array implementation of the stack.
// it represents a Linked List implementation of the stack.
arraylmpofStack.java
pointerlmofStack.java
pointerlmofQueue.java // it represents a pointer implementation of the queue.
Then the students by themselves are required to write the code for the following questions
Ex1) Given the file arraylmpofStack.java then write a main method to read a sequence of numbers
and using the stack operation print…
Question # 03: (Linked List)
[CLO:2 & 3]
Fast Nuces Karachi has installed a Robo Accountant at Onestop. It can deal with a maximum
of 15 students at a time. Students are supposed to make a queue to get all services one at a
time.
You are required to program its fee challan generation function. The services process in the
following way:
• First, Robo will generate a pin_code for all students after asking for their NU-ID.
•
Second, students will enter the generated pin_code to get a fee challan: for the program,
the fee of the student on the fee challan is the sum of NU-ID digits.
Last, every student will pay the fee of the person before him/her in the queue.
Hint: for payment, the student must know the ID of the student behind him/her in the
queue.
Best of Luck!
USING PYTHON
Create a queue class using Python lists under the hood. Make sure built-in list methods are not accessible when using the new queue object so its properties are not violated.
Zack and Aerith are set to be married. Lined up in front of them will be the entourage of their closest friends composed of 5 pairs. Biggs and Jessie will march first. Announce their names by pair using queues (i.e. use print)! Make sure to use enqueue and dequeue methods!
men = ['Zack', 'Cloud', 'Barret', 'Vincent', 'Cid', 'Biggs']
women = ['Aerith', 'Tifa', 'Marlene', 'Lucrecia', 'Yuffie', 'Jessie']
# Example
# "Zack and Aerith!"
# "Cloud and Tifa!"
Chapter 20 Solutions
Introduction to Java Programming and Data Structures: Brief Version (11th Global Edition)
Ch. 20.2 - Prob. 20.2.1CPCh. 20.2 - Prob. 20.2.2CPCh. 20.2 - Prob. 20.2.3CPCh. 20.2 - Prob. 20.2.4CPCh. 20.2 - Prob. 20.2.5CPCh. 20.3 - Prob. 20.3.1CPCh. 20.3 - Prob. 20.3.2CPCh. 20.3 - Prob. 20.3.3CPCh. 20.3 - Prob. 20.3.4CPCh. 20.4 - Prob. 20.4.1CP
Ch. 20.4 - Prob. 20.4.2CPCh. 20.5 - Prob. 20.5.1CPCh. 20.5 - Suppose list1 is a list that contains the strings...Ch. 20.5 - Prob. 20.5.3CPCh. 20.5 - Prob. 20.5.4CPCh. 20.5 - Prob. 20.5.5CPCh. 20.6 - Prob. 20.6.1CPCh. 20.6 - Prob. 20.6.2CPCh. 20.6 - Write a lambda expression to create a comparator...Ch. 20.6 - Prob. 20.6.4CPCh. 20.6 - Write a statement that sorts an array of Point2D...Ch. 20.6 - Write a statement that sorts an ArrayList of...Ch. 20.6 - Write a statement that sorts a two-dimensional...Ch. 20.6 - Write a statement that sorts a two-dimensional...Ch. 20.7 - Are all the methods in the Collections class...Ch. 20.7 - Prob. 20.7.2CPCh. 20.7 - Show the output of the following code: import...Ch. 20.7 - Prob. 20.7.4CPCh. 20.7 - Prob. 20.7.5CPCh. 20.7 - Prob. 20.7.6CPCh. 20.8 - Prob. 20.8.1CPCh. 20.8 - Prob. 20.8.2CPCh. 20.8 - Prob. 20.8.3CPCh. 20.9 - How do you create an instance of Vector? How do...Ch. 20.9 - How do you create an instance of Stack? How do you...Ch. 20.9 - Prob. 20.9.3CPCh. 20.10 - Prob. 20.10.1CPCh. 20.10 - Prob. 20.10.2CPCh. 20.10 - Prob. 20.10.3CPCh. 20.11 - Can the EvaluateExpression program evaluate the...Ch. 20.11 - Prob. 20.11.2CPCh. 20.11 - If you enter an expression "4 + 5 5 5", the...Ch. 20 - (Display words in ascending alphabetical order)...Ch. 20 - (Store numbers in a linked list) Write a program...Ch. 20 - (Guessing the capitals) Rewrite Programming...Ch. 20 - (Sort points in a plane) Write a program that...Ch. 20 - (Combine colliding bouncing balls) The example in...Ch. 20 - (Game: lottery) Revise Programming Exercise 3.15...Ch. 20 - Prob. 20.9PECh. 20 - Prob. 20.10PECh. 20 - (Match grouping symbols) A Java program contains...Ch. 20 - Prob. 20.12PECh. 20 - Prob. 20.14PECh. 20 - Prob. 20.16PECh. 20 - (Directory size) Listing 18.10,...Ch. 20 - Prob. 20.20PECh. 20 - (Nonrecursive Tower of Hanoi) Implement the...Ch. 20 - Evaluate expression Modify Listing 20.12,...
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
- 4. Explain about singly linked lists with example. Write algorithm for various operations.arrow_forwardObjectives: The code for the different stack and queue operations in both implementations (array and linked list) are discussed in the lectures: and are written in the lectures power point. So the main object of this assignment is to give the student more practice to increase their understanding of the different implementation of these operations. - The students also are asked to write by themselves the main methods in the different exercises below; The Lab procedures: The following files must be distributed to the students in the Lab - arrayImpOfStack.java // it represents an array implementation of the stack. - pointerImOfStack.java // it represents a Linked List implementation of the stack. - pointerImOfQueue.java // it represents a pointer implementation of the queue. Then the students by themselves are required to write the code for the following questions Ex1) Given the file arrayImpOfStack.java then write a main method to read a sequence of numbers and using the stack…arrow_forwardQ2: Write the code in c++ of Queues By using Linklist and Perform MultipleTask which are given below. Your Program will be work as menu Base.1) Inserting value in Queue2.) Deleting value from Queue3) For update any value from Queue4) display the all values from queue5) Search any values from Queue6arrow_forward
- Programming assignments1) Waiting line simulation in an Indian post office:In an Indian post office that not only delivers mail but also functions as a savingsbank carrying out specific transactions, a lone postal worker serves a single queue ofcustomers. Every customer receives a token # (serial number) as soon as they enterthe queue. After service, the token is returned to the postal worker, and the customerleaves the queue. At any point in time, the worker may want to know how manycustomers are yet to be served.i) Implement the system using an appropriate queue data structure, simulating arandom arrival and departure of customers after service completion.ii) If a customer arrives to operate their savings account at the post office, thenthey are attended to first by permitting them to join a special queue. In such a case,the postal worker attends to them immediately before resuming their normal serviceof mail delivery. Modify the system to implement this addition in servicearrow_forwardHow nodes are defined (struct node (value count left right) #:mutable #:transparent) Write in Racket (traverse n) A traversal of a BST is an algorithm for “visiting” all node in the BST. The traversal must visit each node exactly once. In the case of a linked list, a traversal is trivial since the structure is linear: start at the head, move to the next node, and stop when you reach the tail. In the case of a BST, traversal must account for multiple child nodes and keep track of which subtrees have already been visited and which have not. There are three types of traversal: in-order, pre-order, and post-order. We will only implement in-order. The in-order traversal of a BST has the property that the node values will display in ascending or sorted order. The function can be defined either recursively or iteratively. Recursion is much simpler, so we’ll stick to that. Recursive Algorithm for In-Order Traversal of BST parameter: node n, the root of the tree…arrow_forward) A singly linked list contains n - 1 strings that are binary representations of numbers from the set {0, 1,.…, n – 1} where n is an exact power of 2. However, the string corresponding to one of the numbers is missing. For example, if n = 4, the list will contain any three strings from 00, 01, 10 and 11. Note that the strings in the list may not appear in any specific order. Also note that thelength of each string is lgn, hence the time to compare two strings in O(lgn). Write an algorithmthat generates the missing string in O(n).arrow_forward
- Write a Python Code for the given function and conditions: (Use LinkedList Manipulation) Given function: def remove(self, deletekey) (4) Pre-condition: List is not empty. Post-condition: Removes the element from a list that contains the deleteKey and returns the deleted key value.arrow_forwardPlease answer question 4.2 the reference question is also given. Please explain how to get the answer with the answer. If can please give answer and explaining as two parts. Thank you.arrow_forwardPls please solve it quicklyarrow_forward
- Please solve it quickly and logical and correct solutionsarrow_forwardPLEASE USE C/C++.DONOT USE PYTHON Using linked lists implement an amusement park reservation system. The system allows a person to make a reservation for a specific date. A person can change the reservation date or even cancel his booking anytime. The system puts all reservations in a queue. The park will allow only certain number of persons on any given day in order the reservation was made. For each day the system will print out persons allowed to visit the park. For sake of simplicity, dates are being confined to 15th to 30th. The system should ask the user to enter code for different operations. It reads all data from the datafile amusement.dat. The first integer on datafile indicates limit of persons allowed on any day. code 1: make reservation, system expects date followed by name (within 20 characters) and makes reservation. If number of bookings exceeds allowed number, then system prints SORRY, QUOTA OVER and moves over to read next code. code 2: change date of…arrow_forwardFill-in blank the correct term A linked list is represented by a pointer to the ......................ode linked list. Answer: of thearrow_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 EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable 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