Problem 2In this problem, develop an algorithm to search a key in a sorted array.As shown in class, one general way to search a key in an array is to scan the array, comparing each element againstthe search key, until one element matches the key, or no match is found till the end of the array. In the latter case thealgorithm concludes that the key is not in the array.when the array is sorted, we can search in a more efficient way. Assume the array is sorted in ascending order. Theidea is, we retrieve the middle value from the array and compare it against the search key. If the middle value and thesearch key match, we’ve found it and the algorithm stops. If not so and the search key is smaller than the middlevalue, we search the 1st (left) half of the array as the key could not be in the 2nd (right) half (convince yourself!),otherwise -- the search key is larger than the middle value -- we search the 2nd half of the array as the key could notbe in the 1st half of thearray.In the half sub-array, we repeat the above steps, retrieving the middle key of the sub-array, comparing it against thesearch key. If they match, we've found it and stop. If they are not same, then go to either first half or second half ofthe subarray based on the comparison result.The search stops either when a match is found, or there is no subarray to search. In the latter case the algorithmconcludes that the key is not in the array. Following figure shows the steps of searching 38 in a sorted array.0 1 2 34 57 8 910Search 380205081216233856729197|L= 0 1 23M= 57 8H = 1038 > 23take 2nd Half02050812.162338567291971st Half2nd Half5 61234M= 8H = 10%3D38 < 72take 1st half02050812 16233856729197Discarded1st Half2nd HalfL=6M = 6230 1 234 5H = 78 910Found 38,Return 6050208121638567291974. Develop flowchart for this algorithm,The algorithm takes as input a search key and an array, output “key in ar: YES" or "key in arr: NO"Hint: use loop and two variables, one to store the starting index of the current search subarray andanother to store the end of the current search subarray. These variables are often called start, end, low,high, etc. Let's call it L and H. In each iteration we search array from index L to H. Initially L is Oand H is the last index of the original array. In each iteration of the loop, we get middle index M andmiddle value. If the search key is smaller than the middle values, search 1st half of the array by settingH to be M-1 (L does not change). If need to search 2nd half, set L to be M+1 (H does not change).If the search (sub)array is of even size, the middle index can be either the end of the 1st half or thebeginning of the 2nd half (so to be precise, the "middle" element should be called "middle-most"element).The loop should stop immediately when the key is found.What is the terminating condition of the search loop?Must use loops. You should not use recursions. (We will learn recursion later).Start your flowchart as shown in the following figure. The algorithm takes as input an array arr and asearch key keySave the flowchart as img_02.jpgstartarr[]keyImplement the algorithm using JavaScriptComplete the function problem20, and attach the onclick event to the corresponding button in htmlYour implementation should match your flowchart.

According to our guidelines we solve first one: ================================== Here i make…

Develop flowchart for this algorithm, The algorithm takes as input a search key and an array, output "key in arr: YES" or "key in arr: NO" Hint: use loop and two variables, one to store the starting index of the current search subarray and another to store the end of the current search subarray. These variables are often called start, end, low, high, etc. Let's call it L and H. In each iteration we search array from index L to H. Initially L is0 and H is the last index of the original array. In each iteration of the loop, we get middle index M and middle value. If the search key is smaller than the middle values, search 1st half of the array by setting

Develop flowchart for this algorithm, The algorithm takes as input a search key and an array, output "key in arr: YES" or "key in arr: NO" Hint: use loop and two variables, one to store the starting index of the current search subarray and another to store the end of the current search subarray. These variables are often called start, end, low, high, etc. Let's call it L and H. In each iteration we search array from index L to H. Initially L is0 and H is the last index of the original array. In each iteration of the loop, we get middle index M and middle value. If the search key is smaller than the middle values, search 1st half of the array by setting

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

