Starting Out with Java: From Control Structures through Objects (7th Edition) (What's New in Computer Science)
7th Edition
ISBN: 9780134802213
Author: Tony Gaddis
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Expert Solution & Answer
Chapter 11.3, Problem 11.22CP
Explanation of Solution
Difference between sequential access and random access:
| Sequential access | Random Access |
|
Files are processed in sequential order. |
Files are processed in random order. |
|
If the records are needed to be accessed in sequential order, sequential file access is used. |
If the files are needed to access in random order, random file access technique is much faster. |
|
In sequential access, the file pointer moves only in one direction... |
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
A common memory matching game played by young children is to start with a deck of cards that contain identical pairs. For example, given six cards in the deck, two might be labeled 1, two labeled 2, and two labeled 3. The cards are shuffled and placed face down on the table. A player then selects two cards that are face down, turns them face up, and if the cards match, they are left face up. If the two cards do not match, they are returned to their original face down position. The game continues until all cards are face up. Write a program that plays the memory matching game. Use 16 cards that are laid out in a 4 4 square and are labeled with pairs of numbers from 1 to 8. Your program should allow the player to specify the cards that he or she would like to select through a coordinate system. For example, in the following layout: 1 2 3 4 1 8 * * * 2 * * * * 3 * 8 * * 4 * * * * all of the face down cards are indicated by *. The pairs of 8 that are face up are at coordinates (1,1) and…
sum= 0;
for (int i = 0; i 1) {
sum++;
i= 1/2;
}
= 2*log2 (n)
We denote by Ta(n), Tb (n), Te(n) the running time of the three fragments.
1. Give evaluations for Ta(n), Tb (n), Te(n).
2. Is T(n) = O(Ta(n)) ? Answer YES or NO and justify your answer.
3. Is Te(n) = (Ta(n)) ? Answer YES or NO and justify your answer.
Assignment for Computer Architecture
You are to write a program in MIPS that computes N! using recursion. Remember N! is the product of all the numbers from 1 to N inclusive, that is 1 x 2 x 3 x (N – 1) x N. It is defined as 1 for N = 0 and is undefined for values less than 0.
The programs first requests the user to input the value of N (display a prompt first so the user knows what to do). If the input value is less than 0, the program is to display “N! undefined for values less than 0” and then requests the user to input the value of N again. If the value input is non-negative, it is to compute N! using a recursive function, that is one that calls itself.
You are to have your name, the assignment number, and a brief description of the program in comments at the top of your program. Since this is an assembly language program, I expect to see comments on almost every line of code in the program. Also make the code neat: line up the command fields, the register fields, and the comment…
Chapter 11 Solutions
Starting Out with Java: From Control Structures through Objects (7th Edition) (What's New in Computer Science)
Ch. 11.1 - Prob. 11.1CPCh. 11.1 - Prob. 11.2CPCh. 11.1 - Prob. 11.3CPCh. 11.1 - Prob. 11.4CPCh. 11.1 - Prob. 11.5CPCh. 11.1 - Prob. 11.6CPCh. 11.1 - Prob. 11.7CPCh. 11.1 - Prob. 11.8CPCh. 11.1 - Prob. 11.9CPCh. 11.1 - When does the code in a finally block execute?
Ch. 11.1 - What is the call stack? What is a stack trace?Ch. 11.1 - Prob. 11.12CPCh. 11.1 - Prob. 11.13CPCh. 11.1 - Prob. 11.14CPCh. 11.2 - What does the throw statement do?Ch. 11.2 - Prob. 11.16CPCh. 11.2 - Prob. 11.17CPCh. 11.2 - Prob. 11.18CPCh. 11.2 - Prob. 11.19CPCh. 11.3 - What is the difference between a text file and a...Ch. 11.3 - What classes do you use to write output to a...Ch. 11.3 - Prob. 11.22CPCh. 11.3 - What class do you use to work with random access...Ch. 11.3 - What are the two modes that a random access file...Ch. 11.3 - Prob. 11.25CPCh. 11 - Prob. 1MCCh. 11 - Prob. 2MCCh. 11 - Prob. 3MCCh. 11 - Prob. 4MCCh. 11 - FileNotFoundException inherits from __________. a....Ch. 11 - Prob. 6MCCh. 11 - Prob. 7MCCh. 11 - Prob. 8MCCh. 11 - Prob. 9MCCh. 11 - Prob. 10MCCh. 11 - Prob. 11MCCh. 11 - Prob. 12MCCh. 11 - Prob. 13MCCh. 11 - Prob. 14MCCh. 11 - Prob. 15MCCh. 11 - This is the process of converting an object to a...Ch. 11 - Prob. 17TFCh. 11 - Prob. 18TFCh. 11 - Prob. 19TFCh. 11 - True or False: You cannot have more than one catch...Ch. 11 - Prob. 21TFCh. 11 - Prob. 22TFCh. 11 - Prob. 23TFCh. 11 - Prob. 24TFCh. 11 - Find the error in each of the following code...Ch. 11 - // Assume inputFile references a Scanner object,...Ch. 11 - Prob. 3FTECh. 11 - Prob. 1AWCh. 11 - Prob. 2AWCh. 11 - Prob. 3AWCh. 11 - Prob. 4AWCh. 11 - Prob. 5AWCh. 11 - Prob. 6AWCh. 11 - The method getValueFromFile is public and returns...Ch. 11 - Prob. 8AWCh. 11 - Write a statement that creates an object that can...Ch. 11 - Write a statement that opens the file...Ch. 11 - Assume that the reference variable r refers to a...Ch. 11 - Prob. 1SACh. 11 - Prob. 2SACh. 11 - Prob. 3SACh. 11 - Prob. 4SACh. 11 - Prob. 5SACh. 11 - Prob. 6SACh. 11 - What types of objects can be thrown?Ch. 11 - Prob. 8SACh. 11 - Prob. 9SACh. 11 - Prob. 10SACh. 11 - What is the difference between a text file and a...Ch. 11 - What is the difference between a sequential access...Ch. 11 - What happens when you serialize an object? What...Ch. 11 - TestScores Class Write a class named TestScores....Ch. 11 - Prob. 2PCCh. 11 - Prob. 3PCCh. 11 - Prob. 4PCCh. 11 - Prob. 5PCCh. 11 - FileArray Class Design a class that has a static...Ch. 11 - File Encryption Filter File encryption is the...Ch. 11 - File Decryption Filter Write a program that...Ch. 11 - TestScores Modification for Serialization Modify...Ch. 11 - Prob. 10PC
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
- Hill cipher decryption: I must find the encryption key in order to decrypt a specific message. All i know is that the encryption key is 3x3 matrix and the specific message begins with the phrase "CONFIDENT". I must do this in python. I understand how to decrypt stuff once I have the key matrix. But I am confused as to how to find the key matrix in the first place with the information given.arrow_forwardEvery recursion call creates a new activation record for that particular call. Group of answer choices True Falsearrow_forwardCrossover and Mutation The two main operations in evolutionary computing are crossover and mutation. Crossover works like this: Randomly choose two parents from the population. Let’s say these: Parent 1: T F T F T T F Parent 2: T T T F F T T Those two parents will create a child whose DNA is related to the parents’. It works like this: for each of the seven genes in the chromosome, we will randomly pick a number between 1 and 10 and use it to choose which parents’ value the child will get. If the random number is 1 through 5, we will use Parent 1’s included value for the child; if it is 6…arrow_forward
- Crossover and Mutation The two main operations in evolutionary computing are crossover and mutation. Crossover works like this: Randomly choose two parents from the population. Let’s say these: Parent 1: T F T F T T F Parent 2: T T T F F T T Those two parents will create a child whose DNA is related to the parents’. It works like this: for each of the seven genes in the chromosome, we will randomly pick a number between 1 and 10 and use it to choose which parents’ value the child will get. If the random number is 1 through 5, we will use Parent 1’s included value for the child; if it is 6…arrow_forwardUnfortunately, the code itself executes but recursively in infinite loop. Is there a reason why it is doing that?arrow_forwardDefine the term " recursion limitations " .arrow_forward
- Artificial Intelligence (Part - 2) ==================== The Towers of Hanoi is a famous problem for studying recursion incomputer science and searching in artificial intelligence. We start with N discs of varying sizes on a peg (stacked in order according to size), and two empty pegs. We are allowed to move a disc from one peg to another, but we are never allowed to move a larger disc on top of a smaller disc. The goal is to move all the discs to the rightmost peg (see figure). To solve the problem by using search methods, we need first formulate the problem. Supposing there are K pegs and N disk. (2) What is the size of the state space?arrow_forwardSudoku is a popular logic puzzle that uses a 9 by 9 array of squares that are organized into 3 by 3 subarrays. The puzzle solver must fill in the squares with the digits 1 to 9 such that no digit is repeated in any row, any column, or any of the nine 3 by 3 subgroups of squares. Initially, some squares are filled in already and cannot be changed. For example, the following might be a starting configuration for a Sudoku puzzle: Create a class SudokuPuzzle.java Download SudokuPuzzle.java that has the attributes • board—a 9 by 9 array of integers that represents the current state of the puzzle, where 0 indicates a blank square • start—a 9 by 9 array of boolean values that indicates which squares in board are given values that cannot be changed and the following methods: • SudokuPuzzle—a constructor that creates an empty puzzle • toString—returns a string representation of the puzzle that can be printed • addInitial(row, col, value)—sets the given square to the given value as an…arrow_forwardIn python Code so far: # TODO: Declare global variables here.recursions = 0comparisons = 0 def binary_search(nums, target, lower, upper): # Type your code here. target = (lower + upper) //2 global if target == nums[index]: return index if (lower == upper): comparisons +=1 if target == nums[lower]: return lower else: return -1 if (nums[index] < target): recursions += 1 return binary_search(nums,target, index, upper) if nums[index] > target: recursions += 1 return binary_search(nums, target, 0, lower) if __name__ == '__main__': # Input a list of nums from the first line of input nums = [int(n) for n in input().split()] # Input a target value target = int(input()) # Start off with default values: full range of list indices index = binary_search(nums, target, 0, len(nums) - 1) # Output the index where target was found in nums, and the # number of…arrow_forward
- write in assebly language using lc3 simulator LC3 simulator-https://wchargin.com/lc3web/ Write a program that implements a for loop that adds 5 to R3 every iteration a. Increment a register by 1 in every cycle of the loop to keep track of the loop iterationsb. Store the maximum amount of iterations that the loop can have in a memory locationc. Your for loop should start at 0 iterations (i.e. i = 0) and stop looping once the maximum is reached Psuedo code: .ORIG x3000 ; Step 1: Clear R3 ; Step 2: Clear R0 ; Step 3: Load the value of MAX into R1 (maximum amount of iterations) ; Step 4: Take the two's compliment of R1 (2 instructions!) loop ; Step 5: Add #5 to R3 (result) ; Step 6: Increment R0 (loop iteration counter) ; Step 7: Add R1 and R0 and put the result in R2 (Since we did a 2's complement on R1, we are essentially subtracting R1 from R0) ; Step 8: Branch if negative back to loop (this means that R1 > R0 and we need to keep looping) ; Step 9: Halt CPU…arrow_forwardStrength Checker for Password Systems: For a given password system, calculate the search space for a general user and a lazy user. Suppose only 11 special characters can be input. Program with any language. Input (by the evaluator): 1st line: number of characters 2nd line: numbers allowed [Y/N]? must be included [Y/N]? 3rd line: letters allowed [Y/N]? case sensitive [Y/N]? must be included [Y/N]? 4th line: special character allowed [Y/NJ? must be included [Y/N]? Output: 1st line: The search space for a general user is (). 2nd line: The search space for a lazy user is (]. Example: Input: 6 YY YYY YY Output: The search space for a general user is 1.43*10^11. The search space for a lazy user is 2.68*10^9. in java codearrow_forwardWe often used slicing of arrays as examples when we were learning recursion. These are excellent examples for learners, but in the real world they have a significant problem. What is the problem? Enter your answer here Explain an easy trick that we can use to get around this problem, while still retaining the recursive nature of our solution. Enter your answer herearrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
New Perspectives on HTML5, CSS3, and JavaScriptComputer ScienceISBN:9781305503922Author:Patrick M. CareyPublisher:Cengage Learning
New Perspectives on HTML5, CSS3, and JavaScript
Computer Science
ISBN:9781305503922
Author:Patrick M. Carey
Publisher:Cengage Learning