Nhat are the values of mynum[0], mynum [1], and mynum[2] after the following code executes? double[] mynum = new double[3]; double start = 1.5; for (double i : mynum) { i = start; %3D start += 10.5; а. 0.0 0.0 0.0 p. 1.5 c. 1.5 d. 22.5 e. Nothing will print due to an out of bounds error 12.0 22.5 1.5 1.5 22.5 22.5

Nhat are the values of mynum[0], mynum [1], and mynum[2] after the following code executes? double[] mynum = new double[3]; double start = 1.5; for (double i : mynum) { i = start; %3D start += 10.5; а. 0.0 0.0 0.0 p. 1.5 c. 1.5 d. 22.5 e. Nothing will print due to an out of bounds error 12.0 22.5 1.5 1.5 22.5 22.5

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:Use the "natural split" algorithm on the file split.txt and answer the following question: How many elements are in the first list? (Split into two files.) Splt.txt 200494 774 644 345 521 61 27 28 584 569 66 857 210 2 211 675 548 596 188 647 671 517 408 475 615 113 731 522 850 17 640 940 556 517 602 935 76 578 880 428 168 394 381 497 247 368 137 138 619 973 895 106 838 45 921 800 681 660 490 427 937 917 786 959 152 604 837 749 684 963 926 963 988 492 385 458 788 7 62 46 932 996 787 634 34 616 71 128 686 578 923 532 933 545 100 224 895 595 342 933 934 797 120 565 495 884 237 648 843 599 157 843 192 279 301 649 382 881 667 178 126 746 44 601 22 52 769 708 991 83 447 786 525 168 328 922 153 367 22 689 834 774 93 110 547 597 644 726 237 20 370 573 391 225 750 897 956 839 951 455 8 509 746 338 576 276 277 341 274 891 723 53 966 271 50 990 493 823 833 306 619 461 768 832 736 759 920 451 549 833 911 123 907 225 252 179 177 272 747 859
Please answer it in Python Write a function pairsbypairslist that would return pair by pair from the smallest value to the biggest value For example [12, 13, 11, 15], # return : (11, 12) and (13, 15) [9, 15, 4, 24, 19, 2] # return : (2,4) (9,15) (19,24) [1, 5, 9, 15, 21, 9, 12, 9], # return : (1,5) (9,9) (9,12) (15,21)
Write a program in C/C++ that reads N number of nonnegative decimal numbers from a user and creates a hash table to store the numbers. The output of the program displays the order of the numbers in the hash table. The program then prompts the user to enter a target value. The program searches the target value to the hash table, and displays the search outcome. For simplicity, let’s assume that N = 6 and the size of the hash table is 10. Use this hash function in your code h(k) = 2k+3 where k is the key value. Use linear probe method for collision resolution. Example test run Test Run 1: Enter 6 elements: 3 2 9 6 11 13 Hash table order: 13 9 - - - 6 11 2 - 3 Enter the target: 1111 is located at index: 6 Test Run 2: Enter 6 elements: 3 2 9 6 11 13 Hash table order: 13 9 - - - 6 11 2 - 3 Enter the target: 1515 is not in the table
What is printed as a result of executing the following code segment? List list1 = new ArrayList(); list1.add(new Integer(1)); list1.add(new Integer(2)); list1.add(new Integer(3)); list1.set(2, new Integer(4)); list1.add(2, new Integer(5)); list1.add(new Integer(6)); System.out.println(list1); [1, 5, 2, 4, 6] [1, 2, 4, 5, 6] [1, 2, 3, 4, 5] [1, 2, 5, 4, 6]
Write a program that benchmarks QuickSort and InsertionSort. You should use at least 5 different data sets and record the performance of each algorithm on the same sets under the same conditions. Write a short report that compares the two algorithms based your results. It is important to include a discussion of the initial states of the data sets in your report. language Java public class week3 {public static void main(String args[]){ //========================================================== //Question 1 testing //================== // Comment on benchmarking for Q1 results // // //========================================================== } static void quickSort(int f[], int p, int q){ if(q-p <= 1) ; //skip else{ int x; int i, j, k; // let x = middle element in f[p..q-1] x = f[(p+q)/2]; //x = f[p]; i = p; j = p; k = q; while(j != k){ if(f[j] == x) j = j + 1; else if(f[j] < x){ //swap f[j] with f[i] int temp; temp = f[j]; f[j] = f[i]; f[i] = temp; j = j + 1; i = i + 1; } else{…
Code Example 18-21. import tkinter as tk2. from tkinter import ttk3. class TipCalcFrame(ttk.Frame):4. def __init__(self, parent):5. ttk.Frame.__init__(self, parent, padding="20 20 20 20")6. self.pack()7. self.mealCost = tk.StringVar()8. self.tipPercent = tk.StringVar()9. self.tipAmount = tk.StringVar()10. ttk.Label(self, text="Cost of your meal:").grid( column=0, row=0, sticky=tk.E)11. ttk.Entry(self, width=30, textvariable=self.mealCost).grid( column=1, row=0)12. ttk.Label(self, text="Percent to leave as a tip:").grid( column=0, row=1, sticky=tk.E)13. ttk.Entry(self, width=30, textvariable=self.tipPercent).grid( column=1, row=1)14. ttk.Label(self, text="Tip amount:").grid( column=0, row=2, sticky=tk.E)15. ttk.Entry(self, width=30, textvariable=self.tipAmount,…
Code Example 18-21. import tkinter as tk2. from tkinter import ttk3. class TipCalcFrame(ttk.Frame):4. def __init__(self, parent):5. ttk.Frame.__init__(self, parent, padding="20 20 20 20")6. self.pack()7. self.mealCost = tk.StringVar()8. self.tipPercent = tk.StringVar()9. self.tipAmount = tk.StringVar()10. ttk.Label(self, text="Cost of your meal:").grid( column=0, row=0, sticky=tk.E)11. ttk.Entry(self, width=30, textvariable=self.mealCost).grid( column=1, row=0)12. ttk.Label(self, text="Percent to leave as a tip:").grid( column=0, row=1, sticky=tk.E)13. ttk.Entry(self, width=30, textvariable=self.tipPercent).grid( column=1, row=1)14. ttk.Label(self, text="Tip amount:").grid( column=0, row=2, sticky=tk.E)15. ttk.Entry(self, width=30, textvariable=self.tipAmount,…
Code Example 18-21. import tkinter as tk2. from tkinter import ttk3. class TipCalcFrame(ttk.Frame):4. def __init__(self, parent):5. ttk.Frame.__init__(self, parent, padding="20 20 20 20")6. self.pack()7. self.mealCost = tk.StringVar()8. self.tipPercent = tk.StringVar()9. self.tipAmount = tk.StringVar()10. ttk.Label(self, text="Cost of your meal:").grid( column=0, row=0, sticky=tk.E)11. ttk.Entry(self, width=30, textvariable=self.mealCost).grid( column=1, row=0)12. ttk.Label(self, text="Percent to leave as a tip:").grid( column=0, row=1, sticky=tk.E)13. ttk.Entry(self, width=30, textvariable=self.tipPercent).grid( column=1, row=1)14. ttk.Label(self, text="Tip amount:").grid( column=0, row=2, sticky=tk.E)15. ttk.Entry(self, width=30, textvariable=self.tipAmount,…
Hello The java function belw is generating a NullPointerException. How can I improve it? public int quadraticProbing(String[] hashArray, int initial_index, int collision) { int index = (initial_index + (collisions * collisions)) % maxSize; System.out.println("Index " + index); if (index == maxSize) { System.out.println("flag 04"); index = 0; // To wrap around the table } if (hashArray[index] == null) { return index; // We can insert at this location } else { // The index isn't empty so we need to insert the value // at the end of the list } collisions = ++collision; return quadraticProbing(hashArray, initial_index, collision); // Recursive call } Thanks in advance. Respectfully, Emmanuel
Please help me code in java: Write a program that reads two files “Data1.txt”, “Data2.txt”; adding their corresponding elements produces an output file “output.txt”. If the number of elements are not equal, fill the elements of the smaller file up with “0” s. Sample output: Elements of the “Data1.txt”: 3 5 7 8 9 Elements of the “Data2.txt”: 45 11 Elements of the “Output.txt”: 48 16 7 8
Requirements: Please do this in Java Programming Please show screenshots of your work. 10. Write method public static int binarySearch(int[] arr, int target) that return an index of one match of target in arr. If there is no match, return -1. 11. Write a nested for loop statement to print out the multiplication table for numbers 1, 2, .., 9. The output should looks like: 1 x 1 = 1, 1 x 2 = 2, 1 x 3 = 3, 1 x 4 = 4, 1 x 5 = 5, 1 x 6 = 6, 1 x 7 = 7, 1 x 8 = 8, 1 x 9 = 9 2 x 2 = 4, 2 x 3 = 6, .................................................................................., 2 x 9 = 18 3 x 3 = 9, .................................................................................., 3 x 9 = 27 .................................................................................................... 9 x 9 = 81 (Hint: Use System.out.printf to get columns alignment nice and neat) 12. Write a method public static initializeArray(int [] arr) to initialize a given int array named arr with random…
Requirements: Use Java Programming only. Show screenshots of your work. 9. Write method public static int sum(int n) that take a positive integer n as input and return the sum of 1+2+...+n 10. Write method public static int binarySearch(int[] arr, int target) that return an index of one match of target in arr. If there is no match, return -1. 11. Write a nested for loop statement to print out the multiplication table for numbers 1, 2, .., 9. The output should looks like: 1 x 1 = 1, 1 x 2 = 2, 1 x 3 = 3, 1 x 4 = 4, 1 x 5 = 5, 1 x 6 = 6, 1 x 7 = 7, 1 x 8 = 8, 1 x 9 = 9 2 x 2 = 4, 2 x 3 = 6, .................................................................................., 2 x 9 = 18 3 x 3 = 9, .................................................................................., 3 x 9 = 27 .................................................................................................... 9 x 9 = 81 (Hint: Use System.out.printf to get columns alignment nice and neat) 12. Write…