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

1. Write an algorithm that applies right shift on one dimensional array (trace your algorithm on example array A: [0, 9, 2, 10, 3] and show the result of your trace steps as a table). *Dont use extra array while solving this problem *Just write algorithm do not write program in any other programming language
Q2: write a program to multiply the elements in each corresponded locations of two one dimensional arrays and store the results in a third one dimensional array as shown in the following example: 5 4 3 8 1 2345
Prob 4 Given a list of x objects, create a program that performs the following operation: -Get the first and last object and place them both at the start of the list. Example: QWERT becomes QTWER Find the worst case time complexity if the solution will be implemented using an array. Give both the EQUATION AND THE BIG-O NOTATION.
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
The function 'countPrimes' is given below to find the count of prime numbers enclosed within double quotes in an array with 12. Which of the following is the missing code line? int countPrimes( char *a[]) { int i,j,num,nump 0,flag; for (j = 0; j< 12; ++j) { for(i=2; i
Can I get help with this in Java please? Thank you.
Implement an empty integer array of capacity 5. a) Use a loop to input values from the console into the array. b) Use a loop to determine the smallest element in the array. c) Use a loop to determine the largest element in the array. d) Use a loop to output the array. e) Output the smallest and largest elements. Example Output [0] = 4 [1] = 24 [2] = 123 [3] = 54 [4] = 3 Array: 4 24 123 54 3 Max: 123 Min: 3 programming language is c++ pleasw do it in a easy way
13. What is the value of UTM[3]? int UTM[] = {19, 10, 8, 17, 9}; А. 19 В. 10 С. 8 D. 17 14. Which of the following statement is TRUE? float x[3][4]; A. The array can hold 7 elements. B. Array x will have 3-rows and 4-columns C. The array can hold a umber with more nine decimal points. D. None of above
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