! Write a program to merge two arrays of 8 elements for each sorted in descending order. For i = 1 To 8 a1(i) = Next i For i = 1 To 8 a2 (i) = InputBox("a2") Next i InputBox("a1") 1-.... a3(i) = a1(i) Next i 2-... 3-.. 4-. Next j For i = 1 To 15 5-....... If a3(i) < a3(k) Then T = a3(i) a3(i) = a3(k) a3(k) = T End If Next k Next i 1-For i = 1 To 16 2-For j = 1 To 8 3-a3 (i) = a2(j) 4-i = i + 1 5-For k = i + 1 To 16 1-For i = 1 To 8 2-For j = 1 To 8 3-a3 (i) = a2 (i+1) 4-i = i + 1 5-For k = i + 1 To 16 1-For i = 1 To 8 2-For j = 1 To 8 3-a3 (i) = a2(j) 4-i = i + 1 5-For k = i + 1 To 16 1-For i = 1 To 8 2-For j = 1 To 8 3-a3(i) = a2(j) 4-i = i + 1 5-For k = i To 16

! Write a program to merge two arrays of 8 elements for each sorted in descending order. For i = 1 To 8 a1(i) = Next i For i = 1 To 8 a2 (i) = InputBox("a2") Next i InputBox("a1") 1-.... a3(i) = a1(i) Next i 2-... 3-.. 4-. Next j For i = 1 To 15 5-....... If a3(i) < a3(k) Then T = a3(i) a3(i) = a3(k) a3(k) = T End If Next k Next i 1-For i = 1 To 16 2-For j = 1 To 8 3-a3 (i) = a2(j) 4-i = i + 1 5-For k = i + 1 To 16 1-For i = 1 To 8 2-For j = 1 To 8 3-a3 (i) = a2 (i+1) 4-i = i + 1 5-For k = i + 1 To 16 1-For i = 1 To 8 2-For j = 1 To 8 3-a3 (i) = a2(j) 4-i = i + 1 5-For k = i + 1 To 16 1-For i = 1 To 8 2-For j = 1 To 8 3-a3(i) = a2(j) 4-i = i + 1 5-For k = i To 16

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: Implement a mergeUniqueValues(arr1, arr2) method. When passed two arrays of strings, it willreturn an array containing the strings that appear in either or both arrays in sorted order. And the returnedarray should have no duplicates.For example, if you have two string arrays:arr1: {“Bear”, “Elephant”,”Fox”}arr2: {“Panda”, “Elephant”,”Eagle”}Calling mergeUniqueValues(arr1, arr2) should return a merged and sorted array like:Bear, Eagle, Elephant, Fox, Panda must include a try catch statement
Q1. Implement a SnapshotArray that supports the following interface: SnapshotArray(int length) initializes an array-like data structure with the given length. Initially, each element equals 0. void set(index, val) sets the element at the given index to be equal to val. int snap() takes a snapshot of the array and returns the snap_id: the total number of times we called snap() minus 1. int get(index, snap_id) returns the value at the given index, at the time we took the snapshot with the given snap_id Example 1: Input: ["SnapshotArray","set","snap","set","get"] [[3],[0,5],[],[0,6],[0,0]] Output: [null,null,0,null,5] Explanation: SnapshotArray snapshotArr = new SnapshotArray(3); // set the length to be 3 snapshotArr.set(0,5); // Set array[0] = 5 snapshotArr.snap(); // Take a snapshot, return snap_id = 0 snapshotArr.set(0,6); snapshotArr.get(0,0); // Get the value of array[0] with snap_id = 0, return 5..
For this project you will be implementing a new data structure called LinkedGrid. This is a linked type data structure version of a 2D array. The LinkedGrid can support any combination of dimensions (n x n, n x m, or m x n, where n > m) This data structure has a singly linked system which allows you to traverse the grid in multiple directions in addition to allowing you to retrieve specific rows and columns. The following diagram gives a rough visual of this data structure. NOTE: Your LinkedGrid MUST work with any number of nodes, the picture only shows twelve as an idea. You may not hardcode only twelve nodes... There should be no public functions other than the ones given to you You may implement any other private functions you feel are necessary to help you implement the given constructors / public functions Complete ALL methods with "TO DO" in LinkedGrid.java import java.util.ArrayList; public class LinkedGrid<E>{private int numRows;private int numCols; private…
JAVA PROGRAMMING Write a generic printArray shown in the sample below. Array contains: <value> <value>.... <valueN>
Let A={1,2,3...,10}. How many subsets B of A where B = │4│and the smallest element in B is 4? Write a computer program or develop an algorithm that lists all subsets according to the part (a). (Please display the all subsets).
Write a for loop to print all elements in courseGrades, following each element with a space (including the last). Print forwards, then backwards. End each loop with a newline. Ex: If courseGrades = {7, 9, 11, 10}, print:7 9 11 10 10 11 9 7 Hint: Use two for loops. Second loop starts with i = NUM_VALS - 1. Note: These activities may test code with different test values. This activity will perform two tests, both with a 4-element array (int courseGrades[4]). Also note: If the submitted code tries to access an invalid array element, such as courseGrades[9] for a 4-element array, the test may generate strange results. Or the test may crash and report "Program end never reached", in which case the system doesn't print the test case that caused the reported message. #include <iostream>using namespace std; int main() { const int NUM_VALS = 4; int courseGrades[NUM_VALS]; int i; for (i = 0; i < NUM_VALS; ++i) { cin >> courseGrades[i]; } /* Your solution goes…
Write a for loop to print all elements in courseGrades, following each element with a space (including the last). Print forwards, then backwards. End each loop with a newline. Ex: If courseGrades = {7, 9, 11, 10), print: 7 9 11 10 10 11 9 7 Hint: Use two for loops. Second loop starts with i = NUM_VALS - 1. Note: These activities may test code with different test values. This activity will perform two tests, both with a 4-element array (int courseGrades[4]). Also note: If the submitted code tries to access an invalid array element, such as courseGrades[9] for a 4-element array, the test may generate strange results. Or the test may crash and report "Program end never reached", in which case the system doesn't print the test case that caused the reported message. 1 #include HNm in 10 m DO G 2 3 int main(void) { 4 5 6 const int NUM_VALS = 4; int courseGrades [NUM_VALS]; int i; 7 8 for (i = 0; i < NUM_VALS; ++i) { scanf("%d", &(courseGrades[i])); 9 } 10 11 12 13 14 15 } /*Your solution…
Write a for loop to print all elements in courseGrades, following each element with a space (including the last). Print forwards, then backwards. End each loop with a newline. Ex: If courseGrades = {7, 9, 11, 10}, print: 7 9 11 10 10 11 9 7 import java.util.Scanner; public class CourseGradePrinter {public static void main (String [] args) {Scanner scnr = new Scanner(System.in);final int NUM_VALS = 4;int [] courseGrades = new int[NUM_VALS];int i; for (i = 0; i < courseGrades.length; ++i) {courseGrades[i] = scnr.nextInt();} /* Your solution goes here */ P.S. The answer came out wrong the first try 7 9 11 10 10 11 9 7Enter
def strPattern(mystr): lenght = len(mystr) mystr1 = "" for i in range(lenght - 1): mystr1 = mystr1 + mystr[i].upper() + str(i + 1) if lenght == 0: return mystr1 return mystr1 + mystr[-1].upper() s = input("enter a word: ") print(strPattern(s)) s = input("enter a word: ") EOFError: EOF when reading a line how can i fix this error
In C++, write a program that outputs the nodes of a graph in a breadth first traversal. Data File: Please use this data file. Text to copy: 100 1 3 -9991 4 -9992 5 -9993 2 -9994 -9995 7 8 -9996 4 7 -9997 -9998 -9999 7 8 -999 Diagram: Also, please take a look at the attached figure on and calculate the weights for the following edges: 0 -> 1 -> 4 0 -> 3 -> 2 -> 5 -> 7 0 -> 3 -> 2 -> 5 -> 8 6 -> 4 6 -> 7 9 -> 7 9 -> 8 To calculates these weights, please assume the following data: 0 -> 1 = 1 0 -> 3 = 2 1 -> 4 = 3 3 -> 2 = 4 2 -> 5 = 5 5 -> 7 = 6 5 -> 8 = 7 6 -> 4 = 8 6 -> 7 = 9 9 -> 7 = 10 9 -> 8 = 11
Write a method public static boolean insertAfter (int value, int target, ArrayList data) 1. seraches for target 2. if there is such element insert new element value after target and return true 3. otherwise return false
Write a program that will take this dictionary: gradePoints = {"A":4,"B":3,"C":2,"D":1,"F":0} and this list: courseList = ["CST 161","Mat 144","ENG 201","PSY 101","HIS 101"] and randomly use elements from each of these lists : gradeList = ["A","B","C","D","F"] creditList = [3,4] and produce a grade point average.