Introduction to Java Programming and Data Structures: Brief Version (11th Global Edition) - 11th Edition - by Y. Daniel Liang - ISBN 9780134671710

Introduction to Java Programming and Da...
11th Edition
Y. Daniel Liang
Publisher: PEARSON
ISBN: 9780134671710

Solutions for Introduction to Java Programming and Data Structures: Brief Version (11th Global Edition)

Chapter

Section

Problem 1.2.1CP:

What are hardware and software?

Problem 1.2.2CP:

List the five major hardware components of a computer.

Problem 1.2.3CP:

What does the acronym CPU stand for? What unit is used to measure CPU speed?

Problem 1.2.4CP

Problem 1.2.5CP:

What is memory for? What does RAM stand for? Why is memory called RAM?

Problem 1.2.6CP

Problem 1.2.7CP

Browse All Chapters of This Textbook

Name: Introduction to Java Programming and Data Structures: Brief Version (11th Global Edition)
Author: Y. Daniel Liang
ISBN: 9780134671710

Chapter 1 - Introduction To Computers, Programs, And Java Chapter 1.2 - What Is A Computer?Chapter 1.3 - Programming Languages Chapter 1.4 - Operating Systems Chapter 1.5 - Java, The World Wide Web, And Beyond Chapter 1.6 - The Java Language Specification, Api, Jdk, Jre, And Ide Chapter 1.7 - A Simple Java Program Chapter 1.8 - Creating, Compiling, And Executing A Java Program Chapter 1.9 - Programming Style And Documentation Chapter 1.10 - Programming Errors

