public class QueueEx public static void method1(ArrayQueue q1, ArrayQueue q2) { Iterator iter1 = q1.iterator(); while (iter1.hasNext()) { int a = iter1.next(); if (a > q2.peek() ) q2.offer(a); } } O • All elements of q1 which are greater than the first element of q1 will be added to q2. O B. All elements of q1 which are greater than the corresponding elements of q2 will be adde OC. All elements of q2 which are greater than the first element of q1 will be added to q1.

public class QueueEx public static void method1(ArrayQueue q1, ArrayQueue q2) { Iterator iter1 = q1.iterator(); while (iter1.hasNext()) { int a = iter1.next(); if (a > q2.peek() ) q2.offer(a); } } O • All elements of q1 which are greater than the first element of q1 will be added to q2. O B. All elements of q1 which are greater than the corresponding elements of q2 will be adde OC. All elements of q2 which are greater than the first element of q1 will be added to q1.

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

IN JAVA Write a method splitQueue () that takes as parameters three queues OriginalQ, OddQ and EvenQ. It should split the OriginalQ into two queues: OddQ that contains only odd numbers of OriginalQ, EvenQ that contains only even numbers of OriginalQ, Keeping OriginalQ unchanged. Test your method.
Given the queue myData 12, 24, 36 (front is 12), what is the result of the following operations? Enqueue(myData, 48)Enqueue(myData, 60)Dequeue(myData)print(Peek(myData))print(IsEmpty(myData))
This is a java question Trace through the state of the queue q in the following code fragment in the main method. You need to show the queue with its values for credit. Queue <Integer> q = new ArrayDeque<Integer>( );q.add(14);q.add(-47);q.offer(75);q.poll( );Integer v = q.peek( );q.add( v - 32);q.remove( );q.add(q.poll( ));System.out.println ("q has " + q);System.out.println ("v has " + v); Final Result for q: v:
Trace through the state of the queue q in the following code fragment in the main method. Queue <Integer> q = new ArrayDeque<Integer>( ); q.add(-6); q.add(23); q.offer(19); q.poll( ); Integer t = q.peek( ); q.add( t + 16); q.remove( ); q.add(q.poll( )); System.out.println ("q has " + q); System.out.println ("t has " + t);
Given a Queue of Integers with the interface: public void enqueue(Integer i) // add to endpublic Integer dequeue() // remove from frontpublic boolean isEmpty() // return true if empty Write a method rearrange(Queue q) that takes a queue of integers as a parameter and rearranges the order of the values so that all of the odd values appear before the even values and that otherwise preserves the original order of the list. For example, if a Queue contained [3, 5, 4, 17, 6, 83, 1, 84, 16, 37] after call rearrange it would contain [ 3, 5, 17, 83, 1, 37, 4, 6, 84, 16] You may use any internal data structures you chose. Hint: I recommend even and odd queues in your method.
Please help me with this! The countOff() method displays the name of each officer removed from the queue, in the order in which they are removed, and displays the name of the officer that goes for help. For example, the output for the queue of defenders above with a count of 4 would appear as:Defenders leaving the queue are: Horace Alsbury, PVT, Kentucky, survivorSimon Arreola, —, —, survivorPeter James Bailey III, PVT, Kentucky, fatalityJohn J. Ballentine, PVT, Pennsylvania, fatalityRobert Allen, PVT, Virginia, fatalityMicajah Autry, PVT, North Carolina, fatalityWilliam Charles M. Baker, CPT, Missouri, fatalityJames L. Allen, PVT, Kentucky, survivorJesse B. Badgett, —, Texas, survivorRichard W. Ballentine, PVT, Scotland, fatalityJosé María Arocha, —, —, survivorJuan Abamillo, SGT, Texas, fatalityIsaac G. Baker, PVT, Arkansas, fatalityJuan A. Badillo, SGT, Texas, fatalityJohn Ballard, —, —, fatalityMiles DeForest Andross, PVT, Vermont, fatality The defender going for help is: George…
write a method that takes two array of customer and what they need and compare them to see if if the what customer wants is present in the front or else send the customer to back. Use queue data structure. Use the following code to complete. import java.util.LinkedList; import java.util.Queue; public class MyQueue{  public int Customer(String[] cust, String[] object) {   Queue<String> queue = new LinkedList<>();   // write your logic here  } example:- cust[] = { P, P, O, O } object[] = { O, P, P, O} since customer P doesn,t want O send it back. loop this to find out how many customers will end up having no object.}
Write a code in Java Write a method called inversePrint. This method gets a head of a linkedlist and Recursively print from the last item to the first one. This is a Recursive method. If Recursive is not used you will get no mark for this question Do not  reverse the linkedlist, only print it in reverse example call: in the main I will call your method like: buffer = myList.head; //This is a buffer to copy the head address inversePrint(buffer); After this, the order for myList should not changed. if myList has: 1->2->3->4->5 your function should print: 5-> 4 -> 3->2->1 but if I check myList the order should still be 1->2->3->4->5 you can assume the LinkedList code for all other operations exist and if you need you can use them Do Not create a new linkedlist in inverse Hint: use recursion does this for you really easy
Modify the given programs by adding two methods in HashTableClass: Find and return the item with the maximum key; Find and return average of the keys in the hash table. import java.util.*;public class hashTableClass { public int tableSize;   Node[] T; public hashTableClass() {   System.out.println("Give the hash table size"); tableSize = Integer.parseInt(new Scanner(System.in).nextLine()); T = new Node[tableSize]; for (int i = 0; i < tableSize; i++) T[i] = null; } public int hashFunction(int Key) {   return Key % tableSize;   } public Node Search(int Key) { int h = hashFunction(Key); Node current = T[h]; while (current != null && current.item != Key) current = current.link; return current; } public void Insert(int newItem) { int h = hashFunction(newItem); Node current = T[h]; Node newNode = new Node(newItem); newNode.link = T[h];…
a Java Program: Write a method called queuesCommonCount to be included in the class queueEx that accepts two parameters q1 and q1 of type ArrayQueue. The method finds the number of elements, which are common in q1 and q2 and returns this number. Class ArrayQueue and all its methods are available for use. Use iterator to access elements of q1. Do not use any iterator to access the elements of q2. You can use a temporary queue in your method. Example: q1: 10 5 12 7 11 15 20 q2: 14 9 7 20 10 12 18 20 The method will return 4 as 4 elements, namely 10, 12, 7 and 20 of q1 and q2 are same. public class QueueEx { public static<E> int queuesCommonCount(ArrayQueue<E> q1, ArrayQueue<E> q2) {
Write a method called inversePrint. This method gets a head of a linkedlist and Recursively print from the last item to the first one. This is a Recursive method. If Recursive is not used you will get no mark for this question Do not reverse the linkedlist, only print it in reverse example call: in the main I will call your method like: buffer = myList.head; //This is a buffer to copy the head address inversePrint(buffer); After this, the order for myList should not changed. if myList has: 1->2->3->4->5 your function should print: 5-> 4 -> 3->2->1 but if I check myList the order should still be 1->2->3->4->5 you can assume the LinkedList code for all other operations exist and if you need you can use them Do Not create a new linkedlist in inverse Hint: use recursion does this for you really easy
Write a class MyArrayQueue that Inherit the ArrayBoundedQueue class show in screen shot and such that all the following methods are implemented in java: public String toString();// Creates and returns a string that correctly represents the current queue. public void remove(int count);// Removes the front count elements from the queue.// Throw QueueUnderflowException with message of "Less than count elements in queue." //if there are less than count elements in the queue. public void reQueue();// Dequeue an element from front, and enqueue the element back to rear of the queue.// Throw QueueUnderflowException with message of "No element in queue."// if there is no element in the queue. public void clear();// Clear entire queue.public void reverse();// Reverse queue content. Hint: you may use LinkedStack ADT.} public int space(); //return how many open spaces does the queue have still available.