Counting the number of 1 bits in a bit string s can be accomplished in Java by first initializing an integer counter n to 0. Next, we implement a loop which iterates over each character c of s and when c is '1' we add 1 to n. When c is '0' we do nothing. Here is the implementation of that algorithm: private int countOnes(String s) { int n = 0; for (int i = 0; i < s.length(); ++i) { if (s.charAt(i) == '1') { ++n; } } return n; This problem is also amenable to being solved using a recursive method rather than an iterative method (one that employs a loop). Your job is to select the correct pieces of code from those available and arrange them in proper order to implement a recursive method with the same method signature. private int countOnes(String s) { [LINE1] [LINE2] [LINE3] [LINE4] [LINE5] [LINE6] [LINE7] [LINE8] [LINE9]

Counting the number of 1 bits in a bit string s can be accomplished in Java by first initializing an integer counter n to 0. Next, we implement a loop which iterates over each character c of s and when c is '1' we add 1 to n. When c is '0' we do nothing. Here is the implementation of that algorithm: private int countOnes(String s) { int n = 0; for (int i = 0; i < s.length(); ++i) { if (s.charAt(i) == '1') { ++n; } } return n; This problem is also amenable to being solved using a recursive method rather than an iterative method (one that employs a loop). Your job is to select the correct pieces of code from those available and arrange them in proper order to implement a recursive method with the same method signature. private int countOnes(String s) { [LINE1] [LINE2] [LINE3] [LINE4] [LINE5] [LINE6] [LINE7] [LINE8] [LINE9]

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

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 please, Write a program that reads a list of words. Then, the program outputs those words and their frequencies. The input begins with an integer indicating the number of words that follow. Assume that the list will always contain less than 20 words. Ex: If the input is: 5 hey hi Mark hi mark the output is: hey 1 hi 2 Mark 1 hi 2 mark 1 Hint: Use two arrays, one for the strings, another for the frequencies. Your program must define and call a method:public static int getFrequencyOfWord(String[] wordsList, int listSize, String currWord) Note: This is a lab from a previous chapter that now requires the use of a method.
Write a java program with a method that reverses a string The method must accept one parameter of type String (string to reverse), and returns every second element from the end to the beginning. For example: String: thisisstringResult is: g i t s s h
Solve in java Find the index of a string within a hex encoded string. You will be given a string which needs to be found in another string which has previously been translated into hex. You will need to return the first index of the needle within the hex encoded string. Examples firstIndex("68 65 6c 6c 6f 20 77 6f 72 6c 64", "world") → 6 firstIndex("47 6f 6f 64 62 79 65 20 77 6f 72 6c 64", "world") ➡8
Write a program in Java that reads an array of strings. Program should output the shortest string from the array.
Write a static recursive method in Java called mrecursiv that displays all of the permutations of the charactersin a string passed to the method as its argument. For example, the character sequence abc has thefollowing permutations: acb, bac, bca, cab, cba. Then Write a static method called getInput that get aninput string from the user and passed it to the mrecursiv method written above in a method call.
write a java program (method) to store all arrangments(permuations) of a given string in an array. note: Here it has to be mentioned that the permutations can also be of shorter length than the list of letters and that no letter is to be repeated. For example, if the initial list of letters is "STOP", then "TOP" and "TOPS" are both valid permutations, but "STOPS" isn't.
Write a program in java that prompts the user to enter an inte- ger m and find the smallest integer n such that m * n is a perfect square. (Hint: Store all smallest factors of m into an array list. n is the product of the factors that appear an odd number of times in the array list. For example, consider m = 90, store the factors 2, 3, 3, and 5 in an array list. 2 and 5 appear an odd number of times in the array list. Thus, n is 10.)
System.out.println (x); for (int i - 0; i < x.length System.out.println (x); for (int i = 1; i < x.lengh; i++) System.out.println (x[i]); for (int i -0; i < x.length; i++) System.out.println (x[i]); None of the above 3. int [] x new int[6]; To print all array elements we use: a. b. 1; i++) C. d. e.
Write Java program that reads array of integers. Calculate the sum of all integers that cointain at least one digit 4. Write Java program that read array of strings. Print all strings that contain at least three characters 's'.
FOR JAVA Write a Java method that takes two 2 dimensional int arrays (a and b) and a 2 dimensional boolean array (c) where all three arrays have the same size. Your method should return an array (result) such that, if a partic- ular element in c is true, then the corresponding (same indexed) element in result must be the multiplication of the the corresponding elements of a and b. If the element in c is false, then the the corresponding element in result must be the negative of multiplication of the the corresponding element in a and b. For example ifa = {{1,2,3},{4,5}},b = {{1,2,1},{0,2}} andc = {{true,false,true},{false,true}}, then the result should be result={{1, -4, 3}{0, 10}}.
In Java Write a program that reads a list of words. Then, the program outputs those words and their frequencies. The input begins with an integer indicating the number of words that follow. Assume that the list will always contain less than 20 words. Ex: If the input is: 5 hey hi Mark hi mark the output is: hey 1 hi 2 Mark 1 hi 2 mark 1 Hint: Use two arrays, one for the strings, another for the frequencies. Your program must define and call a method:public static int getFrequencyOfWord(String[] wordsList, int listSize, String currWord) import java.util.Scanner; public class LabProgram { /* Define your method here */ public static void main(String[] args) {/* Type your code here. */}}