Chapter 2 - Elementary Programming Chapter 2.2 - Writing A Simple Program Chapter 2.3 - Reading Input From The Console Chapter 2.4 - Identifiers Chapter 2.5 - Variables Chapter 2.6 - Assignment Statements And Assignment Expressions Chapter 2.7 - Named Constants Chapter 2.8 - Naming Conventions Chapter 2.9 - Numeric Data Types And Operations Chapter 2.10 - Numeric Literals Chapter 2.11 - Evaluating Expressions And Operator Precedence Chapter 2.12 - Case Study: Displaying The Current Time Chapter 2.13 - Augmented Assignment Operators Chapter 2.14 - Increment And Decrement Operators Chapter 2.15 - Numeric Type Conversions Chapter 2.16 - Software Development Process Chapter 2.17 - Case Study: Counting Monetary Units Chapter 2.18 - Common Errors And Pitfalls Chapter 3 - Selections Chapter 3.2 - Boolean Data Type Chapter 3.3 - If Statements Chapter 3.4 - Two-way If-else Statements Chapter 3.5 - Nested Of And Multi-way If-else Statements Chapter 3.6 - Common Errors And Pitfalls Chapter 3.7 - Generating Random Numbers Chapter 3.9 - Case Study: Computing Taxes Chapter 3.10 - Logical Operators Chapter 3.11 - Case Study: Determining Leap Year Chapter 3.12 - Case Study: Lottery Chapter 3.13 - Switch Statements Chapter 3.14 - Conditional Operators Chapter 3.15 - Operator Precedence And Associativity Chapter 4 - Mathematical Functions, Characters, And Strings Chapter 4.2 - Common Mathematical Functions Chapter 4.3 - Character Data Type And Operations Chapter 4.4 - The String Type Chapter 4.5 - Case Studies Chapter 4.6 - Formatting Console Output Chapter 5 - Loops Chapter 5.2 - The While Loop Chapter 5.3 - Case Study: Guessing Numbers Chapter 5.4 - Loop Design Strategies Chapter 5.5 - Controlling A Loop With User Confirmation Or A Sentinel Value Chapter 5.6 - The Do-whileloop Chapter 5.7 - The For Loop Chapter 5.8 - Which Loop To Use?Chapter 5.9 - Nested Loops Chapter 5.11 - Case Studies Chapter 5.12 - Keywords Break And Continue Chapter 5.13 - Case Study: Checking Palindromes Chapter 5.14 - Case Study: Displaying Prime Numbers Chapter 6 - Methods Chapter 6.4 - Void Vs. Value-returning Methods Chapter 6.5 - Passing Parameters By Values Chapter 6.6 - Modularizing Code Chapter 6.7 - Case Study: Converting Hexadecimals To Decimals Chapter 6.8 - Overloading Methods Chapter 6.9 - The Scope Of Variables Chapter 7 - Single-dimensional Arrays Chapter 7.2 - Array Basics Chapter 7.4 - Case Study: Deck Of Cards Chapter 7.5 - Copying Arrays Chapter 7.7 - Returning An Array From A Method Chapter 7.8 - Case Study: Counting The Occurrences Of Each Letter Chapter 7.9 - Variable-length Argument Lists Chapter 7.10 - Searching Arrays Chapter 7.11 - Sorting Arrays Chapter 7.12 - The Arrays Class Chapter 7.13 - Command-line Arguments Chapter 8 - Multidimensional Arrays Chapter 8.2 - Two-dimensional Array Basics Chapter 8.3 - Processing Two-dimensional Arrays Chapter 8.4 - Passing Two-dimensional Arrays To Methods Chapter 8.5 - Case Study: Grading A Multiple-choice Test Chapter 8.6 - Case Study: Finding The Closest Pair Chapter 8.7 - Case Study: Sudoku Chapter 8.8 - Multidimensional Arrays Chapter 9 - Objects And Classes Chapter 9.3 - Example: Defining Classes And Creating Objects Chapter 9.4 - Constructing Objects Using Constructors Chapter 9.5 - Accessing Objects Via Reference Variables Chapter 9.6 - Using Classes From The Java Library Chapter 9.7 - Static Variables, Constants, And Methods Chapter 9.9 - Data Field Encapsulation Chapter 9.10 - Passing Objects To Methods Chapter 9.11 - Array Of Objects Chapter 9.12 - Immutable Objects And Classes Chapter 9.13 - The Scope Of Variables Chapter 9.14 - The This Reference Chapter 10 - Object-oriented Thinking Chapter 10.2 - Class Abstraction And Encapsulation Chapter 10.3 - Thinking In Objects Chapter 10.4 - Class Relationships Chapter 10.7 - Processing Primitive Data Type Values As Objects Chapter 10.8 - Automatic Conversion Between Primitive Types And Wrapper Class Types Chapter 10.9 - The Biglnteger And Bigdecimal Classes Chapter 10.10 - The String Class Chapter 10.11 - The Stringbuilder And Stringbuffer Classes Chapter 11 - Inheritance And Polymorphism Chapter 11.2 - Superclasses And Subclasses Chapter 11.3 - Using The Super Keyword Chapter 11.4 - Overriding Methods Chapter 11.5 - Overriding Vs. Overloading Chapter 11.7 - Polymorphism Chapter 11.8 - Dynamic Binding Chapter 11.9 - Casting Objects And The Instanceof Operator Chapter 11.10 - The Object's Equals Method Chapter 11.11 - The Arraylist Class Chapter 11.12 - Useful Methods For Lists Chapter 11.13 - Case Study: A Custom Stack Class Chapter 11.14 - The Protected Data And Methods Chapter 11.15 - Preventing Extending And Overriding Chapter 12 - Exception Handling And Text I/o Chapter 12.2 - Exception-handling Overview Chapter 12.3 - Exception Types Chapter 12.4 - More On Exception Handling Chapter 12.5 - The Finally Clause Chapter 12.6 - When To Use Exceptions Chapter 12.7 - Rethrowing Exceptions Chapter 12.8 - Chained Exceptions Chapter 12.9 - Defining Custom Exception Classes Chapter 12.10 - The File Class Chapter 12.11 - File Input And Output Chapter 12.12 - Reading Data From The Web Chapter 12.13 - Case Study: Web Crawler Chapter 13 - Abstract Classes And Interfaces Chapter 13.2 - Abstract Classes Chapter 13.3 - Case Study: The Abstract Number Class Chapter 13.4 - Case Study: Calendar And Gregoriancalendar Chapter 13.5 - Interfaces Chapter 13.6 - The Comparable Interface Chapter 13.7 - The Cloneable Interface Chapter 13.8 - Interfaces Vs. Abstract Classes Chapter 13.9 - Case Study: The Rational Class Chapter 13.10 - Class-design Guidelines Chapter 14 - Javafx Basics Chapter 14.2 - Javafx Vs. Swing And Awt Chapter 14.3 - The Basic Structure Of A Javafx Program Chapter 14.4 - Panes, Groups, Ul Controls, And Shapes Chapter 14.5 - Property Binding Chapter 14.6 - Common Properties And Methods For Nodes Chapter 14.7 - The Color Class Chapter 14.8 - The Font Class Chapter 14.9 - The Image And Imageview Classes Chapter 14.10 - Layout Panes And Groups Chapter 14.11 - Shapes Chapter 14.12 - Case Study: The Clockpane Class Chapter 15 - Event-driven Programming And Animations Chapter 15.2 - Events And Event Sources Chapter 15.3 - Registering Handlers And Handling Events Chapter 15.4 - Inner Classes Chapter 15.5 - Anonymous Inner-class Handlers Chapter 15.6 - Simplifying Event Handling Using Lambda Expressions Chapter 15.8 - Mouse Events Chapter 15.9 - Key Events Chapter 15.10 - Listeners For Observable Objects Chapter 15.11 - Animation Chapter 15.12 - Case Study: Bouncing Ball Chapter 15.13 - Case Study: Us Map Chapter 16 - Javafx Ul Controls And Multimedia Chapter 16.2 - Labeled And Label Chapter 16.3 - Button Chapter 16.4 - Checkbox Chapter 16.5 - Radiobutton Chapter 16.6 - Textfield Chapter 16.7 - Textarea Chapter 16.8 - Combo Box Chapter 16.9 - Listview Chapter 16.10 - Scroll Bar Chapter 16.11 - Slider Chapter 16.12 - Case Study: Developing A Tic-tac-toe Game Chapter 16.13 - Video And Audio Chapter 16.14 - Case Study: National Flags And Anthems Chapter 17 - Binary I/o Chapter 17.2 - How Is Text 1/0 Handled In Java?Chapter 17.3 - Text I/o Vs. Binary I/o Chapter 17.4 - Binary I/o Classes Chapter 17.5 - Case Study: Copying Files Chapter 17.6 - Object I/o Chapter 17.7 - Random-access Files Chapter 18 - Recursion Chapter 18.2 - Case Study: Computing Factorials Chapter 18.3 - Case Study: Computing Fibonacci Numbers Chapter 18.4 - Problem Solving Using Recursion Chapter 18.5 - Recursive Helper Methods Chapter 18.6 - Case Study: Finding The Directory Size Chapter 18.7 - Case Study: Tower Of Hanoi Chapter 18.8 - Case Study: Fractals Chapter 18.9 - Recursion Vs. Iteration Chapter 18.10 - Tail Recursion Chapter 19 - Generics Chapter 19.2 - Motivations And Benefits Chapter 19.3 - Defining Generic Classes And Interfaces Chapter 19.4 - Generic Methods Chapter 19.5 - Case Study: Sorting An Array Of Objects Chapter 19.6 - Raw Types And Backward Compatibility Chapter 19.7 - Wildcard Generic Types Chapter 19.8 - Erasure And Restrictions On Generics Chapter 19.9 - Case Study: Generic Matrix Class Chapter 20 - Lists, Stacks, Queues, And Priority Queues Chapter 20.2 - Collections Chapter 20.3 - Lterators Chapter 20.4 - Using The Foreach Method Chapter 20.5 - Lists Chapter 20.6 - The Comparator Interface Chapter 20.7 - Static Methods For Lists And Collections Chapter 20.8 - Case Study: Bouncing Balls Chapter 20.9 - Vector And Stack Classes Chapter 20.10 - Queues And Priority Queues Chapter 20.11 - Case Study: Evaluating Expressions Chapter 21 - Sets And Maps Chapter 21.2 - Sets Chapter 21.3 - Comparing The Performance Of Sets And Lists Chapter 21.4 - Case Study: Counting Keywords Chapter 21.5 - Maps Chapter 21.6 - Case Study: Occurrences Of Words Chapter 21.7 - Singleton And Unmodifiable Collections And Maps Chapter 22 - Developing Efficient Algorithms Chapter 22.2 - Measuring Algorithm Efficiency Using Big O Notation Chapter 22.3 - Examples: Determining Big O Chapter 22.4 - Analyzing Algorithm Time Complexity Chapter 22.5 - Finding Fibonacci Numbers Using Dynamic Programming Chapter 22.6 - Finding Greatest Common Divisors Using Euclid's Algorithm Chapter 22.7 - Efficient Algorithms For Finding Prime Numbers Chapter 22.8 - Finding The Closest Pair Of Points Using Divide-and-conquer Chapter 22.9 - Solving The Eight Queens Problem Using Backtracking Chapter 22.10 - Computational Geometry: Finding A Convex Hull Chapter 23 - Sorting Chapter 23.2 - Insertion Sort Chapter 23.3 - Bubble Sort Chapter 23.4 - Merge Sort Chapter 23.5 - Quick Sort Chapter 23.6 - Heap Sort Chapter 23.7 - Bucket And Radix Sorts Chapter 23.8 - External Sort Chapter 24 - Lmplementing Lists, Stacks, Queues, And Priority Queues Chapter 24.2 - Common Operations For Lists Chapter 24.3 - Array Lists Chapter 24.4 - Linked Lists Chapter 24.5 - Stacks And Queues Chapter 24.6 - Priority Queues Chapter 25 - Binary Search Trees Chapter 25.2 - Binary Search Trees Chapter 25.3 - Deleting Elements From A Bst Chapter 25.4 - Tree Visualization And Mvc Chapter 25.5 - Lterators Chapter 25.6 - Case Study: Data Compression Chapter 26 - Avl Trees Chapter 26.2 - Rebalancing Trees Chapter 26.3 - Designing Classes For Avl Trees Chapter 26.4 - Overriding The Insert Method Chapter 26.5 - Implementing Rotations Chapter 26.6 - Implementing The Delete Method Chapter 26.7 - The Avl Tree Class Chapter 26.8 - Testing The Avl Tree Class Chapter 26.9 - Avl Tree Time Complexity Analysis Chapter 27 - Hashing Chapter 27.2 - What Is Hashing?Chapter 27.3 - Hash Functions And Hash Codes Chapter 27.4 - Handling Collisions Using Open Addressing Chapter 27.5 - Handling Collisions Using Separate Chaining Chapter 27.6 - Load Factor And Rehashing Chapter 27.7 - Implementing A Map Using Hashing Chapter 27.8 - Implementing Set Using Hashing Chapter 28 - Graphs And Applications Chapter 28.2 - Basic Graph Terminologies Chapter 28.3 - Representing Graphs Chapter 28.4 - Modeling Graphs Chapter 28.5 - Graph Visualization Chapter 28.6 - Graph Traversals Chapter 28.7 - Depth-first Search (dfs)Chapter 28.8 - Case Study: The Connected Circles Problem Chapter 28.9 - Breadth-first Search (bfs)Chapter 28.10 - Case Study: The Nine Tails Problem Chapter 29 - Weighted Graphs And Applications Chapter 29.2 - Representing Weighted Graphs Chapter 29.3 - The Wei Ghtedgraph Class Chapter 29.4 - Minimum Spanning Trees Chapter 29.5 - Finding Shortest Paths Chapter 29.6 - Case Study: The Weighted Nine Tails Problem Chapter 30 - Aggregate Operations For Collection Streams Chapter 30.1 - Introduction Chapter 30.2 - Stream Pipelines Chapter 30.3 - Intstream, Longstream, And Doublestream Chapter 30.4 - Parallel Streams Chapter 30.5 - Stream Reduction Using The Reduce Method Chapter 30.6 - Stream Reduction Using The Collect Method Chapter 30.7 - Grouping Elements Using The Groupingby Collector Chapter 30.8 - Case Studies

