1. Suppose you have an array arr includs the following integer element (15, 1, 6, 12, -3, 4, 8, 21, 2, 30, -1, 9). Create two stacks inside a class SplitStack. One posStack to store the positive elements from arr and the second negStack to store the negative elements from arr. After that, restore the positive elements from posStack to negStack stack so that all the negatives appear on the bottom of the negStack and all the positives appear on the top. It does not matter what order the numbers appear in as long as all the negatives appear lower in the Stack than all the non-negatives.

1. Suppose you have an array arr includs the following integer element (15, 1, 6, 12, -3, 4, 8, 21, 2, 30, -1, 9). Create two stacks inside a class SplitStack. One posStack to store the positive elements from arr and the second negStack to store the negative elements from arr. After that, restore the positive elements from posStack to negStack stack so that all the negatives appear on the bottom of the negStack and all the positives appear on the top. It does not matter what order the numbers appear in as long as all the negatives appear lower in the Stack than all the non-negatives.

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

Exercise #2 Implement an instance method belonging to the IntArrayBag class that takes two input parameters, oldVal and newVal. The method replaces each oldVal element in the array with newVal. Make sure to include the method header.
You will be given a collection of five cards (representing a player's hand in poker). If your hand contains at least one pair, return an array of two elements: true and the card number of the highest pair (trivial if there only exists a single pair). Else, return false. Examples highestPair(["A", "A", "Q", "Q", "6"]) [true, "A"] highest Pair(["]", "6", "3", "10", "8"]) → false highest Pair(["K", highest Pair(["K", "9", "10", "J", "Q"]) false highest Pair(["3", "5", "5", "5", "5"]) [true, "5"] "7", "3", "9", "3"]) → [true, "3"] ➡ - Notes Hands with three or more of the same card still count as containing a pair (see the last example).
public class PokerAnalysis implements PokerAnalyzer { privateList<Card>cards; privateint[]rankCounts; privateint[]suitCounts; /** * The constructor has been partially implemented for you. cards is the * ArrayList where you'll be adding all the cards you're given. In addition, * there are two arrays. You don't necessarily need to use them, but using them * will be extremely helpful. * * The rankCounts array is of the same length as the number of Ranks. At * position i of the array, keep a count of the number of cards whose * rank.ordinal() equals i. Repeat the same with Suits for suitCounts. For * example, if your Cards are (Clubs 4, Clubs 10, Spades 2), your suitCounts * array would be {2, 0, 0, 1}. * * @param cards * the list of cards to be added */ publicPokerAnalysis(List<Card>cards){ this.cards=newArrayList<Card>(); this.rankCounts=newint[Rank.values().length]; this.suitCounts=newint[Suit.values().length];…
The WalkingBoard class represents a board with a figure standing on position x,y. Each position also has a value associated with it. Initialise the board in two different ways: either make it size×size or use the given dimensions and initial values. About the second way: The rows may not be uniform: they may have differing numbers of columns in them. Don’t simply take the argument array: create its copy in the field. All values are set to BASE_TILE_SCORE, or to the given value if that’s bigger. Operations. getPosition: returns the values of x and y in an array. getTile: returns the value of the of the board position. Let this condition be checked by the helper method isValidPosition. If it is an invalid position, throw an IllegalArgumentException. getTiles: returns the values of all the board positions. Don’t let the field contents be accessed from the caller: create and return an exact copy of the structure. getXStep and getYStep: helper methods, they indicate how far (-1,…
Write a simple java delcaration for an array of double values name a. Do not allocate space for the elements of the array.
For instance, if ABBACCCCAC is written when the game is over, then Andy scored 3 points, Ben scored 2 points, and Charlotte scored 5 points, since there are 3 instances of letter A, 2 instances of letter B, and 5 instances of letter C. So the array [3, 2, 5] should be returned. Examples calculateScores("A") → [1, 0, 0] calculateScores("ABC") → [1, 1, 1] calculateScores ("ABCBACC")→→ [2, 2, 3] (Ctrl)
CODE IN JAVA METHOD TO FIND PAIRS IN AN ARRAY LIST THAT CAN BE MULTIPLIED TOGETHER TO GET PARAMETER Complete the method findPairs which receives an array of integers and an intand returns an ArrayList of instances of Pair (this class is available in theQuestion.java file). You should search the array for any two ints whose product(i.e. when multiplied) is equal to the int parameter. When you find a pair, createan instance of Pair and add it to the ArrayList to be returned. The order of thevariables in the constructor is irrelevant. Do not modify the Pair class. Example 1:Array contains (1, 1, 1, 2, 2, 1, 1, 1)int parameter = 4The ArrayList should contain one instance of Pair with the values (2, 2). Example 2:Array contains (1, 2, 3, 4, 5, 6, 7, 8)int parameter = 12The ArrayList should contain two instances of Pair with the values (2, 6) and(3, 4) Example 3:Array contains (1, 1, 1, 1, 1, 1)int parameter = 3The ArrayList should be empty as there are no ways to compute the product of…
Create java code a class shop. In a shop, we have a list of products saved in an array. A product is characterized by :code, name, expiry_date, price and quantity.
.
let a = {x:0}; for (let i = 0; i < 4; i++) { a = Array.create (2, a); } a = 1; After running the last line of code above, how many objects (including arrays) can be garbage collected?
Given an ArrayList called myAL that contains the following: ["blue", "red", "yellow"] write code to insert the elements "purple" and "orange" that keeps the list in alphabetical order.
Two objects of the same class, say "mylnstance1" and "mylnstance2", are declared in a program as a collection of some type (say an ArrayList). mylnstance1 is initialized but mylnstance2 is not. Then mylnstance1 is copied to mylnstance2. If the copy is performed as a copy constructor copy, two collections exist after the copy but the two collections share all the same elements.