Data Structures and Algorithms in Java [Hardcover]

$46.99     $64.99   28% Off     (Shipping shown at checkout) (Free Shipping)
available
  • Category: Books (Computers)
  • Author:  Lafore, Robert
  • Author:  Lafore, Robert
  • ISBN-10:  0672324539
  • ISBN-10:  0672324539
  • ISBN-13:  9780672324536
  • ISBN-13:  9780672324536
  • Publisher:  Sams Publishing
  • Publisher:  Sams Publishing
  • Pages:  800
  • Pages:  800
  • Binding:  Hardcover
  • Binding:  Hardcover
  • Pub Date:  01-May-2002
  • Pub Date:  01-May-2002
  • SKU:  0672324539-11-MING
  • SKU:  0672324539-11-MING
  • Item ID: 100395864
  • List Price: $64.99
  • Seller:
  • Ships in: business days
  • Transit time: Up to business days
  • Delivery by: to
  • Notes:
  • Restrictions:
  • Limit: per customer
  • Cart Requirements: .MIN_ORD_MSG}}

Robert Laforehas degrees in Electrical Engineering and Mathematics, has worked as a systems analyst for the Lawrence Berkeley Laboratory, founded his own software company, and is a best-selling writer in the field of computer programming. Some of his current titles are C++ Interactive Course and Object-Oriented Programming in C++. Earlier best-selling titles include Assembly Language Primer for the IBM PC and XT and (back at the beginning of the computer revolution) Soul of CP/M.



Introduction.

What's New in the Second Edition. What This Book Is About. What's Different About This Book. Who This Book Is For. What You Need to Know Before You Read This Book. The Software You Need to Use This Book. How This Book Is Organized. Enjoy Yourself!



 1. Overview.

What Are Data Structures and Algorithms Good For? Overview of Data Structures. Overview of Algorithms. Some Definitions. Object-Oriented Programming. Software Engineering. Java for C++ Programmers. Java Library Data Structures. Summary. Questions.



 2. Arrays.

The Array Workshop Applet. The Basics of Arrays in Java. Dividing a Program into Classes. Class Interfaces. The Ordered Workshop Applet. Java Code for an Ordered Array. Logarithms. Storing Objects. Big O Notation. Whay Not Use Arrays for Everything. Summary. Questions. Experiments. Programming Projects.



 3. Simple Sorting.

How Would You Do It. Bubble Sort. Selection Sort. Insertion Sort. Sorting Objects. Comparing the Simple Sorts. Summary. Questions. Experiments. Programming Projects.



 4. Stacks and Queues.

A Different Kind of Structure. Stacks. Queues. Priority Queues. Parsing Arithmetic Expressions. Summary. Questionslă9