Sample Solutions for this Textbook

We offer sample solutions for Introduction to Java Programming and Data Structures: Brief Version (11th Global Edition) homework problems. See examples below:

Chapter 1, Problem 1.1PE Chapter 2, Problem 2.1PE Chapter 3, Problem 3.1PE Chapter 4, Problem 4.1PE Chapter 5, Problem 5.1PE Chapter 6, Problem 6.1PE Chapter 7, Problem 7.1PE Chapter 8, Problem 8.1PE Chapter 9, Problem 9.1PE

Chapter 10, Problem 10.1PE Chapter 11, Problem 11.1PE Program: Filename: Exercise12_01.java //Class definition public class Exercise12_01 { //Main method...Chapter 13, Problem 13.1PE Program: //Import required packages import javafx.application.Application; import...Program: //import the required headers import javafx.application.Application; import...Program: //import statement import javafx.application.Application; import javafx.geometry.Pos;...Chapter 17, Problem 17.1PE Program: //Import required packages import java.math.*; import java.util.*; //Class name public...Chapter 19, Problem 19.1PE Chapter 20, Problem 20.1PE Program: //import java array class from util package import java.util.Arrays; //import java...Chapter 22, Problem 22.1PE Program: //define the required packages import java.util.Comparator; //define the class sorting...Chapter 24, Problem 24.1PE Program: //import statement import java.util.*; //class Test public class Test { // main method...Program: “Tree.java” is referred in Listing 25.3 from chapter 25 (Page No.:958). //Test.java...Program: public class Sample { /** Main method */ public static void main(String[] args) {...Program: Exercise.java: //import the required headers import java.util.*; //define the class...Chapter 29, Problem 29.4PE Program: /*Include necessary packages*/ import java.util.Scanner; //Include Stream package import...

