ورود به حساب

نام کاربری گذرواژه

گذرواژه را فراموش کردید؟ کلیک کنید

حساب کاربری ندارید؟ ساخت حساب

ساخت حساب کاربری

نام نام کاربری ایمیل شماره موبایل گذرواژه

برای ارتباط با ما می توانید از طریق شماره موبایل زیر از طریق تماس و پیامک با ما در ارتباط باشید


09117307688
09117179751

در صورت عدم پاسخ گویی از طریق پیامک با پشتیبان در ارتباط باشید

دسترسی نامحدود

برای کاربرانی که ثبت نام کرده اند

ضمانت بازگشت وجه

درصورت عدم همخوانی توضیحات با کتاب

پشتیبانی

از ساعت 7 صبح تا 10 شب

دانلود کتاب Starting Out With Java From Control Structures through Data Structures 4th Ed

دانلود کتاب شروع کار با جاوا از ساختارهای کنترلی از طریق ساختارهای داده ویرایش چهارم

Starting Out With Java From Control Structures through Data Structures 4th Ed

مشخصات کتاب

Starting Out With Java From Control Structures through Data Structures 4th Ed

دسته بندی: الگوریتم ها و ساختارهای داده
ویرایش: 4 
نویسندگان:   
سری:  
ISBN (شابک) : 2018002219, 013478796X 
ناشر: Pearson 
سال نشر: 2018 
تعداد صفحات: 1714 
زبان: English 
فرمت فایل : PDF (درصورت درخواست کاربر به PDF، EPUB یا AZW3 تبدیل می شود) 
حجم فایل: 13 مگابایت 

قیمت کتاب (تومان) : 37,000



کلمات کلیدی مربوط به کتاب شروع کار با جاوا از ساختارهای کنترلی از طریق ساختارهای داده ویرایش چهارم: جاوا



ثبت امتیاز به این کتاب

میانگین امتیاز به این کتاب :
       تعداد امتیاز دهندگان : 3


در صورت تبدیل فایل کتاب Starting Out With Java From Control Structures through Data Structures 4th Ed به فرمت های PDF، EPUB، AZW3، MOBI و یا DJVU می توانید به پشتیبان اطلاع دهید تا فایل مورد نظر را تبدیل نمایند.

توجه داشته باشید کتاب شروع کار با جاوا از ساختارهای کنترلی از طریق ساختارهای داده ویرایش چهارم نسخه زبان اصلی می باشد و کتاب ترجمه شده به فارسی نمی باشد. وبسایت اینترنشنال لایبرری ارائه دهنده کتاب های زبان اصلی می باشد و هیچ گونه کتاب ترجمه شده یا نوشته شده به فارسی را ارائه نمی دهد.


توضیحاتی درمورد کتاب به خارجی



فهرست مطالب

STARTING OUT WITH JAVA™ From Control Structures through Data Structures
Contents in Brief
Contents
Preface
	Control Structures First, Then Objects, Then Data Structures
	Changes in This Edition
	Organization of the Text
	Brief Overview of Each Chapter
	Features of the Text
	Supplements
	‌Reviewers for Previous Editions
	About the Authors
Chapter 1 Introduction to Computers and Java
	TOPICS
	1.1 Introduction
	1.2 Why Program?
	1.3 Computer Systems: Hardware and Software
		Hardware
			The CPU
			Main Memory
			Secondary Storage
			Input Devices
			Output Devices
		Software
			Checkpoint
	1.4 Programming Languages
		What Is a Program?
		A History of Java
	1.5 What Is a Program Made Of?
		Language Elements
			Key Words (Reserved Words)
			Programmer-Defined Names
			Operators
			Punctuation
		Lines and Statements
		Variables
		The Compiler and the Java Virtual Machine
			Portability
		Java Software Editions
		Compiling and Running a Java Program
			Integrated Development Environments
				Checkpoint
	1.6 The Programming Process
		Software Engineering
			Checkpoint
	1.7 Object-Oriented Programming
		Checkpoint
	Review Questions and Exercises
		Multiple Choice
		Find the Error
		Algorithm Workbench
		Predict the Result
		Short Answer
	Programming Challenge
		1. Your First Java Program
		If You Are Using the JDK at the Command Prompt:
		If You Are Using an IDE:
