Text reading is an integral component in our counting algorithms, and it is also ubiquitous in daily applications. The following is a very bad algorithm for reading from a text file, although it is correct and straightforward. It reads from a file line by line, and concatenate them into text. Then we split it using a regular expression. The split part is fast in linear complexity (we will learn it in Comp-2140), hence that is not our concern. Note that trim() is needed to remove empty strings. static String [] readTextBAD (String PATH) throws Exception { BufferedReader br=new BufferedReader (new FileReader (PATH)); String text=""; String line=""; while ((line=br.readLine())!=null) text=text+" "+line.trim() ; String tokens []=text. trim ().split("[^a-zA-Z]+"); return tokens; } 5.4.1 Time complexity of readTextBAD Write below the time complexity of readTextBAD in terms of the text word length n, and explain your answer. Refer to repeat1 example in the textbook for the cause of low speed and its time complexity.

Text reading is an integral component in our counting algorithms, and it is also ubiquitous in daily applications. The following is a very bad algorithm for reading from a text file, although it is correct and straightforward. It reads from a file line by line, and concatenate them into text. Then we split it using a regular expression. The split part is fast in linear complexity (we will learn it in Comp-2140), hence that is not our concern. Note that trim() is needed to remove empty strings. static String [] readTextBAD (String PATH) throws Exception { BufferedReader br=new BufferedReader (new FileReader (PATH)); String text=""; String line=""; while ((line=br.readLine())!=null) text=text+" "+line.trim() ; String tokens []=text. trim ().split("[^a-zA-Z]+"); return tokens; } 5.4.1 Time complexity of readTextBAD Write below the time complexity of readTextBAD in terms of the text word length n, and explain your answer. Refer to repeat1 example in the textbook for the cause of low speed and its time complexity.

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

Related questions

Q: Using C++ or Java, compare the bubble sort, inclusion sort, and margesort algorithms. Make a large…

A: In this question we have to write a C++ program to compare the execution of bubble, mergesort and…

Q: Given a vector of frequencies c = (C₁, C2, ..., Cn), where n ≥ 1 and all c, are non-negative…

A: As per the given formula : pi : probability of ith element in vector is : ci(ith element) divided by…

Q: to a probability vector p = (P₁, P2,..., Pn) usin inction freq_to_prob (c) that takes a frequen…

A: Code is given in solution vector of frequencies c = (C1, C2, ..., Cn), where n ≥ 1 and all c; are…

Q: Please answer this question- Implement Floyd's algorithm for the Shortest Path on your system, and…

A: In this question we have to implement Floyd's algorithm in Java to find the shortest paths in a…

Q: Write a Matlab script Fibonacci.m that uses the function input to ask for an integer n, checks if n…

A: Here is the matlab code of the above problem. See below steps for code.

