R6.3 Consider the following array: int(] a - { 1, 2, 3, 4, 5, 4, 3, 2, 1, 0}; What is the value of total after the following loops complete? a. int total - 0; for (int i - 0; i < 10; i++) { total - total + a[i]; } b. int total - 0; for (int i - 0; i < 10; i - i + 2) { total - total + a[i]; } c. int total - 0; for (int i- 1; i < 10; i - i + 2) { total - total + a[i]; }

R6.3 Consider the following array: int(] a - { 1, 2, 3, 4, 5, 4, 3, 2, 1, 0}; What is the value of total after the following loops complete? a. int total - 0; for (int i - 0; i < 10; i++) { total - total + a[i]; } b. int total - 0; for (int i - 0; i < 10; i - i + 2) { total - total + a[i]; } c. int total - 0; for (int i- 1; i < 10; i - i + 2) { total - total + a[i]; }

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

9.5.1: Use the addChoice method to add any needed instance variables. Provide a different implementation of ChoiceQuestion. Instead of storing the choices in an array list, the addChoice method should add the choice to the question text. For this purpose, an addLine method has been added to the Question class. ChoiceQuestion.java: /** A question with multiple choices.*/public class ChoiceQuestion extends Question{ // Add any needed instance variables, but don't store the choices // The choices should be added to the text of the superclass /* Your code goes here */ /** Constructs a choice question with a given text and no choices. @param questionText the text of this question */ public ChoiceQuestion(String questionText) { /* Your code goes here */ } /** Adds an answer choice to this question. @param choice the choice to add @param correct true if this is the correct choice, false otherwise */ public void…
Answer in java code a) Given this: int [][] tda = new int [12][25];Write a loop to print the fourth row of this two-dimensional array tda {assume the array is filled with data..}b) Write Java code (only the loop) to find the maximum value in the array Ab of type integer (use enhancedfor-loop): c) Write the output of this code:int [][] tda = {{5,99,88,2},{22,76,12,87,77,66},{34,88,13,4},{9,76,77,11}};tda[1][4] = -22;for(int q=0; q<tda[3].length; q++) System.out.print(tda[2][q] + " ");
Q1 / Write a program in C++ that reads a binary array of dimensions (383) containing integers, and then prints the elements of the third column horizontally on the screen after showing the necessary alert messages
5. Implement the binary search function below that returns the index of the target value in an integer array. int search(int a[], int t, int l, int r); Given the binary search function in question 5 and the array a below, list all activations when calling search(a, 19, 0 15). -9 -5 -2 0 1 3 7 11 17 19 21 25 27 31 37 41 a index 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
4.4.1: Modify an array parameter. Write a method swapArrayEnds() that swaps the first and last elements of its array parameter. Ex: sortArray = {10, 20, 30, 40} becomes {40, 20, 30, 10}.
3. Consider an 1-d array of type int and a pointer pointing variable pointing to the 2nd item of the array. Write down the code for the following: int arr(10) = (5,6,23,4,89,70,12,78,33); int *ptr = arr+1; (a) Print the first item of the array using ptr. (b) Print all prime numbers of the array using value at address. (c) Print the last item of the array using a pointer to an array. You are not allowed to initialize the pointer to the address of the last item. Iterate using a loop to change the value of the pointer. (d) Now print the array in reverse order using a pointer. 101
Q1: Write a program in Java that reads 10 integers and store them in AN ArrayList. Then, do the following : a) Print the ArrayList in the reverse order b) Sort the ArrayList, and display the data after sorting c) Print the largest and the smallest element in the ArrayList
1) Write Java code to declare a two dimensional array of 3 columns and 4 rows. The array will hold doubles. double [][] list = new double [3][4]; What is the array initialized to by default? 2) Write Java code to find the lowest value in a 2 dim array.
2. Implement a function called findMinGap that will return the smallest gap betweenadjacent entries of an integer array. A gap between two numbers is the absolutevalue of their difference. For example, if an array contains the elements {10, 14,-5, -3, 0, 5, 7}, the minimum gap is 2 (between -5 and -3).Title line: int findMinGap(int array[], int length)
Can someone look at my code and tell me why my sequential access was slower than my random access. I thought random was supposed to be slower most of the time. #include <stdio.h> #include <stdlib.h> #include <time.h> #define ARRAY_SIZE (1 << 24) void sequentialAccess(int* array) { for (int i = 0; i < ARRAY_SIZE; ++i) { array[i] += 1; // Accеssing еach еlеmеnt sеquеntially } } void randomAccess(int* array, int stride) { for (int i = 0; i < ARRAY_SIZE; i += stride) { array[i] += 1; // Accеssing еlеmеnts with a spеcifiеd stridе } } int main() { int* largeArray1 = (int*)malloc(ARRAY_SIZE * sizeof(int)); int* largeArray2 = (int*)malloc(ARRAY_SIZE * sizeof(int)); for (int i = 0; i < ARRAY_SIZE; ++i) { largeArray1[i] = i; largeArray2[i] = i; } clock_t startTimeSeq = clock(); sequentialAccess(largeArray1); clock_t endTimeSeq = clock(); clock_t startTimeRand =…
3. Implement a function called findLargestIndex which returns the index of the rowwith the largest sum.ex. int array[3][6] = {{3, 6, 8, 2, 4, 1}, // sum = 24{2, 4, 5, 1, 3, 4}, // sum = 19{1, 0, 9, 0, 1, 0}}; // sum = 11If the findLargestIndex function was called using this array, it would return 0, asit is returning the index of the row, not the sum.Note that the number of columns is required when passing a 2d array to a function.Assume that 2D arrays passed to this function will have 6 columns.Title line: int findLargestIndex(int array[][6], int rows, int columns);
6. Read in two integers n and m (n, m < 50). Read n integers in an array A. Read m integers in anarray B. Then do the following (write separate programs for each, only the reading part iscommon).a) Find if there are any two elements x, y in A and an element z in B, such that x + y = z.b) Copy in another array C all elements that are in both A and B (intersection).c) Copy in another array C all elements that are in either A and B (union).d) Copy in another array C all elements that are in A but not in B (difference).Do In c Program