Answer please? what is the output of the following algorithm?set x=3set sum=0while (x<=20)if(x%2=D3D0 && x%3=%3D0)add x to sumendifadd 3 to xendWhileprint sumstopSelect one:O a. 63O b. 36O c. none of the aboveO d. 60

while (x <=20){if (x%2==0 && x%3==0){sum+=x;}x+=3;}

Answered: Answer please

Engineering

Computer Science

Answer please

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: 6 . Correct and detailed answer. Handwritten solution not allowed. tha

A: The answer is 4.

Q: etailed answer please. Than

A: given data Given the "Dupliate-Removal" reules below. drm(0,0):-!. drm([Head Tail],NL):-…

Q: PLEASE HELP with explanations of the answer

A: N denotes a set of natural numbers, which is a set of whole numbers starting from 1 and -99 is a…

Q: Solve all questions,please.

A: Loop is a sequence of instructions that is continually repeated until a certain condition is…

Q: hand written answer please

A: Solution:-

Q: Commonly used domain names such as .uk represent country. Select one: True False

A: True

Q: wer quickly

A: Artificial Intelligence Artificial Intelligence (AI) is a type of computer intelligence that mimics…

Q: answer all the questions

A: Here we have to answer all the given MCQs

Q: can you help me to answer this

A: shortest remaining time first and priority schedules are answered in step 2.

Q: Please slove only sub part a and b in detailed not just any copied answer from google . PLease…

A: SOLUTION Answer a) When one take standard ASCII representation, then each character in the text…

Q: Hi please assist urgent please verify each line

A: Required: Hi please assist urgent please verify each line

Q: please complete answer need average response time and calculate response time?

A: Response Time= Time at which the process gets the CPU for the first time - Arrival Time Response…

Q: choose the correct answer

A: (1)The regular expression of language which starting and ending with different The correct answer is…

Q: rwnd uses by server not client. The statement is: a) extremely true b) somewhat true c) slightly…

A: Rwnd is a technique which is used to overcome the problem of congestion when data is send between…

Q: ease send correct answer of Q

A: We need to answer: Q8) PNG image encoding supports which of the following - a) Lossy compression of…

Q: ould you Please Choose the correct answer without explanation .. Thank you

A: The only first question will be answered. 1 The above two graphs are isomorphic. Consider f is a…

Q: Please answer both

A: Answer 1: Here i choose the wrong statement: 1. It is missing the natural recursion for (first los)…

Q: pls answer as soon as possible

A: Ans : The correct term to design the specific algorithm is: d) Flowchart

Q: Total: ?

A: Big O notation about big o notation it is a frame work to analyze and compare algorithms amount of…

Q: explain clearly why the 3rd answer is correct

A: As given, T(n) = 4T(n/2) + n^3, T(0) = 1; and L(n) = 16 L(n/4) + n^2, L(0) = 1; so as per the master…

Q: Question 4. Convert 1101.10018 to hexadecimal and decimal numbers.

A: Given (1101.1001)8 Octal to Hexadecimal: First, convert the given octal number to binary. 001 in…

Q: Ture False

A: Correct answer of above given question is False means ( p→q) is not logically equivalent to (¬p ∧ q)…

Q: asap please Dont use answers from other websites please! Please type your answer not picture Show…

Q: ed answer please plea

A: 1 - For J = 1 To 3 2 - Sum = 0 3 - For I = 1 To 5 4 - AV= S/5 5 - K(J) = Sum

Q: tt helpp 15min

A: Given you are working as a software tester in AMAZON your team responsible for payment module. How…

Q: a- Desilte

A: We need to solve these 6 Questions.

Q: please answer all i will rate

A: Coded using C language.

Q: Answer the all question

A: 1 ans #include <iostream>using namespace std; int main(){ int divisor, dividend,…

Q: q4 please

A: Answer 4 is given below- If you have any query comment below.

Q: lease respond..

A: I have written Python code for the following question:

Q: 14 11 /\ 1 3 10 30 7 40

A: Algorithm Preorder(tree) 1. Visit the root. 2. Traverse the left subtree, i.e., call…

Q: need answer within 20 minutes please please with my best wishes

A: Thanks Like it _________ Option a Allowed

Q: The solutions provided didn't work for any of the questions. Please provide different…

A: TASK 10 - SELECT FROM information_schema.tables WHERE table_schema = 'information_schema' AND…

Q: Please provide the missing codes

A: Given data: import java.util.*;public class SearchMe { public static void main(String[] args) {…

Q: i need the correct answers please

A: Graphs can be dense(have more edges) or sparse (have a fewer edges). Most graphs are dense:- True,…

Q: question number 15

A: The documentation for who, and then view the documentation for w and the similar commands

Q: what is the re the following

A: Rauto=BO00 and its operand is (AO) hex the content of register C= (8C) hex what is the result…

Q: correct answ

A: Correct option: CONTEXT SENSITIVE Context sensitive help is associated to a product's user…

Q: R2

A: Given values steady-state current I flowing in a circuit that contains a resistance R = 5 ,…

Q: pls provide letter of final answer

A: I have provided the answer and explained it in step 2.

Q: please be quick

A: We need to implement the search operation on a 2D array as given in the following code.

Q: I need answer within 20 minutes please please with my best wishes

Q: I need answer within 20 minutes please please with my best

A: Thank you ____ Like it ____ Option a) Allows

Q: 234

A: Solution - In the given question, we have to tell whether the given tree is a heap or not.

Q: please please with my best

A: Thank you ____ Like it thanks ___ Option a) Allowed