Must show it in Python:Please show step by step with comments.Please show it in simplest form.Please don't use any functionsPlease don't use any def func ()Input and Output must match with the QuestionPlease go through the Question very carefully.
Using “Def” keyword write a function that returns the min element of the given array elements (The function name will be MinofArrayElements) Not: Write some print functions to see the outputs inside each function. (Python programming language)
Do it with Matlab
Prompt: In Python language, write a function that applies the logistic sigmoid function to all elements of a NumPy array. Code: import numpy as np import math import matplotlib.pyplot as plt import pandas as pd def sigmoid(inputArray): modifiedArray = np.zeros(len(inputArray)) #YOUR CODE HERE: return(modifiedArray) def test(): inputs = np.arange(-100, 100, 0.5) outputs = sigmoid(inputs) plt.figure(1) plt.plot(inputs) plt.title('Input') plt.xlabel('Index') plt.ylabel('Value') plt.show() plt.figure(2) plt.plot(outputs,'Black') plt.title('Output') plt.xlabel('Index') plt.ylabel('Value') plt.show() test()
The Philippine Stock Exchange (PSE) is the national stock market of the Philippines. As of 1 January 2022, there are 278 listed companies in PSE. Write a C++ program that asks user input stock symbol, checks whether the input symbol is included in the listed companies in the Philippine Stock Exchange market, and outputs the position of the listed company in the array. Use linear search algorithm. See sample output. Note: Use this list of stock symbols attached in the table. S.No. Symbol 1 2GO 2 HOUSE 3 BRN 4 ANS 5 ABA 6 AEV 7 AP 8 AR 9 ABS 10 ABSP 11 ACEN 12 ACEX 13 ACE 14 ANI 15 ALLDY 16 HOME 17 AGI 18 FOOD 19 ACR 20 APVI 21 ALHI 22 APO 23 APC 24 APX 25 APL 26 ARA 27 AREIT 28 ALCO 29 AAA 30 AUB 31 ABG 32 ATI 33 AT 34 ATN 35 AB 36 AXLM 37 AC 38 ALI 39 ALLHC 40 BPI 41 BSC 42 BLFI 43 BDO 44 BEL 45 BC 46 BCOR 47 BH 48 BLOOM 49 BMM 50 BHI 51 BKR 52 CEB 53 CHI 54 CLI 55 CHP…
Please follow all the steps given
The Philippine Stock Exchange (PSE) is the national stock market of the Philippines. As of 1 January 2022, there are 278 listed companies in PSE. Write a C++ program that asks user input stock symbol, checks whether the input symbol is included in the listed companies in the Philippine Stock Exchange market, and outputs the position of the listed company in the array. Use linear search algorithm. Note: Use this list of stock symbols attached in the table. S.No. Symbol 1 2GO 2 HOUSE 3 BRN 4 ANS 5 ABA 6 AEV 7 AP 8 AR 9 ABS 10 ABSP 11 ACEN 12 ACEX 13 ACE 14 ANI 15 ALLDY 16 HOME 17 AGI 18 FOOD 19 ACR 20 APVI 21 ALHI 22 APO 23 APC 24 APX 25 APL 26 ARA 27 AREIT 28 ALCO 29 AAA 30 AUB 31 ABG 32 ATI 33 AT 34 ATN 35 AB 36 AXLM 37 AC 38 ALI 39 ALLHC 40 BPI 41 BSC 42 BLFI 43 BDO 44 BEL 45 BC 46 BCOR 47 BH 48 BLOOM 49 BMM 50 BHI 51 BKR 52 CEB 53 CHI 54 CLI 55 CHP 56 CAT 57 CEU 58…
Input the grades of a student by taking marks in 3 different subjects using arrays. Use functions to Design a grade calculator based on following criteria: If the student scores 60 above in all three subjects, then he should get an A grade. If the student scores 60 above in only one subject, he gets a B grade. If he scores 60 below in all subjects he scores C grade
The table below shows the deformed lengths of four (4) springs of length 10 cm each when stretched by a 100 N force to its maximum. Spring # Maximum deformation length, L (cm) 2 12 3 17 4 20 15 Write a complete C program to compute and display the spring constant, K of each spring. The maximum length (L), and the spring constant (K) must be stored in one-dimensional arrays. The applicable equation is K = 100/(L - 10), where K is in N/cm. The program should also provide the average spring constant.
AIM: Write a program to do Linear Search using a given Search Key in an un- sorted Linear Array 'A' which has N values in it. Description: The linear search compares each element of the array with the search key until the search key is found. To determine that a value is not in the array, the program must compare the search key to every element in the array 'A'. It is also called "Sequential Search" because it traverses the data sequentially to locate the element. Algorithm: (Linear Search) LINEAR SEARCH (A, N, SKEY) Here A is a Linear Array with N elements and SKEY is a given item of information to search. This algorithm finds the location of SKEY in A and if successful, it returns its location otherwise it returns -1 for unsuccessful. 1. Repeat step-2 for K = 0 to N-1 2. if(A [K] = SKEY) return K [Successful Search] [End of loop of step-1 ] 3. return -1 [Un-Successful] 4. End.
Using the srand() and rand() C++ library, generate a vector of integers. Prompt the user for the size of the list. The random integers should be scaled to the range 1 to 100 (see page 283). Sort the numbers using the sort function from the algorithm library and display the numbers. Then calculate the percent of numbers from 1 to 50 (including 50) and from 51 to 100. Report the percentages.
a. Write a code which prints out a column vector by using the row vector containing the digits of your student number in order with programming conceptimethod.