Binary Search Tree: ADT Enhancement and Application In Java, execute a set of 10 contains operations 1,000 times, timing how long it takes to complete all 10,000 contains calls. Report out the execution time. Rebalance the tree and repeat the 10,000 calls, and report out how long it takes after the tree has been rebalanced. Be sure to avoid including any I/O in the execution times. Use these values as the actual parameters for the contains calls: 2, 7, 1117, 22307, 33331, 45533, 48611, 4, 24000, 50000.

Binary Search Tree: ADT Enhancement and Application In Java, execute a set of 10 contains operations 1,000 times, timing how long it takes to complete all 10,000 contains calls. Report out the execution time. Rebalance the tree and repeat the 10,000 calls, and report out how long it takes after the tree has been rebalanced. Be sure to avoid including any I/O in the execution times. Use these values as the actual parameters for the contains calls: 2, 7, 1117, 22307, 33331, 45533, 48611, 4, 24000, 50000.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter3: Data Representation

Section: Chapter Questions

Problem 13RQ: How is an array stored in main memory? How is a linked list stored in main memory? What are their...

See similar textbooks

Similar questions

True/False Select true or false for the statements below. Explain your answers if you like to receive partial credit. 3) Which of the following is true about the insertBeforeCurrent function for a CircularLinked List (CLL) like you did in programming exercise 1?a. If the CLL is empty, you need to create the new node, set it to current, andhave its next pointer refer to itselfb. The worst case performance of the function is O(n)c. If you insert a new element with the same data value as the current node, theperformance improves to O(log n)
Coding language: C++. (Try to avoid linked lists if possible please). Add comments. Thanks. • Each functionality component must be implemented as a separate function, though the function does not need to be declared and defined separately • No global variables are allowed • No separate.hor.hpp are allowed • You may not use any of the hash tables, or hashing functions provided by the STL or Boost library to implement your hash table • Appropriate, informative messages must be provided for prompts and outputs You must implement a hash table using the Double Hashing collision strategy and the mid-square base 10 hashing function with an R of 2. Your collision strategy must be implemented as a separate function, though it may be implemented inside your insert/search/delete functions, and should halt an insert / search/delete functions, and should halt an insert/search/delete after table size number of collisions. Your hash function must be implemented as a separate function. Your hash table…
please update generateRandoms, letterToGrades, sumBetween, countCharacters //A6Utilities.java import java.io.IOException;import java.nio.file.Files;import java.nio.file.Paths;import java.security.SecureRandom;import java.util.List;import java.util.TreeMap;import java.util.function.Function;import java.util.stream.Collectors;public class A6Utilities {/*** Returns the corresponding letter grade. Don't modify this method, simply use it when converting single* grades to their equivalent letter grade** @param grade the integer grade to convert* @return the letter grade equivalent to the integer grade*/private static char letterGrade(final int grade) {if (grade < 0) return '?';else if (grade < 60) return 'F';else if (grade < 70) return 'D';else if (grade < 80) return 'C';else if (grade < 90) return 'B';else if (grade <= 100) return 'A';else return '?';}/*** The method uses Java Streams only. Don't use any looping structures, conditional statements are OK (IF, TERNARY,…
java program: University of Bahrain College of Information Technology Department of Computer Science Second Semester, 2020-2021 ITCS214 / ITCS215 / ITCS216 (Data Structures) Assignment 3 Implement generic class ArrayStack as discussed in the lectures having following methods: constructor, push, pop, peek, isEmpty, copy constructor, reallocate (private method). Also add following methods to this class: size: returns number of elements in the stack. contains: Search an element in the stack. If found returns true, else returns false. clear: Deletes all elements of the stack and make it empty stack. Implement generic class ArrayQueue as discussed in the lectures having following methods: constructor, copy constructor, offer, poll, peek, isEmpty, reallocate(private), iterator. Inner class Iter that implements interface Iterator having methods: constructor, hasNext, next. Also add following methods to the ArrayQueue class: size: returns number of elements in the queue. contains: Search…
/** * Removes the specified key and its associated value from this symbol table * (if the key is in this symbol table). Takes advantage of the fact that the * keys appear in increasing order to terminate` early when possible. * * @param key the key * @throws IllegalArgumentException if {@code key} is {@code null} */ public void delete(Key key) { // TODO // Change this code to make use of the fact that the list is sorted to // terminate early when possible. // As this code already uses recursion, the private helper function is // already present below, but it will need to be changed to terminate // early when appropriate. if (key == null) throw new IllegalArgumentException("argument to delete() is null"); first = delete(first, key); } // delete key in linked list beginning at Node x // warning: function call stack too large if table is large private Node delete(Node x, Key…
Implement the function below void swap(int pos1, int pos2) {} For LinkedList, to maintain integrity of data in the structure, you are not to swap directly the element, nor remove a node. Instead, you are to only change the nodes' next pointers. Inital code to be completed: class LinkedList : public List { node* head; node* tail; int index; node* create_node(int num) { node* n = (node*) malloc(sizeof(node)); n->element = num; n->next = NULL; return n; } public: LinkedList() { index = 0; head = NULL; tail = NULL; } int add(int num) { addTail(num); return index; } int get(int pos) { node* currnode = head; int count =0; while (currnode != NULL){ count++; if (count == pos){ return currnode -> element; }else{ currnode = currnode -> next; } }…
Please implement this function: void swap(int pos1, int pos2) {}. There's an answer from the previous teacher but he added '' node** hRef " in the function (see below) please correct without the href. For LinkedList, to maintain integrity of data in the structure, you are not to swap directly the element, nor remove a node. Instead, you are to only change the nodes' next pointers. PLEASE CORRECT THIS ONE void swap(node** hRef, int pos1, int pos2) { if (pos1 == pos2) return; node *prevNode1 = NULL; node* currNode1 = *hRef; while (currNode1 && currNode1->index != pos1) { prevNode1 = currNode1; currNode1 = currNode1->next; } node *prevNode2 = NULL; node *currNode2 = *hRef; while (currNode2 && currNode2->index != pos2) { prevNode2 = currNode2; currNode2 = currNode2->next; } if (currNode1 == NULL || currNode2 == NULL) return; if (prevNode1 != NULL) prevNode1->next =…
How is an array stored in main memory? How is a linked list stored in main memory? What are their comparative advantages and disadvantages? Give examples of data that would be best stored as an array and as a linked list.
Q #3. Apply concepts of Advanced Data Structures to implement a Students Book as adoubly linked list. Each node in the Student Book will contain ‘Name’, ‘RegNumber’,‘CGPA and ‘Age’ of the student. Following operations can be performed on the StudentBook.• Constructor to create and Destructor to destroy the Student Book• Add a Student if it is not already present in the Book.• Delete a Student from the Book.• Search a Student in the Student Book using Name or Reg. Number. If founddisplay its details. If not found, display ‘Student not found’.• Display the Student details in forward and reverse order• In main (), define an object of type StudentBook. Get details of 10 student fromthe user and add to the StudentBook. Ask the user, if the user wants to display,search or delete a student and perform the required actions, accordingly.
332 File structures and databaseSuppose you have these inputs: M, I, T, Q, L, H, R, E, K, P, C, A.a. Show the binary search tree for these inputs.b. Show how to store the binary search tree in an array with the nodestructure (key, left, right).
Question #7. SORTED LIST NOT UNSORTED C++ The specifications for the Sorted List ADT state that the item to be deleted is in the list. Rewrite the specification for DeleteItem so that the list is unchanged if the item to be deleted is not in the list. Implement DeleteItem as specified in (a) using an array-based. Implement DeleteItem as specified in (a) using a linked implementation. Rewrite the specification for DeleteItem so that all copies of the item to be deleted are removed if they exist. Implement DeleteItem as specified in (d) using an array-based. Implement DeleteItem as specified in (d) using a linked implementation.
Question:- Implement a generic Map that supports the insert and lookup operations. The implementation will store a hash table of pairs (key, definition). You will lookup a definition by providing a key. The following snippet provides the Map specification (minus some details). You can complete this snippet. After you completed your map, use it in a program. Insert 50 (key, definition) which are (words, meaning) from a file that you have already built it. Then let the user look up the keys and insert more key and definition. Submit your input file with your code. template <typename HashedObj, typename Object> class Pair { HashedObj key; Object def; // Appropriate Constructors, etc. }; template <typename HashedObj, typename Object> class Dictionary { public: Dictionary( ); void insert( const HashedObj & key, const Object & definition ); const Object & lookup( const HashedObj & key ) const; bool isEmpty( ) const; void makeEmpty( ); private:…