Chapter 2 Java Fundamentals
	TOPICS
	2.1 The Parts of a Java Program
		Checkpoint
	2.2 The print and println Methods, and the Java API
	2.3 Variables and Literals
		Displaying Multiple Items with the + Operator
		Be Careful with Quotation Marks
		More about Literals
		Identifiers
		Class Names
			Checkpoint
	2.4 Primitive Data Types
		The Integer Data Types
			Integer Literals
		Floating-Point Data Types
			Floating-Point Literals
			Scientific and E Notation
		The boolean Data Type
		The char Data Type
			Unicode
		Variable Assignment and Initialization
		Variables Hold Only One Value at a Time
			Checkpoint
	2.5 Arithmetic Operators
		Integer Division
		Operator Precedence
		Grouping with Parentheses
		The Math Class
			The Math.pow Method
			The Math.sqrt Method
				Checkpoint
	2.6 Combined Assignment Operators
		Checkpoint
	2.7 Conversion between Primitive Data Types
		Mixed Integer Operations
		Other Mixed Mathematical Expressions
			Checkpoint
	2.8 Creating Named Constants with final
	2.9 The String Class
		Objects Are Created from Classes
		The String Class
		Primitive Type Variables and Class Type Variables
		Creating a String Object
			Checkpoint
	2.10 Scope
	2.11 Comments
	2.12 Programming Style
	2.13 Reading Keyboard Input
		Reading a Character
		Mixing Calls to nextLine with Calls to Other Scanner Methods
	2.14 Dialog Boxes
		Displaying Message Dialogs
		Displaying Input Dialogs
		An Example Program
		Converting String Input to Numbers
			Checkpoint
	2.15 Common Errors to Avoid
	Review Questions and Exercises
		Multiple Choice and True/False
		Predict the Output
		Find the Error
		Algorithm Workbench
		Short Answer
	Programming Challenges
		1. Name, Age, and Annual Income
		2. Name and Initials
		3. Personal Information
		4. Star Pattern
		5. Sales Prediction
		6. Land Calculation
		7. Sales Tax
		8. Cookie Calories
		9. Miles-per-Gallon
		10. Test Average
		11. Circuit Board Profit
		12. String Manipulator
		13. Restaurant Bill
		14. Male and Female Percentages
		15. Stock Commission
		16. Energy Drink Consumption
		17. Ingredient Adjuster
		18. Word Game
		19. Stock Transaction Program
		20. Planting Grapevines
		21. Compound Interest
Chapter 3 Decision Structures
	TOPICS
	3.1 The if Statement
		Using Relational Operators to Form Conditions
		Putting It All Together
		Programming Style and the if Statement
		Be Careful with Semicolons
		Having Multiple Conditionally Executed Statements
		Flags
		Comparing Characters
			Checkpoint
	3.2 The if-else Statement
		Checkpoint
	3.3 Nested if Statements
	3.4 The if-else-if Statement
	3.5 Logical Operators
		The Precedence of Logical Operators
		Checking Numeric Ranges with Logical Operators
			Checkpoint
	3.6 Comparing String Objects
		Ignoring Case in String Comparisons
			Checkpoint
	3.7 More about Variable Declaration and Scope
	3.8 The Conditional Operator (Optional)
		Checkpoint
	3.9 The switch Statement
		Checkpoint
	3.10 Displaying Formatted Output with System.out.printf and String.format
		Format Specifier Syntax
		Precision
		Specifying a Minimum Field Width
			Combining Minimum Field Width and Precision in the Same Format Specifier
		Flags
			Comma Separators
			Padding Numbers with Leading Zeros
			Left-Justifying Numbers
		Formatting String Arguments
		The String.format Method
			Checkpoint
	3.11 Common Errors to Avoid
	Review Questions and Exercises
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Programming Challenges
		1. Roman Numerals
		2. Magic Dates
		3. Body Mass Index
		4. Test Scores and Grade
		5. Mass and Weight
		6. Time Calculator
		7. Sorted Names
		8. Software Sales
		9. Shipping Charges
		10. Fat Gram Calculator
		11. Running the Race
		12. The Speed of Sound
		13. Mobile Service Provider
		14. Mobile Service Provider, Part 2
		15. Bank Charges
		16. Book Club Points
		17. Wi-Fi Diagnostic Tree
		18. Restaurant Selector
