Write a C++ program that reads user's choice as single character then do the following: • If the user entered (A), your program should read a long positive number, and display the positive difference between the first and last digits (the positive difference between the most right digit and the most left digit) i.e. If the number is 5635634, the program should display 1 (5-4=1). If the number is 3635637, the program should display 4 (7-3=4). • If the user entered (B), your program should read 9 integer numbers, then find and print the sum of the odd numbers. • If the user entered (C), your program should read two integer numbers, add three to each of them, swap their values, and print them after swapping. • If the user entered any other character as a choice, then your program should display the following pattern.

Write a C++ program that reads user's choice as single character then do the following: • If the user entered (A), your program should read a long positive number, and display the positive difference between the first and last digits (the positive difference between the most right digit and the most left digit) i.e. If the number is 5635634, the program should display 1 (5-4=1). If the number is 3635637, the program should display 4 (7-3=4). • If the user entered (B), your program should read 9 integer numbers, then find and print the sum of the odd numbers. • If the user entered (C), your program should read two integer numbers, add three to each of them, swap their values, and print them after swapping. • If the user entered any other character as a choice, then your program should display the following pattern.

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter1: Creating Java Programs

Section: Chapter Questions

Problem 19RQ

See similar textbooks

Similar questions

Python please You got one pizza with sausage that has been sliced into a few pieces. The list of sausage count specifies how many slices of sausage are in each piece. You start cutting the pizza into n + 1 pieces since you want to distribute it with your n buddies. Each component is made up of one or more successive portions. You generously choose to eat the portion that contains the fewest overall slices of sausage. Find the most sausage slices you can have overall. Input # of people; list of (#number of sausage) on the cunks for example: Output print the maximum number of sausage you can have. Example: 9;8,1,4,5,7,8,9,10,3,3,4,6,7,8,8,8,4,3,4,9,9,9,4,6,5,7,8 Print: 15
C program: fill out TODO'S IN THE PROGRAM #include <stdlib.h> // EXIT_ codes#include <stdbool.h> // bool#include <stdio.h> // printf, scanf#include <string.h> // strlen, strcmp#include <poll.h> // poll#include <unistd.h> // usleep#include "sysfs_gpio.h" // custom virtual file system gpio library#include "udp.h" // custom udp library#define SERVER_LISTENER_PORT 4096#define DOOR 17#define MOTION 27#define TIMEOUT_SECONDS 25bool isAnyKeyPressed(){struct pollfd pfd;pfd.fd = 1;pfd.events = POLLIN;poll(&pfd, 1, 1);return pfd.revents == POLLIN;}//-----------------------------------------------------------------------------// Main//-----------------------------------------------------------------------------int main(int argc, char* argv[]){char *remoteIp;int remotePort;bool armed = false;bool quit = false;int timeout = TIMEOUT_SECONDS;// Verify arguments are goodbool goodArguments = (argc == 2);if (goodArguments)remoteIp = argv[1];if…
Language: Python i have a txt named "hightemp.txt" I want to sort the rows from highest to lowest in the third column please help me , thanks Here is the content of "hightemp.txt" A AA 41 2013-08-12B BB 40.9 2007-08-16C CC 40.9 2007-08-16D DD 40.8 1933-07-25E EE 40.7 2013-08-10F FF 40.6 1994-08-08G GG 40.6 1994-08-04H HH 40.5 2013-08-10 Q QQ 40 2007-08-16R RR 40 2001-07-24S SS 39.9 2013-08-11T TT 39.9 1997-07-05U UU 39.9 1994-08-08V VV 39.9 1990-07-19W WW 39.9 1978-08-03I II 40.4 2007-08-16J JJ 40.3 2007-08-16K KK 40.3 1998-07-04L LL 40.3 1994-08-05M MM 40.2 2004-07-20N NN 40.2 2001-07-24O OO 40.2 1927-07-22P PP 40.1 1978-08-03X XX 39.9 1942-08-02
Grey code lines (beginging - 10 & 15-End of code) can NOT be edited. New JAVA code must only be added inbetween theses code blocks.
visual studio assembly language. ctt 6. Greatest Common Divisor (GCD)The greatest common divisor (GCD) of two integers is the largest integer that will evenly divide both integers. The GCD algorithm involves integer division in a loop, described by the followingpseudocode:int GCD(int x, int y){ x = abs(x) // absolute value y = abs(y) do { int n = x % y x = y y = n } while (y > 0) return x}Implement this function in assembly language and write a test program that collects two numbers from the user and calls the function, passing it the two values. Display the result on the screen.
Please Use C language. 1. In most personal computers, the largest integer is 32,767 and the largest long integer is 2,147,483,647. Some applications, such as the national debt, may require an unbounded integer. One way to store and manipulate integers of unlimited size is by using a linked list. Each digit is stored in a node of the list. For example, the figure below shows how we could store a five-digit number in a linked list.
Software engineering case study homework (PLAGIARISM WILL BE DETECTED !!!) Please provide an upload link for the file This case study is about a simplified Payphone coin system.1. The minimum price of a communication is 10 ryals.2. After the introduction of the currency, the user has 2 minutes to dial his number (this time iscounted by a time counter).3. The line can be free or busy.4. The Payphone consumes money as soon as the called person picks up and at each time unitgenerated by the counter.5. You can add pieces of money at any time.6. At the time of the hang-up, the balance of the currency introduced (the rest of the money) isreturned. Required work:From this statement, you are asked to:1. Establish the use case diagram of this statement.2. Construct a sequence diagram that describes the nominal scenario of Payphoning use case inthis statement.
python: def dna_slice(strand, first_nucleotides, last_nucleotides): """ Question 3 - Regex You are working with a long strand of DNA. Your task is to find and return the length of the first substrand that begins with the two-letter sequence specified in first_nucleotides and ends with the sequence specified in last_nucleotides. THIS MUST BE DONE IN ONE LINE. Args: strand (str) first_nucleotides (str) last_nucleotides (str) Returns: int strand_1 = 'TATGGGTCGAGCATGT' >>> dna_slice(strand_1, 'AT', 'CG') 8 >>> dna_slice(strand_1, 'GT', 'TG') 10 """ strand_1 = 'TATGGGTCGAGCATGT' pprint(dna_slice(strand_1, 'AT', 'CG')) pprint(dna_slice(strand_1, 'GT', 'TG'))
Internet Technologies Class.HTMLWrite a script that asks for a user's name and age, then prints the user's name and age on the screen over and over until it loops as many times as the user's age. Security Feature: Do not let users named "Raymond" run this program
Python task: Task OverviewYour task is to implement a variation of the classic word game Hangman, which involves playersguessing the letters in a word chosen at random with a finite number of guesses. While there arealternate versions such as category Hangman and Wheel of Fortune, which involve playersguessing idioms, places, names and so on, we will be sticking with the traditional version.If you are unfamiliar with the rules of the game, please read the following before starting:http://en.wikipedia.org/wiki/Hangman_(game). You can also play an online version here. Don’tbe intimidated - You’ll be given some skeleton code to get you started, it's easier than it looks! You will implement a function called main that allows users to play an interactive hangman gameagainst the computer. The computer should pick a word, and players should then try to guess lettersin the word until they win or run out of guesses.Here is the overarching behaviour we expect:1. The program should load a list of…
Need help with Python....please paste indented code here 4. Implement the following to simulate how websites ensure that everyone has a unique username.a) Make a list of five or more usernames called current_users.b) Request an input of username.c) Print a message, Sorry XXX, that name is taken and also display the current user list if the inputusername has already been used. XXX is the input user name.d) Print a message, Great, XXX is still available and also display the updated user list if the username hasnot been used.e) Make sure your comparison is case insensitive. If 'John' has been used, 'JOHN' or ‘john’ should not beaccepted.Example Output 1Enter your user name: TOMSorry TOM, that name is taken.Current users: [‘admin’, ‘tom’, ‘jerry’, ‘Dora’, ‘GEORGE’] Example Output 2 Enter your user name: curiousGeorge Great, curiousGeorge is still available. Updated users: [‘admin’, ‘tom’, ‘jerry’, ‘Dora’, ‘GEORGE’, ‘curiousGeorge’] 5. Implement the following to search a…
Computer Science Write in Javascript please and use high order functions liek map or filter or reduce let obj = [ { mode: "hot" }, { temp: "low" }, { mode: "cold } ] I want to create a function that get object by key such as: myFunc("mode"); returns { mode: "hot" } next call of myFunc("mode") returns { mode: "cold