What is the output result of the following code segment? int n=0, i, number; do { for (number=5; number>i; number--) { if (i=1 || 1==3) break; n++; } i++; } while (i++ < 5 ); cout << ++n <<< ++number << ++i; What will the above code segment output if i is initialized to 1? Answer: What will the above code segment output if i is initialized to -1? Answer:

What is the output result of the following code segment? int n=0, i, number; do { for (number=5; number>i; number--) { if (i=1 || 1==3) break; n++; } i++; } while (i++ < 5 ); cout << ++n <<< ++number << ++i; What will the above code segment output if i is initialized to 1? Answer: What will the above code segment output if i is initialized to -1? Answer:

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

please write pseudocode for this code #include <iostream> #include<time.h> using namespace std; int main() { srand(time(0)); int n=1,num=0; n=(rand()%(100-1+1))+1; cout<<n; while(num!=n) { cout<<"Enter a number to guess:"<<endl; cin>>num; if(n==num) { cout<<"Congratulations,you have guessed the number"<<endl; break; } if(num>n) { cout<<"Sorry,guess is too high"<<endl; } if(num<n) { cout<<"Sorry,guess is too low"<<endl; } } return 0; }
#include using namespace std; int main() { int stop; int result; int n; } cin >> stop; result = 0; Type the program's output for (n = 0; n stop) { cout << "n=" << n; cout << endl; break; } } cout << result << endl; return 0; Input 7 Output
#include <iostream> using namespace std; int rectArea (int len, int wid) { return len * wid; } int main () { int length, width; cin >> length >> width; cout << "The area of a " << length << " by " << width << " rectangle is " << /*add code to call the reacArea function */ << "." << endl; return 0; }
1. What is the output of the following code segment: char* s [] = { "NBY", "SDT"}; const char** z = s; const cout << z [1] [1]; cout << cout << a. DSDT b. DTY c. DTBY d. DTS e. *(z [1]+ 2); (*z + 1); None of the above
For the following main functionint _tmain(int argc, _TCHAR* argv[]){int years[10]={2007,2008,2009,2010,2011,2012,2013,2014,2015,2016};cout<<"Years before updating: "<<endl;for(int i=0;i<10;i++){cout<<*(years+i)<<"\t";}cout<<endl;after_2_years(years);cout<<"Years after updating: "<<endl;for(int i=0;i<10;i++){cout<<*(years+i)<<"\t";}cout<<endl;printf("Press any key to continue,...");char ch = getch();return 0;}The result of running the program is as followsYears before updating:2007 2008 2009 2010 2011 2012 2013 2014 2015 2016Years after updating:2009 2010 2011 2012 2013 2014 2015 2016 2017 2018Press any key to continue,...Write the body of function after_2_years()
In C++: Examine the code segment. What will be printed? If there are any errors indicate the nature of each error. int a[7] = {31, 12, 32, 14, 25, 16, 27}; int *ptr; ptr = & a[2]; for ( i=1; i<=5; i=i+2) cout << *(ptr +i); cout << a[0] << *ptr << *ptr - 2 << *(ptr -1)) << endl;
JAVA CODE PLEASE Recursive Functions Quiz by CodeChum Admin Create a recursive function named sequence that accepts an integer n. This function prints the first n numbers of the Fibonacci Sequence separated by a space in one line Fibonacci Sequence is a series of numbers in which each number is the sum of the two preceding numbers. In the main function, write a program that accepts an integer input. Call the sequence function by passing the inputted integer. Input 1. One line containing an integer Output Enter·a·number:·5 0·1·1·2·3
Explain the code and how it works: #include <iostream>#include <cmath> using namespace std;double to_kilograms(double n){ return n * 0.453592;}double to_pounds(double n){ return n * 2.20462;}double to_kilograms_ref(double& n){ return n * 0.453592;}double to_pounds_ref(double& n){ return n * 2.20462;}double to_kilograms_ptr(double* n){ return *n * 0.453592;}double to_pounds_ptr(double* n){ return *n * 2.20462;} void display_menu(){ cout << "1.Kilograms to Pounds (pass by value)\n2. Pounds to Kilograms (pass by value)\n3. Kilograms to Pounds (pass by reference)\n4. Pounds to Kilograms (pass by reference)\n5. Kilograms to Pounds (using pointers)\n6. Pounds to Kilograms (using pointers)\nEnter choice\n\n";} void convert(){ int ch; double w; cout << "Enter a menu option: "; cin >> ch; cout << "Enter weight: "; cin >> w; if (ch == 1) cout << "weight in kg is " << to_kilograms(w);…
1. Examine the following code segment. What will be printed?If there are any errors indicate the nature of the error. int a[8] ={16, 12, 10, 7, 15, 18, 17, 29}; int *ptr ; ptr = & a[ 5 ] ; for(int i = 0; i<= 4; i = i + 2) cout<<a[i]<<*( ptr + i )<<endl; cout<<” ”<<a[1]<<” ”<<*ptr<<” ”<<*ptr + 2<<” ”<<*(ptr + 3);
2- The factorial n! of a positive integer n is defined as n! = 1*2*3 . .. * (n-1) * n Where 0! = 1 Write a function to calculate the factorial of a number. Argument: A number n of type unsigned int. Returns: The factorial n! of type long double. Write two versions of the function, where the factorial is • calculated using a loop calculated recursively Test both functions by outputting the factorials of the numbers 0 to 20.
Assembly program
#include <stdio.h>#include <limits.h> int findMissingUtil(int arr[], int low, int high, int diff){ if (high <= low)return INT_MAX; int mid = low + (high - low)/2; if (arr[mid+1] - arr[mid] != diff)return (arr[mid] + diff); if (mid > 0 && arr[mid] - arr[mid-1] != diff)return (arr[mid-1] + diff); if (arr[mid] == arr[0] + mid*diff)return findMissingUtil(arr, mid+1, high, diff); return findMissingUtil(arr, low, mid-1, diff);} int findMissing(int arr[], int n){int diff = (arr[n-1] - arr[0])/n; return findMissingUtil(arr, 0, n-1,diff);} int main(){int arr[] = {120001, 120013, 120025, 120037, 120049, 120061,120085,120097,120109,120121};int n = sizeof(arr)/sizeof(arr[0]);printf("The missing element is %d", findMissing(arr, n));return 0;} ______________________________________________________________________________ Convert the code above into Pseudocode