i. Design an algorithm that takes two arrays, and returns true if the arrays are disjoint, i.e. have no elements in common. Use standard data structures and algorithm in your solution without having to explain how they are implemented. Write down your algorithm as pseudocode. You don't need to write Java code but be precise so that a competent programmer should be able to take your description and easily implement it. Your algorithm should take Qln log m) time, where n is the size of the larger array and m is the size of the smaller array. Since n2m, this is the same as Q(n log m + m log m). ii. Describe why it is a bad idea to implement a linked list version a queue which uses the head of the list as the rear of the queue. iii. Demonstrate a situation where storing items in an array is clearly better than storing items on a linked list. Give an example. :

i. Design an algorithm that takes two arrays, and returns true if the arrays are disjoint, i.e. have no elements in common. Use standard data structures and algorithm in your solution without having to explain how they are implemented. Write down your algorithm as pseudocode. You don't need to write Java code but be precise so that a competent programmer should be able to take your description and easily implement it. Your algorithm should take Qln log m) time, where n is the size of the larger array and m is the size of the smaller array. Since n2m, this is the same as Q(n log m + m log m). ii. Describe why it is a bad idea to implement a linked list version a queue which uses the head of the list as the rear of the queue. iii. Demonstrate a situation where storing items in an array is clearly better than storing items on a linked list. Give an example. :

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

