Ksišżki informatyczne

Strona główna
Bestsellery
Pomoc
Regulamin
Odbiór osobisty
Kontakt
Koszyk
» Informatyka
» Informatyka po angielsku





Znak akceptacji PayPal
Ksiazki - Informatyczne .pl » informatyka » informatyka

Data Structures with Java

 Data Structures with JavaWydawnictwo: prentice hall
Autor: Ford
Liczba stron: 1024
Oprawa: miękka
ISBN: 978-0-13-129337-3
Czas dostawy: 4 - 6 tygodni (na zamówienie)
Cena detaliczna: 281,99 zł
Nasza cena: 282,00 zł  


Opis Data Structures with Java:

For freshman-, sophomore-, or junior-level courses in Computer Science, Data Structures, and Algorithms in the departments of Computer Science, Computer Engineering, Computer Information Systems, and Business Information Systems.
This modern object-oriented approach to data structures helps students make the transition from a first course in programming to an integrated understanding of data structures and their applications. Carefully developing topics with sufficient detail, this text enables students to learn about concepts on their own, offering instructors flexibility and allowing them to use the text as lecture reinforcement. It includes a solid introduction to algorithms, an integral part of understanding data structures, and uses Java syntax and structure in the design of data structures. Its breadth of coverage insures that core topics such as linked lists, sets, maps, and iterators are carefully and comprehensively discussed.
  • Comprehensive coverage of the classical data structures-Provides an exceptional level of detail and clarity.

    • Provides students with a very modern and highly integrated treatment of data structures.
  • ADT for each major data structure-Immediately uses it to solve appropriate problems.

    • Enables students to develop a good conceptual understanding of each data structure and have tools to solve real problems.
  • Algorithms for the collection class methods.

    • Allows students to see first-hand how algorithms are designed and implemented.
  • An excellent review of object concepts-Provides an overview of object-oriented design and programming principles that are at the core of data structures.

    • Shows students topics that are fundamental to the design and implementation of data structures.
  • Careful development of generic programming in Java-Includes generic methods and classes.

    • Provides students with a true Java text, allowing them to fully understand the overall design of each data structure and its Java implementation code.
  • A large number and variety of exercises-Range from simple checks of basic understanding to larger projects that involve significant design and coding.

    • Gives students numerous opportunities for hands-on learning.
  • Illustrative examples-Introduces concepts and then immediately illustrates them with examples.

    • Provides students with interesting examples that help them understand often complex concepts.
  • Figures and tables-Includes 20 or more figures in each chapter.

    • Aids students' understanding with vivid visuals.
  • Full-featured integrated development environment for Java programming-Available on the Web.

    • Enables students to enter, compile, run, and debug Java programs.
  • HTML-based documentation for all the text software.

    • Helps students understand the software.
  • Instructor's Guide CD-ROM-Includes solutions to all the written and programming exercises.

    • Aids instructors in preparing and grading the class work.
  • Sample test for each chapter.

    • Provides instructors with comprehensive questions that can be modified to any test format.


Spis treści Data Structures with Java:

1.    Classes and Objects
 
2.    Class Relationships
 
3.    Designing Classes
 
4.    Introduction to Algorithms
 
5.    Generic Classes and Methods
 
6.    Recursion
 
7.    Sorting Algorithms
 
8.    Collections and Lists
 
9.    The Array-Based List Collection
 
10.   Linked Lists
 
11.   Implementing the LinkedList Class
 
12.   Iterators
 
13.   Implementing Iterators
 
14.   Stacks
 
15.   Queues and Priority Queues
 
16.   Binary Trees
 
17.   Binary Tree Applications
 
18.   Binary Search Trees
 
19.   Sets and Maps
 
20.   Ordered Set and Map Implementation
 
21.   Hashing as a Map Implementation
 
22.   Heaps
 
23.   Bit Arrays and File Compression
 
24.   Graphs and Paths
 
25.   Graph Algorithms
 
26.   Graph Implementation
 
27.   Balanced Search Trees
 
28.   Number Theory and Cryptography
 
29.   Assorted Algorithms
Appendix A: Java Keywords.
Appendix B: ASCII and Unicode Character Sets.
Appendix C: Java Operator Summary.
Appendix D: EZJava Tutorial.