1. Suppose that that we have an array called list initialized as follows: int [] list = {-2, 8, 13, 22, 25, 25, 38, 42, 51, 103}; This would construct the following array: [0] [1] [2] [3] [4] [5] [6] [7] [8] [9] +- --+ -2 | 8 | 13 | 22 | 25 | 25 | 38 | 42 | 51 | 103 | + a) What values would low, high and mid take on for the following call: binarySearch (list, 23) and what value would be returned? b) What values would low, high and mid take on for the following call: binarySearch (list, 2, 8, 38) Note: Use the Author's code for this question and what value would be returned?

1. Suppose that that we have an array called list initialized as follows: int [] list = {-2, 8, 13, 22, 25, 25, 38, 42, 51, 103}; This would construct the following array: [0] [1] [2] [3] [4] [5] [6] [7] [8] [9] +- --+ -2 | 8 | 13 | 22 | 25 | 25 | 38 | 42 | 51 | 103 | + a) What values would low, high and mid take on for the following call: binarySearch (list, 23) and what value would be returned? b) What values would low, high and mid take on for the following call: binarySearch (list, 2, 8, 38) Note: Use the Author's code for this question and what value would be returned?

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 using pointers to find the smallest index of the large element : often you need to locate the largest element in an array . if an array has multiple elements with the same largest value , find the smallest index of such an element. suppose the array my list is {1,2,3,4,5,5}. so, the largest element is 5 and the smallest index for 5 is 1 .
Please develop well-documented pseudo code that finds all consecutive similar elements of a given array (of any size n) by using either a stack or a queue. The code must display the start indices where the values start to repeat, as well as the values of these elements. For instance, given the following array A: (22, 9, 61,61, 61, 21, 0, 9, 9, 9, 9, 35, 81,81, 9, 5, 5), the code should find and display something similar to the following (pls notice that this is just an example. The solution must not refer to this particular example): Value 61 is repeated 3 times starting at Index 2 Value 9 is repeated 4 times starting at Index 7Value 81 is repeated 2 times starting at Index 12Value 5 is repeated 2 times starting at Index 15 a) Briefly justify the motive(s) behind your design. b) What is the Big-O time complexity of your solution? Explain clearly how you obtained such complexity. c) What is the Big-Ω time complexity of your solution? Explain clearly how you obtained such complexity. d)…
Create a Numpy List named as marks with six float numbers, showing the final marks of a student in six subjects. Round the marks from marks array from Q-3 a) upto two decimal numbers What if you need to create the same list as Q-3 a), but for five students. Can you still use 1-D array? How many dimensions should be there? Find the highest marks a student has obtained using marks array from Q-3 a) Use seaborn to show marks array from Q-3 a)
Q2. Write a java program to perform the following task: a) Create a collection ArrayList<String> for Customer class b) Add 5 elements into ArrayList c) Display the element at index 4 d) Display all the elements in the ArrayList using for-each loop e) Remove the values at index 2 f) Add “cst2” in location 2. g) Check if st2 existing inside the collection.
Python: Write a function biggest_gap(L) that takes a list L of real numbers or integers and finds the largest difference |a−b| between two adjacent elements a and b. The function should return |a−b| and the index of the second element in the list. As an example, a correctly written biggest_gap should return 25,2 when run on L=[7, 13, 38, 43, 53]. Test your function on the array A and show the result. A = [12, 45, 23, 22, 42, 15, 17, 15, 73, 36, 7, 13, 38, 43, 53, 86, 40, 45, 63, 74]
Print the following List in the reversed order using lambda / arrow operator. var array = new List <int>{ 8,2,2,24,5,7,5,3,2,10};
Create a Numpy List named as marks with six float numbers, showing the final marks of a student in six subjects. Round the marks from marks array from Q-3 a) up to two decimal numbers What if you need to create the same list as Q-3 a), but for five students. Can you still use 1-D array? How many dimensions should be there? Find the highest marks a student has obtained using marks array from Q-3 a) Use seaborn to show marks array from Q-3 a)
Consider the 2D array “list”. Each row represent a class say Bangla or English or Math, andthe columns indicates student. A ‘1’ in list[c][s] indicates student s is in class c; a ‘0’ meansstudent s is not in class c. Write a program to display the class number (0/1/2) with the mostnumber of students.
You are provided a 2 dimensional array is created by the statement: 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 What value is accessed by the following statements: num[1][7] = _________________ num[0][5] = __________________ num[1][4]= ___________________ num[0][9]= _____________________ num[1][0]=_____________________ Extra Credit: What is a common property of the values in the area? You are implementing a Stack of chars The following statements are issued: push (‘a’) push (‘b’) push (‘c’) push (‘d’) pop() push(‘z’) pop() push(‘e’) push(‘f’) push (‘g’) pop() Display a representation of the stack at the end of the operations above from top to bottom. You must label the top and bottom. You have a queue of numbers and you issue the following instructions: (10 pts.) add(33) add(57) add(75) add(12) remove() remove() add(101) add(99) remove() add(67) remove() add(33) remove() List…
Please help with the following in JAVA You are given an inclusive range [lower, upper ]and a sorted unique integer array nums, where all elements are in the inclusive range.A number x is considered missing if x is in the range [lower, upper] and x is not in nums. Return the smallest sorted list of ranges that cover every missing number exactly. That is, no element of nums is in any of the ranges, and each missing number is in one of the ranges. Each range [a,b] in the list should be output as:
Consider the IntArrayBag collection class that we discussed in class, Draw the data array after executing the following code and show the values that are stored in each cell of the array. Show the array four times at the points labelled A, B, C, and D IntArrayBag bag1 = new IntArrayBag(5); bag1.add(10); bag1.add(5); bag1.add(20); bag1.add(13); //Point A bag1.remove(5); //Point B bag1.add(8); bag1.remove(10); //Point C bag1.add(30); //Point D Exercise 4: search method
You are given an array-like data structure Listy which lacks a size method. It does, however, have an elementAt ( i) method that returns the element at index i in 0( 1) time. If i is beyond the bounds of the data structure, it returns -1. (For this reason, the data structure only supports positive integers.) Given a Listy which contains sorted, positive integers, find the index at which an element x occurs. If x occurs multiple times, you may return any index. Write code with explanation