This is an introductory course about algorithms and data structures. C++ is the programming language used in the course. The basics of this language will be reviewed before more difficult concepts are explored. VTC author and expert Dima Kassab will examine many topics, including: data design and implementation, primitive data structures (such as arrays and records), classes, templates, sorted and unsorted array-based lists, linked lists, doubly linked lists, stacks, queues, and binary search trees

Data Structures & Algorithms Interview Questions You'll Most Likely Be Asked /by Vibrant Publishers. Data Structures and Algorithms Interview Questions You'll Most Likely Be Asked is a perfect companion to stand ahead above the rest in today’s competitive job market.

An updated, innovative approach to data structures and algorithms

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 algorithms in C++.

The third edition of Java Software Structures embraces the enhancements of the latest version of Java (Java 6, as well as Java 5), where all structures and collections are based on generics. The framework of the text walks the reader through three main areas: conceptualization, explanation, and implementation, allowing for a consistent and coherent introduction to data structures. Readers learn how to develop high-quality software systems using well-designed collections and algorithms.

This innovative new book encourages readers to utilize the "Outside-In" approach to learning the use, design and implementation of data structures. The author introduces every data structure by first narrating its properties and use in applications (the "outside" view). This provides a clear introduction to data structures with realistic context where it is used. Venugopal then details how to build data structures (the "inside" view); readers learn how to evaluate usability, flexibility, extensibility, and performance in designing and implementing classic data structures.

This innovative new book encourages readers to utilize the “Outside-In” approach to learning the use, design and implementation of data structures. The author introduces ever

Data Structures and Algorithm Analysis in Java is an “advanced algorithms” book that fits between traditional CS2 and Algorithms Analysis courses. In the old ACM Curriculum Guidelines, this course was known as CS7. This text is for readers who want to learn good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency. Readers should have some knowledge of intermediate programming, including topics as object-based programming and recursion, and some background in discrete math.

The book teaches two things. Algorithms that are very useful in computing. And how these can be coded in Java.
The explanation of the algorithms requires a reasonable amount of mathematical sophistication on your part. They all relate to discrete maths, and cover topics like sorting, random number generation and graphs. The complexity of the discussion is less than that in Knuth's "Art of Computer Programming". Perhaps more akin to Sedgewick or Aho's algorithms texts. There is a fair amount of abstraction that you'll have to deal with.