Write the function printJAVA that takes an integer n3 (n is equal or greater than 0) and returns a string with the integers 0 through n3, inclusive, except that every power of 2 is replaced by JAVA. Sample Inputs Expected Outputs n3=3 OJAVAJAVA3 n3=7 OJAVAJAVA3 JAVA567 n3-10 OJAVAJAVA3JAVA567JAVA910 n3=1 OJAVA

Write the function printJAVA that takes an integer n3 (n is equal or greater than 0) and returns a string with the integers 0 through n3, inclusive, except that every power of 2 is replaced by JAVA. Sample Inputs Expected Outputs n3=3 OJAVAJAVA3 n3=7 OJAVAJAVA3 JAVA567 n3-10 OJAVAJAVA3JAVA567JAVA910 n3=1 OJAVA

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter5: Repetition Statements

Section5.5: A Closer Look: Loop Programming Techniques

Problem 12E: (Program) Write a program that tests the effectiveness of the rand() library function. Start by...

See similar textbooks

Similar questions

Write a Java function that counts the number of 'x's in the string. Any 'x' that is followed by another 'x' should count double (e.g. "axxbxc" -> 4) /** * Count the number of 'x's in the string. Any 'x' that is followed by * another 'x' should count double (e.g. "axxbxc" -> 4) * * @param x a string. * @return the count of x's. */ public static int countXWithDubs(String s){ return -1; }
Write the code in python to define a function has_repeat(mystr), which takes a string parameter and returns a boolean result. - If mystr has a character that is repeated (count is more than 1 for that character), return True - Otherwise, return False Hint: You can solve this problem by iterating over the characters in mystr and comparing each character's count with 1. For example: Test Result print(has_repeat("Happy")) True print(has_repeat("sad")) False print(has_repeat("salmons")) True print(has_repeat("Trouts")) False
Write a program in Python with a function decimalToBinary(n) that converts a positive decimal integer n to a string representing the corresponding binary number. Do the conversion by repeatedly dividing the number n by 2 using integer division, keeping track of the remainders, until the number is reduced to 0. The remainders written in reverse order form the binary number string.
Write a generator function named count_seq that doesn't require any arguments and generates a sequence that starts like this: 2, 12, 1112, 3112, 132112, 1113122112, 311311222112, 13211321322112, ...To get a term of the sequence, count how many there are of each digit (in a row) in the **previous** term. For example, the first term is "one 2", which gives us the second term "12". That term is "one 1" followed by "one 2", which gives us the third term "1112". That term is "three 1" followed by "one 2", or 3112. Etc.Your generator function won't just go up to some limit - it will keep going indefinitely. It may need to treat the first one or two terms as special cases, which is fine. It should yield the terms of the sequence as **strings**, rather than numeric values, for example "1112" instead of 1112.
Write a program in Python with a function biggestBuried(s), which the parameter s is a string, and the function returns the largest integer buried in the string. If there is no integer inside the string, then return 0. For example, biggestBuried('abcd51kkk3kk19ghi') would return 51, and biggestBuried('kkk32abce@@-33bb14zzz') would return 33, since the '-' character is treated like any other non digit. print(biggestBuried('abcd51kkk3kk19ghi')) answer should be 51 print(biggestBuried('kkk32abce@@-33bb14zzz')) answer should be 33 print(biggestBuried('this15isast22ring-55')) answer should be 55
Code in Python Write a function, print_integers_less_than(n), which takes an integer parameter n and prints each integer k which is at least 0 and is less than n, in ascending order. Hint: use a simple for loop. For example: Test Result print_integers_less_than(2) 0 1 print_integers_less_than(5) 0 1 2 3 4 print_integers_less_than(-3)
Implement a function that checks whether a given string is a palindrome or not. A palindrome is a word, phrase, number, or other sequence of characters that reads the same forward and backward, disregarding any spaces, punctuation, or capitalization. Write a function named isPalindrome that takes a string as input and returns True if it is a palindrome, and False otherwise. Example: Input: "racecar" Output: True Input: "hello" Output: False Input: "A man, a plan, a canal: Panama" Output: True Write the isPalindrome function that solves this problem efficiently.
Implement function rotate that takes a string argument s and an integer argument n, and rotates the string s to the left by n times. For example, the code char s[] = "systems"; rotate(s, 3); will change s into "temssys", while the code char t[] = "abcd"; rotate(t, 1); will change t into "bcda" void rotate(char *t, int f)
Implement function rotate that takes a string argument s and an integer argument n, and rotates the string s to the left by n times. For example, the code char s[] = "systems"; rotate(s, 3); will change s into "temssys", while the code char t[] = "abcd"; rotate(t, 1); will change t into "bcda". void rotate(char *w, int j)
Write a program that does two string functions: capitalize the first word of a phrase, and reverse the letters of words in odd positions within the phrase. For this program it is acceptable to let punctuation be part of the word. Write a capitalizeWords() and a reverseOddWords() method and call them in a test program. Make certain to properly handle empty phrases, phrases with one and two words, and phrases with greater than two words. For example, if the original phrase were: Learning Java is fun! Java is powerful and easy to use The capitalized version would be: Learning Java Is Fun! Java Is Powerful And Easy To Use And with reversed odd words would be: gninraeL Java sI Fun! avaJ Is lufrewoP And ysaE To esU
d. Write a function Encode as follows:• // Return M^e mod PQ• int Encode (int M, int e, int PQ); e. Write a function Decode as follows:• //Return C^d mod PQ• int Decode (int C, int d, int PQ); f. Verify that RSA algorithm works, i.e.,• int M;• /* M is an integer that is smaller than PQ */• cout <<"Enter an integer that is smaller than"<< PQ;• cin <<M;•• C=Encode (M, e, PQ);• M1=Decode (C, d, PQ);• assert (M==M1); //Note: include assert.h header file to use this//macro/function. c++
(Program) Write a program that tests the effectiveness of the rand() library function. Start by initializing 10 counters, such as zerocount, onecount, twocount, and so forth, to 0. Then generate a large number of pseudorandom integers between 0 and 9. Each time 0 occurs, increment zerocount; when 1 occurs, increment onecount; and so on. Finally, display the number of 0s, 1s, 2s, and so on that occurred and the percentage of time they occurred.