Write a program in java using two dimensional arrays. You should prompt the user toenter the number of rows and columns for your matrix. You should then prompt the userto enter values for each element of the matrix. Once the user has provided all the values for matrix, you should print the matrix and transpose of that matrix. A transpose of a matrix converts rows to columns and columns to rows.Example:Output: This program transposes a matrix.Output: Please enter the number of rows:User enters 2Output: Please enter the number of columns:User enters 3Enter value for row[0] column[0]: 9Enter value for row[0] column[1]: 1Enter value for row[0] column[2]: 2Enter value for row[1] column[0]: 72Enter value for row[1] column[1]: 3Enter value for row[1] column[2]: 6The matrix you entered is:9 1 272 3 6The transpose of this matrix has 3 rows and 2 columns and the transpose is:9 721 32 6
Develop python program of function randomArray(m, n) that takes two integers as argument and returns a 2D m-by-n array with random elements in it. Develop python program of function adder(a1, a2) that reads two 2D arrays of the same size and returns an array that is the summation of a1 and a2. To add the two arrays, you need to add their elements, correspondingly. Develop a python program of function inverseArray(a) that takes a 2D-array as argument and inverses the array. You will need to inverse the rows, first and then inverse the columns, next. For instance, if the array = [[2, 3, 4], [5, 6, 7]], the inverse will be = [[7, 6, 5], [4, 3, 2]]
Write a recursive function that adds all the elements in an array. The function will take two arguments, 1) An integer value that is greater than 0 and indicates the size of the array, and 2) An integer array of that size. The function should return an integer value that is the sum of the elements in the array. The function should add elements of the input array using recursion and should not use a loop.ii) Read both a string and the key (integer) is entered through the keyboard. Define a function to encrypt each and every character in a string with the given key. As a programmer, implement the same by writing the C code using pointers. If the given Key is positive, then traverse towards left of the character in the Alphabet sequence. Otherwise, move traverse towards the right of the character in the Alphabet sequence. Example : if the given string is "PRADEEP" and Key = 3 then the encrypted string is "SUDGHHS" iii) An ISBN (International Standard Book Number) is a 10 digit number…
I need the code from start to end with no errors and the explanation for the code ObjectivesJava refresher (including file I/O)Use recursionDescriptionFor this project, you get to write a maze solver. A maze is a two dimensional array of chars. Walls are represented as '#'s and ' ' are empty squares. The maze entrance is always in the first row, second column (and will always be an empty square). There will be zero or more exits along the outside perimeter. To be considered an exit, it must be reachable from the entrance. The entrance is not an exit.Here are some example mazes:mazeA7 9# # ###### # # ## # # #### # ## ##### ## ########## RequirementsWrite a MazeSolver class in Java. This program needs to prompt the user for a maze filename and then explore the maze. Display how many exits were found and the positions (not indices) of the valid exits. Your program can display the valid exits found in any order. See the examples below for exact output requirements. Also, record…
Write a recursive function to sort an array of integers into ascending order using the following idea: the function must place the smallest element in the first position, then sort the rest of the array by a recursive call. This is a recursive version of the selection sort. (Note: You will probably want to call an auxiliary function that finds the index of the smallest item in the array. Make sure that the sorting function itself is recursive. Any auxiliary function that you use may be either recursive or iterative.) Embed your sort function in a driver program to test it. Turn in the entire program and the output.
Use the example exe located here to create the pseudo code or flow chart that would represent the logic of the program. You must use an array to store each student's average. You must use looping (for or while, your choice) where appropriate (there will be many instances). Make sure you follow structured programming principles. Run the exe as much as needed on your computer to see how it works and examine the output file. You can answer most of your questions if you use the example file. There are several ways this can be done but the following must be incorporated. Input: Number of students (min 1, max 10) Number of grades for each student (min 1, max 10) The number of points each assignment is worth Enter each student's grade for each assignment Output: Total possible worth of all assignments At the end, the average for each student (must use array) written to screen At the end, the average for each student (must use array) written to the file StudentAverages.txt (example…
Problem2: A square matrix can be represented by a two-dimensionalarray with N rows and N columns. You may assume a maximum size of 50 rows and 50 columns. 1. Write an algorithm MakeEmpty(n), which sets the first n rows and n columns to zero. 2. Write an algorithm Add(M1, M2, M3), which adds two matrices M1 and M2 together to produce matrix M3. 3. Write an algorithm Subtract(M1, M2, M3), which subtracts matrix M2 from matrix M1 to produce matrix M3. 4. Write an algorithm Copy(M1, M2), which copies matrix M1 into matrix M2.
READY CAREFULLY Java add COMMENT TO CODE, please TEST-CASE on how you would test your solution assumptions and hence your code. Example of cases to be tested for are like : What if the array input which is expected does not exist - that is , input is a null. How should your code handle such a situation ? Maybe output some message like "Null input case, so no output"? What if the length of the array is one ?....so on and so forth. In this assignment you are required programs which takes as input two sorted arrays and returns a new array containing the elements found in both the sorted arrays. It is alright if the input arrays have duplicates, but the returned array should be duplicate free! Below is how the arrays are represented ARRAY1[] = [1, 5, 6, 6, 9, 9, 9, 11, 11, 21] Here length of ARRAY1 is m. ARRAY2[] = [6, 6, 9, 11, 21, 21, 21] Here length of ARRAY2 is n. Array to be returned would be: ARRAY[] = [6, 9, 11, 21] ANSWER THE QUESTION BELOW. Implement the function…
Please help me to solve the error in the following java code. The question requirement is to merge k arrays into a single sorted array, the output should be: (Winnie, 0), (Eason Chan, 40), (Gloria Tang, 60), (Andy Lau, 60), (McDull, 60), (Denise Ho, 60), (Jennifer Chan, 70), (Joey Yung, 80), (Kay Tse, 90), (Mickey, 90), (Jacky Cheung, 95), (Teddy, 95), (Anita Mui, 100), (Peppa, 100) import java.util.*;import java.util.Arrays; public class StableMerger { static class Student { String name; double grade; public Student(String n, double g) { name = n; grade = g; } public String toString() { return "(" + name + ", " + grade + ")"; } } public static Student[] merge(Student[][] a) { //↓↓↓↓↓↓error code↓↓↓↓↓↓ PriorityQueue<Student> queue = new PriorityQueue<Student>(); int total=0; //add arrays to heap for (int i = 0; i < a.length; i++) {…