Input: Decimal Number (n) Output: Binary String (bString) equivalent to the Decimal Number n Process: Initialize to an empty string (tempString=""") Initialize bString to an empty string (bString="") Initialize remainder to 0 (remainder = 0) Assign the decimal number to be converted to n (n = decimal number to be converted) While J{ remainder =n%2 n=n/2 tempString = concatenation of tempString and remainder // tempString = tempString.concat(remainder) } tempString = concatenation of tempString and the current value of n // tempString = tempString.concat(n) bString = reverse of tempString // bString = tempString.reverse() return bString

Input: Decimal Number (n) Output: Binary String (bString) equivalent to the Decimal Number n Process: Initialize to an empty string (tempString=""") Initialize bString to an empty string (bString="") Initialize remainder to 0 (remainder = 0) Assign the decimal number to be converted to n (n = decimal number to be converted) While J{ remainder =n%2 n=n/2 tempString = concatenation of tempString and remainder // tempString = tempString.concat(remainder) } tempString = concatenation of tempString and the current value of n // tempString = tempString.concat(n) bString = reverse of tempString // bString = tempString.reverse() return bString

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter7: Characters, Strings, And The Stringbuilder

Section: Chapter Questions

Problem 12RQ

See similar textbooks

Similar questions

Part 3 plase skip it if you dont know the correct answer i need it urgent. Will doewnvote in case of wrong or copied answers from chegg or bartleby! A regular expression (shortened as regex or regexp; also referred to as rational expression) is a sequence of characters that specifies a search pattern. Usually such patterns are used by string-searching algorithms for "find" or "find and replace" operations on strings, or for input validation. using regex create a python program to verify the string having each word start from 'f'? It should return True otherwise false.
Write a function that returns a sorted string using the following header: string sort(string& s) Write a test program that prompts the user to enter a string and displays the new sorted string.
Soundex System Soundex is a system that encodes a word into a letter followed by three digtis that roughly describe how the word sounds. That is, similar sounding words have similar four-character codes. For instance, the words carrot and caret are both coded as C123. A slight variation of the Soundex coding algorithm is as follows: 1. Retain the first letter. 2. For the remaining letters, delete all occurrences of a, e, i, o, u, h, y, and w. 3. Replace the letters that remain with numbers so that (a) b, f, p, and v become 1 (b) c, g, j, k, q, s, x, and z become 2 (c) d and t both become 3 (d) l (that is, el) becomes 4 (e) m and n become 5 (f) r becomes 6 4. If the result contains two adjacent identical digits, eliminate the second of them. 5. Keep only the first four characters of what you have left. If you have fewer than four, then add zeros on the end to make the string have length four. Write a program that carries out the algorithm. See Fig. 6.86.
Soundex System Soundex is a system that encodes a word into a letter followed by three digtis that roughly describe how the word sounds. That is, similar sounding words have similar four-character codes. For instance, the words carrot and caret are both coded as C123. A slight variation of the Soundex coding algorithm is as follows: 1. Retain the first letter. 2. For the remaining letters, delete all occurrences of a, e, i, o, u, h, y, and w. 3. Replace the letters that remain with numbers so that (a) b, f, p, and v become 1 (b) c, g, j, k, q, s, x, and z become 2 (c) d and t both become 3 (d) l (that is, el) becomes 4 (e) m and n become 5 (f) r becomes 6 4. If the result contains two adjacent identical digits, eliminate the second of them. 5. Keep only the first four characters of what you have left. If you have fewer than four, then add zeros on the end to make the string have length four. Write a program that carries out the algorithm. See Fig. 6.86. THIS IS DONE IN VISUAL BASIC
Pointer Arithmetic Write a program that accepts a string and print the reversed form of that string using a pointer ptr. Input: One line Containing String Sample Output: Enter a string: Test tseT
python: a function that counts the number of occurrences of given character in a given string. For example, calling the function with Count(‘j’, ‘just joshin’) returns 2. Note the function counts the character regardless of case.
Vehicle Displacement You are given the velocity of shuttle traveling in a straight line as a series of data points. Write a program that computes the position (displacement) of the shuttle along this line at the time of the final data point The input is given vis standard input in the following format number of data points (0 < 65,535) on its own in • It pairs of data points, each on their own line, consisting of two integers separated by a ungle comma The first number represents the time in seconds (065535), and the second represents velocity in meters per second (4 v). Time is strictly increasing and velocity is constant between data points. The vehicle position and velocity both start at 0 May shuttles can drive in either direction, and in an added bit of realm the data points are speed-limited to about 25 mph in forward and 10 mph in reverse. However, in a reduced bit of realsm, the problem does imply that shuttles can change velocity instantaneously The output should be a single…
sloc) 1. # Given an encoded string, return it's decoded string. # The encoding rule is: k[encoded_string], where the encoded_string# inside the square brackets is being repeated exactly k times.# Note that k is guaranteed to be a positive integer. # You may assume that the input string is always valid; No extra white spaces,# square brackets are well-formed, etc. # Furthermore, you may assume that the original data does not contain any# digits and that digits are only for those repeat numbers, k.# For example, there won't be input like 3a or 2[4]. # Examples: # s = "3[a]2[bc]", return "aaabcbc".# s = "3[a2[c]]", return "accaccacc".# s = "2[abc]3[cd]ef", return "abcabccdcdcdef".
2- The factorial n! of a positive integer n is defined as n! = 1*2*3 . .. * (n-1) * n Where 0! = 1 Write a function to calculate the factorial of a number. Argument: A number n of type unsigned int. Returns: The factorial n! of type long double. Write two versions of the function, where the factorial is • calculated using a loop calculated recursively Test both functions by outputting the factorials of the numbers 0 to 20.
#include <bits/stdc++.h>using namespace std; int main() { string str; cout << "Enter a string: "; getline (cin, str); for(int i=0; i<str.length(); i++){ if(str[i]=='a' || str[i]=='e' || str[i]=='i' || str[i]=='o' || str[i]=='u' || str[i]=='A' || str[i]=='E' || str[i]=='I' || str[i]=='O' || str[i]=='U'){ str[i] = '*'; } } cout<<"Resulting string: "<<str; return 0; WHAT DOES THE FOR LOOP MEAN HERE? PLEASE EXPLAIN for(int i=0; i<str.length(); i++){
i. L1 = {w | all strings start with 1 or ended with 0}
///-In python-/// def get_words_last_1():"""The function should take a list of wordsas an input parameter and return a new list of stringswith the last character removed. (Use string slicing)If the word is empty or has only 1 character, then skip it.""" pass The code should aslo have if __name__ == "__main__" section.