1) (5 points) (for) Trace the following code step-by-step and fill in rest of the table below? for (int i 1; i <= 2; i++) for (int j 1; j <= 2; j++) for i 1 } = (int k = 1; k <= 2; k++) { i + j + k; int sum System.out.println(sum); j 1 = k 1 Output 3

1) (5 points) (for) Trace the following code step-by-step and fill in rest of the table below? for (int i 1; i <= 2; i++) for (int j 1; j <= 2; j++) for i 1 } = (int k = 1; k <= 2; k++) { i + j + k; int sum System.out.println(sum); j 1 = k 1 Output 3

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

ii) In JAVA language input the elements of an integer array A of size 10 and find the count of all hills in the array. A[i] is a Hill if A[i-1]A[i+1]. A[i] >= 0 All elements of the array are unique.
Question 3 : (Eliminate duplicates) Write a program Duplicate.java that reads in ten integers in an array T, creates a new array V by eliminating the duplicate values in the array, and displays the result. Here is the sample run of the program: Enter ten numbers: 1 2 3 2 1 6 3 4 5 2 The distinct numbers are: 1 2 3 6 4 5
Fill in the blanks. Line # Code 1 i-1 2 for (x = 2; x
Explain this c code in details. #include <stdio.h> int main() { int max_weight_truck, n; scanf("%d", &max_weight_truck); scanf("%d", &n); int weight_item[n]; int priority[n]; int p_sort[n]; int w_sort[n]; int a[n]; for(int i=0; i<n; i++) scanf("%d", &weight_item[i]); for(int i=0; i<n; i++) scanf("%d", &priority[i]); //sorting priority array for(int i=0; i<n; i++) p_sort[i]= priority[i]; int temp=0; for (int i = 0; i < n; i++) { for (int j = i+1; j < n; j++) { if(p_sort[i] < p_sort[j]) { temp = p_sort[i]; p_sort[i] = p_sort[j]; p_sort[j] = temp; } } } for(int i=0; i<n; i++) a[i]= 0; for(int i=0; i<n; i++) { int index; for(int j=0; i<n; j++) { if(p_sort[i]== priority[j] && a[j]==0) { index= j; break; } } w_sort[i]= weight_item[index]; a[index]=1; } int s=0, i=0,j=0,truck=5, l=0; int o_item[truck], unused_space[truck]; // initializing arrays for(i=0; i<truck; i++) { o_item[i]= 0; unused_space[i]= 0; } i=0; while(truck>0)…
Ocaml, functional programming task.
Exercise 1: (Design of algorithm to find greatest common divisor) In mathematics, the greatest common divisor (gcd) of two or more integers is the largest positive integer that divides each of the integers. For example, the gcd of 8 and 12 is 4. Why? Divisors of 8 are 1, 2, 4, 8. Divisors of 12 are 1, 2, 4, 6, 12 Thus, the common divisors of 8 and 12 are 1, 2, 4. Out of these common divisors, the greatest one is 4. Therefore, the greatest common divisor (gcd) of 8 and 12 is 4. Write a programming code for a function FindGCD(m,n) that find the greatest common divisor. You can use any language of Java/C++/Python/Octave. Find GCD Algorithm: Step 1 Make an array to store common divisors of two integers m, n. Step 2 Check all the integers from 1 to minimun(m,n) whether they divide both m, n. If yes, add it to the array. Step 3 Return the maximum number in the array.
8.
please answer quickly
Q2) Write down a C/C++ function that increases the salary of the given employee ID by 20 percent. Multiply the salary with 1.2 to give the increase. Linear search algorithm can be used to find the given ID. struct employee{ int ID; char class; int salary; }a [100]; prototype: onlovee (struct employee a [], int size, int searchID);
1-Write python code that implements an indexed array and an associative array (dictionary). 2- Use examples to explain the two main problems with Pointers 3- What is the output of the following Python code: x=3 y="5" print (x+y)
4. Answer the following questions based on your understanding on arrays. [C a) Complete the following program to print the values of each inner array in a single line? (Note: Don't forget to use appropriate initialization, condition, and post iteration statement in the loop header) public class Mainclass { public static void main(String[] args) { int[][] a = { {1,2,3}, {1}, {1,2,3,4,5,6,7}, {1,2}, {1,2,3,4,5,6,7,8,9,10,11,12} }; for( ; ; ) { for( ; ; ) { } System.out.println(); } b) Suppose that you are developing a data mining algorithm that stores 4GB input dataset in an array. After removing the unnecessary attributes and outliers in the preprocessing stage, the size of the dataset becomes 2GB, which is also stored in an array. The size of the final results from the mining algorithm could be 3GB and should be stored in another array. However, the size of heap is 7GB, which is not enough to store the final results since the input and preprocessed dataset have already occupied…
[Part 1: C Array example] C++ Create two overloaded methods that return the average of an array with the following prototypes: int average(const int[] , int ); double average(const double[] , int); Write a driver program that randomly generates ten integers between 0- 100, and ten double values with 2 decimal digits between 0 – 50. (Use srand and rand to get array element values. ) You may add the following functions to generate random numbers: void intArrayGenerator(int[], int size, int low, int high); void doubleArrayGenerator(double[], int size, int low, int high); Invokes both functions, and displays all values and the average values. (All double numbers will be displayed with two-digit decimal places.) Each line displayed each element from both arrays. [Part 2: Using C++ Array] Peer Discussion: The function prototypes provided are for C Array, how will you modify them for C++ Array? Rewrite all functions with C++ array and test all of them.