Trace the following pieces of code and give their exact output with the tracing steps.a. (*for (int i=1; i<=3; i++) {for (int j = i+1; j<=5; j++)System.out.print (i*j + ",");System.out.println ();b.String[] names={"Hani","Sara", "Hanaa","Heba","Amr","Lona","Amani","Samar","Hend","Yara","Clara"};for (int i = 1; i < names.length; i += 2)System.out.printf("%s, %s\n", "Hi",names[i]);с.public class MyScope {static int value = 2;public static void main (String[] args) {System.out.println(value);int value = 3;System.out.println(value);System.out.println(meth1());System.out.println (meth1(10));System.out.println(value / 3);public static int meth1() {return (value > 1) ? 4 : 1;public static int meth1(int number) {System.out.println (number);return number % 4;d.String s = "TM105FinalExam";int k = s.length()-1;while (k >= 5) {if (k < 3) break;System.out.println(s.charAt (k));k = k-3;}System.out.println ("k = " + k);

NOTE - As per our guidelines we can solve only the first part of multiple questions, so please…

Answered: а. ( for (int i=1; i<=3; i++) { for…

Engineering

Computer Science

а. ( for (int i=1; i<=3; i++) { for (int j = i+1; j<=5; j++) System.out.print (i*j + ","); System.out.println ();

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

Input 1. integer n 2. N integer values Output Enter n: 5 Enter value #1: 3 3 is odd Enter value #2: 6 6 is even Enter value # 3: 4 4 is even Enter value #4: 1 1 is odd Enter value #5: 3 3 is odd
Find the error(s), if any 1) void main(){int a = 15;float b = 10;char cha = 'a';char chb = 'b';do{a += b;a = a * b / 4;cout<<a<<b/a<<endlcout<<cha;for (int i=0; i<20; i++); {cout<<i;}}while(a=<1000)}; 2) The following code should output the even integers from 2 to 100:counter = 2;do{cout << counter << endl;counter += 2;} While ( counter < 100 );
What value will be returned by the function if a = 8, b=12? %3D int func(int a, int b){ if(a>b){ return a+b; } else if(a
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?
#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; }
#include tinclude 3 tinclude 4 void modify(int *, int) ; 5 int main (void) int sensor[15]; int i, thr = 15; for (i=0;i<15;i++) * (sensor+i)=rand () *100; 8 10 11 printf("Sensor Value\n"); for (i=0;i<15;i++) printf("%3d",* (sensor+i)); modify(sensor,thr); printf("\nAfter Modification\n"); for (i=0;i<15;i++) printf("%3d",*(sensor+i)); return 0; 13 14 15 16 17 18 19 20 L} 21 22 void modify(int *d, int t) 23B { 24 int i; for (i=0;i<15;i++) 25 26 if (*(d+i) <= t) * (d+i) = t; 27 28 29 30 B Sensor Value 41 67 34 0 69 24 78 58 62 64 5 45 81 27 61 After Modification Sensor Value 41 67 34 0 69 24 78 58 62 64 5 45 81 27 61 After Modification 41 67 34 12 69 24 78 58 62 64 12 45 81 27 61 41 67 34 20 69 24 78 58 62 64 25 45 81 27 61 D Sensor Value 41 67 34 0 69 24 78 58 62 64 5 45 81 27 61 After Modification Sensor Value 41 67 34 0 69 24 78 58 62 64 5 45 81 27 61 After Modification 41 67 34 15 69 24 78 58 62 64 15 45 81 27 61 61 87 54 20 89 44 98 78 82 84 25 65101 47 81 oao 123 456 r89
lint power (int base, int exponent); Define the recursive function power() that when invoked returns baseonent Assume that exponent is an integer greater than or equal to 1. Hint: The recursion step would use the relationship basenent = base * baseonert- and the terminating condition occurs when exponent is equal to 1 because base' = base or when exponent is equal to o because base = 1.
c++complete and change #include <iostream>using namespace std; int sumbyrow(int* m, int ncol, int row){int total = 0;for (int i = 0 i < ncol; i++) {total += m[row * ncol + i];}return total; } int sumBCol(int* m, int nrow, int ncol, int col){int total = 0;for (int j = 0; < j nrow; j++) {total += m[j * ncol + col]; }return total;}int sumBYLeftDiag(int* m, int ncol){int total = 0;for (int i = 0, j = ncol - 1; i < ncol && j >= 0; i++, j--) {total += m[i * ncol + j];}return total;}bool hasDuplicates(int* m, int row) {int flatArray[row * row];int k = 0for (int i = 0; i < row; i++) {for (int j = 0; j < row; j++) {flatArray[k++] = m[i * row + j]; }}for (int i = 0; i < (row * row); i++) {for (int j = i + 1; j < (row * row); j++) {if (flatArray[i] == flatArray[j])return true; }}return flase;} bool isMagicMatrix(int* m, int nrow, int ncol) { if (hasDuplicate(m, nrow), int ncol{return false; }if (sumByleftDiag(m, nrow) != sumByRightDiag(m, nrow)) {return…
// Assume all libraries are included 3 void func (int a, int &b, int &c); // int main () { int i = 5, j = 4, k = 33; 4 7 %3D 8. func (i, j, k); func (j, i, k); cout << j « k << i <« endl; 10 11 12 13 return 0; 14 } // 15 16 void func (int a, int &b, int &c) { 17 18 = 2*c + b; 19 b a; 20 C = a + 3*b; } // 21 22 I|||
#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.
Recursive function: Writing the recursive case. Write code to complete PrintFactorial()'s recursive case. Sample output if input is 5: 5! = 5 * 4 * 3 * 2 * 1 = 120 #include <stdio.h> void PrintFactorial(int factCounter, int factValue){int nextCounter;int nextValue; if (factCounter == 0) { // Base case: 0! = 1printf("1\n");}else if (factCounter == 1) { // Base case: Print 1 and resultprintf("%d = %d\n", factCounter, factValue);}else { // Recursive caseprintf("%d * ", factCounter);nextCounter = factCounter - 1;nextValue = nextCounter * factValue; /* Your solution goes here */ }} int main(void) {int userVal; scanf("%d", &userVal);printf("%d! = ", userVal);PrintFactorial(userVal, userVal); return 0;}
int j; for (int i = 0; i < 5; i++) {j = 2*j*i;} What is j?