Explain Algorithm: To sequentially search for the first occurring even number in the list of numbers given. Input 1: –1, 3, 5, 7, –5, 7, 11, –13, 17, 71, 21, 9, 3, 1, 5, –23, –29, 33, 35, 37, 40. Input 2: 6, 17, 71, 21, 9, 3, 1, 5, –23, 3, 64, 7, –5, 7, 11, 33, 35, 37, –3, –7, 11. Input 3: 71, 21, 9, 3, 1, 5, –23, 3, 11, 33, 36, 37, –3, –7, 11, –5, 7, 11, –13, 17, 22.

Explain Algorithm: To sequentially search for the first occurring even number in the list of numbers given. Input 1: –1, 3, 5, 7, –5, 7, 11, –13, 17, 71, 21, 9, 3, 1, 5, –23, –29, 33, 35, 37, 40. Input 2: 6, 17, 71, 21, 9, 3, 1, 5, –23, 3, 64, 7, –5, 7, 11, 33, 35, 37, –3, –7, 11. Input 3: 71, 21, 9, 3, 1, 5, –23, 3, 11, 33, 36, 37, –3, –7, 11, –5, 7, 11, –13, 17, 22.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter5: Control Structures Ii (repetition)

Section: Chapter Questions

Problem 29PE

See similar textbooks

Similar questions

Maximum Subsequence Sum Problem：Given a sequence of 10 integers： -10 1 2 3 4 -5 -23 3 7 -21. Use the third Algorithm to find the largest sum. Write the main steps.
Write algorithm for the problem : Read two numbers and find subtraction two numbers and then compare the result more than or less than with number 10?
Question 4 - Algorithm Design Imagine you are a treasure hunter standing at one side of the river. There are n (a positive integer) stones on the river. They are aligned on a straight line and at the nth stone, there is treasure waiting for you. Your target is to reach the nth stone. For each move, you have the choice of either walking (move one stone ahead) or leaping (move two stones ahead). Also, you are not allowed to travel backwards. Design an algorithm that calculates the number of ways (sequences of walks/leaps) that get you to the treasure stone. You should clearly explain the algorithm and demonstrate the correctness of the algorithm with a complete proof. Here is an example. For n = 1 5, there are 8 ways: Method 1: walk → walk → walk → walk → walk Method 2: walk → walk → walk → leap Method 3: walk → walk → leap → walk Method 4: walk → leap → walk → walk walk Method 5: leap → walk → walk → Method 6: leap → leap walk Method 7: leap → walk → leap Method 8: walk → leap leap
QUESTION 8 The following algorithm construct a sequence of positive whole numbers, which demonstrates the famous Collatz's conjecture: starting from any positive whole number, the sequence will eventually go down to 1. 1. input: positive integer x 2. i+0 3. repeat 3.1. i+i+1 3.2. if x is odd then 3.2.1. x (3 x x) + 1 else 3.2.2. x x+ 2 until x = 1 4. output i By tracing the algorithm, how many times does the algorithm perform Step 3.2.1. if the input is set to x = 6?
Credit card numbers follow certain patterns: It must have between 13 and 16 digits, and the number must start with:■ 4 for Visa cards■ 5 for MasterCard credit cards■ 37 for American Express cards■ 6 for Discover cards In 1954, Hans Luhn of IBM proposed an algorithm for validating credit card numbers. The algorithm is useful to determine whether a card number is entered correctly or whether a credit card is scanned correctly by a scanner. Credit card numbers are generated following this validity check, commonly known as the Luhn check or the Mod 10 check, which can be described as follows (for illustration, consider the card number 4388576018402626): 1. Double every second digit from right to left. If doubling of a digit results in a two-digit number, add up the two digits to get a single-digit number. 2. Now add all single-digit numbers from Step 1. 3. Add all digits in the odd places from right to left in the card number. 4. Sum the results from Steps 2 and 3. 5. If the result from…
What problem does this algorithm help us solve? Step 1 Start Step 2: Input the three numbers A, 8 and C Step 3: Add the numbers and divide by 3 Step 4: Print the result Step 5: Stop This algorithm helps to find the product of three numbers. This algorithm helps to find the sum of three numbers. O none of the choices This algorithm helps to find the average of three numbers.
Create a VBA algorithm that calculates the weighted grade of four exams of 10 students. Column 1 – Student’s Name Column 2 –Exam 1 Score Column 3 – Exam 2 Score Column 4 – Exam 3 Score Column 5 – Exam 4 Score Column 6 – Weighted Grade Formula of Weighted Grade: Weighted Grade = 30% Exam 1 + 25% Exam 2 + 25% Exam 3 + 20% Exam 4
Create a VBA algorithm that calculates the weighted grade of four exams of 10 students. Column 1- Student's Name Column 2 -Exam 1 | Score Column 3 - Exam 2 Score Column 4 - Exam 3 Score Column 5 - Exam 4 Score Column 6 – Weighted Grade Formula of Weighted Grade: Weighted Grade = 30% Exam 1+ 25% Exam 2 + 25% Exam 3 + 20% Exam 4
C- Filip Mirko has a younger brother, Filip, who just started going to school and is having trouble with numbers. To help him get the hang of the number scale, his teacher writes two three-digit numbers. She asks Filip to compare those numbers, but instead of interpreting them with the leftmost most significant digit, he needs to interpret them the other way around, with the most significant digit being the rightmost one. He then has to tell the teacher the larger of the two numbers. Write a program that will check Filip's answers. Input The first and only line of input contains two three-digit numbers, A and B. A and B will not be equal and will not contain any zeroes. Output The first and only line of output should contain the larger of the numbers in the input, compared as described in the task. The number should be written reversed, to display to Filip how he should read it. Sample Input 1 Sample Output i 734 893 437 Activate W
D Question 2 What does the following algorithm do? Procedure Guess (n: nonnegative integer) if n=0 return 1 else return (n-1)× Guess(n-2) The algorithm returns (n-1)!. The algorithm returns Fibonacci Sequence. The algorithm returns n!. The algorithm returns n x 1: Previous
explain and prove the algorithm You found a lost civilizations' library and you are interested in its alphabet of 7 strange characters. Each book has a title in this alphabet and you hope that the books are arranged in lexicographical order on the bookshelves. You would like to know whether the order of the books uniquely determines the order of the characters of the alphabet, or if there is insufficient information, or whether even such an order cannot exists (meaning that someone must have shuffled the books). Think of the input as a list of words without spaces from the alphabet "a-z", and the question is the order of the characters "a-z" in the examined alphabet. Try to find an algorithm which solves this problem in time linear in the size of the input (that is, the number of characters on input). You may assume that each character appears at least once. Don't assume that the size of the alphabet is a fixed constant (like 26); treat it as a variable n, and let L be the total number…
-Write the algorithm and the Pseudo code for the following the questions? 1. Write an algorithm to swap two numbers. Example: Trace the algorithm using x as 8 and y as 9..... Solution X=9 y=8