Chapter 4 Loops and Files
	TOPICS
	4.1 The Increment and Decrement Operators
		The Difference between Postfix and Prefix Modes
			Checkpoint
	4.2 The while Loop
		The while Loop Is a Pretest Loop
		Infinite Loops
		Don’t Forget the Braces with a Block of Statements
		Programming Style and the while Loop
			Checkpoint
	4.3 Using the while Loop for Input Validation
		Checkpoint
	4.4 The do-while Loop
	4.5 The for Loop
		The for Loop Is a Pretest Loop
		Avoid Modifying the Control Variable in the Body of the for Loop
		Other Forms of the Update Expression
		Declaring a Variable in the for Loop’s Initialization Expression
		Creating a User Controlled for Loop
		Using Multiple Statements in the Initialization and Update Expressions
			Checkpoint
	4.6 Running Totals and Sentinel Values
		Using a Sentinel Value
			Checkpoint
	4.7 Nested Loops
	4.8 The break and continue Statements (Optional)
	4.9 Deciding Which Loop to Use
	4.10 Introduction to File Input and Output
		Using the PrintWriter Class to Write Data to a File
			More about the PrintWriter Class’s println Method
			The PrintWriter Class’s print Method
			Adding a throws Clause to the Method Header
			An Example Program
			Review
		Appending Data to a File
		Specifying the File Location
		Reading Data from a File
		Reading Lines from a File with the nextLine Method
		Adding a throws Clause to the Method Header
			Detecting the End of a File
			Reading Primitive Values from a File
			Review
		Checking for a File’s Existence
			Checkpoint
	4.11 Generating Random Numbers with the Random Class
		Checkpoint
	4.12 Common Errors to Avoid
	Review Questions and Exercises
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Programming Challenges
		1. Sum of Numbers
		2. Distance Traveled
		3. Distance File
		4. Pennies for Pay
		5. Letter Counter
		6. File Letter Counter
		7. Hotel Occupancy
		8. Average Rainfall
		9. Population
		10. Largest and Smallest
		11. Celsius to Fahrenheit Table
		12. Bar Chart
		13. File Head Display
		14. Line Numbers
		15. Uppercase File Converter
		16. Budget Analysis
		17. Random Number Guessing Game
		18. Random Number Guessing Game Enhancement
		19. ESP Game
		20. Square Display
		21. Dice Game
		22. Slot Machine Simulation
		23. Personal Web Page Generator
Chapter 5 Methods
	TOPICS
	5.1 Introduction to Methods
		void Methods and Value-Returning Methods
		Defining a void Method
		Calling a Method
		Layered Method Calls
		Using Documentation Comments with Methods
			Checkpoint
	5.2 Passing Arguments to a Method
		Argument and Parameter Data Type Compatibility
		Parameter Variable Scope
		Passing Multiple Arguments
		Arguments Are Passed by Value
		Passing Object References to a Method
		Using the @param Tag in Documentation Comments
			Checkpoint
	5.3 More about Local Variables
		Local Variable Lifetime
		Initializing Local Variables with Parameter Values
	5.4 Returning a Value from a Method
		Defining a Value-Returning Method
		Calling a Value-Returning Method
		Using the @return Tag in Documentation Comments
		Returning a boolean Value
		Returning a Reference to an Object
			Checkpoint
	5.5 Problem Solving with Methods
		Calling Methods That Throw Exceptions
	5.6 Common Errors to Avoid
	Review Questions and Exercises
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Programming Challenges
		1. showChar Method
		2. Retail Price Calculator
		3. Rectangle Area—Complete the Program
		4. Paint Job Estimator
		5. Falling Distance
		6. Celsius Temperature Table
		7. Test Average and Grade
		8. Conversion Program
		9. Distance Traveled Modification
		10. Stock Profit
		11. Multiple Stock Sales
		12. Kinetic Energy
		13. isPrime Method
		14. Prime Number List
		15. Even/Odd Counter
		16. Present Value
		17. Rock, Paper, Scissors Game
		18. ESP Game
