Implement the following using Queue in the same Java program as in Part I. a) Create a Queue and add the following ID numbers: i. 14788 ii. 10652 iii. 13764 iv. 12785 v. 10325 vi. 11008 b) Display the Queue using any one of the three cursors (Enumeration, Iterator or ListIterator) c) Ask the user to enter a new ID number and add to Queue and display it. d) Remove only the head element of the Queue and display the removed element. e) Display only the current head element of the Queue. f) Display all the elements present in the Queue. g) Ask the user to enter a valid index number within the size range of the Queue. h) Receive the user input and display the element present at the given index. i) Ask the user to enter an ID number of their choice. j) Search for user given ID number in the Queue and display "ID number is present" if it is present in the Queue or display "ID number is present" if it is not present in the Queue

Implement the following using Queue in the same Java program as in Part I. a) Create a Queue and add the following ID numbers: i. 14788 ii. 10652 iii. 13764 iv. 12785 v. 10325 vi. 11008 b) Display the Queue using any one of the three cursors (Enumeration, Iterator or ListIterator) c) Ask the user to enter a new ID number and add to Queue and display it. d) Remove only the head element of the Queue and display the removed element. e) Display only the current head element of the Queue. f) Display all the elements present in the Queue. g) Ask the user to enter a valid index number within the size range of the Queue. h) Receive the user input and display the element present at the given index. i) Ask the user to enter an ID number of their choice. j) Search for user given ID number in the Queue and display "ID number is present" if it is present in the Queue or display "ID number is present" if it is not present in the Queue

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

Similar questions

Java adt Draw the contents of the queue after the following statements execute. Clearly label the front and back of the queue. QueueInterface bankLine = new LinkedQueue<>(); bankLine .enqueue("John"); bankLine .enqueue("Matthew"); String next = bankLine .dequeue(); next = bankLine .dequeue(); bankLine .enqueue("Drew"); bankLine .enqueue("Heather"); next = bankLine .dequeue(); bankLine .enqueue("David"); next = bankLine .dequeue();
Answer the given question with a proper explanation and step-by-step solution. Write in Java: Write a menu-driven program to illustrate the use of a linked list. The entries will only consist of integer number keys (values). The program should implement the following options in order: • Insert- insert a key into a list- not allowing duplicate integers. • Delete- delete a key from the list. • Search- finds or does not find a particular key in the list. • Print- prints the list graphically in horizontal form. If the list is empty output- "Nothing to print". • Size- count of all the keys in the list. • Sort- sorts the keys in the list in ascending order. • Reverse- reverses the order of the keys in the list • Rotate- moves the key at the front of the list to the end of the list. If the list has 0 or 1 elements it should have no effect on the list. • Shift- rearranges the keys of a list by moving to the end of the list all values that are in odd number positions (indexes) and otherwise…
java method : Write a method called prioritizeQueue to give priority for vaccination for elderly persons. The method is to be in a class called VaccinationQueue and has two parameters q1 and q2 type ArrayQueue. The q1 and q2 data are of type Integer. Assume that initially q1 is not empty and q2 is empty. The method will insert from q1 those elements towards the beginning of the queue (front) q2 whose data is greater than or equal to 45 and will insert those elements whose data is less than 45 and greater than or equal to 18 towards the end (rear) of q2. Any data item less than 18 of q1 will not be inserted in q2. It returns the number of elements added to q2. Class ArrayQueue and all its methods including iterator are available for use. You can also create temporary queues. You are not allowed to use arrays or any other data structure. Example: Before method call: front rear q1: 14 25 50 70 35 45 19 10 21…
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.
The school cafeteria offers circular and square sandwiches at lunch break, referred to by numbers 0 and 1 respectively. All students stand in a queue. Each student either prefers square or circular sandwiches. The number of sandwiches in the cafeteria is equal to the number of students. You are given two integer arrays students and sandwiches where sandwiches[i] is the type of the ith sandwich in the stack (i = 0 is the top of the stack) and students[j] is the preference of the jth student in the initial queue (j = 0 is the front of the queue). Part 1: Modify the code given and make it more efficient. You can try to implement your own stack or your own Queue. Or you can use the sandwiches array as a stack without making a separate Stack class. Same with the students array. Part 2: After modifying the code, explain how it works, and why it is more efficient than the solution that you started with. (Or, if it turns out that the change you made is not more efficient, try to…
Implement a Queue using a vector or the STD ::queue:: class Note the difference in what it takes to implement using a char[] array vs a vector or the STD ::queue:: class The user will input a string and the program will return the string with each letter in the string duplicated. Displaying correct Queue implementation. Utilize the conventional methods as needed. Sample Execution Please input String: happy Program will produce the output string. Only use the enqueue(), dequeue(), empty(), etc hhaappyy
True or False For each statement below, indicate whether you think it is True or False. provide a description of your answer for partial credit in case you are incorrect. 1) Given a stack implemented as an array, and the following functions performed: Push(A), Push (B), Push(C), Pop(), Push(D), Push(E), Pop(), Push(F) a. The array will be [A][B][D][F] and the “top” of the stack will be at index 3 where [F] is b. The next element that will be removed when Pop is called will be A c. If we Push(G), [G] will be inserted at index 0
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!"
python 8.7 LAB: Writing append and search methods (singly-linked list)Given main.py and a Node class in Node.py, complete the LinkedList class in LinkedList.py by writing the append() and search() methods. The search() method should return the Node whose data value matches a given key, and None if the key is not found. The search() method should also set the position of each Node searched in the LinkedList, starting with 1. Ex: If the input is: 12 23 59 37 923 212the output is: 12 found in list at position 1.If the input is: 12 23 59 37 923 268the output is: 68 not found in list.
Q2: Write the C++ code of queue which is performed multiple task which are given below and performed all task by using Arrays. En-queue values 10, 20, 5 , 50, 40, 60, 45 De-queue values 45, 60, and 40 Sort all values of queue Please create is empty and queue function for telling them queue is empty or full.NOTE: PELEASE SOLVE THE QUESTION PROPERLY AND ACCORDING TO THE REQUIRED THINGS WHICH ARE MENTIONED ABOVE.
Question 9: Draw internal representation of the queue q for each step of the following code: ArrayBoundedQueue<Integer> q = new ArrayBoundedQueue<Integer>(6); q.enqueue(37); q.enqueue(86); q.enqueue(54); q.enqueue(71); q.dequeue(); q.enqueue(97); q.dequeue();
Given the value of queue(Q), execute the given code and answer the questions. Assume that Q iscircular with the size limit of 6. Thanks!!!