Answered: 31. Find the sum of all 2-digit…

31. Find the sum of all 2-digit positive integers present in the array given below, and print the sum in the output. [24, 678, -127, 12, 0, 78, -9999, 91, 45, -10] Write your code in C++.

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

C++ PLEASE MATCH OUTPUT IN PICS (Previous answers were incorrect) In this lab, you're going to be working with partially filled arrays that are parallel with each other. That means that the row index in multiple arrays identifies different pieces of data for the same person. This is a simple payroll system that just calculates gross pay given a set of employees, hours worked for the week and hourly rate. Parallel Arrays First, you have to define several arrays in your main program employee names for each employee hourly pay rate for each employee total hours worked for each employee gross pay for each employee You can use a global SIZE of 50 to initialize these arrays Second, you will need a two dimension (2-D) array to record the hours worked each day for an employee. The number of rows for the 2-D array should be the same as the arrays above since each row corresponds to an employee. The number of columns represents days of the week (7 last I looked) Functions Needed In this lab,…
Write C++ code using one dimensional array and for loop to read 4 numbers using cin into an array of size 4. These numbers are 1, -1, 2, 3 After reading these numbers consecutively in the array , your program should provide: How many positive numbers are in the array? (30) What is the average of these positive numbers ? (30) Your results should be displayed using cout. c++ with comments Hint: const int N=4; int arr[N]; int i, count =0; double sum = 0, average=0;
can someone help me with this in C++ Given the following input: Array size (positive integer value) Array elements (positive integer values) Write a program that prints whether the array is a palindrome number. A palindrome number is a number that reads the same backwards and forwards. You must implement your solution following the requirements below: a) Do not use cout to print a message before reading the input from STDIN. b) Read the input in the main function. c) Implement a function to print whether all the elements of the array form a palindrome number. You must use a pointer to an integer variable to implement your function. You cannot use square brackets (array notation) inside the function. You can assume that the input will always be valid. Input Output 5 1 2 3 2 1 Palindrome number 5 1 2 1 4 1 Not a palindrome number
Note: It`s C++
C++ PLEASE HELP MUST MATCH OUTPUT IN PICS In this lab, you're going to be working with partially filled arrays that are parallel with each other. That means that the row index in multiple arrays identifies different pieces of data for the same person. This is a simple payroll system that just calculates gross pay given a set of employees, hours worked for the week and hourly rate. Parallel Arrays First, you have to define several arrays in your main program employee names for each employee hourly pay rate for each employee total hours worked for each employee gross pay for each employee You can use a global SIZE of 50 to initialize these arrays Second, you will need a two dimension (2-D) array to record the hours worked each day for an employee. The number of rows for the 2-D array should be the same as the arrays above since each row corresponds to an employee. The number of columns represents days of the week (7 last I looked) Functions Needed In this lab, you must read in the…
Complete the C++ function given below:
help me solve this in c++ please Write a program that asks the user to enter a list of numbers from 1 to 9 in random order, creates and displays the corresponding 3 by 3 square, and determines whether the resulting square is a Lo Shu Magic Square. Notes Create the square by filling the numbers entered from left to right, top to bottom. Input validation - Do not accept numbers outside the range. Do not accept repeats. Must use two-dimensional arrays in the implementation. Functional decomposition — Program should rely on functions that are consistent with the algorithm.