Need help with Python question. O123412345QUESTION 30for letter in 'another'[3:6]:print(letter, end=' ')'O ththeotherO ther

According to the Question below the Solution:

Answered: QUESTION 30 for letter in…

Engineering

Computer Science

QUESTION 30 for letter in 'another'[3:6]: print(letter, end=' ')' th Othe other ther

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter7: Input/output Technology

Section: Chapter Questions

Problem 25VE

See similar textbooks

Similar questions

• R7.17Consider the following code that repeats a C++ string three times. string a = "Hello"; string b = a + a + a; Suppose s is a C string, and t is declared as char t[100]; Write the equivalent code for C strings that stores the threefold repetition of s (or as much of it as will fit) into t.
R7.4Explain the mistakes in the following code. Not all lines contain mistakes. Each line depends on the lines preceding it. 1 double a = 1000; 2 double* p = a; 3 int* p = &a; 4 double* q; 5 *q = 2000; 6 int* r = nullptr; 7 *r = 3000;
Dec2Hex function : def decimal_to_hex(number): hex_map = {0: '0', 1: '1', 2: '2', 3: '3', 4: '4', 5: '5', 6: '6', 7: '7', 8: '8', 9: '9', 10: 'A', 11: 'B', 12: 'C', 13: 'D', 14: 'E', 15: 'F'} hex_digits = [] while number > 0: hex_digits.append(hex_map[number % 16]) number //= 16 # Reverse the order of the hex digits and join them to form the final hex string hex_string = ''.join(reversed(hex_digits)) return f'0x{hex_string}' if hex_string else '0x0' Perform a Profile of your Dec2Hex function. Write a function that takes a timedate object as a parameter andcalculates the number of years from NOW to the time in the timedateobject. Add unit-testing code to your Dec2Hex exercise, and then perform aUnit test of the updated Dec2Hex code.
c++ commas.cpp) Write a program that accepts a 7-9) digitinteger and echoes the number with commas between everythree digits from the right. Test it with the numbers1234567, 9)87654321, 20300045, & 10000000. this what I have so far // program inserts comas into number given #include <iostream>using namespace std;int main(){int leadingDigits,middledigits,lastdigits;int tempValue,original;cout<< "please enter a 7-9 digit number.\n";cin>>original;tempValue=original/1000;lastdigits=original%1000; // add code lastdigits=original%100; // corrected codeleadingDigits=tempValue/1000;middledigits=tempValue%1000; // add code middledigits=tempValue%100; // corrected code cout<<"the number with comas is "<<leadingDigits;cout<< ","<<middledigits/1<< "," <<lastdigits/1<<endl; // correct this to print individual digits of middle and last digitsreturn 0;}
Question # 1 Initialize a string of size 40. Write a program that prints all unique alphabets from string. After printing them sort them in ascending order. For example: Hi world I am here to help you. Unique characters are: H, I, W, O, R, L, D, A, M, E, T, P, Y, U. Sorted: A, D, E, H, I , L,M, O, P, R, T, U, W, Y
5: CheckLetter.cpp) Write a program that adds a checkletter to an eight-digit number. The check letter should becomputed as follows: Break the number up into 4 two-digitnumbers. Add the four numbers together. Find theremainder after division by 26. The check letter is the letterin the alphabet that corresponds to the number justcomputed. (A=0, B=1, C=2, etc.) Print the original numberfollowed by the check letter. Use at least one ffunction thatreturns a value when you write this program.
Write your codes in m.file Put a leaf right next to this flower. make additions to this code n=800;r=linspace(0,1,n);theta=linspace(0,2*pi,n);[R,THETA]=ndgrid(r,theta);% define the number of petals we want per cycle. Violets have 5!petalNum=5;x = 1 - (1/2)*((5/4)*(1 - mod(petalNum*THETA, 2*pi)/pi).^2 - 1/4).^2;% update the formula for phi to stop the spiralling effectphi = (pi/2)*exp(-2*pi/(8*pi));y = 1.95653*(R.^2).*(1.27689*R - 1).^2.*sin(phi);R2 = x.*(R.*sin(phi) + y.*cos(phi));X=R2.*sin(THETA);Y=R2.*cos(THETA);Z=x.*(R.*cos(phi)-y.*sin(phi));% color code for blueviolet RGB 138,43,226% Indigo rgb value (75,0,130)mapSize=20;blue_map=linspace(138,75,mapSize)';blue_map(:,2)=linspace(43,0,mapSize)';blue_map(:,3)=linspace(226,130,mapSize)';% and a pretty bit in the middlegold_map=[255 215 0; 250 210 0];% combine to form a full flower mapviolet_map=[gold_map; blue_map];% Now lets plot it and try and pick an attractive anglesurf(X,Y,Z,'LineStyle','none')colormap(violet_map/255)view([-12.700…
Print a line of num characters that are made up of balanced curly braces or square brackets with either "*" or "++" in the center. num is a positive integer the desired pattern is displayed on cout no iteration is allowed on this function, but you can print multiple characters together (at one time). Do not add a linefeed. Examples: num pattern // 1 * // 2 ++ // 3 [*] // 4 {++} // 5 [[*]] // 6 {{++}} // 7 [[[*]]] void printPattern2(size_t num){}
C++ only. Do not copy. Correct code will upvoted else downvote. You are given a string s of length n. Each character is both of the primary k lowercase Latin letters or a question mark. You are asked to supplant each inquiry mark with one of the primary k lowercase Latin letters so that the accompanying worth is augmented. Let fi be the most extreme length substring of string s, which comprises altogether of the I-th Latin letter. A substring of a string is a bordering aftereffect of that string. Assuming the I-th letter doesn't show up in a string, fi is equivalent to 0. The worth of a string s is the base worth among fi for all I from 1 to k. What is the most extreme worth the string can have? Input : The primary line contains two integers n and k (1≤n≤2⋅105; 1≤k≤17) — the length of the string and the number of first Latin letters utilized.The subsequent line contains a string s, comprising of n characters. Each character is both of the principal k lowercase Latin letters or…
PLEASE CODE IN PYTHON Crypto Columns The columnar encryption scheme scrambles the letters in a message (or plaintext) using a keyword as illustrated in the following example: Suppose BATBOY is the keyword and our message is MEET ME BY THE OLD OAK TREE. Since the keyword has 6 letters, we write the message (ignoring spacing and punctuation) in a grid with 6 columns, padding with random extra letters as needed: MEETME BYTHEO LDOAKT REENTH Here, we've padded the message with NTH. Now the message is printed out by columns, but the columns are printed in the order determined by the letters in the keyword. Since A is the letter of the keyword that comes first in the alphabet, column 2 is printed first. The next letter, B, occurs twice. In the case of a tie like this we print the columns leftmost first, so we print column 1, then column 4. This continues, printing the remaining columns in order 5, 3 and finally 6. So, the order the columns of the grid are printed would be 2, 1, 4, 5, 3, 6, in…
Caesars Cypher in C programming language How do you program an encryption and decryption for a Caesars Cypher that covers all the possible ASCII characters? In this there should be a shift over K = 5 but the example below is K = 3. This should result in actual character and not the control ASCII represenations. For example: >>> $ encrypt(I have a key)N%mf{j%f%pj~>>> $ encrypt(see me at 3)xjj%rj%fy%8>>> $ decrpyt(|jfw%ns%gqzj)wear in blue Assume that the text parsing method has been succesful and it's the encryption/decryption of the char array that needs to be factored. Formula Encryption -> C = E(k, P) = (P + k) (mod 26) Decryption -> P = D(k, C) = (C - k) (mod 26) Where k = 5
File CountLetters.java contains a program that reads a word from the user and prints the number ofoccurrences of each letter in the word. In reviewing the code, note that the word is converted to allupper case first, then each letter is translated to a number in the range 0.25 (by subtracting 'A' ordecimal 65) for use as an index. See Appendix C for the Unicode character set.1. Run CountLetters and enter a phrase, that is, more than one word with spaces or otherpunctuation in between. It should throw an ArrayIndexOutOfBoundsException, because anon-letter will generate an index that is not between 0 and 25. It might be desirable to allownon-letter characters, but not count them. Of course, you could explicitly test the value of thecharacter to see if it is between 'A' and 'Z'. However, an alternative is to go ahead and use thetranslated character as an index and catch an ArrayIndexOutOfBoundsException if itoccurs. Since don't want to do anything when a non-letter occurs, the handler…