#include using namespace std; const int y = 1; int main () ( int static y - 2; int i = 3, j - 4, m = 5, n = 6; int a = () (int x, int i = 1) ( return x * i; ) (y, 3); int b = (=1 (int x) ( return [=1 (int b) ( return b + j; ) (x) % 7;) (a); int c = [=] (int x) mutable ->int { m - 6; return (6] (int j) mutable ( y - a * b; return y / j; ) (x) -m; ) (b) ; cout <« a << endl; cout <« b << endl; cout << c < endl; cout << m << endl; cout « y « endl; return 0; This program outputs 5 lines. What are they? Please explain your work and your answer.

#include using namespace std; const int y = 1; int main () ( int static y - 2; int i = 3, j - 4, m = 5, n = 6; int a = () (int x, int i = 1) ( return x * i; ) (y, 3); int b = (=1 (int x) ( return [=1 (int b) ( return b + j; ) (x) % 7;) (a); int c = [=] (int x) mutable ->int { m - 6; return (6] (int j) mutable ( y - a * b; return y / j; ) (x) -m; ) (b) ; cout <« a << endl; cout <« b << endl; cout << c < endl; cout << m << endl; cout « y « endl; return 0; This program outputs 5 lines. What are they? Please explain your work and your 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

int func(int a, int b) { return (a
int sum = 0; for (int i 0; i < 5; i++){ sum += i; } cout << sum;
int j; for (int i = 0; i < 5; i++) {j = 2*j*i;} What is j?
int main(){ long long int total; long long int init; scanf("%lld %lld", &total, &init); getchar(); long long int max = init; long long int min = init; int i; for (i = 0; i < total; i++) { char op1 = '0'; char op2 = '0'; long long int num1 = 0; long long int num2 = 0; scanf("%c %lld %c %lld", &op1, &num1, &op2, &num2); getchar(); long long int maxr = max; long long int minr = min; if (op1 == '+') { long long int sum = max + num1; maxr = sum; minr = sum; long long int res = min + num1; if (res > maxr) { max = res; } if (res < minr) { minr = res; } } else { long long int sum = max * num1; maxr = sum; minr = sum; long long int res = min * num1;…
#include #include #include #define SIZE 5 int nums [SIZE] = [5,0,6,1,2); int main() { int i; pid_t pid; pid= fork(); if (pid == 0) { for (i = 0; i 0) { wait (NULL); } for (i = 0; i < SIZE; i++) printf("PARENT: %d\n", nums [i] + 1); /* LINE Y */ return 0; From the above-given program, please state what will be the output at lines X and Y. Explanation in detail required for output at both lines X and Y.
#include using namespace std; int main() { int numbers[10]; int i; for (i=0;i>numbers[i]; int numbers2[10],j,k; for(i=0;ic) { max1=rep; c=top; } } cout<
int x1 = 66; int y1 = 39; int d; _asm { } mov EAX, X1; mov EBX, y1; push EAX; push EBX; pop ECX mov d, ECX; What is d in decimal format?
void fact(int num) { int k,f=1; for (k=1;k<=num; k++) f=f*k; cout<< f; int main() { int arri[3]={3,2,1} ; for(int i=0;i<3;i++) fact(arri[i]); } 261 O 621 O 7 462
1. #include int main() { int i; for (i = 1; i int main() { double number, sum = 0; do { printf("Enter a number: "); scanf("%lf", &number); sum += number; } while(number != 0.0); printf("Sum = %.2lf",sum); return 0; } }
#include <stdio.h>int main(){int d;int s[20],i, r, p, lg=0,m;char c;printf("Enter number of salesman(max 20): ");scanf("%d", &d);for(i=0; i<d; i++){ printf("\n salesman %d sales: ");scanf("%d", &s[i]);}for(i=0; i<d; i++){for(r=i+1; j<d; r++){if(s[i] > s[r]){p= s[i];s[i] = s[r];s[j] = p;}}}printf("\nsalesman lowest to highest: ");for(i=0; i<d; i++){printf("%d\t", s[i]);}for(i=0;i<m;i++){printf("\n highest sales: %d ",lg);if(lg<=s[i])lg=s[i];break;}getch();} >>> the upper part output should be like this enter number of salesman (max 20): 5 salesman 1 500 salesman 2 300 salesman 3 1000 salesman 4 200 salesman 5 1000 in the lower part the lowest to highest the output should become like this salesman 4 200 salesman 2 300 salesman 1 500 salesman 3 1000 salesman 5 1000 highest total sales : 2000
#include <stdio.h> struct Single { int num; }; void printSingle(int f) { int binaryNum[33]; int i = 0; while(f>0) { binaryNum[i] = f % 2; f = f/2; i++; } for (int j=i-1; j>= 0; j--) { printf("%d",binaryNum[j]); } } int main() { struct Single single; single.num = 33; printf("Number: %d\n",single.num); printSingle(single.num); return 0; }
Number of digits int main() {int c=0;int i=3856; int l=i; while(l>0) {l=l/10; c++; } printf("%d",c); return 0; } Summation of digits int main() {int sum=0; int i=384; int l=i; while(l>0) { sum+=l%10; l=l/10;} printf("%d",sum); return 0; }