More Editions of This Book

Corresponding editions of this textbook are also available below:

Introduction To Java Programming, Ap Version

1st Edition

ISBN: 9780134304748

Introduction to Java Programming with Sun ONE Studio 4

1st Edition

ISBN: 9780130092588

Introduction To Java Programming: Comprehensive Version

8th Edition

ISBN: 9780132130806

Introduction To Java Programming, Comprehensive: International Edition

8th Edition

ISBN: 9780132472753

EBK INTRODUCTION TO JAVA PROGRAMMING, B

10th Edition

ISBN: 9780133592658

Introduction to Java Programming, Comprehensive Version plus MyLab Programming with Pearson eText -- Access Card Package (10th Edition)

10th Edition

ISBN: 9780133813463

Introduction to Java Programming, Comprehensive Version

10th Edition

ISBN: 9780133761641

Intro to Java Programming, Comprehensive Version (10th Edition)

10th Edition

ISBN: 9780133761313

Student Value Edition for Introduction to Java Programming, Comprehensive Version plus MyLab Programming with Pearson eText -- Access Card Package (10th Edition)

10th Edition

ISBN: 9780133813456

EBK INTRODUCTION TO JAVA PROGRAMMING, C

10th Edition

ISBN: 9780133593525

Intro to Java Programming, Comprehensive Version, Student Value Edition (10th Edition)

10th Edition

ISBN: 9780133593495

Introduction to Java Programming and Data Structures, Comprehensive Version Plus MyProgrammingLab with Pearson EText -- Access Card Package

11th Edition

ISBN: 9780134694511

EBK INTRO.TO PROGRAM.JAVA.PROGRAM.,AP

17th Edition

ISBN: 9780134421964

Introduction to Java Programming and Data Structures, Comprehensive Version, Student Value Edition Plus MyLab Programming with Pearson eText - Access Card Package (11th Edition)

11th Edition

ISBN: 9780134756431

Instructor Solutions Manual For Introduction To Java Programming And Data Structures, Comprehensive Version, 11th Edition

11th Edition

ISBN: 9780134671581

Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)

11th Edition

ISBN: 9780134670942

Introduction to Java Programming and Data Structures, Comprehensive Version, Student Value Edition (11th Edition)

11th Edition

ISBN: 9780134671604

MyProgrammingLab with Pearson eText -- Access Card -- for Introduction to Java Programming, AP Version (1-year access)