Q: Heres my current code. I know that the check is a bit wrong just need some guidance.

A: Here, your requirement is to check whether the given number lies in the range. if not in range you…

Q: Choose the correct answer:

A: According to the question we need to choose the correct answer:

Q: lease Help ASAP!!!

A: Employeeid will be unique for each employee, and that also defines the class. So it can be…

Q: Help please mcq

A: Let's see the solution in the next steps

Q: d B, An BCA d B, ACAU B

A: For two arbitrary sets A and B, two following statements are given: A. ∀sets A, ∅⊆A B. ∀sets B, ∅⊂B

Question

Answer please?

what is the output of the following algorithm?
set x=3
set sum=0
while (x<=20)
if(x%2=D3D0 && x%3=%3D0)
add x to sum
endif
add 3 to x
endWhile
print sum
stop
Select one:
O a. 63
O b. 36
O c. none of the above
O d. 60

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1: Algorithm

VIEW

Step 2

VIEW

Step 3: Answer

VIEW

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

What is the output of the following algorithm if called as AlgorithmX(30,12) AlgorithmX(m,n) 1 while n ≠ 0 do 2 r ← m mod n 3 m← n 4 n ← r 5 return m
What is the time complexity of the following code segment in big O notation? for (int i=0; i<n; i++) { for (int k=0; k<n; k++) { if (k < 5) cout << 5*i*k ; else cout <<i*k; } cout << endl; } Question 17 options: O(n3) O(n2) O(nlogn) O(n)
Below is pseudocode representing the Compute-Opt algorithm: Compute-Opt(j): If j = 0 then Return 0 Else Return max(vj+Compute-Opt(p(j)), Compute-Opt(j − 1)) Endif Memoization of this algorithm does what to its running time? Group of answer choices It reduces the running time from exponential to linear. It reduces the running time from O(n2) to O(n). It reduces the running time from exponential to O(n log n). It doesn't significantly reduce the running time, but it enables the algorithm to utilize less space.
calculate number of operations in this algorithm void my_dgemv(int n, double* A, double* x, double* y) { double alpha=1.0, beta=1.0; int lda=n, incx=1, incy=1; cblas_dgemv(CblasRowMajor, CblasNoTrans, n, n, alpha, A, lda, x, incx, beta, y, incy); }
What is the Big Oh of the following algorithm(program) ? #include <stdio.h> int main() { int i,j, n; scanf("input range %d (from 1~9)", &n); for(i=1;i<=n;i++) { for(j=1;j<=n;j++) printf("%d*%d=%2d\t", i, j, i*j); printf("\n"); } return 0;} a. O(n)b. O(nlogn)c. O(n^2logn^2)d. O(3^n)e. O(n^2logn)f. O(n^2)g. O(nlogn^2)h. O(n^3)i. O(1)j. O(2^n)
IN STO a IN STO b test LDA a SUB b BRP count LDA c OUT LDA d OUT HLT count STO a LDA c ADD one STO c LDA d SUB b STO d BR test a DAT b DAT c DAT 0 one DAT 1 d DAT 0 Using this LMC program to solve a÷b=cRd where a = 20 b = 4 what is c and remainder d. IF a = 20 b = 4 c should be 5 and d should be 0. IS there reason to why i keep getting the remainder as 980
Consider the below algorithm: for (i=1;i < n;i++){ for (j=1;j < m;j++){ Alloc[i][j]=( 2i *( j+1 ) % 7) } } For n=13 and m=6 answer the following questions What value Alloc [3][5]
*n = A.length;int x;for (int i = 0; i <n; i ++) { x = 1; while (x <n) { x = x + 2; }} x = x / 2;while (x> = 0) { System.out.println (A [0]); x--;} This algorithm has a Grand O complexity of ... (select all the correct answers): O(n) O (n log2 n) none of the above O (log2n)
Algorithm Prime2 (n: integer):{T,F}; prime = F; d=2; while d < n/2 and prime = F do if n mod d = 0 then prime = T else d = d+1 return prime; How many times is the operation "n mod d" performed, when the input for Algorithm Prime 2 is n=17? Group of answer choices 7 4 None of these. 8 6
Determine how many additions are done in the worst case scenario of the following code. Assume that all variables are properly declared. y = 1; for (i=1; i<=n;i++) { for (j = 1; j<=n;j++) { x = i + j; x = x * y; } x = y + x; }
Algorithm to An iterative solution to Towers of Hanoi.in: triplet S = s0, s1, s2 representing the current game stateout: triplet R = r0, r1, r2 representing the new game statelocal: pole indices a, b, z ∈ {0, 1, 2}; disc numbers g, h ∈ [2, n]; last(Q) = Q|Q|−1, if1 ≤ |Q|, otherwise, last(Q) = +∞
ALGO(A)x = A[0]p = -1r = nwhile (True) { do { p = p + 1 } while (A[p] < x) do { r = r - 1 } while (A[r] > x) if (p >= r ){ return r } exchange A[p] and A[r]} From the above algorithm, we have to state whether the following statements are True or False(With explanation) (A) At the end of each iteration of the while loop of Line 4, each index of A smaller than p contains an integer smaller than x. (B) At the end of each iteration of the while loop of Line 4, each index of A larger than r contains an integer larger than or equal to x. (C) When ALGO terminates, the integer at index r is x.