rss Home » Tag Archive For ‘Algorithms’

Java Foundations: Introduction to Program Design and Data Structures, 2nd Edition

Java Foundations: Introduction to Program Design and Data Structures, 2nd Edition

Book Description

Inspired by the success of their best-selling introductory text, Software Solutions, authors Lewis, DePasquale, and Chase now release Foundations, Second Edition. This text is a comprehensive resource for instructors who want a two-or three-semester introduction to textbook that includes detail on data structures topics. Foundations introduces a Software Methodology early on and revisits it throughout to ensure students develop sound program development skills from the beginning. Control structures are covered before writing classes, providing a solid foundation of fundamental concepts and sophisticated topics.

  • Presents objects in a gradual, natural manner. Concepts that overlap with procedural programming, such as methods and their invocation, are discussed in terms of an object-oriented approach.
  • Loaded with fully implemented examples, intertwining small examples, and realistic larger examples that are easy to understand.
  • Offers complete chapter on Graphical User Interfaces that includes engaging graphical examples.
  • Exclusive coverage of software-testing and debugging effective practices.
  • Provides plenty of opportunity for practice with extensive end-of-chapter questions, exercises, and projects.

Table of Contents
Chapter 1. Introduction Download Now »

Data Structures and Algorithms in C++, 2nd Edition

Data Structures and Algorithms in C++, 2nd Edition

Book Description

An updated, innovative approach to data structures and

Written by an author team of experts in their fields, this authoritative guide demystifies even the most difficult mathematical concepts so that you can gain a clear understanding of data structures and in ++.

The unparalleled author team incorporates the object-oriented design paradigm using ++ as the implementation language, while also providing intuition and analysis of fundamental algorithms.

  • Offers a unique multimedia format for learning the fundamentals of data structures and algorithms
  • Allows you to visualize key analytic concepts, learn about the most recent insights in the field, and do data structure design
  • Provides clear approaches for developing programs
  • Features a clear, easy-to-understand writing style that breaks down even the most difficult mathematical concepts

Building on the success of the first edition, this new version offers you an innovative approach to fundamental data structures and algorithms.

Table of Contents
1. Basic C++ .
2. Object-Oriented Design. Download Now »

Mastering Algorithms with C

Mastering Algorithms with C

Book Description

There are many books on data structures and , including some with useful libraries of functions. Mastering with offers you a unique combination of theoretical background and working code. With robust solutions for everyday tasks, this book avoids the abstract style of most classic data structures and algorithms texts, but still provides all of the information you need to understand the purpose and use of common techniques.

Implementations, as well as interesting, real-world examples of each data structure and algorithm, are included.

Using both a style and a writing style that are exceptionally clean, Kyle Loudon shows you how to use such essential data structures as lists, stacks, queues, sets, trees, heaps, priority queues, and graphs. He explains how to use algorithms for sorting, searching, numerical analysis, data compression, data encryption, common graph problems, and computational geometry. And he describes the relative efficiency of all implementations. The compression and encryption chapters not only give you working code for reasonably efficient solutions, they offer explanations of concepts in an approachable manner for people who never have had the time or expertise to study them in depth.

Anyone with a basic understanding of the C language can use this book. In order to provide maintainable and extendible code, an extra level of abstraction (such as pointers to functions) is used in examples where appropriate. Understanding that these techniques may be unfamiliar to some programmers, Loudon explains them clearly in the introductory chapters. Download Now »