package datastructure; public class UseMap { public static void main(String[] args) { /* * Demonstrate how to use Map that includes storing and retrieving elements. * Add List into a Map. Like, Map> list = new HashMap>(); * Use For Each loop and while loop with Iterator to retrieve data. * Use any databases[MongoDB, Oracle, MySql] to store data and retrieve data. */ } }

package datastructure; public class UseMap { public static void main(String[] args) { /* * Demonstrate how to use Map that includes storing and retrieving elements. * Add List into a Map. Like, Map> list = new HashMap>(); * Use For Each loop and while loop with Iterator to retrieve data. * Use any databases[MongoDB, Oracle, MySql] to store data and retrieve data. */ } }

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

C++ Design a HashMap without using any built-in hash table libraries. Implement the MyHashMap class: MyHashMap() initializes the object with an empty map. void put(int key, int value) inserts a (key, value) pair into the HashMap. If the key already exists in the map, update the corresponding value. int get(int key) returns the value to which the specified key is mapped, or -1 if this map contains no mapping for the key. void remove(key) removes the key and its corresponding value if the map contains the mapping for the key. Example 1: Input ["MyHashMap", "put", "put", "get", "get", "put", "get", "remove", "get"] [[], [1, 1], [2, 2], [1], [3], [2, 1], [2], [2], [2]] Output [null, null, null, 1, -1, null, 1, null, -1]
Write a hash table in which both the keys and the values are of type String. (NOT generic programming OR a generic class.) Write an implementation of hash tables from scratch. Define the following methods: get(key), put(key,value), remove(key), containsKey(key), and size(). Remember that every object, obj, has a method obj.hashCode() that can be used for computing a hash code for the object, so at least you don't have to define your own hash function. **//Do not use any of Java's built-in generic types; create your own linked lists using nodes as covered in section 9.2.2 of Eck, D. J. (2019). Introduction to programming using Java, version 8.1. Hobart and William Smith Colleges. http://math.hws.edu/javanotes However, you do not have to worry about increasing the size of the table when it becomes too full.You should also write a short program to test your solution.
Create a class Student with the fields: name (a String) and gpa (a double). Create a linked list of Student objects, called students using the LinkedList class from java.util.Sort the linked list students “by length” of name (see Sect. 11.3 in textbook) using the sort method from class Collections.Sort the initial linked list students by gpa using the sort method from class Collections. Apply the toArray() method from class LinkedList to the initial linked list students and sort the obtained array “by length” of name using the sort method from class Arrays. After each sort, print the result.Do NOT use the sort method from the List interface (also available from a LinkedList).
Add unit testing to the textanalyzer class. Please perform this task using JUnit. import java.util.ArrayList; import java.util.Collections; import java.util.Comparator; import java.util.HashMap; import java.util.List; import java.util.Map; import java.util.Set; import java.io.*; public class TextAnalyzer { public static void main(String[] args) throws Exception { String Word; URL poem = new URL("https://www.gutenberg.org/files/1065/1065-h/1065-h.htm"); BufferedReader in = new BufferedReader( new InputStreamReader(poem.openStream())); Map map = new HashMap(); while ((Word = in.readLine()) != null) { String[] words = Word.split("[\\s.;,?:!()\"]+"); for (String word : words) { word = word.trim(); if (word.length() > 0) { if (map.containsKey(word)) { map.put(word, map.get(word) + 1); } else { map.put(word, (int) 1L); } } } } // retrieving the map contents Set> set = map.entrySet(); // make an array list List> sortedList = new…
How do I limit the size of "com" from the combine function? I want it to have a strict size of 4, but it still allows more than 4 in size. import java.util.LinkedList; public class Lab5 { // BEGIN EDITING HERE // CREATE VARIABLES YOU MAY NEED, SUCH AS: // public int count=0; /******************************************** Requirement: Replace this comment here with a comment that explains how your rules work and why you believe it is fair. *********************************************/ private LinkedList<Integer> stack; public void combine() { if(com.size()>4){ return; }// Limit to 4 elements if(pri.size()>0) com.add(pri.pop()); // Something is in priority, so pop it over to combined else if(reg.size()>0) com.add(reg.pop()); // If priority is empty, pop something from regular to combined } // DO NOT EDIT BELOW HERE // The three lists: regular, priority, and combined private LinkedList<Integer> reg, pri, com; // Constructor: Make three empty FIFO queues public…
Implement a simple linked list in Python (Write source code and show output) with basic linked list operations like: (a) create a sequence of nodes and construct a linear linked list. (b) insert a new node in the linked list. (b) delete a particular node in the linked list. (c) modify the linear linked list into a circular linked list. Use this template: class Node:def __init__(self, val=None):self.val = valself.next = Noneclass LinkedList:"""TODO: Remove the "pass" statements and implement each methodAdd any methods if necessaryDON'T use a builtin list to keep all your nodes."""def __init__(self):self.head = None # The head of your list, don't change its name. It shouldbe "None" when the list is empty.def append(self, num): # append num to the tail of the listpassdef insert(self, index, num): # insert num into the given indexpassdef delete(self, index): # remove the node at the given index and return the deleted value as an integerpassdef circularize(self): # Make your list circular.…
package hashset; import java.util.Iterator; public class MySet { // implements a set using a separate chaining hash table privateclass Node { private Integer element; private Node next; private Node(Integer e, Node n) { element = e; next = n; } } private Node table[]; //an array of linked list privateinttableSize; //current number of lists in the table privateintnumElements; //number of elements in the set privatefinalintprimes[] = {7, 23, 59, 131, 271, 563, 1171, 2083, 4441, 8839, 16319, 32467, 65701, 131413, 263983, 528991}; privateintprimeIndex; //last prime used publicint getSize() { returntableSize; } privateint nextPrime(intp) { //finds the next prime from the list above //used for resizing and the initial size while (primes[primeIndex] <= p) primeIndex++; returnprimes[primeIndex]; } public MySet(ints) { //s is a hint for the initial size primeIndex = 0; tableSize = nextPrime(s); table = new Node[tableSize]; numElements = 0; } //return the hash function…
Implement class “LinkedList” which has two private data members head: A pointer to the Node class length: length of the linked list // Node* GetNode(int index) const;A private function which is only accessible to the class methods. This function takes an array-like index and returns the address of the node at that index. For example, index 0 corresponds to the head and index length-1 corresponds to end node of the linked list. The function returns NULL if the index is out of bound.// Implement the following public method: 1. bool RemoveHead();// Use RemoveAt FunctionRemove first node. Return true if successful, otherwise, false.2. bool RemoveEnd();// Use RemoveAt FunctionRemove last node. Return true if successful, otherwise, false.3 . void DisplayList() const;Display data of the whole linked list this in c++.
package circularlinkedlist;import java.util.Iterator; public class CircularLinkedList<E> implements Iterable<E> { // Your variablesNode<E> head;Node<E> tail;int size; // BE SURE TO KEEP TRACK OF THE SIZE // implement this constructorpublic CircularLinkedList() {} // I highly recommend using this helper method// Return Node<E> found at the specified index// be sure to handle out of bounds casesprivate Node<E> getNode(int index ) { return null;} // attach a node to the end of the listpublic boolean add(E item) {this.add(size,item);return false; } // Cases to handle// out of bounds// adding to empty list// adding to front// adding to "end"// adding anywhere else// REMEMBER TO INCREMENT THE SIZEpublic void add(int index, E item){ } // remove must handle the following cases// out of bounds// removing the only thing in the list// removing the first thing in the list (need to adjust the last thing in the list to point to the beginning)// removing the last…
Implement a city database using ordered lists. Each database record contains the name of the city (a string of arbitrary length) and the coordinates of the city expressed as integer x and y coordinates. Your database should allow records to be inserted, deleted by name, and searched by name. Another operation that should be supported is to print all records within a given distance of a specified point/coordinate. The order of cities should be alphabetically by city name. Implement the database using: an array- based list implementation. By using JAVA.
Code In Java Using Array or doubly Linklist instead of linklist COVID-19 has effect whole world. People are interested in knowing current situation of COVID-19. You are required to write JAVA program for storing information in a Array Following JAVA classes are provided. // Node class public class COVIDDetail { public String country; public int activecases; public COVIDDetail next; } // linked List class public class COVIDList { COVIDDetail start=null; } You are required to add following methods to COVIDList class void add(COVIDDetail n) this method receives a node as argument and adds it to given list. Nodes are arranged in descending order with respect to number of cases. Note that you are not required to sort the list in fact while adding first find its appropriate position and then add given node to that position. void updateCases(String country_name , int cases) this method receives two argument country name and cases (can have…
Create an implementation of singly linked list using classes with minimum 5 nodes (spectre, togusa, yuri, siren, shepherd) in Python with the following capabilities/functions: Traverse - print out all data from the linked list Insert - generate a node and attach to an existing linked list Search - find an item (data) from the linked list and return the node Remove - remove a node from the linked list