Q: We learned from mathematics that addition is commutative (i.e. a+b = b+a) and associative (i.e. (a +…

A: The addition of integers is commutative and associative.Even though integers can have negative…

Q: There are many algorithms presented in this text that would lend themselves to be included as…

A: .asm file - In computing, an .asm file is a source code file written in assembly language. Assembly…

Q: You are the sysadmin for a big tech company, and you have to estimate the amount of servers you need…

A: In Java:-Step-1: StartStep-2: Define a class Solution Step-2.1: Define function minMeetingRooms,…

Q: Solve using JAVA only Given a square chess board of size N, solve the N queens problem.…

A: The Java Code for the given problem is provided below: We are using multi-dimensional array to…

Q: Here is the code of bubble sort. Its run time complexity is 8(n²). Change the code in a way so that…

A: Please refer to the following steps for the complete solution to the problem above.

Q: Can this be written in C programming and using strings and loops. Also can there be clear and…

A: I have provided C CODE along with CODE SCREENSHOT and 2 OUTPUT…

Q: Ada has an array of n toys, each of which is either a ball, squeaker, or stuffed. She wants to sort…

A: An algorithm is a set of well-defined instructions or a step-by-step procedure for solving a…

Q: Input The first line contains an integer N ( 1 <= N <= 105), denoting the length of Alice's sorted…

A: Introduction To solve this problem, you can simply merge the two sorted lists. You can use two…

Question

Text reading is an integral component in our counting algorithms, and it is also ubiquitous in daily applications. The
following is a very bad algorithm for reading from a text file, although it is correct and straightforward. It reads from
a file line by line, and concatenate them into text. Then we split it using a regular expression. The split part is
fast in linear complexity (we will learn it in Comp-2140), hence that is not our concern. Note that trim() is needed
to remove empty strings.
static String [] readTextBAD (String PATH) throws Exception {
BufferedRe ader br=new BufferedReader (new FileReader(PATH));
String text="";
String line="";
while ((line=br.readLine ())!=null)
text=text+" "+line.trim();
String tokens []=text.trim().split("[^a-zA -Z]+");
return tokens;
}
5.4.1
Time complexity of readTextBAD
Write below the time complexity of readTextBAD in terms of the text word length n, and explain your answer. Refer
to repeat1 example in the textbook for the cause of low speed and its time complexity.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Implement the insertionSort function and modify the quicksortHelper() function so that it calls insertion sort to sort any sublist whose size is less than 50 items. Compare the performance of this version with that of the original one, using data sets of 50, 500, and 5000 items. Afterwards, adjust the threshold for using the insertion sort to determine an optimal setting based on your findings from the step above. To test your program run the main() method in the testquicksort.py file.
Complete the function encrypt, which takes an unencrypted, plaintext message called plaintext and encrypts it according to the following algorithm. The function then returns the encrypted ciphertext message. 1. Using a for-loop, swap the character at each even-indexed position with the one to its right. (Examples: abcdefg becomes badcfe; abcdefg becomes badcfeg) You'll have to carefully accomodate for even-lengthed and odd-lengthed strings. 2. Then, using another for-loop, replace every uppercase letter with its lowercase equivalent, and replace every lowercase letter with its uppercase equivalent. 3. (May be combined with the loop in the previous step in the code.) Except for the character o, replace each digit character with 10 minus that digit. (Examples: 2 becomes 8, 9 becomes 1.) Hint: use ord and/or chr and/or str and/or int instead of a 10-way if- statement! Examples: Function Call encrypt('abCDefGHIJKLMnopQ') encrypt('ABCdefGHIjkL') encrypt('0123456789') encrypt('123456789')…
We will be looking at a problem known as the partition problem. The partition problem is to determineif a given set can be partitioned into two subsets such that the sum of elements in both subsets is thesame. This is a variant of the 0-1 knapsack problem.You would notice that the code only returns True or False. Suppose now you need to change thecode using Backtracking such that it returns the numbers of the subsets.Please explain your codes.# Returns true if there exists a sublist of list `nums[0…n)` with the given sum def subsetSum(nums, total): n = len(nums) # `T[i][j]` stores true if subset with sum `j` can be attained # using items up to first `i` items T = [[False for x in range(total + 1)] for y in range(n + 1)] # if the sum is zero for i in range(n + 1): T[i][0] = True # do for i'th item for i in range(1, n + 1): # consider all sum from 1 to total for j in range(1, total + 1): # don't include the…
Apply algorithm 4.3.2 in P.155 with n=6 and A=(3,5,4,1,3,2). Draw only the right half of the corresponding walkthrough as shown in P.155, showing only the list A at the end of the outer “for” loop.
The module timeit (imported above) allows you to compute the time a function call takes. Verify your answer about the time complexity from Exercise I have attached by computing the run time for randomly chosen arc diagrams of suitable sizes and producing an appropriate plot of the average run times against the lengths of the matchings. Interpret your results.
You are given a list of randomly arranged numbers, for example (11,7,18,5,17,13). The triple (11,7, 5) is called the "inversion triple" because (5<7<11) in terms of value, while the index of 5 in the list is greater than the index of 7, and the index of 7 is greater than 11. Therefore, we can find 2 inversions in such list as follows: (11,7,5), and (18,17,13). Your main task is to find the total number of inversions in any given list. a) Design a brute-force algorithm to return the number of possible inversions, and analyse the complexity of your solution b) Develop a python code to implement your brute-force algorithm. [The marks depend on the correctness of the code, indentation, comments, test-case] c) Design a more efficient algorithm to do the same task with less complexity, and analyse the complexity of your solution. [Important instruction to be followed: Create an arbitrary unsorted list of 8 characters and use it to provide full explanation of how your proposed…
Can someone help me turn this in python code, please?
mber. A composite number is any integer n that can be written as a product n = p ·q,where p and q are integers with 1 < p, q < n. Specifically for the purpose of this question, 0 and 1 are notconsidered composite numbers.Your machine can be non-deterministic, and it can use multiple tapes (as many as you need). I suggestbreaking up the construction into smaller sub-tasks. In particular, the machine you built in Question 3might be useful.For this question, it is enough to give a detailed description of the algorithm of your machine. You donot need to draw a full transition diagram. Although you can draw diagrams for smaller parts if it helpsyou illustrate your construction.
Write a python program. Add a function called reverse() that outputs a DNA strand in reverse. Example: reverse(AATC) returns CTAA Note: you should not use the built-in reverse method.
Define a function shuffle that takes a sequence with an even number of elements (cards) and creates a new list that interleaves the elements of the first half with the elements of the second half. Let's better understand what it means to shuffle a list in this way. Let's say there is some list [1, 2, 3, 4, 5, 6, 7, 8]. To interleave the first half [1, 2, 3, 4] with the second half [5, 6, 7, 8] means that your final list should contain the first element from the first half, then the first element from the second half, then the second element of the first half, then the second element of the second half and so on. So the interleaved version of [1, 2, 3, 4, 5, 6, 7, 8] would be [1, 5, 2, 6, 3, 7, 4, 8]. def card (n): """Return the playing card numeral as a string for a positive n 0 and n >> shuffle (range(6)) [0, 3, 1, 4, 2, 5] >>> suits = ['H', 'D', 'S', 'C'] >>> cards = [card (n) + suit for n in range (1,14) for suit in suits] >>> cards [:12] ['AH', 'AD', 'AS', 'AC', '2H', '2D', '25',…
Please answer this question- Implement Floyd's algorithm for the Shortest Path on your system, and study its performance using different graphs. Side note- Below I have attached Floyd's Algorithm for Shortest Paths. please use java language for coding java file - should start with your Last Name, Like SmithClubApp, PetrowskiTravelLogApp, for your class short paragraph should include- -description of the java file -what it does? -what is the input data? expected output, samples of both
Define a function shuffle that takes a sequence with an even number of elements (cards) and creates a new list that interleaves the elements of the first half with the elements of the second half. Let's better understand what it means to shuffle a list in this way. Let's say there is some list [1, 2, 3, 4, 5, 6, 7, 8]. To interleave the first half [1, 2, 3, 4] with the second half [5, 6, 7, 8] means that your final list should contain the first element from the first half, then the first element from the second half, then the second element of the first half, then the second element of the second half and so on. So the interleaved version of [1, 2, 3, 4, 5, 6, 7, 8] would be [1, 5, 2, 6, 3, 7, 4, 8]. def card (n): """Return the playing card numeral as a string for a positive n 0 and n >> shuffle (range(6)) [0, 3, 1, 4, 2, 5] >>> suits = ['H', 'D', 'S', 'C'] >>> cards = [card (n) + suit for n in range (1,14) for suit in suits] >>> cards [:12] ['AH', 'AD', 'AS', 'AC', '2H', '2D', '25',…