It is the Python version of "Data Structures and Algorithms Made Easy." Table of Contents: <a target="_blank" rel="noopener nofollow" href="http://goo.gl/VLEUca">goo.gl/VLEUca</a> Sample Chapter: <a target="_blank" rel="noopener nofollow" href="http://goo.gl/8AEcYk">goo.gl/8AEcYk</a> Source Code: <a
Data Structures and Algorithms: Annotated Reference with Examples
✍ Scribed by Barnett Granville, Del Tongo Luca.
- Tongue
- English
- Leaves
- 112
- Category
- Library
No coin nor oath required. For personal study only.
✦ Synopsis
Dotnetslackers.com, 2008. — 112 p.
This book written by Granville Barnett and Luca Del Tongo is part of an effort to provide all developers with a core understanding of algorithms that operate on various common, and uncommon data structures.ContentsIntroduction.
What this book is, and what it isn’t.
Assumed knowledge.
Big Oh notation.
Imperative programming language.
Object oriented concepts.
Pseudocode.
Tips for working through the examples.
Book outline.
Testing.
Where can I get the code?
Final messages.
Data Structures.
Linked Lists.
Singly Linked List.
Insertion.
Searching.
Deletion.
Traversing the list.
Traversing the list in reverse order.
Doubly Linked List.
Insertion.
Deletion.
Reverse Traversal.
Summary.
Binary Search Tree.
Insertion.
Searching.
Deletion.
Finding the parent of a given node.
Attaining a reference to a node.
Finding the smallest and largest values in the binary search tree.
Tree Traversals.
Preorder.
Postorder.
Inorder.
Breadth First.
Summary.
Heap.
Insertion.
Deletion.
Searching.
Traversal.
Summary.
Sets.
Unordered.
Insertion.
Ordered.
Summary.
Queues.
A standard queue.
Priority Queue.
Double Ended Queue.
Summary.
AVL Tree.
Tree Rotations.
Tree Rebalancing.
Insertion.
Deletion.
Summary.
Algorithms.
Sorting.
Bubble Sort.
Merge Sort.
Quick Sort.
Insertion Sort.
Shell Sort.
Radix Sort.
Summary.
Numeric.
Primality Test.
Base conversions.
Attaining the greatest common denominator of two numbers.
Computing the maximum value for a number of a specific base consisting of N digits.
Factorial of a number.
Summary.
Searching.
Sequential Search.
Probability Search.
Summary.
Strings.
Reversing the order of words in a sentence.
Detecting a palindrome . . . . . .
Counting the number of words in a string.
Determining the number of repeated words within a string.
Determining the first matching character between two strings.
Summary.
Algorithm Walkthrough.
Iterative algorithms.
Recursive Algorithms.
Summary.
Translation Walkthrough.
Summary.
Recursive Vs. Iterative Solutions.
Activation Records.
Some problems are recursive in nature.
Summary.
Testing.
What constitutes a unit test?
When should I write my tests?
How seriously should I view my test suite?
The three A’s.
The structuring of tests.
Code Coverage.
Summary.
Symbol Definitions.
✦ Subjects
Информатика и вычислительная техника;Информатика (программирование);Алгоритмы и структуры данных
📜 SIMILAR VOLUMES
<p><strong> Peeling Data Structures and Algorithms:</strong></p><p>The sample chapter should give you a very good idea of the quality and style of our book. In particular, be sure you are comfortable with the level and with our Python coding style. This book focuses on giving solutions for complex p
The sample chapter should give you a very good idea of the quality and style of our book. In particular, be sure you are comfortable with the level and with our Python coding style. This book focuses on giving solutions for complex problems in data structures and algorithm. It even provides multiple
As an experienced javascript developer moving to server-side programming, you need to implement classic data structures and algorithms associated with conventional object-oriented languages like C# and Java. This practical guide shows you how to work hands-on with a variety of storage mechanisms—inc
As an experienced javascript developer moving to server-side programming, you need to implement classic data structures and algorithms associated with conventional object-oriented languages like C# and Java. This practical guide shows you how to work hands-on with a variety of storage mechanisms—inc