Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Related questions
Question
JAVA
i will attach images of the ourQueue code and the main
I have to do the following:
*create an ourQueue object, add the following sequence:
*2,-3,4,-6,7,8,-9,-11
*create and ourStack object
*write a program/ one loop that would result into the stack containing all of the negative number at the bottom and the positive numbers at the top.
*outStack at the end should contain the following
*[-3,-6,-9,-11,2,4,7,8]
Transcribed Image Text:package com.mac286.ourQueue;
public interface ourQueue <T>{
//public ourQueue<T>( );
public boolean empty();
public T remove();
public void insert (T e);
public int size();
public String toString();
}
![package com.mac286.ourQueue;
import com.mac286.arraysGeneric.ourArrayGeneric;
public class Tester {
public static void main(String [] args) {
//create a Queue
ourQueue<Integer> Q = new ourArrayGeneric<Integer>();
Q.insert(-3);
Q.insert (-7);
Q.insert(-9);
System.out.println("Q.size: "
System.out.println("Removing:
+ Q.size() +
+ Q. remove() +
+ Q. toString(0);
Q:
Q:
+ Q.toString(0);
}
}
/*create an ourQueue object add the fol lowing sequence:
*2,-3,4,-6,7,8,-9,-11
*create and ourStack object
*write a program/ one loop that would result into the stack containing all of the negative number at the bottom and the positive numbers at the top.
*
*outStack at the end should contain the following
*[-3,-6,-9,-11,2,4,7,8]
*/](https://content.bartleby.com/qna-images/question/33eba9e5-eb7d-44a1-93e3-ed0ee897e17f/96c3964d-f5ea-4419-9551-b4ecd9d329f3/muj8uon_processed.png)
Transcribed Image Text:package com.mac286.ourQueue;
import com.mac286.arraysGeneric.ourArrayGeneric;
public class Tester {
public static void main(String [] args) {
//create a Queue
ourQueue<Integer> Q = new ourArrayGeneric<Integer>();
Q.insert(-3);
Q.insert (-7);
Q.insert(-9);
System.out.println("Q.size: "
System.out.println("Removing:
+ Q.size() +
+ Q. remove() +
+ Q. toString(0);
Q:
Q:
+ Q.toString(0);
}
}
/*create an ourQueue object add the fol lowing sequence:
*2,-3,4,-6,7,8,-9,-11
*create and ourStack object
*write a program/ one loop that would result into the stack containing all of the negative number at the bottom and the positive numbers at the top.
*
*outStack at the end should contain the following
*[-3,-6,-9,-11,2,4,7,8]
*/
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by stepSolved in 4 steps with 2 images
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
- If the elements “A”, “B”, “C” and “D” are placed in a stack and are removed one at a time, in what order will they be removed?arrow_forwardPythong help!arrow_forwardFor any element in keysList with a value greater than 50, print the corresponding value in itemsList, followed by a comma (no spaces). Ex: If the input is: 32 105 101 35 10 20 30 40 the output is: 20,30, 1 #include 2 3 int main(void) { const int SIZE_LIST = 4; int keysList[SIZE_LIST]; int itemsList[SIZE_LIST]; int i; 4 6 7 8 scanf("%d", &keysList[0]); scanf ("%d", &keysList[1]); scanf("%d", &keysList[2]); scanf("%d", &keysList[3]); 10 11 12 13 scanf ("%d", &itemsList[0]); scanf ("%d", &itemsList[1]); scanf("%d", &itemsList[2]); scanf ("%d", &itemsList[3]); 14 15 16 17 18 19 /* Your code goes here */ 20 21 printf("\n"); 22 23 return 0; 24 }arrow_forward
- Java - This project will allow you to compare & contrast different 4 sorting techniques, the last of which will be up to you to select. You will implement the following: Bubble Sort (pair-wise) Bubble Sort (list-wise) [This is the selection sort] Merge Sort Your choice (candidates are the heap, quick, shell, cocktail, bucket, or radix sorts) [These will require independent research) General rules: Structures can be static or dynamic You are not allowed to use built in methods that are direct or indirect requirements for this project – You cannot use ANY built in sorting functions - I/O (System.in/out *) are ok. All compare/swap/move methods must be your own. (You can use string compares) Your program will be sorting names – you need at least 100 unique names (you can use the 50 given in project #3) – read them into the program in a random fashion (i.e. not in any kind of alpha order). *The more names you have, the easier it is to see trends in speed. All sorts will be from…arrow_forwardJava - All objects in a sorted list must be objects that can be compared to each other. True or False?arrow_forwardJava - Elements in a Rangearrow_forward
- I have implemented a stack using arrays. The array is 5 elements long and is called examstack. The contents are: examstack[0] = 36 examstack[1] = 49 examstack[2] = 7 examstack[3] = 67 examstack[4] = 9 If I did a Pop what would be returned? 9 or 36 09 07 O 67 O 9 or 67 36 or 49 O 36 49arrow_forwardIn Javaarrow_forwardCreate two function using java for separate tasks: >Delete the middle element of a stack > Create a separate function that takes an arraylist of integers and put all the odds before the evens int he order they occurarrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON 
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable 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