WSP 2: Mix-up ink: Strategy 2Start with three sorted bottles. In the strategy the idea is to loadthree bottles with uniform colour and then move ink around for anumber of moves until the bottles are mixed up.Advantage: Result is always solvable since the bottles arecreated in a reversed-gamestrategy.Disadvantage: It is hard to develop an algorithm which will reachthe bottoms of the bottles. We tried this by moving on itemfrom every bottle in rounds. But it still took more than 100moves to obtain a good mix in the bottles. WSP 2: Implement any strategy• You need to extend your WaterSort program to implement oneof these strategies. It is a good idea to play around with both –please use Random numbers in both cases.Important: To add ink to a bottle (strategy 1) or to move ink fromone bottle to another (strategy 2) or you need to use the stackoperators.• You need to ensure that you are not spilling ink! (now youunderstand why you needed the getSize()) method in Part 1.• You only need to submit one of the two strategies. Your programshould have output of 5 scrambled bottles.

import java.util.Scanner; class MyArrayList<E> { private int size; // Number of elements in…

WSP 2: Mix-up ink: Strategy 2 Start with three sorted bottles. In the strategy the idea is to load three bottles with uniform colour and then move ink around for a number of moves until the bottles are mixed up. Advantage: Result is always solvable since the bottles are created in a reversed-game strategy. Disadvantage: It is hard to develop an algorithm which will reach the bottoms of the bottles. We tried this by moving on item 100

WSP 2: Mix-up ink: Strategy 2 Start with three sorted bottles. In the strategy the idea is to load three bottles with uniform colour and then move ink around for a number of moves until the bottles are mixed up. Advantage: Result is always solvable since the bottles are created in a reversed-game strategy. Disadvantage: It is hard to develop an algorithm which will reach the bottoms of the bottles. We tried this by moving on item 100

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

Task An ATM only has 100, 50 and 20 dollar bills (USD) available to be dispensed. Given an amount between 40 and 10000 dollars (inclusive) and assuming that the ATM wants to use as few bills as possible, determinate the minimal number of 100, 50 and 20 dollar bills the ATM needs to dispense (in that order). Here is the specification for the withdraw method you'll complete: withdraw(amount) Parameters amount: Integer - Amount of money to withdraw. Assume that the amount is always divisible into 100, 50 and 20 bills. Return Value Array (of Integers) - An array of 3 integers representing the number of 100, 50 and 20 dollar bills needed to complete the withdraw (in that order). Constraints 40 ≤ amount ≤ 1000 Can you please help me I will rate! Code is in Python 3.7
Imagine if the survey contained two sheets in the same book. Perhaps sheet 1 isshoes and sheet 2 is dresses.The work now doubles.What about more than two sheets?You get the picture. This needs some sort of automation.Write ALGORITHM FOR MERGING SHEETS
Write tests and implement
Implement the Board class. Make sure to read through those comments so that you know what is required. /** * Determines if the board is solved * * @return {@true} if the board is solved and {@code false} otherwise. */ public boolean correct() { return false; }
Solution should be avaialble in java
tep: A child is running up a staircase with n steps and can hop either 1 step, 2 steps, or 3steps at a time. Implement a method to count how many possible ways the child can run up thestairs.
Can you please give me a code that runs properly this time Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'.A region is captured by flipping all 'O's into 'X's in that surrounded region.For example, for the following board,X X X XX O O XX X O XX O X XAfter capturing all regions, the board becomesX X X XX X X XX X X XX O X XThe algorithm should take an input file, named “input.txt”, and output the resulting board in the console.Sample input.txt6X X X X X OX O X O O XX X O O O XX X X O X XX O X X O OX X X X X XThe first line is a number indicating the size of the board; in the above example, 6 means the board is .Output for in console:X X X X X OX X X X X XX X X X X XX X X X X XX X X X O OX X X X X X
In a square maze, we can have multiple steps from ‘s’ to reach ‘e’ with one place that can onlybe visited once. Example: Input Output 3 s.. ..# .e# 4 These are the unique steps: *.. *.. **. *.. **. .*. **. .*. .*. **. **. **. 4 .s.. .#.# #e.# .... 2 These are the unique steps: .**. ..*. .**. .**. .**. ..*. .**. .... The problem:➢ Input: an integer followed by the maze.➢ Output: total number of unique steps. (no need to print the unique steps)➢ Task: Design an code in C to print the total number of unique steps using a backtracking algorithm.
Implement a “To Do” list. Tasks have a priority between 1 and 9, and a description (which you can come up with on your own, say, “wash dishes”). The program is going to prompt the user to enter the tasks by running the method add_priority_description, the program adds a new task and prints the current list with priority 1 tasks on the top, and priority 9 tasks at the bottom. The program will continue to ask the user if they want to add another tasks, and repeat the add_priority_description method, or enters Q to run the quit method to quit the program. Sample output (not limited to) 1. Study for the final 1. Take the final 2. Watch Justice League with friends 3. Play ball 9. Wash Dishes 9. Clean room. There is a possibility of two tasks having the same priority. If so, the last task that was entered gets to be printed first. Use HEAP in your solution.
Question: Update Bresenham’s line (JAVA) method such that you can scale the line before drawing it. Normally, you pass two points and a Graphics’ object to draw line using Bresenham’s algorithm. Now you’ll add scaling factors in arguments for scaling as shown below. public void drawBresenhamLine(Point p1, Point p2, double Sx, double Sy, Graphics g) { //Write your code here } Note: If you use scaling method, then also write Scale method in solution.