Lab 02: Splitting a URL into piecesURLS are composed of five pieces:The scheme, also known as the protocolThe authority (may further be divided into the user info, the host, and the port)The pathThe fragment identifier, also known as the section or refThe query stringRead-only access to these parts of a URL is provided by nine public methods: getFile(), getHost(),getPort(), getProtocol(), getRef(), getQuery(), getPath(), getUserinfo(), and getAuthority().Write a Java program which uses these methods to split URLS entered on the command line into theircomponent parts.

import java.net.*; class Main { public static void main(String args[]) { URL url =…

Read-only access to these parts of a URL is provided by nine public methods: getFile(), getHost(), getPort(), getProtocol(), getRef(), getQuery(), getPath(), getUserlnfo(), and getAuthority(). Write a Java program which uses these methods to split URLS entered on the command line into their component parts.

Read-only access to these parts of a URL is provided by nine public methods: getFile(), getHost(), getPort(), getProtocol(), getRef(), getQuery(), getPath(), getUserlnfo(), and getAuthority(). Write a Java program which uses these methods to split URLS entered on the command line into their component parts.

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

Help me solve this problem!: Method Skeletons and a Loop Roundup Practice these steps again and then solve the set of loop problems. These problems are more difficult than those in the previous lesson, so you'll need to take your time and work through each one step-by-step. Here is the link: https://codecheck.it/files/1906092225agosqgnp6wc7mwgcfpf6s4wky
Write an application program using single LinkedList or circular single LinkedList to store the ISBN of a books. Create a class called “Book”, add appropriate data fields to the class, add the operations (methods) insert ( at front, end, and specific position), remove (from at front, end, and specific position), and display to the class.
Crypto Columns The columnar encryption scheme scrambles the letters in a message (or plaintext) using a keyword as illustrated in the following example: Suppose BATBOY is the keyword and our message is MEET ME BY THE OLD OAK TREE. Since the keyword has 6 letters, we write the message (ignoring spacing and punctuation) in a grid with 6 columns, padding with random extra letters as needed: MEETME BYTHEO LDOAKT REENTH Here, we've padded the message with NTH. Now the message is printed out by columns, but the columns are printed in the order determined by the letters in the keyword. Since A is the letter of the keyword that comes first in the alphabet, column 2 is printed first. The next letter, B, occurs twice. In the case of a tie like this we print the columns leftmost first, so we print column 1, then column 4. This continues, printing the remaining columns in order 5, 3 and finally 6. So, the order the columns of the grid are printed would be 2, 1, 4, 5, 3, 6, in this case. This…
import java.io.BufferedReader; import java.io.InputStreamReader; import java.net.HttpURLConnection; import java.net.URL; import java.net.URLEncoder; import org.json.JSONObject; public class Myclass { public static void main(String[] args) throws Exception { try { URL url = new URL("https://parseapi.back4app.com/classes/City?count=1&limit=10&keys=name,population"); HttpURLConnection urlConnection = (HttpURLConnection)url.openConnection(); urlConnection.setRequestProperty("X-Parse-Application-Id", "mxsebv4KoWIGkRntXwyzg6c6DhKWQuit8Ry9sHja"); // This is the fake app's application id urlConnection.setRequestProperty("X-Parse-Master-Key", "TpO0j3lG2PmEVMXlKYQACoOXKQrL3lwM0HwR9dbH"); // This is the fake app's readonly master key try { BufferedReader reader = new BufferedReader(new InputStreamReader(urlConnection.getInputStream())); StringBuilder stringBuilder = new…
Given a list of employees, create JAVA a simple program that allows the user to insert, delete, display,and search an employee. The program should input 10 full names of employees with employeenumber as linked list. Also, a list of menus should be displayed.These menus are Insert, Delete, Display and Search.A. Insert - allows the user to insert one employee at a time with corresponding ID numberwhich serves as their link. All employees to be inserted must be inserted at theend of the list. B. Delete – allows the user to delete the employee from the listC. Display – allows the user to display the list of employeesD. Search - allows the user to find a certain employeeThese menus should be in loop once you test every operation based on the listed menu. Use linked list as a data structure in generating a list of employees, andPerform basic operations that can be applied in a linked list
to create a SortedList object with three names and IP addresses, show the code.to create a SortedList object with three names and IP addresses, show the code.to create a SortedList object with three names and IP addresses, show the code.
After modify the following code please split which part will be main.java file and which part will be hashtableclass.java file? Because I will use main.java IDE. Modify the given programs by adding two methods in HashTableClass: Show Full code with output. Please Don't copy previous solution. Find and return the item with the maximum key; Find and return average of the keys in the hash table. import java.util.*;public class hashTableClass { public int tableSize; Node[] T; public hashTableClass() { System.out.println("Give the hash table size"); tableSize = Integer.parseInt(new Scanner(System.in).nextLine()); T = new Node[tableSize]; for (int i = 0; i < tableSize; i++) T[i] = null; } public int hashFunction(int Key) { return Key % tableSize; } public Node Search(int Key) { int h = hashFunction(Key); Node current = T[h]; while (current != null && current.item != Key)…
Given a list of employees, create a simple JAVA program that allows the user to insert, delete, display,and search an employee. The program should input 10 full names of employees with employee number as linked list. Also, a list of menus should be displayed. These menus are Insert, Delete, Display and Search. A. Insert - allows the user to insert one employee at a time with corresponding ID number which serves as their link. All employees to be inserted must be inserted at the end of the list. B. Delete – allows the user to delete the employee from the list C. Display – allows the user to display the list of employees D. Search - allows the user to find a certain employee These menus should be in loop once you test every operation based on the listed menu. Use linked list as a data structure in generating a list of employees.
Python task: Task OverviewYour task is to implement a variation of the classic word game Hangman, which involves playersguessing the letters in a word chosen at random with a finite number of guesses. While there arealternate versions such as category Hangman and Wheel of Fortune, which involve playersguessing idioms, places, names and so on, we will be sticking with the traditional version.If you are unfamiliar with the rules of the game, please read the following before starting:http://en.wikipedia.org/wiki/Hangman_(game). You can also play an online version here. Don’tbe intimidated - You’ll be given some skeleton code to get you started, it's easier than it looks! You will implement a function called main that allows users to play an interactive hangman gameagainst the computer. The computer should pick a word, and players should then try to guess lettersin the word until they win or run out of guesses.Here is the overarching behaviour we expect:1. The program should load a list of…
After modify the following code please split which part will be main.java file and which part will be hashtableclass.java file? Because I will use main.java IDE. Please don't copy previous solution. That was not correct. Modify the given programs by adding two methods in HashTableClass: Show Full code with output. Find and return the item with the maximum key; Find and return average of the keys in the hash table. import java.util.*;public class hashTableClass { public int tableSize; Node[] T; public hashTableClass() { System.out.println("Give the hash table size"); tableSize = Integer.parseInt(new Scanner(System.in).nextLine()); T = new Node[tableSize]; for (int i = 0; i < tableSize; i++) T[i] = null; } public int hashFunction(int Key) { return Key % tableSize; } public Node Search(int Key) { int h = hashFunction(Key); Node current = T[h]; while (current != null &&…
In JAVA, use a HashMap to count and store the frequency counts for all the words from a large text document. Using file util, please. Then, display the contents of this HashMap with words and frequency count. Next, please create a set view of the Map and store the contents in an array. Sort this array based on key value and display it. Finally, sort the array in decreasing order by frequency and display it as well. Please label your explanation in the code Thank you
Use C++ Programming language. The header file below defines a class for a simple hash table: hashMap.h Download hashMap.h Write a driver program to test the class with the following data: (520, "3100 Main St, Houston TX "); (37, "2200 Hayes Rd, Austin TX"); (226, "1775 West Airport St, San Antonio TX"); (273, "3322 Walnut Bend, Houston TX"); (491, "5778 Alabama, Waco TX"); (94, "3333 New St, Paris TX"); Make sure to test the find function for exiting and non-existing data 2. Modify the type of member key in class HashEntry from int to a string (this is useful is the key is e.g. the phone number or e-mail address). Use the string hash function discussed in class (see ppt notes) or search online for alternative functions that work on strings. 3. Modify the collision strategy of class HashMap to do separate chaining instead of linear probing. Be sure to modify the display function so that items in the bucket chains are also displayed in a pre-defined order…