e.jsp?course_assessment_id=_20372_1&course_id%3D 40969_1&...الو قت المتبقي: 20 نهایحالة إكمال الأسئلة?What is the output of the following program#include using namespace std;int main()int i=0;while(i<=21)cout<

Answer The output of given code 0 3 6 9 12 15 18 21 Explanation As the given code is a c++…

Answered: What is the output of the following…

Engineering

Computer Science

What is the output of the following program

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

Similar questions

[Python Language] A common back-of-the-envelope technique for estimating a runner’s marathon time is to take their best half-marathon time, multiply by two and add ten minutes. This works pretty well unless the marathon course is hilly.If it is hilly, we add an extra 20 minutes to the estimate. Write a program that takes two lines of input: a float giving the half- marathon time in minutes and an integer indicating whether the marathon course is hilly(1) or not (0). It prints a float giving the estimated number of minutes the runner will take to run the full marathon. Write your pro- gram in a file named marathon.py.
About initial programming in python: It is known that a messenger RNA molecule is used as a basis to synthesize proteins, in a process called translation. Each trip of messenger RNA bases is related to an aminoacid. Combining several aminoacids, we have a protein. Based on the (simplified) table of RNA cracks below, create a function that receives a string of length 9 representing a valid messenger RNA molecule, according to this table, and return the chain of 3 amino acids that represent the corresponding protein. Use a dictionary to store mappings RNA → Aminoacid. Example: translat("UUUUUAUCU") return "Phe-Leu-Ser"
Objective: Practice writing recursive functions in python3 Make the five recursive functions described below in python3 by using the starter code recursive_functions.py. For each function, figure out how to solve it conceptually : write down the base case (when recursion stops) and how each recursive function-call moves towards the base case. The functions should not print anything (except you may add temporary print statements to help debug them). You can test your program by using the provided program test_recursive_functions.py. Don't edit the test program. Put it into the same directory (folder) with your recursive_functions.py and run it. It will import your functions as a module, test your functions, and tell you when each function is returning correct results. 1. Factorial In math, if you have a number n, the factorial function (written n!) computes n x (n-1) x (n-2) x (n-3) x ... x 1. For example: 0! is defined to be 1 1! = 1 2! = 2 x 1=2 3! = 3 x 2 x 1=6 4! = 4 x 3…
[Python (py3)] The error in the code below is if the number of rows of the matrix is not equal to its number of columns, matrix addition will not be performed. This should not be the case since the only requirement for matrices addition is that the dimension of Matrix A is equal to the dimension of Matrix B. Please resolve the error in the code below such that Matrix A and Matrix B can be added if the dimension of Matrix A is equal to the dimension of Matrix B. PLEASE do not just copy the code below and use it as the answer itself. I've encountered such case many times. Please modify the code. When the dimension of Matrix A is not equal to the dimension of Matrix B, print "Matrix addition cannot be performed; dimensions are unequal." The input will come from file1.txt, and the output should only be printed to output.txt Format of the input from file1.txt:First Line: type of operation (add)Second Line: matrix A dimension (example: if 3 rows and 2 columns, type 3 2)Third Line: matrix A…
(Perfect Numbers) An integer number is said to be a perfect number if its factors, including1 (but not the number itself), sum to the number. For example, 6 is a perfect number because 6 =1 + 2 + 3. Write a function isPerfect that determines whether parameter number is a perfect number. Use this function in a program that determines and prints all the perfect numbers between 1and 1000. Print the factors of each perfect number to confirm that the number is indeed perfect.Challenge the power of your computer by testing numbers much larger than 1000.
Please help. I asked helped here before but the answer is wrong, and my deadline was yesterday. I really need help. This is C programming. Please strictly follow the rules in the image. Please C programming only.
Use Type Switches and Asertions sparingly function to write go code. Question is right , please donot reject it Output 70< nil>
NOTE: Solve this as soon as possible, I need this urgently. (a). Write a function that takes an integer as input and finds whether it is a prime number or not . Function should return 1 if number is prime , 0 otherwise. In main(), ask the user to enter the number and call the funcltion. Based upon the value returned by the function , main() will display on screen, if the number is prime or not.
Python (this is not graded this is practice work that is not graded) write and test a function which takes two dates (month, day) list arguments.When the function is called with the two arguments, it returns the number of days betweenthose two dates. Print the returned value. It is assumed that the first date occurs first. Forinstance, if the users calls the function with FUNCTION([12, 10], [12, 20]) as arguments, thereturned value is 10 days. However, if FUNCTION([12, 20], [12, 10]) is called, the returnedvalue is -10 days.Assume February has 28 days.Test data: [10, 30], [5, 20] [1, 30], [5, 25] [5, 25], [1, 30] [1, 1], [12, 31]