Chapter 6 A First Look at Classes
	TOPICS
	6.1 Objects and Classes
		Classes: Where Objects Come From
		Classes in the Java API
		Primitive Variables vs. Objects
			Checkpoint
	6.2 Writing a Simple Class, Step by Step
		Accessor and Mutator Methods
		The Importance of Data Hiding
		Avoiding Stale Data
		Showing Access Specification in UML Diagrams
		Data Type and Parameter Notation in UML Diagrams
		Layout of Class Members
			Checkpoint
	6.3 Instance Fields and Methods
		Checkpoint
	6.4 Constructors
		Showing Constructors in a UML Diagram
		Uninitialized Local Reference Variables
		The Default Constructor
		Writing Your Own No-Arg Constructor
		The String Class Constructor
			Checkpoint
	6.5 Passing Objects as Arguments
	6.6 Overloading Methods and Constructors
		The BankAccount Class
		Overloaded Methods Make Classes More Useful
	6.7 Scope of Instance Fields
		Shadowing
			Checkpoint
	6.8 Packages and import Statements
		Explicit and Wildcard import Statements
		The java.lang Package
		Other API Packages
	6.9 Focus on Object-Oriented Design: Finding the Classes and Their Responsibilities
		Finding the Classes
			Writing a Description of the Problem Domain
			Identifying All of the Nouns
			Refining the List of Nouns
			1. Some of the nouns really mean the same thing.
			2. Some nouns might represent items that we do not need to be concerned with in order to solve the problem.
			3. Some of the nouns might represent objects, not classes.
			4. Some of the nouns might represent simple values that can be stored in a primitive variable and do not require a class.
		Identifying a Class’s Responsibilities
			The Customer class
			The Car Class
			The ServiceQuote Class
		This Is Only the Beginning
			Checkpoint
	6.10 Common Errors to Avoid
	Review Questions and Exercises
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Programming Challenges
		1. Employee Class
		2. Car Class
		3. Personal Information Class
		4. RetailItem Class
		5. Payroll Class
		6. TestScores Class
		7. Circle Class
		8. Temperature Class
		9. Days in a Month
		10. A Game of Twenty-One
		11. Freezing and Boiling Points
		12. SavingsAccount Class
		13. Deposit and Withdrawal Files
		14. Patient Charges
		15. Dice Game
		16. Roulette Wheel Colors
		17. Coin Toss Simulator
		18. Tossing Coins for a Dollar
		19. Fishing Game Simulation
Chapter 7 Arrays and the ArrayList Class
	TOPICS
	7.1 Introduction to Arrays
		Accessing Array Elements
		Inputting and Outputting Array Contents
		Java Performs Bounds Checking
		Watch Out for Off-by-One Errors
		Array Initialization
		Alternate Array Declaration Notation
			Checkpoint
	7.2 Processing Array Elements
		Array Length
		The Enhanced for Loop
			The Enhanced for Loop versus the Traditional for Loop
		Letting the User Specify an Array’s Size
		Reassigning Array Reference Variables
		Copying Arrays
			Checkpoint
	7.3 Passing Arrays as Arguments to Methods
		Checkpoint
