Q2. What is the output of the following code?int a[ ] = {1, 1, 2, 3, 5, 8, 13, 21};for (int n = 0; n < 5; n++)a[n]a[n+1] = a[n+2];a[n+2]a[n+3]a[n+1];= a[n+3];a[n] + a[n+1] + a[n+2];}System.out.println (a[7]);

import java.util.*;public class Main{ public static void main(String []args) {…

Answered: int a[ ] = {1, 1, 2, 3, 5, 8, 13, 21};…

int a[ ] = {1, 1, 2, 3, 5, 8, 13, 21}; for (int n = 0; n < 5; n++) { = a[n+1]; a[n] a[n+1] = a[n+2]; a[n+2] a[n+3] %3D = a[n+3]; = a[n] + a[n+1] + a[n+2]; %3D } System.out.println (a[7]);

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

Java program In main method: Create 2-D Array, called m: the row size of array m is 15 ask user to input column size of array m fill all array elements as double numbers in the range of (7.0, 17.0) by using random object create 2-d array, called double [][]md = {{1,1,1},{2,0,1},{4,7,4}}; pass the above array m and md to call the following two methods MaxCol(m); MaxCol(md); System.out.println (“the average of array m is: ” + returnLast3RowAvg(m)); System.out.println (“the average of array md is: ” + returnLast3RowAvg(md)); Print out the largest column sum, and the average of the last 3 rows of array m and md. In MaxCol(double[][]array) method, find and print the largest column sum in the array. In returnLast3RowAvg(double[][]array) method, find the average of the elements in the last 3 rows in the array and return this average value.
Write the code in Java language
JAVA language, please add test screenshot public static int[] makeIntoPalindrome(int[] arr) Makes a palindrome from a given array by appending the smallest possible number of elements. For example, makeIntoPalindrome([1, 3, 7]) returns [1, 3, 7, 3, 1] makeIntoPalindrome([5, 4, 1, 3, 3, 1]) returns [5, 4, 1, 3, 3, 1, 4, 5] makeIntoPalindrome([1, 3, 3, 1]) returns [1, 3, 3, 1] makeIntoPalindrome([1, 4, 3, 2]) should return [1, 4, 3, 2, 3, 4, 1]. Parameters: arr - an array Returns: a new array that is a palindrome obtained by appending the fewest number of elements onto arr
Background for Question 14-20: Below is a bubble sort program that sorts the elements in an array. static void bubbleSort(int[] arr) { int n = arr.length; int temp = 0; for (int i=0; i arr[i]) { temp = arr[j - 1]; arr[j - 1] = arr[j]; arr[j] = temp: 1. Based on the program above, please draw a control flow graph for it. 1. In your control flow graph, what are the test requirements for edge coverage? 1. List test path(s) that achieves the edge coverage. 1. Provide test cases for each test path you list in the previous question. If it is not possible to find the test input for certain test path, describe the reason. 1. In your control flow graph, what are the test requirements for edge-pair coverage? 1. List test paths that achieve the edge-pair coverage 1. Provide test cases for each test path you list in the previous question. If it is not possible to find the test input for certain test path, describe the reason.
Consider the Insertion Sort Function below:public static void insertionSort(int array[]){ int n = array.length; for (int j = 1; j < n; j++) { int key = array[j]; int i = j-1; while ( (i > -1) && ( array [i] > key ) ) { array [i+1] = array [i]; i--; } array[i+1] = key;} }Discuss when is its best case, and worst case performance.
Reverse the order of a n-element array in C What am I doing incorrectly and how can I fix? My code: #include <stdio.h> sort(int *p, int m) { //Write your code here for(int i = 0; i<n/2; i++){ temp = arr[i]; arr[i] = arr[n-i-1]; arr[n-i-1] = temp; } } main(){ int i, n; int *p, num[20]; printf("input n:"); scanf("%d", &n); printf("please input these numbers:\n"); for (i = 0; i < n; i++) scanf("%d", &num[i]); p = &num[0]; sort(p, n); printf("Now, the sequence is:\n"); for (i = 0; i < n; i++) printf("%d ", num[i]); }
PROBLE. ). Make a diagram of memory for point one. int a[ ] int b[ ] = {40, 50, 60}; int c[ ] = {70, 80, 90}; {10, 20, 30}; void f(int **p) { p[1] [2] += 1; (*p) [1] += 2; *p[1] += 3; * (p[1]) += 4; //------- ---point one int main(void) { int *d[ ] = {a, b, c}; f (d); return 0; }
Background for Question 14-20: Below is a bubble sort program that sorts the elements in an array. static void bubbleSort(int] arr) { int n = arr.length; int temp = 0; for (int i = 0; i arr[]) { temp = arrj - 1]: arrj - 1] = arr[i]: arrj) = temp; } } Based on the program above, please draw a control flow graph for it. In your control flow graph, what are the test requirements for edge coverage? 2. 1. List test path(s) that achieves the edge coverage. 3. Provide test cases for each test path you list in the previous question. If it is not possible to find the test input for certain test path, describe the reason. 4. In your control flow graph, what are the test requirements for edge-pair coverage? 5. List test paths that achieve the edge-pair coverag. 6. Provide test cases for each test path you list in the previous question. If it is not possible to find the test input for certain test path, describe the reason.
Choose the missing statements to generate A array of 4x4 elements
C++.Write a function, named SecondNegative, that takes a const reference to a vector of doubles, it should return an const_iterator to the element in the vector that is the second value that is negative. If no such element exists, have the iterator point to one past the end.