If New character set is given, it is "qwertyuiopasdfghjklzxcvbnm." The first character is q, and we will place the letter "a" (for position) at index q during hashing, i.e. (17th). Our new character set after hashing is "kxvmcnophqrszyijadlegwbuft." write a java program to achieve the same for any given string.

If New character set is given, it is "qwertyuiopasdfghjklzxcvbnm." The first character is q, and we will place the letter "a" (for position) at index q during hashing, i.e. (17th). Our new character set after hashing is "kxvmcnophqrszyijadlegwbuft." write a java program to achieve the same for any given string.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

solve in java Integer arrays groceryItemPrices and stockRecords are read from input, containing the prices and stock records of each grocery item. Initialize variable count with 0. For each grocery item, increment count if a grocery item meets both of the following conditions: Price is greater than 20. Stock record is less than 20. Lastly, output count followed by a newline. Ex: For the input: 28 14 21 22 7 9 17 24 18 10 20 26 then the output is: 3 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 import java.util.Scanner; public class CombineArrays { publicstaticvoidmain(String[] args) { Scannerscnr=newScanner(System.in); finalintNUM_VALS=6; int[] groceryItemPrices=newint[NUM_VALS]; int[] stockRecords=newint[NUM_VALS]; inti; intcount; for (i=0; i<NUM_VALS; ++i) { groceryItemPrices[i] =scnr.nextInt(); } for (i=0; i<NUM_VALS; ++i) { stockRecords[i] =scnr.nextInt(); } /* Your code goes here */
Let A={1,2,3...,10}. How many subsets B of A where B = │4│and the smallest element in B is 4? Write a computer program in java or develop an algorithm that lists all subsets according to the part (a). (Please display the all subsets).
Write a program that obtains the executiontime of external sorts for integers of size 6,000,000, 12,000,000, 18,000,000,24,000,000, 30,000,000, and 36,000,000. Your program should print a tablelike this:
Write a Java program that uses ArrayList and Iterator. It should input from user the names and ages of your few friends in a loop and add into ArrayList. Finally, it should use an Iterator to display the data in a proper format. ( Sample run of the program:-) List of my Friends Enter name and age [friend# 0] Khalid Al-shamri 22.5 Do you want to add another friend (y/n)? y Enter name and age [friend# 1] Rahsed Al-anazi 21.1 Do you want to add another friend (y/n)? y Enter name and age [friend# 2] Salem Al-mutairi 23.7 Do you want to add another friend (y/n)? n Here is the data you entered: 0. Khalid Al-shamri,      22.5 1. Rahsed Al-anazi,         21.1 2. Salem Al-mutairi,       23.7
The Problem The Mastermind game board game is a code breaking game with two players. One player (your program) becomes the codemaker, the other the codebreaker. The codemaker (your program) creates a 4 digit secret code which is randomly generated by the supplied code below and the codebreaker tries to guess the 4 digit pattern. import randomsecretCode =[]for i in range (0,4):    n = random.randint(1,9)    secretCode.append(str(n))    print (secretCode) # take this out when you are playing the game for real because it is a secret The secret code pattern generated above will consist of any of the digits 1-9 and can contain multiples of the same digit. Your program should then tells the codebreaker which digits should be in their guess by displaying a sorted list of the digit characters contained in the secret code python list . Use the loopfor digit in sorted(secretCode):    #display each digit on the same line for the player to see; there could be duplicate digits in the secret Prompt…
Exercise 1: Write a program using the java.util.Stack data structure that prompts for an integer and reverses it: 7359 becomes 9537.   Hints:   Think of how base-10 works: A base-10 number is a sum of digit * 100  + digit * 101 + digit * 102, etc., where each digit in your number is that digit times a power of 10.   Using that understanding, you can use modulo and integer arithemetic to get each digit and add it to a stack. Algorithm: Your number % 10 will give you the rightmost number. Example: 7359 % 10 = 9. Put the 9 on the stack. Now substract the 9 from original number: 7359 - 9 = 7350. Now take the 7350/10 to remove the zero. That is 7350 /10 = 735. Repeat the process, that is 735 % 10 = 5, put the 5 on the stack, substract the 5 and divide by 10. 730/10 = 73, use 73 % 10 to get the 3. Keep going, adding digits to the stack until you run out of numbers. When you pop the numbers off your stack, they will come off teh stack reversed. Note…
The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
Python Code Teddy and Tracy love to play a rope-based game. The game is as follows. At first, Tracy writes a long random thread on a white board. Then, each player starting with Teddy takes turns. Each time, the player has to clear the corresponding subtitle in the dictionary. The dictionary contains N words. Indeed, a player who can clear any small bullet unit in his time loses a game, and another player is declared the winner. Note that after deleting a small R-string, the remaining small series is separated, i.e., they cannot erase the word that appears partially to the left of R and slightly to the right of R. Decide who wins the game, assuming both players play very well Input 1 bar 1 foo Output Tracy
Write a code in Java programming You are working in a company, and your new task is creating an encoding algorithm to secure a given data. Given a code, write a method called encode() that takes a String and returns a new String based on the frequency of the characters. All the even-frequency characters should be placed before the odd-frequency characters, and finally, all characters should be sorted in increasing order. Your colleague is sick again, and he cannot finish his task. He gave you an unfinished code like the following: public static String encode(String code) { // MyFunction mf = // TODO return mf.encode(code); } Your job is to complete the implementation of the functional interface MyFunction that encode() method should use to encode the given String code. The MyFunction interface should have the following signature: interface MyFunction { String encode(String code); } Additionally, your algorithm should handle the following cases: 1. If the input String is null, the…
JAVA programming I have to finish the "remove" method which is supposed to remove element e at index ind and returns it. index here is the place where the numbers are placed. space 0,1,2,3. for example, if i run this program, i will get "-13,-3,-1" as the output. so the index (ind) is place 0 is -13, 1 is -3 and the 2nd place or index 2 is -1. so I have to remove a number from whatever index I want to and return it. I want to remove an element (number) from the 2nd spot in the array, that's index (ind) 2, so whatever number is at index 2, i have to remove and return that number. Ill paste the entire code below, but i only have to complete the "remove" method. CODE: package com.mac286.arrays; public class ourArray { //define an array of integers private int[] Ar; //Ar is a reference //declare private int Capacity = 100; private int size = 0; private int Increment = 10; //Default Constructor public ourArray() { Ar = new int[100]; Capacity = 100; size = 0; Increment = 10; }…
Java: Write a program that prompts the user to enter a string and display the maximum consecutive increasingly order substring and the maximum increasingly ordered subsequence of characters. The signatures of the methods are as follows: public static String maxSortedSubstring(String s) public static String maxSortedSubSeq (String s) Analyze the time complexity of both methods in comments Sample Run： Enter a string: WelcomeMaximum consecutive substring is WelMaximum increasingly ordered subsequence of characters is Welo Enter a string: ProgrammingMaximum consecutive substring is PrMaximum increasingly ordered subsequence of characters is amn
in Python Minima in permutations. Write a program that takes an integer n from the command line, generates a random permutation, prints the permutation, and prints the number of left-to-right minima in the permutation (the number of times an element is the smallest seen so far). Then write a program that takes integers m and n from the command line, generates m random permutations of length n, and prints the average number of left-to-right minima in the permutations generated