Chapter 15 Recursion
	TOPICS
	15.1 Introduction to Recursion
	15.2 Solving Problems with Recursion
		Direct and Indirect Recursion
			Checkpoint
	15.3 Examples of Recursive Methods
		Summing a Range of Array Elements with Recursion
		Drawing Concentric Circles
		The Fibonacci Series
		Finding the Greatest Common Divisor
	15.4 A Recursive Binary Search Method
	15.5 The Towers of Hanoi
	15.6 Common Errors to Avoid
	Review Questions and Exercises
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Programming Challenges
		1. Recursive Multiplication
		2. isMember Method
		3. String Reverser
		4. maxElement Method
		5. Palindrome Detector
		6. Character Counter
		7. Recursive Power Method
		8. Sum of Numbers
		9. Ackermann’s Function
		10. Recursive Population Class
Chapter 16 Sorting, Searching, and Algorithm Analysis
	TOPICS
	16.1 Introduction to Sorting Algorithms
		The Bubble Sort
		Using the Bubble Sort to Sort Objects
		The Selection Sort
		Using the Selection Sort to Sort Objects
		The Insertion Sort
		Using the Insertion Sort to Sort Objects
		The Quicksort Algorithm
		Using Quicksort to Sort Objects
			Checkpoint
	16.2 Introduction to Search Algorithms
		The Sequential Search Algorithm
		Average Case Analysis of the Sequential Search
		The Binary Search
		Efficiency of the Binary Search
		A Recursive Binary Search
			Checkpoint
	16.3 Analysis of Algorithms
		Computational Problems and Basic Steps
		Complexity of Algorithms
		Worst Case Complexity of Algorithms
		Average Case Complexity
		Asymptotic Complexity and the Big O Notation
			Checkpoint
	16.4 Common Errors to Avoid
	Review Questions and Exercises
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Programming Challenges
		1. Sorting Objects with the Insertion Sort Algorithm
		2. Sorting Objects with the Quicksort Algorithm
		3. Searching for Objects with the Binary Search Algorithm
		4. Charge Account Validation
		5. Charge Account Validation Modification
		6. Name Search
		7. Search Benchmarks
		8. Sorting Benchmarks
		9. Efficient Computation of Fibonacci Numbers
Chapter 17 Generics
	TOPICS
	17.1 Introduction to Generics
		Using the Diamond Operator for Type Inference
			Checkpoint
	17.2 Writing a Generic Class
		Only Reference Types Can Be Passed to Type Parameters
			Autoboxing and Unboxing
		Instantiating a Generic Class without Specifying a Type Argument
		Commonly Used Type Parameter Names
			Checkpoint
	17.3 Passing Objects of a Generic Class to a Method
		Constraining a Type Parameter
		Defining a Type Parameter in a Method Header
		The extends Key Word Constrains a Type to an Upper Bound
		The super Key Word Constrains a Type to a Lower Bound
			Checkpoint
	17.4 Writing Generic Methods
		Checkpoint
	17.5 Constraining a Type Parameter in a Generic Class
		Checkpoint
	17.6 Inheritance and Generic Classes
		Checkpoint
	17.7 Defining Multiple Type Parameters
	17.8 Generics and Interfaces
		Constraining a Type Parameter to a Type That Implements an Interface
			Checkpoint
	17.9 Erasure
		Checkpoint
	17.10 Restrictions on the Use of Generic Types
	17.11 Common Errors to Avoid
	Review Questions and Exercises
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Programming Challenges
		1. MyList Class
		2. MyList Modification
		3. PointList Class
		4. Generic Insertion Sort
		5. Generic Binary Search
		6. Highest and Lowest Elements
		7. Number Analyzer
		8. Generic Random Permutation
