Classwork for CS-103 Discrete St xACFrOgA4fPkKOhvF3hbH_566NA x b My Solutions | bartleby->8 https://doc-04-1c-apps-viewer.googleusercontent.com/viewer/secure/pdf/dos83644s12mc92tsj78e6s6i16ab611/0phjk05ork613nsn8. to(D Page view | A Read aloud V DrawF HighlightO Erase2of 2Q11. Write down the output of each line of the following binary search algorithm in a table likethe one given below. Your job is to search for the integer 10 in the array named 'data'.Line AlgorithmO 1 2 3 4 5 6data 1 2| 31int Lo = 0;int Hi = data.length -1;int Mid = -1;24573while (Lo <= Hi){Mid = Lo + (Hi-Lo)/2;if (data[Mid] == Item) break;if (Item < data[Mid])Hi = Mid-1;4LineIteLHMi5mid10| 178910else Lo = Mid+1;}if (data[Mid] == Item)return (Mid);else return (-1);1112find (10, data)1314CamScanner 03-03-2.Open fileWhatsApp Image 2.jpegOpen fileWhatsApp Image 2.jpegOpen fileWhatsApp Image 2.jpegOpen fileWhatsApp Image 2.jpegOpen filePDF...Show all............12:17 PMP Type here to searchHiPsXdAiA 4)743/3/2021近

The binary search is a searching technique based on the divide and conquers method in which…

Q11. Write down the output of each line of the following binary search algorithm in a table like the one given below. Your job is to search for the integer 10 in the array named “data'. Line Algorithm 0 1 2 3 4 5 6 data 12 3 1 int Lo = 0; 2 int Hi = data.length -1; 4 5 6 3 int Mid = -1; while (Lo <= Hi) { Mid = Lo + (Hi-Lo)/2; if (data[Mid] == Item) break; if (Item < data(Mid]) Hi = Mid-1; else Lo = Mid+1; 4 Line Ite L H Mi d 5 10 6 8. 10 %3D 11 if (data[Mid] == Item) return (Mid); 12 find (10, data) 13 14 else return (-1);

Q11. Write down the output of each line of the following binary search algorithm in a table like the one given below. Your job is to search for the integer 10 in the array named “data'. Line Algorithm 0 1 2 3 4 5 6 data 12 3 1 int Lo = 0; 2 int Hi = data.length -1; 4 5 6 3 int Mid = -1; while (Lo <= Hi) { Mid = Lo + (Hi-Lo)/2; if (data[Mid] == Item) break; if (Item < data(Mid]) Hi = Mid-1; else Lo = Mid+1; 4 Line Ite L H Mi d 5 10 6 8. 10 %3D 11 if (data[Mid] == Item) return (Mid); 12 find (10, data) 13 14 else return (-1);

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

5. Write a program that creates two integer arrays with one dimension by size 8 then: • User inserts the data of two arrays • Retrieve the similar numbers from the two arrays • For example : o A1= [ 2,3,4,5,7,8] o Output will be : 2, A2=[4,7,9,1,10,2] 4, 7
Write the function lastOf which searches the array a for the last occurance of any value contained in the array b. Returns the index if found. If not found, return -1. arrays.cpp 1 #include 2 3 int lastof(const int a[), int alen, const int b[], int blen) 4 { int res = 0; for (int i = 0; i =0 ; j--) if (b[j] == a[i]) { if(res[1, 9, 4, 5, 1, 5, 1, 12, 8, 11, 2, 11, 7, 8] b1->[7, 5, 9] last0f(al, 14, b1, 3): -1 Expected: 12 al->[1, 9, 4, 5, 1, 5, 1, 12, 8, 11, 2, 11, 7, 8] b2->[7, 7] lastof (al, 14, b2, 2): -1 Expected: 12 a2->[3, 2, 1, 14, 10, 6, 13, 1ө, 11, 13, 14] b2->[7, 7] lastof (a2, 11, b2, 2): -1 Expected: -1 а2->[3, 2, 1, 14, 10, 6, 13, 1ө, 11, 13, 14] b1->[7, 5, 9] last0f (a2, 11, b1, 3): -1 Expected: -1 а2->[3, 2, 1, 14, 10, 6, 13, 10, 11, 13, 14] b3->[11, 2, 1, 15] lastof (a2, 11, b3, 4): -1 Expected: 8 Score 2/5
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
Please give me correct solution.
5. Implement the binary search function below that returns the index of the target value in an integer array. int search(int a[], int t, int l, int r); Given the binary search function in question 5 and the array a below, list all activations when calling search(a, 19, 0 15). -9 -5 -2 0 1 3 7 11 17 19 21 25 27 31 37 41 a index 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Can I get help with this in Java please? Thank you.
AHPA #11: Changing Grades * * Create a C function (switcher) that will receive a pointer to the finalExams array, using only pointers look for D scores and boost them to C scores. (ouput should be same as picture)
programming langugae: c++ The question is attached below . kinldy refer to it
int[] cars = {1,2,3,4,5}; for (int i=0; i
struct grade { char id[10]; int mark; }; Using the student structure given above, create an array of size 5 students. Then write a complete C program to sort the students array based on the students rank. Use the following sorting techniques in your code. Don’t forget to print initial array and final (sorted) array. a. Insertion sort b. Merge sort c. Quick sort
Give me an in depth step by step explanation on how to solve this problem including a step by step explanation on how the ogic works for each answer choice.10. Consider two parallel arrays which contain the names and corresponding scores of players in a trivia game.String names "Rob", "Pam", "Sandy", "Kelly", "Kim", "J.P."}; int I scores = (2600, 2420, 1790, 2100, 3100, 3250);Which of the following code segments correctly prints the names and scores of all the players who scored above high?(A) for (int element scores) if (element> high) System.out.print In (names + " " + element);(B) for (int element scores)if (element >= high)System.out.println(names" "+element); (C) for (int i = 0; i < scores.length; i++)if (scores [i]> high) System.out.println(names [i] + " " + scores [i]);(D) for (int i = 0; i < scores.length; i++) System.out.println (names [i]+"" + scores [i]);if (scores [i] >= high)if (scores [i] high)(E) for (int i = 0; i <= scores.length; i++)…
Question 17 Aa .You are given a sorted list of n numbers stored in an array A, where n can be arbitrarily large. Now randomly generate a number k and search the number in the list (i.e., in A). Now randomly select two subarrays of A, each of size n^1/2 . Then repeat the same procedure on each of the subarrays. The procedure stops after the subarray sizes become 1. Analyze the time complexity of finding the total number of successful searches in the entire procedure using big O-notation Full explain this question and text typing work only We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line