Sample Input/Output: Depicted below are sample outputs when the program is executed (the items in bold characters are input from the user, while the items in bold italic are generated, calculated and printed by the program): Input the number of elements: 3 List B 30 List A 21 50 List C 630 500 10 25 10 250 Input the number of elements: 5 List A 31 List B 13 List C 403 21 30 10 41 630 500 2460 50 60 25 10 250 Required: The java file (FamilyName_List.java) containing the code and 2 image files (Samplel and Sample2) containing different sample input/output of the program.

Sample Input/Output: Depicted below are sample outputs when the program is executed (the items in bold characters are input from the user, while the items in bold italic are generated, calculated and printed by the program): Input the number of elements: 3 List B 30 List A 21 50 List C 630 500 10 25 10 250 Input the number of elements: 5 List A 31 List B 13 List C 403 21 30 10 41 630 500 2460 50 60 25 10 250 Required: The java file (FamilyName_List.java) containing the code and 2 image files (Samplel and Sample2) containing different sample input/output of the program.

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

3. Write a program to find intersection of two sorted array.For example, if the two sorted arrays as input are {21, 34, 41, 22, 35} and {61, 34, 45, 21, 11}, it should returnan intersection array with numbers {34, 21}. For the sake of this Problem, you can assume that numbers ineach integer array are unique.
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).c programm please tell all the answer
Consider 2 integer arrays, x and y, each with size equal to 10.Initialize array x with random numbers between 1 and 100.Write code that fills array y with values such that each element of y is the corresponding valueof x multiplied by its index.
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
1. Write a program to input a list of names (strings) from the user and store them in an ArrayList. The input can be terminated by entering the empty string or byentering the string “quit”. 2. Add further functionality to your program so that it searches the ArrayList to find the first string and the last string according to dictionary ordering and then prints out these strings (names). Do this exercise without sorting the names in the ArrayList. For example, if the list contains the following names: Charles Darwin Albert Einstein Issac Newton Tony Hoare Grace Hopper Edgar Dijkstra Ada Lovelace Charles Babbage Stephen Hawking Your program should output:The first name in the list in alphabetical order is: Ada Lovelace The last name in the list in alphabetical order is: Tony Hoare
Java Code 2. Search and Rescue by CodeChum Admin Make a program that will accept an integer and loop for the same number of times as that of the inputted integer and input random integers and add it to the array/list one by one, per line. Afterwards, make your program accept another random integer. Using that final integer, compare from your array/list if the final integer's value is also present in your current array/list. If so, print "Present"; otherwise, print "None". Start coding now! Input The first line contains the size of the array/list. The next lines contain the integers. The last line contains an integer to be searched. 5 3 21 2 5 23 2 Output A line containing a string. Present
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
9.1.1: Output numbers in reverse. Write a program that reads a list of 10 integers, and outputs those integers in reverse. For coding simplicity, follow each output integer by a space, including the last one. Then, output a newline. Ex: If the input is 2 4 6 8 10 12 14 16 18 20, the output is: 20 18 16 14 12 10 8 6 4 2 To achieve the above, first, read the integers into an array. Then output the array in reverse. CODES in Coral Language
I need this program in java please. #Given Arrayarray=[1,1,1,2,2,2,2,2,4,5,5,6,6,6] #Insert valuevalue=3 index=0for x in array: if value<x: #inserting to the array in the position index array.insert(index,value) print ("Output :",array) break #Incrementing position by 1 index=index+1
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)
Consider two arrays of Different sizes are given and your task is to multiply corresponding elements and store it into the result array and print the result array.
Java Program. Write a function that returns the index of the smallest element in an array of doubles. If there are more such elements than one, return the last index is fine. Using the following header: int IndexOfSmallestArray(double array[], int size) Finish the function implement only.