Design data structures: present five data structures including B-tree for big data (you find data), for sorting algorithms. In this project, you will implement and analyze the following. Median finding, Order Statistics, and Quick Sort: In this project, you will implement the median-finding algorithms. The user should be able to select the "k", i.e., the rank of the number desired as output (k = n/2 is the median). You should also be able to select groups of 3, 5, 7, etc. in the linear-time median finding algorithm and be able to compare the performance of each. Also, implement the randomized median finding algorithm and compare it against the linear-time one. Implement quick sorting using both algorithms and compare the performances of these different versions.

Design data structures: present five data structures including B-tree for big data (you find data), for sorting algorithms. In this project, you will implement and analyze the following. Median finding, Order Statistics, and Quick Sort: In this project, you will implement the median-finding algorithms. The user should be able to select the "k", i.e., the rank of the number desired as output (k = n/2 is the median). You should also be able to select groups of 3, 5, 7, etc. in the linear-time median finding algorithm and be able to compare the performance of each. Also, implement the randomized median finding algorithm and compare it against the linear-time one. Implement quick sorting using both algorithms and compare the performances of these different versions.

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

Iterating over a dictionary example: Gradebook statistics. Write a program that uses the keys(), values(), and/or items() dict methods to find statistics about the student_grades dictionary. Find the following: Print the name and grade percentage of the student with the highest total of points. Find the average score of each assignment. Find and apply a curve to each student's total score, such that the best student has 100% of the total points. The language is in Python. # student_grades contains scores (out of 100) for 5 assignmentsstudent_grades = {'Andrew': [56, 79, 90, 22, 50],'Nisreen': [88, 62, 68, 75, 78],'Alan': [95, 88, 92, 85, 85],'Chang': [76, 88, 85, 82, 90],'Tricia': [99, 92, 95, 89, 99]} So far I have the first part of the question: for student, scores in student_grades.items(): print(student, sum(scores)/len(scores))
That's enough for you! def first_preceded_by_smaller(items, k=1): Given a list of items, find and return the value of the first element for which at least k smaller elements precede that element in items. If no such element exists inside the list, this function should return None. The required k smaller items do not need to be consecutive immediate predecessors of the current item, but can be any k items positioned before the current element. items k Expected result [4, 4, 5, 6] 2 5 [42, 99, 16, 55, 7, 32, 17, 18, 73] 3 18 [42, 99, 16, 55, 7, 32, 17, 18, 73] 8 None ['bob', 'carol', 'tina', 'alex', 'jack', 'emmy', 'tammy', 'sam', 'ted'] 4 'tammy' [9, 8, 7, 6, 5, 4, 3, 2, 1, 10] 1 10 [42, 99, 17, 3, 12] 2 None
Recamán's sequence def recaman_item(n):Compute and return the n:th term of the Recamán's sequence. See the linked definition for this sequence on Wolfram Mathworld. Note how the definition for the current element in this sequence depends on whether some particular number can be found in the previously generated prefix of the sequence. To allow your function to execute in a sure and speedy fashion even for millions of elements, you should use a set to keep track of which elements are already part of the prefix of the sequence generated so far. This way you can generate each element in constant time, instead of having to iterate through the entire previously generated list the way some "Shlemiel" might approach this problem. n Expected result 1 1 8 12 13 23 57 87 395743 258330 The previous version of this problem, simply called recaman in the very first versions of this problem collection,…
Part 1: autocomplete term. Write an immutable data type Term.java that represents an autocomplete term-a query string and an associated integer weight. You must implement the following API, which supports comparing terms by three different orders: lexicographic order by query string (the natural order); in descending order by weight (an alternate order); and lexicographic order by query string but using only the first r characters (a family of alternate orderings). The last order may seem a bit odd, but you will use it in Part 3 to find all query strings that start with a given prefix (of length r). public class Term implements Comparable { // Initializes a term with the given query string and weight. public Term (String query, long weight) // Compares the two terms in descending order by weight. public static Comparator byReverseWeight0rder () // Compares the two terms in lexicographic order, // but using only the first r characters of each query. public static Comparator…
ISBNThis problem is slightly more difficult than the above problem. This one requires a data type that stores 10 digits. BackgroundPublishers and bookstores use a number system called the International Standard Book Number (ISBN) system to identify books. At the start of publication, each book is assigned a unique ISBN. An ISBN, once assigned, can never be re-used. Click here for detailed information on this numbering system.An ISBN consists of exactly 10 digits. The rightmost digit is the check digit. The check digit is validated modulo 11.• multiply each digit from the first to the ninth by a weight from 10 to 2 respectively (the first digit by 10, the second by 9,.., the ninth by 2).• the sum of the products plus the check digit should be divisible without remainder by 11.• if there is a remainder, the whole number is not a valid ISBN SpecificationsDesign a program that validates an ISBN. Your program keeps accepting a whole number and determining if that whole number is a valid…
Data Structure and algorithms ( in Java ) Please solve it urgent basis: Make a programe in Java with complete comments detail and attach outputs image: Question is inside the image also: a). Write a function to insert elements in the sorted manner in the linked list. This means that the elements of the list will always be in ascending order, whenever you insert the data. For example, After calling insert method with the given data your list should be as follows: Insert 50 List:- 50 Insert 40 List:- 40 50 Insert 25 List:- 25 40 50 Insert 35 List:- 25 35 40 50 Insert 40 List:- 25 35 40 40 50 Insert 70 List:- 25 35 40 50 70 b). Write a program…
Tour.java Create a Tour data type that represents the sequence of points visited in a TSP tour. Represent the tour as a circular linked list of nodes, one for each point in the tour. Each Node contains two references: one to the associated Point and the other to the next Node in the tour. Each constructor must take constant time. All instance methods must take time linear (or better) in the number of points currently in the tour. To represent a node, within Tour.java, define a nested class Node: private class Node { private Point p; private Node next; } Your Tour data type must implement the following API. You must not add public methods to the API; however, you may add private instance variables or methods (which are only accessible in the class in which they are declared). public class Tour // Creates an empty tour. public Tour() // Creates the 4-point tour a→b→c→d→a (for debugging). public Tour(Point a, Point b, Point c, Point d) // Returns the number of points in this tour. public…
Computer Science Done in Perl. Someone gave me a wrong/incomplete answer. Write a function, hashsum, which takes a hash reference as its first argument and an array reference as its second argument. The function should take the elements of the array and use them as keys in the hash. The values in the hash corresponding to the keys in the array should be totaled, and the sum should be returned to the user. If a key passed in the array does not exist in the hash, ignore it. Write a sample program to call this function.
Maze Runner Function - Implementation of this function is done in a1_partd.py We describe a maze as having row x col cells. For example if row was 3, and col was 4, then we would have a grid of cells as follows. We describe a wall by the two cell numbers the wall separates. If every single wall existed, there would be (row-1)(col) + (col-1)(row) walls. 0 | 1 | 2 | 3 4 | 5 | 6 | 7 8 | 9 | 10 | 11 A Maze class (which you do not need to implement) describes a maze as mentioned above. This class is defined in maze.py. It has methods that you can use to travel through the maze (i.e. figure out where you are, find a neighbour cell etc.) use a recursive maze runner function: def find_path(maze, from_cell, to_cell); The find_path function will find a path from cell number from_cell to cell number to_cell and will return it as a list containing all the cell numbers along the path, from the from_cell to the to_cell. You are allowed to use this function as a wrapper to a recursive function that…
Looking for assistance with this question: Fulcrum def can_balance(items): Each element in items is a physical weight, a positive integer instead of some sort of helium balloon. Your task is to 0ind and return a fulcrum position in this list of weights so that when balanced on that position, the total torque of the items to the left of that position equals the total torque of the items to the right of that position. The item on the fulcrum is assumed to be centered symmetrically on the fulcrum, and does not participate in the torque calculation. In physics, the torque of an item with respect to the fulcrum equals its weight times distance from the fulcrum. If a fulcrum position exists, return that position. Otherwise return -1 to arti0icially indicate that the given items cannot be balanced, at least without rearranging them. items Expected result [6, 1, 10, 5, 4] 2 [10, 3, 3, 2, 1] 1 [7, 3, 4, 2, 9, 7, 4] -1 [42] 0…
Hef sharks_minnows (minnows, sharks): shark_count = 0 minnow_count = len (minnows) for i in range(minnow_count): curr_shark_height = minnows [i] if curr_shark_height is not None: minnows [i] = None for j in range (i + 1, minnow_count): if minnows [j] == curr_shark_height: minnows [j] = None curr_shark_height -- 1 shark_count += 1 return shark_count <= sharks The provided code is imperfect, in that it sometimes returns True when it should return False, and sometimes returns False when it should return True. (a) Provide an example of a function call where the provided code will correctly return True (i.e. a True Positive) (b) Provide an example of a function call where the provided code will correctly return False (i.e. a True Negative) (c) Provide an example of a function call where the provided code will incorrectly return True (i.e. a False Positive) (d) Provide an example of a function call where the provided code will incorrectly return False (i.e. a False Negative)
def classify(classifier, point): """ return the classification probability for the given point using the given classifier :params: classifier: list of floats, representing the weights for a logistic classifier point: list of values, representing features of a data point. will be same length as list of weights return: float, representing probability that point is from class 1. """ # TODO: implement this! # placeholder; say "50-50" for any point return 0.5