
Introduction to Java Programming and Data Structures: Brief Version (11th Global Edition)
11th Edition
ISBN: 9780134671710
Author: Y. Daniel Liang
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Textbook Question
Chapter 22.3, Problem 22.3.2CP
How many stars are displayed in the following code if n is 10? How many if n is 20? Use the Big O notation to estimate the time complexity.
Expert Solution & Answer

Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
7. See the code below and solve the following.
public class Test {
public static void main(String[] args) {
int result = 0;
}
result = fn(2,3);
System.out.println("The result is:
+ result);
// fn(x, 1) = x
// fn(x, y)
=
fn(x, y-1) + 2, when y>1
public static int fn(int x, int y) {
if (x <= 1)
return x;
else
return fn(x, y-1) + 2;
}
}
7-1. This program has a bug that leads to infinite recursion. Modify fn(int x, int y) method to fix
the problem. (2 point)
7-2. Manually trace the recursive call, fn(2,3) and show the output (step by step). (2 point)
7-3. Can you identify the Base Case in recursive method fn(int x, int y)? (1 point)
6. See the code below and solve the following.
import java.io.*;
public class DataStream {
}
public static void main(String[] args)
}
DataOutputStream output = new DataOutputStream(new FileOutputStream("temp.dat"));
output.writeUTF("Book1");
output.writeInt(85);
output.writeUTF("Book2");
output.writeInt(125);
output.writeUTF("Book3");
output.writeInt(70);
output.close();
// ToDo: Read all data from temp.dat and print the data to the standard output (monitor)
6-1. This program has a compile error, and the message is “Unhandled exception type
FileNotFoundException". How do you fix this error? (1 point)
6-2. Is FileNotFoundException a checked exception or an unchecked exception? (1 point)
6-3. What is the difference between checked exception and unchecked exception? (1 point)
6-4. Please complete the above program by reading all data from temp.dat and print the data
to the standard output (monitor) by using System.out.print, System.out.println or
System.out.printf method. (2 points)
Write a program that reads a list of integers from input and determines if the list is a palindrome (values are identical from first to last and last to first). The input begins with an integer indicating the length of the list that follows. Assume the list will contain a maximum of 20 integers. Output "yes" if the list is a palindrome and "no" otherwise. The output ends with a newline.
Hints: - use a for loop to populate the array based on the specified size (the first number entered)
- use a for loop to check first value with last value, second value with second from end, etc.
- if the values do not match, set a Boolean variable to flag which statement to output (yes or no)
Ex: If the input is (remember to include spaces between the numbers):
6 1 5 9 9 5 1
the output is:
yes
Ex: If the input is:
5 1 2 3 4 5
the output is: C++ coding
Chapter 22 Solutions
Introduction to Java Programming and Data Structures: Brief Version (11th Global Edition)
Ch. 22.2 - Prob. 22.2.1CPCh. 22.2 - What is the order of each of the following...Ch. 22.3 - Count the number of iterations in the following...Ch. 22.3 - How many stars are displayed in the following code...Ch. 22.3 - Prob. 22.3.3CPCh. 22.3 - Prob. 22.3.4CPCh. 22.3 - Example 7 in Section 22.3 assumes n = 2k. Revise...Ch. 22.4 - Prob. 22.4.1CPCh. 22.4 - Prob. 22.4.2CPCh. 22.4 - Prob. 22.4.3CP
Ch. 22.4 - Prob. 22.4.4CPCh. 22.4 - Prob. 22.4.5CPCh. 22.4 - Prob. 22.4.6CPCh. 22.5 - Prob. 22.5.1CPCh. 22.5 - Why is the recursive Fibonacci algorithm...Ch. 22.6 - Prob. 22.6.1CPCh. 22.7 - Prob. 22.7.1CPCh. 22.7 - Prob. 22.7.2CPCh. 22.8 - Prob. 22.8.1CPCh. 22.8 - What is the difference between divide-and-conquer...Ch. 22.8 - Prob. 22.8.3CPCh. 22.9 - Prob. 22.9.1CPCh. 22.9 - Prob. 22.9.2CPCh. 22.10 - Prob. 22.10.1CPCh. 22.10 - Prob. 22.10.2CPCh. 22.10 - Prob. 22.10.3CPCh. 22 - Program to display maximum consecutive...Ch. 22 - (Maximum increasingly ordered subsequence) Write a...Ch. 22 - (Pattern matching) Write an 0(n) time program that...Ch. 22 - (Pattern matching) Write a program that prompts...Ch. 22 - (Same-number subsequence) Write an O(n) time...Ch. 22 - (Execution time for GCD) Write a program that...Ch. 22 - (Geometry: gift-wrapping algorithm for finding a...Ch. 22 - (Geometry: Grahams algorithm for finding a convex...Ch. 22 - Prob. 22.13PECh. 22 - (Execution time for prime numbers) Write a program...Ch. 22 - (Geometry: noncrossed polygon) Write a program...Ch. 22 - (Linear search animation) Write a program that...Ch. 22 - (Binary search animation) Write a program that...Ch. 22 - (Find the smallest number) Write a method that...Ch. 22 - (Game: Sudoku) Revise Programming Exercise 22.21...Ch. 22 - (Bin packing with smallest object first) The bin...Ch. 22 - Prob. 22.27PE
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
For the circuit shown, use the node-voltage method to find v1, v2, and i1.
How much power is delivered to the c...
Electric Circuits. (11th Edition)
There are three seating categories at a high school athletic stadium. For a baseball game, Class A seats cost 1...
Starting Out With Visual Basic (8th Edition)
Convert the following iterative method to one that uses recursion: public static void sign(int n) { while (n 0...
Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)
Why is the shielded metal arc welding process limited to low welding currents and shallow penetration?
Degarmo's Materials And Processes In Manufacturing
Write an if statement that multiplies payRate by 1.5 if hours is greater than 40.
Starting Out with Java: From Control Structures through Objects (7th Edition) (What's New in Computer Science)
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
- Design and draw a high-level "as-is" process diagram that illustrates a current process related to a product or service offered through the SSDCI.gov database.arrow_forwardCompare last-mile connections for connecting homes and businesses to the Internetarrow_forwardExplain wireless networking standardsarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- EBK JAVA PROGRAMMINGComputer ScienceISBN:9781337671385Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENTC++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology PtrC++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
- Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage LearningOperations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks ColeProgramming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:Cengage

EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT

C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr

C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning

Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning

Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Computational Software for Intelligent System Design; Author: Cadence Design Systems;https://www.youtube.com/watch?v=dLXZ6bM--j0;License: Standard Youtube License