Write applications that perform the following:2.1 Write a program that merges two ordered-list objects of integers into a single ordered listobject of integers. Use the merge method of class ListMerge to receive references to eachof the list objects to be merged and return a reference to the merged list object.2.2 Binary search is an important algorithm used to efficiently locate a target value within asorted sequence of n elements stored in an array. This is among the most important ofcomputer algorithms, and it is the reason that we so often store data in sorted order. Thisalgorithm can be implemented using both the repetition approach and the recursionapproach. In this question, you are required to write two applications to perform the binarysearch using both the repetition approach and the recursion approach to determine theposition of the number 15 in the array made of all multiple of 5 less than 100.2.3 Write an application using a hash table that finds all the pairs of two integers within thebelow array that add up to 12.Array = {4,9,6,13,5,3,2,8}

Required code is implemented in java programming .

Write applications that perform the following: 2.1 Write a program that merges two ordered-list objects of integers into a single ordered list object of integers. Use the merge method of class ListMerge to receive references to each of the list objects to be merged and return a reference to the merged list object.

Write applications that perform the following: 2.1 Write a program that merges two ordered-list objects of integers into a single ordered list object of integers. Use the merge method of class ListMerge to receive references to each of the list objects to be merged and return a reference to the merged list object.

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

Subject-Object oriented programing Write a program which:• creates a new Array List• adds 5 decimal numbers to it• prints the list to the screenb) In the same program, insert an element in the above ArrayList at index 2. The resulting Array Listmust be one element larger. Print the resulting list to the screen.c) In the same program, replace the element in the ArrayList at index 2 by null. Print the resulting list tothe screen.d) In the same program, remove the element at the last index of the Array List. Print the resulting list tothe screen.e) In the same program, use a 'for' loop to print each element of the Array List to the screen.f) Create a class named ArrayListManager. Into this class, code a method which prints to the screenevery element of an Array List of strings placed at an odd index. Hint: use a modulus.
Write the following function that sorts and merges two lists into a new sorted list. The new list contains only even numbers. def myMergeEvenList(list1, list2): Enter list1: 10,5,6,7 Enter list2: 12,8,5,0,1 The merged list is: 0,6,8,10,12
The statement "Linear collection of self-referential class objects, called nodes, connected by pointer links" is best describing a/an 7. O A. data structure B. union O c. array list O D. linked list
Subject-Object oriented programing Write a program which:• creates a new Array List• adds 5 decimal numbers to it• prints the list to the screen In the same program, remove the element at the last index of the Array List. Print the resulting list tothe screen.
Write a function with below starting function: public static void printFirstAnd Last(ArrayList list) The approach should accomplish the following: Print "no elements" if the list is empty. Print the single element in the list if there is only one. Print the first entry in a list with more than one element, followed by a space, and then the last element.
Exercise 1: Write a main program that reads the elements of a 2 x 2 integer matrix, A, from the user. It then performs the following tasks: • prints the matrix row-by-row using a nested looping structure, • adds all matrix elements in row 0 using a looping structure and prints the sum. For example, for matrix, A| [i 3 A[2][2] = 7 9 The Sample Session will be as follows: CA Microsoft Visual Studio Debug Console Enter element at row 0 column 0: 1 Enter element at row e column 1: 3 Enter element at row 1 column 0: 7 Enter element at row 1 column 1: 9 The matrix entered by the user is: 13 7 9 Sum of row 0 elements: 4 C:\Users\User\source\repos \Project1\Debug\Project1.exe (process 52912) exited with code 0. Press any key to close this window
Old MathJax webview Old MathJax webview In Java Some methods of the singly linked list listed below can be implemented efficiently (in different respects) (as opposed to an array or a doubly linked list), others not necessarily which are they and why? b. Implement a function to add an element before the first element. c. Implement a function to add an item after the last one element. d. Implement a function to output an element of the list. e. Implement a function to output the entire list. f. Implement a function to output the number of elements. G. Implement a function to delete an item. H. Implement a function to clear the entire list. I. Implement functionality to search for one or more students by first name, last name, matriculation number or course of study. J. Implement functionality to sort the records of the student, matriculation number and course according to two self-selected sorting methods.
13. Star topology is an arrangement of the network in which every node is connected to the central hub, switch, or central computer. True False 14. Queue is referred to be as First-In-First-Out (FIFO) list. True False 15. Linked list is more suitable data structure than array for a program that requires a lot of insert/erase operations. True False 16. An algorithm of the order O(c") runs faster than a one of the order O(n!), where n is size of input and c is a positive constant. True False 17. The notation O(n) is the formal way to express both the lower bound and the upper bound of an algorithm's running time. True False 18. One of the advantages of File-Based database is separation of data. True False 19. In NOSQL, data is placed in tables, and data schema is perfectly designed before the database is built. True False 20. In ERD representation, derived attributes are depicted by double ellipses. True False
19. Binary Search Implementation Below is an implementation of binary search, but the implementation contains an error. What is the error? 251 def binary_search(array, target): 252 left,right = 0,len(array)-1 while left <= right: mid = left + ((right - left) // 2) if target == array[mid]: 253 254 255% 256 return mid elif target < array[mid]: left = mid + 1 257 258 259 else: 260 right = mid - 1 261 return None Pick ONE option Line 253 should be change to: while left < right Lines 258 and 260 should be switched right should be initialized to len(array) instead of len(array)-1 Nothing is incorrect Clear Selection
In C program language, You are to read 10 numbers from a data file into an array named List. Create another 10 element array named Reverse that is to contain the same items as List but in reverse order. For example, the first element in List will be placed in the last position of Reverse, the second element in List will be placed in the second-to-last position in Reverse, etc. After Reverse has been created, output the contents of both arrays.
def large_rec(m: list[list[int]], r: int, c: int) -> int:"""Do not use any imports, dictionaries, try-except statements or break and continue please you must make use of the helper long here as you loop througheach row of the matrix returns the area of the largest rectangle whose top left corner is atposition r, c in m.>>> case1 = [[1, 0, 1, 0, 0],... [1, 0, 1, 1, 1],... [1, 1, 1, 1, 1],... [1, 0, 0, 1, 0]]>>> largest_at_position(case1, 1, 2)6""" Helper code: def long(lst: list[int]) -> int: count = 0i = 0while i < len(lst) and lst[i] != 0:i = i + 1count = count + 1return count
Answer the following questions in a file called bigo.java: ● Write an O(n) algorithm that sequentially inserts an element into a list