Chapter 18 Collections and the Stream API
	TOPICS
	18.1 Introduction to the Java Collections Framework
		Lists, Sets, and Maps
		Java Functional Interfaces
		JCF Interfaces
		Iterating a Collection
		The Iterable Interface and the forEach method
		Iterators
		The Enhanced For Loop
		The Collection Interface
			Checkpoint
	18.2 Lists
		The List Interface
		The ArrayList and LinkedList Classes
		Creating and Initializing Lists
		List Iterators
		Methods of the LinkedList Class
		Using an Interface Variable to Reference a Collection Object
			Checkpoint
	18.3 Sets
		The Set Interface
		The HashSet Class
		Implementing Your Own hashCode Method
		The LinkedHashSet Class
		The SortedSet Interface and the TreeSet Class
		Using a Comparator to Compare Objects
			Checkpoint
	18.4 Maps
		The HashMap Class
		The LinkedHashMap Class
		The SortedMap Interface and the TreeMap Class
			Checkpoint
	18.5 The Collections Class
	18.6 The Stream API
		The Stream Package
		Creating a Stream
		Terminal Operations
		Intermediate Operations on Streams
		Intermediate Stream Operations are Lazy
		The Stream map Operation
		The Stream reduce Methods
		Stream Collectors
			Checkpoint
	18.7 Common Errors to Avoid
	Review Questions and Exercises
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Programming Challenges
		1. Word Set
		2. Instructor Set
		3. EmployeeMap Class
		4. Stock Map
		5. Prime Number List
		6. Dealing Cards
		7. Word Frequency Count
		8. groupingBy Collector
Chapter 19 Linked Lists
	TOPICS
	19.1 Introduction to Linked Lists
		Creating Lists and Adding Nodes
		Removing a Node
		Traversing Linked Lists
			Checkpoint
	19.2 Operations on Linked Lists
		The isEmpty Method
		The size Method
		The add Methods
		The remove Methods
		The toString Method
		A Graphical Interface for the Linked List Program
	19.3 Doubly Linked and Circularly Linked Lists
		Adding a Node to a Doubly Linked List
		Removing a Node from a Doubly Linked List
		Circularly Linked Lists
			Checkpoint
	19.4 Recursion on Linked Lists
		A Recursive Implementation of size
		A Recursive Implementation of the add(String e, Node list) Method
		A Recursive Implementation of add(int index, String e, Node list)
		A Recursive Implementation of the remove Methods
	19.5 Common Errors to Avoid
	Review Questions and Exercises
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Programming Challenges
		1. Generic Linked Lists
		2. Linked List Sorting and Reversing
		3. Recursive Linked List Operations
		4. Top Ten Gamers
		5. Wedding Lottery
		6. Wedding Lottery II
		7. Adjacency List Input
Chapter 20 Stacks and Queues
	TOPICS
	20.1 Stacks and Their Applications
		Examples and Applications of Stacks
		Stack Operations
		Stacks of Primitive Types
	20.2 Array Implementation of Stacks
		The Stack Push Operation
		The Stack empty Method
		The Stack peek and pop Methods
		Stacks of Objects
	20.3 Linked Implementation of Stacks
		Implementation of Stack Methods
			Checkpoint
	20.4 Queues and Their Applications
	20.5 Array Implementation of Queues
		GUI Front End for the Queue Demo Program
	20.6 Linked List Implementation of Queues
		Queue Initialization and Enqueuing of Items
		Dequeuing Items
			Checkpoint
	20.7 Generic Implementation of Stacks and Queues
	20.8 Queues and Breadth-First Search
	20.9 Common Errors to Avoid
	Review Questions and Exercises
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Programming Challenges
		1. Double-Ended Queue
		2. Array-Based Deque
		3. Prefix Expressions
		4. Properly Nested Delimiters
		5. Tracing Genealogies
