I have to encrypt the strings present in an array to the alphabet after 2 positions
Example:
my name is x
should give an output
oa pcog ku z
Although i have taken an input but unable to increment the char in the array...
Write a program that continuously asks for an alphabet letter, and stops when a non-alphabet letter is entered. Then output the number of upper case letters, lower case letters, and vowels entered ....
View Replies View RelatedI have an encoder that will shift the character of a string X places. Im trying to account for the possibility of the shift being larger than alphabet array length. I've come up with the following, but I still get an ArrayIndexOutOfBounds Error and it never gets past the if statement.
private String encryption(char charArrayElement) {
String [] alphabet = {"A", "B", "C", "D", "E", "F", "G", "H", "I", "J", "K", "L",
"M", "N", "O", "P", "Q", "R", "S", "T", "U", "V", "W", "X", "Y", "Z"};
String str = String.valueOf(charArrayElement);
[Code] ....
how to search array elements present or not using command line argument in java
View Replies View RelatedMy assignment is to write a program that will encrypt and decrypt a sentence entered by a user but the encryption is to be random using an array. Can I convert my sentence(string) from char to int then create a random array to encrypt?
import java.util.Scanner;
import java.util.Random;
/*SentenceEncryptionProgram
*/
public class SentenceEncryption {
string sentence; //sentence entered by user
[Code] ....
I am having an array of strings and i want to find out whether these strings contained in the array contain a similar character or not.For example i am having following strings in the array of string:
aadafbd
dsfgdfbvc
sdfgyub
fhjgbjhjd
my program should provide following result: 3 because i have 3 characters which are similar in all the strings of the array(f,b,d).
So I got an interesting challenge today. I think logically I know what I have to do but I'm at a complete loss as for the actual coding implementation. So I have to develop this method called moveToBack(T entry). What this is meant to do is as implies, move entry to the back of my queue. As simple as it sounds, I know that I cant just move its position that simple. I know that I'll have to essentially remove whatever the desired value is, and then re-add it to the back of the queue. The interesting problem with this, however; is that I know that the FIFO property exists for queue's.
So if the desired entry to be moved is at the 3rd position of 4, I'd have to remove positions 1 and 2 to finally get to 3. But I want it to keep those values still. So I assume what I'll have to do is remove each element of the queue (it'll only be 5 entries max for the purpose of the project) and save it somewhere, then empty the queue and finally add the elements back in while waiting and putting the desired element to the last position.
If that's the case, I'm really curious on how I would do this. I have 4 files, 2 interfaces, the main class that contains the methods and what not for the queue, and a 4th class that'll be used for running test data and testing the methods of the program. Now, I wont add the interfaces code below because those are fine and all methods that need to be added are. I just gotta improve my moveToBack method so that it does what its supposed to. (I know I should have exceptions instead of my very poor else statements, but for this project it's not necessary.)
public abstract class NoDuplicatesQueueWilson<T> implements NoDuplicatesQueueInterfaceWilson<T>
{
private int MAX_QUEUE = 5; // Default array size, small for testing purposes
private T[] items; // The array of the queue.
private int front; // The first entered item of a queue.
private int back; // The last entered item of a queue.
private int count; // A counter.
[Code] ....
I want to create a java program that can be encrypt-decrypt alphabet from characters . Which is the shifting of the alphabet is starting from the the first character to increase 4 and 5 increased in the second character, increasing 6 at the third character, and so on..
Then when one of the characters increasement is more than the ascii code of 'z', that character will decrease from the variable i from the loop. This is the output of the program that i want:
Encryption:
Plain text: "abcz"
Cipher text: "egiz"
Decryption:
Cipher text: "egiz"
Plain text: "abcz"
This is my code for now:
package -;
public class - {
public static void main(String[] args) {
String enkripsi = "abcz".toLowerCase();
String dekripsi = "egiz".toLowerCase();
[Code] ....
What's wrong with my code? It won't work. Specially in the decryption.
I would like to keep the same values of the positions for dividers (SplitPane) even if the width or the height of the window changes. I want to keep the proportion of the differents dividers. After resizing the window, the values of positions are not the sames ! I use this source without success :
stage.widthProperty().addListener(new ChangeListener<Number>() {
@Override public void changed( ObservableValue<? extends Number> observableValue, Number number, Number number2) {
sp.setDividerPositions(0.40f, 0.02f, 0.54f);
[Code] ....
I want to run a function on load only when a particular parameter is not present?
My question is how to detect in JSP that if a particular parameter is present or not?
I want to hyphenate a token which is present in a database. My code:
String str = "The Appointments Committee Cabinet has approved the appointment of Dr. Harry Potter, Chief Economic Adviser, Department of Economic Affairs as Executive Director in the International Monetary Fund.";
String[] words = str.split(" ");
LinkedList<String> linkedlist=new LinkedList<String>();
for (int i = 0; i <= words.length-1; i++) {
linkedlist.add(words[i]);
[Code] ....
I want to implement this algorithm, I will start with "The Appointments", whether it is present in table or not. If yes, then move forward and check for the next token- whether entry for "The Appointments Committee" is present. If yes, then again move forward, and check for "The Appointments Committee Cabinet". If entry is present, then again move forward, if not, then move back, then hyphenate "The-Appointments-Committee". Then again start with "Cabinet"- the same process all over again. I want to use a select query- it should give a smaller result set, so the speed should be much faster.
I have few queries regarding compiling v/s execution of a java program. Suppose I have a Main Class which is referring to class Test which is present in JarA. Now, at compile time, this jar JarA must be present in classpath/buildpath. So, what actually is the action performed by the compiler by referring to this jar?
Now, at runtime also, this jar should be present to execute the Main class. Is this correct? If yes, then what is the action performed by JRE when it refers to this class at runtime? WOn't all the dependencies be resolved at compile time only?
I have a problem with setting multiple splitpane divider positions. In my application there are multiple splitpanes (one inheriting the other). When resizing the scene (e.g. by double-click or mouse drag) the divider position default values (as set in the FXML) are not taken into account and the application therefore incorrectly displays the divider positions. For example, one pane that should be only 100px wide now spans over the half of the application. Its not very nice because one has to readjust the divider positions manually each time after resizing the window. At the same time, I dont want to set maximum values to keep the layout flexible.
I tried to solve this by adjusting the divider positions at a button click event (..setOnAction(new EventHandler<ActionEvent>()...) but when I click it only one splitpane at a time is adjusted. As I have 3 splitpanes I have to click the button 3 times to get all the adjustments. I am not sure whether this is because the click event is consumed after the first adjustment and subsequent repaint of the scene?
A sample code of what I have now would look like this:
adjustButton.setOnAction(new EventHandler<ActionEvent>(){
public void handle(ActionEvent e){
pane1.setDividerPositions(0.9);
pane2.setDividerPositions(0.8);
pane3.setDividerPositions(0,075);
}
});
I am having hard time to grasp the concept of java as i am beginner. according to different sources found in internet, only one class is written in one source file. and all those class can be accessed through the main class.
my question is
1.can we access one class present in one source file, through another class present in another source file [not through the class containing main method]?
2.can we create more than 1 class in same source file?is there special way to do it? i do get error always when i try to do so
3.can multiple classes contain main method? or should there be only single class containing it?
Write a method named secondHalfLetters that accepts a string as its parameter and returns an integer representing how many of letters in the string come from the second half of the alphabet (that is, have values of 'n' through 'z' inclusive). Compare case-insensitively, such that uppercase values of 'N' through 'Z' also count. For example, the call secondHalfLetters("ruminates") should return 5 because the 'r', 'u', 'n', 't', and 's' come from the second half of the alphabet. You may assume that every character in the string is a letter.
View Replies View RelatedI need my code to print out the top three most common IP Addresses in the ArrayList. Right now I have it printing out the top IP Address. I am a little confused as to how to get it to print out three. Every time I change something, It doesn't give me the correct results
My Code:
public class Log_File_Analysis {
private static ArrayList<String> ipAddress = new ArrayList<>();
private static String temp , mostCommon;
static int max = 0;
static int num = 0;
[Code] .....
I am trying to encrypt a string using substitution cipher, the program doesnt show any errors but the output is not what is expected. On encryption it shows random characters whereas i want it to be encrypted by another letter. This is what I have done:
/* Encryption using substitution */
import java.io.*;
public class SSExp1 {
public static void main(String args[]) {
char[] ip= new char[20];
char[] op= new char[20];
char key = '3';
String b;
[Code] .....
I am using AES/CBC/PKCS5Padding algorithm to encrypt/decrypt, it works fine across machines, since i am not using a Facrtory to create the secret . I am using constant SecretKeySpec and iv for the ciphers. This of course heart the security , and doesn't prevent the "man of the middle" problem .
I saw that there are ways with key generation with MAC , and RSA symmetric encryption , but i am not sure how to implement it , and how to it depends on local certificates or files .
I'm trying to calculate the average of grades that a user puts in. Here is my code so far:
public static void main(String[] args) {
Scanner input = new Scanner (System.in);
System.out.println("Please enter an array of grades seperated bt a comma.");
input.nextLine();
String arrayOfGrades = "100,50,100";
String[] grades = arrayOfGrades.split(",");
[Code] .....
I think I'm on the right track, the only big error I'm really getting is the line: sum += grades[i]. It's saying string can not be converted into a double.
I have an encryption utility class. Can i use it some how to encrypt password before submitting form? I heard it can be done using applet.
View Replies View RelatedAn array has objects with String firstName, String lastName, int ID, char examType('M' or 'F'), and int score. Every object has both Midterm('M') and Final('F'). The array has to be sorted by the first Midterm- 'M' and immediately followed by the Final ('F') of the same person (object). Im having troubles with coming up with a proper algorithm with gettin the Final- 'F' after Midterm for the same person.
Java Code: public static Exam[] collateExams(Exam[] exams) {
Exam [] r = new Exam[10];
r = exams;
int[] position = new int[10];
int index = 0;
for(int i = 0; i < exams.length; i++)
[Code]...
I want to encrypt a file and decrypt it on another host. For decryption on another host I guess I need to transfer the cipher... how can this be done? How can you write a Cipher to disk?Or am I completely on a wron track?
The following code is doing it already on one host:
package test;
import java.io.FileInputStream;import java.io.FileOutputStream;import java.io.ObjectInputStream;import java.io.ObjectOutputStream;import java.io.Serializable;import java.security.Provider;
import javax.crypto.*;import javax.crypto.spec.DESKeySpec;
[Code] ....
I am working on an assignment where I initially have to take as input a number. That number will be the number of strings the user is going to type. As they are typed, they are to be sorted alphabetically, then printed. It took me a while to get this far, and I am stuck on how to properly invoke the other methods in main. There has to be at least three methods: main, one to do the sorting, and one to print the new array. I'm quite sure there are mistakes in my code, but this is definitely a challenge for me. Here is the code. Keep in mind that the methods being invoked are blank on purpose.
I am not allowed to use the Arrays, Arraylist or Collection class. This is basically to test my ingenuity and to see how arrays actually work.
import java.util.*;
public class Sort_as_Inserted {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
System.out.print("Enter number of elements to be sorted: ");
String element_number = input.nextLine();
[Code] ....
Every time i try and add a new word to personalDictionary, it only replaces the first index. In my personalAdd method i had tried to add a running count to advance the position it would be saving in but it doesn't seem to be working correctly...
Java Code:
import java.util.Arrays;
import java.util.Scanner;
import java.io.File;
import java.io.PrintWriter;
import java.io.FileNotFoundException;
public class SpellingChecker
[Code] ....
I am trying to update a Rubik's cubes side by adding each of the 9 squares of the Rubik's cube's side.
So for example:
cube.front.squares = cube.fronts.squares[1] + cube.front.square[2] + cube.left.sqaures[8] ... //until 9 sqaures are added, where squares is a String array of size 9. However, when I try doing this I get an error stating "change 'square' to 'String'". I know I can go in an individually change the values like:
cube.front.squares[0] = "whatever"
cube.front.squares[1] = "something else"
but I know there is a better way to do this...
I also just tried to use String[] concat= ArrayUtils.addAll(first, second) but that only takes in two arrays at most according to the API: [URL]...
Now I am trying to print the 4 string randomly from string array..where string contains no of words which are splitted from the file....
View Replies View Related