any method or common algorithm to change a number taken from input to the word for that number? Such as input being "4", output would be "four", at least up to 59 as the larger program I'm trying to make involves time
One of the random number generators in Java extract the higher-order bits of the random number in order to get a longer period.
I'm not sure if I understand how this is done. Suppose that the random number r = 0000 1100 1000 1101. If we extract the 16 most significant bits from r; is the new number r = 0000 1100 or r = 0000 1100 0000 0000?
The method public static int steps(int posts, int stride) calculates how many strides can be taken to get back to posts. Let's say if the method is (12, 4), it takes only three steps. Now let's say the method has parameters (12,5), so it should be (5, 10, 3, 8, 1, 6, 11, 4, 9, 2, 7, 12). My method works for such examplse as (12, 4) or (12,3) or (6,2)... but how can I figure out (12,5)?
Java Code:
public static int steps(int posts, int stride) { int countSteps = 0; int result = 0; do { result += stride;
String temp = "hi this sf hello is new what is this"; String[] cmd = temp.split("s"); int num = cmd.length; System.out.println("number of words are: "+num); mh_sh_highlight_all('java');
However, when i get the input from user , i didnt get the expected result:
Java Code:
System.out.println("Enter the input string to count the words: "); String[] cmd = new Scanner(System.in).next().trim().split("s"); int num = cmd.length; System.out.println("number of words are: "+num); mh_sh_highlight_all('java');
I need to modify modules used in the book that run a bubble sort, selection sort, and insertion sort on an integer array such that each module keeps a count of the number of swaps it makes.
How do I code for this?
Then we have to design an application that uses 3 identical arrays of at least 20 integers. That calls each module on a different array, and display the number swaps made by each algorithm.
How would I program a counter that will return the total number of search, failed searches and correct searches. The second thing is how can a return the price of the search methods with out calling for it specifically. Here is my current code.
package stu.paston.program7; import java.util.Scanner; public class MainClass { public static void main(String[] args) { InventoryClass productData= new InventoryClass();
I have to write a program that will read a picture and then print out the number of blocks inside it.
I have to read the picture as a binary matrix of the size r - c (number of rows times number of columns). The blocks are groups of one or more adjacent elements with the value 1.
- Blocks are built exclusively of elements with value 1 - Each element with value 1 is a part of some block - Adjacent elements with value 1 belong to the same molecule.
We only take into account the horizontal and vertical adjacency but not diagonal.
INPUT:
In the first line of the input we have the integers r and c, separated with one space. Then we have the r lines, where each contains s 0's and 1's. The numbers inside the individual lines are NOT separated by spaces.
The OUTPUT only print the number of blocks in the picture.
import java.util.Scanner; class Blocks{ public static void main(String[] args){ Scanner sc=new Scanner(System.in); char ch[][]; int rowNum=sc.nextInt(); int columnNum=sc.nextInt();
My code then is supposed to read it in and store it as an Array of singly linked lists. I am having trouble with my code, I am only getting outputs where it is only storing the first line of the txt matrixs like so:
I want to practice chopping my code into small objects so they can be easily reused and replaced/maintained etc. So I'm looking to separate this small program into three separate files, one main with the main function to make a window, one to make the DrawPanel for "animating", and one for the controlling with the KeyListener.
import javax.swing.*; //Graphics API import java.awt.*; //BorderLayout API import java.awt.event.KeyEvent; import java.awt.event.KeyListener; public class KeyAnimate { int x = 0; //X Coords int y = 0; //Y Coords int z = 0; //Z to Keep going forever
in Operator/Literals, it says "There is no literal representation for binary numbers in C, C++, or Java." seems "0b11001" could reprensent binary numbers?
i am relatively new to Swing. learning swing concepts for my new project. how can we construct a Hierarchical JTable structure using Swing. Something like a Master-Child table structure with a drill down from Master table to Child Table. Something similar to the image Telerik.
I have seen some examples like TreeTable. But that is not what i am looking for. The Column headings for Master table and child table might differ.
import java.util.Random; /** * A very basic Dice that can be rolled and represent int values */
public class Dice{ private Random rand; public Dice(){ rand=new Random(); } /**simulates rolling the dice*/
[Code] ....
Why the Random rand is initiated at the Constructor and not at roll? Like the code works for both but I remember our teacher telling us something about one uses more memory than the other.
for (int w=0;w<bi.getWidth();w++) { for (int h=0;h<bi.getHeight();h++) { int color = bi.getRGB(w, h); color = color << 5; bi.setRGB(w, h, color); } }
I am using a solid green image so
11111111000000001111111100000000
I just wanted to see how it looked so bumped it over 5 places (obviously changing the color). To my surprise, there was no added transparency. I mean moving it to the left would make the alpha:
11100000
I am thinking that setRGB() doesn't effect alpha. Is this accurate?Tested it and in fact setRGB has no effect on the alpha bits. So now the question is how can I gain access to them. I am going to look into the writable Raster API. Perhaps, I can also use a modified awt to access directly OS data.
I am trying to understand what ivor is saying about the and, and or operators and the mask. If I understand it correctly the & operator prevents you from changing a bit that is one when a mask is involved and changes all others to 0 and the | operator forces a bit to 1 when the mask is 1.
My question is when would i need to actually use the & ,| operators ?when will i need to manipulate the bits in a variable?
Java Code: String s = "111100100111011011000010110011101"; mh_sh_highlight_all('java');
I am trying to convert that to bits/bytes.
I need to make that into a series of bits with the same exact values..."1" = a 1 bit, and "0" = a 0 bit.
Remarkably, I haven't been able to find much on this sort of conversion - possibly I am just not searching with the right keywords? As typically, stackexchange or other parts of the web have the same question that I have, asked (and answered) by many others.
How do I go about doing this?
Furthermore, how would I go about saving this to a file - and are there already good "kinds" of files to save this into. If not, how do I go about making my "own" type of "file."
CONTEXT:
I've written a compression system. To keep things simple, I've been using a string to hold the 1s and 0s, so that debugging is simpler, and overall, everything is easier to write. Now, however, my algorithm is finished - and I'm moving on to create a GUI and a working system. This is the last step that I need for the non-GUI stuff (which I'm writing through javafx by the way - is this the right thing to use? I've been told that that is where people are moving towards. Away from swing).
I have to divide a text file into blocks of 128 bits. I think i must use the ByteArrayInputStream and ByteArrayOutputStream classes. is there any website showing how to user these two ByteArrayInputStream and ByteArrayOutputStream classes in detail. or it would be much better if you could show me a portion of the code.
I am designing a program in-order convert Binary to Decimal values with added features:
Rejecting binary values longer than 32 bits
Prompting the user to make multiple entries after completing the binary to decimal conversion of their first entry. I was trying to code this in Nested For Loops, but I don't know if I've really done that.
Here is what i have so far.
public class BinaryToDecimal { public static void main(String[] args){ Scanner scan = new Scanner(System.in); String binary; int decimal=0b10, i, rem; boolean isBinary = true;
I'm supposed to write a GUI application letting the user enter a file on the text field and display its hex representation in a text area and vice versa.
Here's my code:
/* * To change this license header, choose License Headers in Project Properties. * To change this template file, choose Tools | Templates * and open the template in the editor. */ package hexconvertor; import java.util.*; import java.io.*; public class HexConvertor extends javax.swing.JFrame {
I am trying to write a program that will generate a QR Code from an input text and also display some information about the input/output bits. So far I have created the frame and what to do next. And I'm not sure if I am on the right track since my level of programming is not that great. By the way, I am using zxing libraries from GitHub. I know, there are plenty of generators online for the QR Code, but that is not what I am looking for. As you can see on the attached image, I am more interested in the efficiency of encoding 2D data. Also, I noticed that almost all the online projects regarding 2D codes are for Android. Which is not very useful.
I have written a piece of code that takes a desired input file and calculates things such as words, characters, digits etc. I would like to make the program look better by counting palindromes.what I could add to my current code to count palindromes.My current code for counting other things that I would like to add plaindromes to.
// Loops through the file calculating the outcome. while (input.hasNextLine()) { lines++; String line = input.nextLine(); chars += line.length();
I'm having trouble creating a highly efficient algorithm for counting within a custom scale. This problem applies to futures trading, specifically treasuries contracts.
One specific treasury contract has 32 units before rolling over to the next whole number. So, the price scale looks something like this ...
If I pick a number (price) at random, let's say 1 28, and I want to add 8 units to that value, I should end up with 2 4. I can do this using brute force, calculating remainders, etc, etc....