/* how many time are the if conditions executed? */ public static void fw (int[] [] G) { int n G.length; // G is a square array for(int i=0; i G[j] [i] + G[i] [k]) { G[j] [k] = G[j] [i] + G[i] [k]; } /* how would you describe the runtime of the above code? */

/* how many time are the if conditions executed? / public static void fw (int[] [] G) { int n G.length; // G is a square array for(int i=0; i G[j] [i] + G[i] [k]) { G[j] [k] = G[j] [i] + G[i] [k]; } / how would you describe the runtime of the above code? */

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

Given that integer array x has elements 4, 7, 3, 0, 8, what are the elements after the loop? inti;for (i = 0; i < 4; ++i) {x[i] = x[i + 1];} a. 4, 4, 7, 3, 0 b. 7, 3, 0, 8, 8 c. 7, 3, 0, 8, 4 d. Error: Invalid access JAVA
in java Create two arrays with same length n: - Array A with integer numbers that user will insert- Array B with random numbers from 0 to 100.- Find sum of both arrays,- Find maximum values of both array and compare them: .if maximum of 1 st is lower then maximum of 2nd array: print sums of both arrays.if maximum of 1st is greater then maximum of 2nd array print 2nd array (use println)otherwise print first array in reverse.
Given two arrays that are full of integers, recursively merge these two arrays into one large array. The large array should have items from the first array in even indices (0,2,4 ...) and items from the second array in odd indices (1,3,5 ...). Only use recursion to complete this task. You cannot change the method header. public void mergeArrays(int[] arrayOne, int[] arrayTwo, int[] mergedArray){ // Your code here }
import java.util.Scanner; public class ModifyArray { public swapArrayEnds(10, 20, 30, 40) { for (i = 0; i < (arrVals.length / 2); ++i) { tempValue = arrVals[i]; // Do swap //*please fix code// arrVals[i] = arrVals[arrVals.length - 1 - i]; arrVals[arrVals.length - 1 - i] = tempValue; 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}. public static void main (String [] args) { Scanner scnr = new Scanner(System.in); int numElem = 4; int[] sortArray = new int[numElem]; int i; int userNum; for (i = 0; i < sortArray.length; ++i) { sortArray[i] = scnr.nextInt(); } swapArrayEnds(sortArray); for (i = 0; i < sortArray.length; ++i) { System.out.print(sortArray[i]); System.out.print(" "); } System.out.println(""); }}
Find a duplicate (20 points). Write a program FindDuplicate.java that reads n integer arguments from the command line into an integer array of length n, where each value is between is 1 and n, and displays true if there are any duplicate values, false otherwise. java FindDuplicate 2 10 8 5 4 1 3 6 7 9 false java FindDuplicate 4 5 2 1 2 true
(in Java language) Write a method that is inspired by a photo app that does the following. Ask the user to enter a size of array between 2 to 10. Based on the size entered, write a loop which asks the user to fill values into an integer array. Print the array contents using Arrays.toString(). For this integer array, write a logic that returns true if there exists a place to split the array such that the sum of the numbers on one side is equal to the sum of the numbers on the other. Otherwise return false. Examples: If the array is {1, 1, 1, 2, 1} then return true. If the array is {2, 1, 1, 2, 1} then return false If the array is {10, 10} then return true.
In Java Write an application that inputs five numbers, each between 10 and 100, inclusive. As each number is read, display it only if it’s not a duplicate of a number already read. Provide for the “worst case,” in which all five numbers are different. Use the smallest possible array to solve this problem. Display the complete set of unique values input after the user enters each new value. Rough output in screenshot
(IN JAVA) Write a method which does the following: Ask the user to enter a size of array between 2 to 10. Based on the size entered, write a loop which asks the user to fill values into an integer array. Print the array contents using Arrays.toString(). For this integer array, write a logic that returns true if there exists a place to split the array such that the sum of the numbers on one side is equal to the sum of the numbers on the other. Otherwise return false. Examples: If the array is {1, 1, 1, 2, 1} then return true. If the array is {2, 1, 1, 2, 1} then return false If the array is {10, 10} then return true.
Write a method that returns a new array by eliminating theduplicate values in the array using the following method header:public static int[] eliminateDuplicates(int[] list)Write a test program that reads in 10 integers, invokes the method, and displaysthe distinct numbers separated by exactly one space. Here is a sample run of theprogram: Enter 10 numbers: 1 2 3 2 1 6 3 4 5 2 ↵EnterThe distinct numbers are: 1 2 3 6 4 5
code: import java.util.Random;import java.util.ArrayList;import java.util.Scanner;public class WeekendOrders {/*** * This method takes as input the scanner instance created from main and* asks the user for input on the number of orders placed on each of the * days on the long weekend (Saturday, Sunday, and Monday). * Put the number of orders for each day in an array of fixed size* * * @param scnr (an instance of Scanner)* @return an array of int which includes the number of orders* placed on each day, with one day per index of the array*/public static int[] getUserInput(Scanner scnr){// DO NOT MODIFY THIS LINEint[] userInput = new int[3];// TODO: Prompt user for input on number of orders on each day// and store in userInputreturn userInput; }/*** * This method appends all the new orders for the given day onto the * arraylist. It first generates a random int between 0-2 (inclusive).* If the int is 0: it adds "Burger" to the prevOrders list* If the int is 1: it adds "Fries" to the…
. Now take any name from the user, find whether that name is present in that array or not, and print the position of that name in the array if found. Write a search method to sequentially search the name from the array. Invoke the search method from the main method. The array and the name to be searched should be passed into the search method as parameters.Now write a Java program to implement binary search for the above problem.[Hint: You can use equals() and compareTo() methods of String class.]
briefly comment the code#include <stdio.h>#include <stdlib.h>/* ADJACENCY MATRIX int source,V,E,time,visited[20],G[20][20];void DFS(int i){int j;visited[i]=1;printf(" %d->",i+1);for(j=0;j<V;j++){if(G[i][j]==1&&visited[j]==0)DFS(j);}}int main(){int i,j,v1,v2;printf("\t\t\tGraphs\n");printf("Enter the no of edges:");scanf("%d",&E);printf("Enter the no of vertices:");scanf("%d",&V);for(i=0;i<V;i++){for(j=0;j<V;j++)G[i][j]=0;}/* creating edges :P */for(i=0;i<E;i++){printf("Enter the edges (format: V1 V2) : ");scanf("%d%d",&v1,&v2);G[v1-1][v2-1]=1; } for(i=0;i<V;i++){for(j=0;j<V;j++)printf(" %d ",G[i][j]);printf("\n");}printf("Enter the source: ");scanf("%d",&source);DFS(source-1);return 0;}