Chapter 21 Binary Trees, AVL Trees, and Priority Queues
	TOPICS
	21.1 Binary Trees and Their Applications
		Binary Tree Concepts
		Applications of Binary Trees
		Representing Nodes of Binary Trees
		Traversing a Binary Tree
			Checkpoint
		Graphical Display of Binary Trees
		Class Implementation of Binary Trees
	21.2 Binary Search Trees
		Adding a Value to a Binary Search Tree
		Removing a Value from a Binary Search Tree
		Implementation of Binary Search Trees
		Graphical Display of Binary Search Trees
		A Program for Testing the Binary Search Tree Class
	21.3 AVL Trees
		Adding New Elements to AVL Trees
		Implementation of AVL Trees
	21.4 Priority Queues
		Applications of Priority Queues
		Using Comparators with Priority Queues
		Analysis of Heapsort
		Implementation of Priority Queues
		Binary Trees with the Heap Order Property
		Complete Binary Trees and Heaps
		The Depth of Complete Binary Trees
		Storing a Complete Binary Tree in an Array
		Adding an Item to a Heap
		Removing the Minimum Element
	21.5 Common Errors to Avoid
	Review Questions and Exercises
		Multiple Choice and True/False
		Find the Error
		Short Answer
		Algorithm Workbench
	Programming Challenges
		1. AVL Trees
		2. Family Tree
		3. Balanced Search Tree
		4. Prefix Calculator
		5. Levels in an AVL Tree
		6. Binary Tree Input and Display
		7. Breadth-First Traversal of Binary trees
Chapter 22 Databases
	TOPICS
	22.1 Introduction to Database Management Systems
		JDBC
		SQL
		Using a DBMS
		Java DB and Apache Derby
		Creating the CoffeeDB Database
		Connecting to the CoffeeDB Database
		Connecting to a Password-Protected Database
			Checkpoint
	22.2 Tables, Rows, and Columns
		Column Data Types
		Primary Keys
			Checkpoint
	22.3 Introduction to the SQL SELECT Statement
		Passing an SQL Statement to the DBMS
			Getting a Row from the ResultSet Object
			Getting Columns in a ResultSet Row
			More about the SELECT Statement
		Specifying Search Criteria with the WHERE Clause
			String Comparisons in a SELECT Statement
			Using the LIKE Operator
			Using AND and OR
		Sorting the Results of a SELECT Query
		Mathematical Functions
			Checkpoint
	22.4 Inserting Rows
		Inserting Rows with JDBC
			Checkpoint
	22.5 Updating and Deleting Existing Rows
		Updating Rows with JDBC
		Deleting Rows with the DELETE Statement
		Deleting Rows with JDBC
			Checkpoint
	22.6 Creating and Deleting Tables
		Removing a Table with the DROP TABLE Statement
			Checkpoint
	22.7 Creating a New Database with JDBC
	22.8 Scrollable Result Sets
		ResultSet Navigation Methods
	22.9 Result Set Metadata
	22.10 Relational Data
		Joining Data from Multiple Tables
		An Order Entry System
	22.11 Advanced Topics
		Transactions
		Stored Procedures
	22.12 Common Errors to Avoid
	Review Questions and Exercises
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Programming Challenges
		1. Customer Inserter
		2. Customer Updater
		3. Unpaid Order Sum
		4. Population Database
		5. Personnel Database Creator
		6. Employee Inserter
		7. Employee Updater
		8. PhoneBook Database
Chapter 23 A First Look at GUI ­Applications with Swing
	TOPICS
	23.1 Introduction
		The JFC, AWT, and Swing
		Event-Driven Programming
		The javax.swing and java.awt Packages
	23.2 Creating Windows
		Using Inheritance to Extend the JFrame Class
		Equipping GUI Classes with a main Method
		Adding Components to a Window
			Content Panes and Panels
		Handling Events with Action Listeners
			Writing Event Listener Classes as Private Inner Classes
			Event Listeners Must Implement an Interface
			Registering an Event Listener Object
		Writing an Event Listener for the KiloConverter Class
		Background and Foreground Colors
			Changing the Background Color of a JFrame Object’s Content Pane
		The ActionEvent Object
			The getActionCommand Method
			The getSource Method
				Checkpoint
	23.3 Layout Managers
		Adding a Layout Manager to a Container
		The FlowLayout Manager
			Adjusting the FlowLayout Alignment
			Adjusting the FlowLayout Component Gaps
		The BorderLayout Manager
			Nesting Panels Inside a Container’s Regions
		The GridLayout Manager
			Checkpoint
	23.4 Radio Buttons and Check Boxes
		Radio Buttons
			Grouping with the ButtonGroup class
			Responding to Radio Button Events
			Determining in Code Whether a Radio Button Is Selected
			Selecting a Radio Button in Code
		Check Boxes
			Responding to Check Box Events
			Determining in Code Whether a Check Box Is Selected
			Selecting a Check Box in Code
				Checkpoint
	23.5 Borders
		Empty Borders
		Line Borders
		Titled Borders
			Checkpoint
	23.6 Focus on Problem Solving: Extending Classes from JPanel
		The Brandi’s Bagel House Application
		The GreetingPanel Class
		The BagelPanel Class
		The ToppingPanel Class
		The CoffeePanel Class
		Putting It All Together
