This problem is based on a "Nifty Assignment" by Steve Wolfman (http://nifty. stanford.edu/2006/wolfman-pretid). Consider lists of numbers from real-life data sources-for example, a list containing the number of students enrolled in different course sections, the number of comments posted for different Facebook status up dates, the number of books in different library holdings, the number of votes per precinct, etc. It might seem like the leading digit of each number in the list could be 1-9 with an equally likely probability. However, Benford's Law states that the leading digit is 1 about 30% of the time and drops with larger digits. The leading digit is 9 only about 5% of the time.
Write a
Want to see the full answer?
Check out a sample textbook solutionChapter 3 Solutions
Absolute Java (6th Edition)
Additional Engineering Textbook Solutions
Java: An Introduction to Problem Solving and Programming (8th Edition)
Starting Out with C++: Early Objects (9th Edition)
Database Concepts (8th Edition)
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
C How to Program (8th Edition)
Modern Database Management
- In Java: The CSV (or comma-separated values) format is commonly used for tabular data. Each table row is a line, with columns separated by commas. Items may be enclosed in quotation marks, and they must be if they contain commas or quotation marks. Quotation marks inside quoted fields are doubled. Here is a line with four fields:1729, San Francisco, "Hello, World", "He asked: ""Quo vadis?""" Implement a class CSVReader that reads a CSV file, and provide methodsint numberOfRows()int numberOfFields(int row)String field(int row, int column)arrow_forwardImplement 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.arrow_forwardQ2: Ginormous Campus The campus is pretty big. There are n buildings scattered around it, numbered from 0 to n-1. These buildings are so far away from each other that the only way to get from one to another is to take a campus bus. There are m campus bus routes. The i-th one (0 <= i < m) takes you from building u_i to building v_i (but not the other way around). These buses run very frequently. Professor Zingaro is deciding where to hold his CS lectures. He believes a building x is accessible from a building y if you can get from y to x taking at most two buses. For his students’ convenience, he wants to hold his lectures in the most accessible building. Help him out by telling him how many buildings the most accessible building is accessible from. In addition, list all buildings that are the most accessible. Input The first line of the input contains two space-separated integers n and m, denoting the number of buildings and bus routes, respectively. m lines follow. The i-th one…arrow_forward
- Instrument FrequencyCounter to use Stopwatch and StdDraw to make a plot where the x-axis is the number of calls on get() or put() and the y-axis is the total running time, with a point plotted of the cumulative time after each call. Run your program for Tale of Two Cities using SequentialSearchST and again using BinarySearchST and discuss the results. Note : Sharp jumps in the curve may be explained by caching, which is beyond the scope of this question.arrow_forwardIn java, please read the text file as array. Then, replace the null with 0 and calculate the sum of the new students in ABC University.Example of text file: (university,year,total_students,new_students,new_staff,ABC, 2000, 3457, , ,ABC, 2001, 3675,218, ,EFG, 2000, 2389,602, ,EFG, 2001, 2785,396, 65,)arrow_forwardImplement two different versions of quicksort in a high level programming language. The first version will use the first element of the array as the pivot. The second version will use the median of the first element, middle element, and last element of the array as the pivot. For each version, compare the performance on random arrays of data of sizes 10n for n = 2, 3, and 4. Create three graphs (one for the random data, one for the increasing data, and one for the decreasing data) to illustrate your results. Discuss these results.arrow_forward
- Python Question The campus is pretty big. There are n buildings scattered around it, numbered from 0 to n-1. These buildings are so far away from each other that the only way to get from one to another is to take a campus bus. There are m campus bus routes. The i-th one (0 <= i < m) takes you from building u_i to building v_i (but not the other way around). These buses run very frequently. Professor Zingaro is deciding where to hold his CS lectures. He believes a building x is accessible from a building y if you can get from y to x taking at most two buses. For his students’ convenience, he wants to hold his lectures in the most accessible building. Help him out by telling him how many buildings the most accessible building is accessible from. In addition, list all buildings that are the most accessible. Input The first line of the input contains two space-separated integers n and m, denoting the number of buildings and bus routes, respectively. m lines follow. The i-th one…arrow_forwardWrite a program that generates a square table that contains randomly generated integer values that are between 0 and10. - include a fixed seed value by using the function random.seedarrow_forwardA young programmer wrote his first testing system. He was so happy it compiled that he invited his school friends to his own contest. But at the end of the tour it turned out that the system can't sort the teams in the results table properly. Help the programmer to write the correct implementation of the sorting. The teams should be sorted by the next criteria: 1) By the quantity of solved tasks in descending order 2) When the quantities of solved tasks are equal-by the penalty time in ascending order 3) When both quantities of solved tasks and penalty times are equal-by the indices of teams in ascending order. Output: n numbers - the indices of teams in sorted order. Example: Input 5 3 50 5 728 17 00 8 500 Output 52134arrow_forward
- We want to build 10 letter “words” using only the first n=9n=9 letters of the alphabet. For example, if n=5n=5 we can use the first 5 letters, {a,b,c,d,e}{a,b,c,d,e} (Recall, words are just strings of letters, not necessarily actual English words.) How many of these words are there in total? How many of these words contain no repeated letters? How many of these words start with the sub-word “ade”? How many of these words either start with “ade” or end with “be” or both? How many of the words containing no repeats also do not contain the sub-word “bed”?arrow_forwardWrite a program that prints an mxn matrix whose dimensions are specified by the user. Let the matrix values be random variables. You must use it within the repetition cycle. Example format: Enter dimension of matrix mxn: 2 4 The 2x4 matrix is : 1 2 3 4 5 6 7 8arrow_forwardComputer Engineering Lab The Government of United States of America has decided to issue new currency notes with special protection features to so as to commemorate a great mathematician. They have decided to issue notes summing up to N and all the sums from 1 to N should only made by selecting some of the notes in only one unique way. With n = 5 the sets {1,1,1,1,1}, {1,2,2}, {1,1,3} are valid. Your task is to design a C++ code that output the solution in one line. Sample Input - 100 Sample Output - 3arrow_forward
- C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning