B. Consider a problem to find the student who had the highest GPA for the 2020/2021 academic year. Using the below data set, answer the questions that follow: StudentGPA[2,2.5,4,4,4,3,3.5,3.3,3.1,2.1] Explain how a binary search algorithm can be used to solve this problem. i. ii. Explain how a sorting algorithm can be used to solve this problem. ii. Write the algorithm using the binary implementation. iv. Write the algorithm using the sorting implementation.

B. Consider a problem to find the student who had the highest GPA for the 2020/2021 academic year. Using the below data set, answer the questions that follow: StudentGPA[2,2.5,4,4,4,3,3.5,3.3,3.1,2.1] Explain how a binary search algorithm can be used to solve this problem. i. ii. Explain how a sorting algorithm can be used to solve this problem. ii. Write the algorithm using the binary implementation. iv. Write the algorithm using the sorting implementation.

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

2 Consider the following KB:S1. ?∨?S2. ¬?∨¬?S3. ¬?∨?S4. ?∨¬?S5. ¬?∨?a) Use the resolution algorithm to determine whether the following KB entails ¬?.b) Use the resolution algorithm to determine whether the following KB entails ? ∨¬?.
Observe the following two Sequential Search and Binary Search algorithms in the image. Perform a comparative analysis of the Sequential Search and Binary Search algorithms in terms of the number of basic operations executed by the two algorithms. A. Calculate and analyze the time complexity T(n) and the efficiency class of the two search algorithms in the worst case. B. Write an example case by writing down the elements for different data sizes, for example n=4, 8, ... Please specify the elements of table A and the data you are looking for, x. Write an illustration of the comparison process for every n to confirm the complexity of the algorithm in point a). C. Describe your opinion regarding the comparative analysis of the efficiency of the two algorithms! Please solve subparts A,B,C in 60 minutes ASAP can u get thank u
Problem 4: Let S = {s1, s2, . . . , sn} and T = {t1, t2, . . . , tm}, n ≤ m, be two sets of integers. (ii) Devise an algorithm that uses a hash table of length n to test whether S is a subset of T. What is the expected running time of your algorithm?
Question 17. Sorting a data set is an important sub-problem in data science. Given the size n of a data set, which statements are correct? a) Bubble Sort has worst-case run-time complexity O(n).b) Bubble Sort has worst-case run-time complexity O(n log N).c) Bubble Sort has worst-case run-time complexity O(n2).d) Merge Sort has worst-case run-time complexity O(n).e) Merge Sort has worst-case run-time complexity O(n log N).f) Merge Sort has worst-case run-time complexity O(n2).g) Quick Sort has worst-case run-time complexity O(n).h) Quick Sort has worst-case run-time complexity O(n log N).i) Quick Sort has worst-case run-time complexity O(n2).
1.a.Justify why the Best first search algorithm is not optimal. b.Write the pseudo-code for Depth First Branch and Bound Search. Can we also construct a Breadth First Branch and Bound search? What will be the advantages and disadvantages of these two versions of Branch and Bound search?
1. (a)The objective is to shuffle a given array of n different elements. You would like to compare various shuffling algorithms and select the best of them. What does it mean: “the best shuffling algorithm”? What is a requirement for the perfect shuffling algorithm? (b) Is the Fisher-Yates Shuffle the perfect shuffling algorithm? Present a formal mathematical proof that this algorithm meets (or does not meet) the requirement given in (a). (c) Evaluate empirically performance of the Fisher-Yates Shuffle for selected numerical values of n. Propose your evaluation criteria and explain your evaluation methodology. Report your observations and conclusions.
Let A = {a1, … an} and B = {b1, ... bn} be two sets of numbers. Consider the problem of finding their union, i.e., the set C of all the numbers that are in A or B or both. a. Design a brute-force algorithm for solving this problem and determine its efficiency class. b. Design a presorting-based algorithm for solving this problem and determine its efficiency class.
Search a sorted matrix: The input consists of a real number x and a matrix A[1..n, 1..m] of nm real values, where A[i, 1..m] and A[1..n, j] are the rows and columns, respectively, of the matrix. The objective is to either state that all of the members of A are greater than x or to locate the largest array entry A[i, j] that is less than or equal to x. Create and evaluate an iterative approach for this issue that looks at the least amount of matrix entries feasible. If you think the issue can be resolved with a straightforward binary search, think twice.
Given an unlimited supply of coins of given denominations represented by an array D[1, . . . , n], where D[i] is the denomination of the ith type of coin, find the minimum number of coins required to get a desired change. For example, assume that D = [1, 3, 5, 7]. If he desired change is 18, then the minimal number of coins required is 4, which can be made by 7 + 7 + 3 + 1 or 5 + 5 + 5 + 3. Precisely define the subproblem.Provide the recurrence equation.Describe the algorithm in pseudocode to compute the optimal value.Describe the algorithm in pseudocode to print out an optimal solution.
A is be a 4×3 matrix and B is a 3×2 matrix. Which of the following gives a 2×4 matrix as a result? Select one alternative: a. BT AT b. BT A c. B A d. A + BT
Below are a number of statements about linear and binary search. A. Linear search systematically searches from beginning to end. B. Linear search as well as binary search works on both sorted and unsorted data sets. C. For linear search, T (n) = O (n) applies in the worst case. D. For linear search, T (n) = 0 (n) applies in the worst case, if the quantity is unsorted. E. For binary search, T (n) = O (log n) applies in the worst case. Indicate which of these is correct. a,b,d,e true a,b,c,d true a,c,d,e true a,e true
Let m be a matrix with n rows and n columns whose entries are either 1 or 0. recall that the element of m on row i and column j is denoted by mij . the diagonal entries of m are {mii} for 1 ≤ i ≤ n. We call M permutable if it is possible to swap some of the rows and some of columns so that all diagonal entries are 1. Design a polynomial time algorithm that decides whether a binary matrix M is permutable or not. Note that we can swap any two rows or two columns. Also, the order in which these swaps are done is not important.