APPENDIX F More about the Math Class
APPENDIX G Packages
APPENDIX H Working with Records and Random Access Files*
APPENDIX I Configuring Java DB and Installing Apache Derby
	Configuring Java DB with Java 7 or Java 8
		Setting the CLASSPATH Environment Variable
			Windows 10
			Windows 8
			Windows 7
	Configuring Derby with Java 9
		Setting the CLASSPATH Environment Variable
			Windows 10
			Windows 8
			Windows 7
APPENDIX J The QuickSort Algorithm
APPENDIX K Named Colors
APPENDIX L Answers to Checkpoints*
	Chapter 1
	Chapter 2
	Chapter 3
	Chapter 4
	Chapter 5
	Chapter 6
	Chapter 7
	Chapter 8
	Chapter 9
	Chapter 10
	Chapter 11
	Chapter 12
	Chapter 13
	Chapter 14
	Chapter 15
	Chapter 16
	Chapter 17
	Chapter 18
	Chapter 19
	Chapter 20
	Chapter 21
	Chapter 22 (Available on the Book’s Companion Website)
	Chapter 23 (Available on the Book’s Companion Website)
	Chapter 24 (Available on the Book’s Companion Website)
	Chapter 25 (Available on the Book’s Companion Website)
APPENDIX M Answers to Odd-Numbered Review Questions*
	Chapter 1
		Multiple Choice
		Find the Error
		Algorithm Workbench
		Predict the Result
		Short Answer
	Chapter 2
		Multiple Choice and True/False
		Predict the Output
		Find the Error
		Algorithm Workbench
		Short Answer
	Chapter 3
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Chapter 4
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Chapter 5
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Chapter 6
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Chapter 7
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Chapter 8
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Chapter 9
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Chapter 10
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Chapter 11
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Chapter 12
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Chapter 13
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Chapter 14
		Multiple Choice and True/False
		Algorithm Workbench
		Short Answer
	Chapter 15
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Chapter 16
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Chapter 17
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Chapter 18
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Chapter 19
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Chapter 20
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Chapter 21
		Multiple Choice and True/False
		Find the Error
		Short Answer
		Algorithm Workbench
	Chapter 22 (Available on the Book’s Companion Website)
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Chapter 23 (Available on the Book’s Companion Website)
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Chapter 24 (Available on the Book’s Companion Website)
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
	Chapter 25 (Available on the Book’s Companion Website)
		Multiple Choice and True/False
		Find the Error
		Algorithm Workbench
		Short Answer
CASE STUDY 1 Calculating Sales Commission*
	Program Design
CASE STUDY 2 The Amortization Class*
	Calculations
	Report Requirements
	The Main Program
CASE STUDY 3 The PinTester Class*
CASE STUDY 4 Parallel Arrays*
CASE STUDY 5 The FeetInches Class*
	More about the toString Method
	The add Method
	The equals Method
	The copy Method
	The Copy Constructor
CASE STUDY 6 The SerialNumber Class*
CASE STUDY 7 A Simple Text Editor Application*
	File Menu
	Font Menu




نظرات کاربران