If all you want is examples of various data structures and algorithms without all the boring theory, then you'll be happy with this book. It has about seventy examples of the most common structures and algorithms. All examples are in the C Language. Pointers and advanced language concepts are extensively used.
I've studied a few so far, and they do work, but they are only for educational purposes and not ready for commercial use. Most examples begin with a very short description and a very elementary diagram that shows the program logic followed with a list of steps that describe what the code does while it runs. Many examples, if not all, also have a list of steps describing the user input, processing, and program output. So far, I haven't found any pseudo code, which if done well, would have been better.
The book does have a downside, but is mostly due to formatting. The font for the code is in serif so it's too condensed; a very poor and naive choice. The line spacing is too large so the code spans too many pages; all the examples could have taken less than half the current space so that more of it could be seen at the same time. The diagrams and overall formatting of the book are at the level of an amateur.
The book has no index, but I don't think it would have provided any value.
If the downside does not turn you off, then the book is well worth the money.
Buying Options
| Digital List Price: | $2.99 |
| Print List Price: | $17.78 |
| Kindle Price: | $0.99 Save $16.79 (94%) |
You've subscribed to ! We will preorder your items within 24 hours of when they become available. When new books are released, we'll charge your default payment method for the lowest price available during the pre-order period.
Update your device or payment method, cancel individual pre-orders or your subscription at
Your Memberships & Subscriptions
Your Memberships & Subscriptions
There was an error. We were unable to process your subscription due to an error. Please refresh and try again.
Got a mobile device?
You’ve got a Kindle.
You’ve got a Kindle.
Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet, or computer - no Kindle device required. Learn more
Read instantly on your browser with Kindle Cloud Reader.
Using your mobile phone camera - scan the code below and download the Kindle app.
Enter your mobile phone or email address
Send link
Processing your request...
By pressing "Send link," you agree to Amazon's Conditions of Use.
You consent to receive an automated text message from or on behalf of Amazon about the Kindle App at your mobile number above. Consent is not a condition of any purchase. Message & data rates may apply.
Add to book club
Loading your book clubs
There was a problem loading your book clubs. Please try again.
Not in a club? Learn more
Join or create book clubs
Choose books together
Track your books
Bring your club to Amazon Book Clubs, start a new book club and invite your friends to join, or find a club that’s right for you for free.
Follow the Author
Something went wrong. Please try your request again later.
OK
Beginning Data Structures Using C Kindle Edition
by
Yogish Sachdeva
(Author)
Format: Kindle Edition
| Yogish Sachdeva (Author) Find all the books, read about the author, and more. See search results for this author |
A beginner of the Data structures, who has some basic knowledge of C, could find this book interesting and simple. Every program has a proper step by step explanation of each line of code. It contains the practical implementation of stacks, queues, linked lists, trees, graphs, searching and sorting techniques. Also, recursion has been explained in an easy manner with the numerous examples. However if you find any mistake, or want to give some suggestions for the improvement of this book, then the same may be sent at 'sachdevayogish@yahoo.co.in', so that the mistakes may be rectified and the suggestions may be incorporated. Topics, which are covered in this book, are:
1.INTRODUCTION TO DATA STRUCTURES
1.1ARRAYS
1.2STACKS
1.3QUEUES
1.4LINKED LISTS
1.5TREES
1.6GRAPHS
1.7DATA STRUCTURE OPERATIONS
2.STACKS
2.1POLISH NOTATION
2.2TRANSFORMING AN INFIX EXPRESSION INTO A POSTFIX EXPRESSION
2.3EVALUATION OF A POSTFIX EXPRESSION
3.QUEUES
3.1CIRCULAR QUEUE
3.2PRIORITY QUEUES
3.3DEQUES
3.4INPUT RESTRICTED DEQUE
3.5OUTPUT RESTRICTED DEQUE
4.RECURSION
4.1BACKTRACKING
4.2FACTORIAL OF A NUMBER
4.3MULTIPLYING TWO NUMBERS USING RECURSION
4.4GREATEST COMMON DIVISOR
4.5FIBONACCI SERIES
4.6BINARY SEARCH USING RECURSION
4.7TOWERS OF HANOI
4.88 QUEENS PROBLEM
4.9GENERATING PERMUTATIONS
4.10TO FIND OUT THE DETERMINANT OF A MATRIX
4.11INVERSE OF A MATRIX
4.12A RECURSIVE PROBLEM
5.LINKED LISTS
5.1LINEAR LINKED LIST
5.2CIRCULAR LINKED LIST
5.3DOUBLY LINKED LIST
6.STACKS AND QUEUES USING LINKED LISTS
6.1STACKS USING LINKED-LIST
6.2QUEUE USING LINKED-LIST
6.3PRIORITY QUEUE USING LINKED-LIST
7.TREES
7.1BINARY TREES
7.2COMPLETE BINARY TREES
7.3DEPTH (OR HEIGHT) OF A TREE
7.4BINARY SEARCH TREES
7.5TRAVERSING IN TREES WITHOUT USING RECURSION
7.6HEIGHT BALANCED TREES; AVL TREES
7.7THREADED BINARY TREES; INORDER THREADING
8.GRAPHS
8.1SIMPLE GRAPH
8.2DIGRAPH (DIRECTED GRAPH)
8.3SIMPLE DIRECTED GRAPH
8.4WEIGHTED GRAPH
8.5PATH
8.6CYCLE
8.7CONNECTED GRAPH
8.8COMPLETE GRAPH
8.9INCIDENCE AND DEGREE
8.10NULL GRAPH
8.11ADJACENCY MATRIX
8.12PATH MATRIX
8.13WARSHALL’S ALGORITHM
8.14SHORTEST PATH ALGORITHM
8.15GRAPH COLORING
8.16HAMILTONIAN CYCLES
8.17ADJACENCY LIST
8.18GRAPH TRAVERSAL
8.19MINIMUM COST SPANNING TREES
8.20TOPOLOGICAL SORT
9.SEARCHING
9.1SEQUENTIAL SEARCH
9.2BINARY SEARCH
10.SORTING
10.1BUBBLE SORT
10.2SELECTION SORT
10.3INSERTION SORT
10.4SHELL SORT
10.5MERGING OF TWO SORTED ARRAYS
10.6MERGE SORT
10.7MERGE SORT USING RECURSION
10.8QUICKSORT
10.9RADIX SORT
10.10HEAP SORT
10.11BINARY TREE SORT
10.12ADDRESS CALCULATION SORT
1.INTRODUCTION TO DATA STRUCTURES
1.1ARRAYS
1.2STACKS
1.3QUEUES
1.4LINKED LISTS
1.5TREES
1.6GRAPHS
1.7DATA STRUCTURE OPERATIONS
2.STACKS
2.1POLISH NOTATION
2.2TRANSFORMING AN INFIX EXPRESSION INTO A POSTFIX EXPRESSION
2.3EVALUATION OF A POSTFIX EXPRESSION
3.QUEUES
3.1CIRCULAR QUEUE
3.2PRIORITY QUEUES
3.3DEQUES
3.4INPUT RESTRICTED DEQUE
3.5OUTPUT RESTRICTED DEQUE
4.RECURSION
4.1BACKTRACKING
4.2FACTORIAL OF A NUMBER
4.3MULTIPLYING TWO NUMBERS USING RECURSION
4.4GREATEST COMMON DIVISOR
4.5FIBONACCI SERIES
4.6BINARY SEARCH USING RECURSION
4.7TOWERS OF HANOI
4.88 QUEENS PROBLEM
4.9GENERATING PERMUTATIONS
4.10TO FIND OUT THE DETERMINANT OF A MATRIX
4.11INVERSE OF A MATRIX
4.12A RECURSIVE PROBLEM
5.LINKED LISTS
5.1LINEAR LINKED LIST
5.2CIRCULAR LINKED LIST
5.3DOUBLY LINKED LIST
6.STACKS AND QUEUES USING LINKED LISTS
6.1STACKS USING LINKED-LIST
6.2QUEUE USING LINKED-LIST
6.3PRIORITY QUEUE USING LINKED-LIST
7.TREES
7.1BINARY TREES
7.2COMPLETE BINARY TREES
7.3DEPTH (OR HEIGHT) OF A TREE
7.4BINARY SEARCH TREES
7.5TRAVERSING IN TREES WITHOUT USING RECURSION
7.6HEIGHT BALANCED TREES; AVL TREES
7.7THREADED BINARY TREES; INORDER THREADING
8.GRAPHS
8.1SIMPLE GRAPH
8.2DIGRAPH (DIRECTED GRAPH)
8.3SIMPLE DIRECTED GRAPH
8.4WEIGHTED GRAPH
8.5PATH
8.6CYCLE
8.7CONNECTED GRAPH
8.8COMPLETE GRAPH
8.9INCIDENCE AND DEGREE
8.10NULL GRAPH
8.11ADJACENCY MATRIX
8.12PATH MATRIX
8.13WARSHALL’S ALGORITHM
8.14SHORTEST PATH ALGORITHM
8.15GRAPH COLORING
8.16HAMILTONIAN CYCLES
8.17ADJACENCY LIST
8.18GRAPH TRAVERSAL
8.19MINIMUM COST SPANNING TREES
8.20TOPOLOGICAL SORT
9.SEARCHING
9.1SEQUENTIAL SEARCH
9.2BINARY SEARCH
10.SORTING
10.1BUBBLE SORT
10.2SELECTION SORT
10.3INSERTION SORT
10.4SHELL SORT
10.5MERGING OF TWO SORTED ARRAYS
10.6MERGE SORT
10.7MERGE SORT USING RECURSION
10.8QUICKSORT
10.9RADIX SORT
10.10HEAP SORT
10.11BINARY TREE SORT
10.12ADDRESS CALCULATION SORT
- LanguageEnglish
- Publication dateJune 5, 2011
- File size2262 KB
Create your FREE Amazon Business account to save up to 10% with Business-only prices and free shipping. Register today
Product details
- ASIN : B0054JJ3BY
- Publication date : June 5, 2011
- Language : English
- File size : 2262 KB
- Text-to-Speech : Enabled
- Screen Reader : Supported
- Enhanced typesetting : Enabled
- X-Ray : Not Enabled
- Word Wise : Not Enabled
- Print length : 524 pages
- Lending : Enabled
- Best Sellers Rank: #2,713,462 in Kindle Store (See Top 100 in Kindle Store)
- #329 in C Programming
- #775 in Computer Engineering
- #980 in C Programming Language
- Customer Reviews:
About the author
Follow authors to get new release updates, plus improved recommendations.

Discover more of the author’s books, see similar authors, read author blogs and more
Customer reviews
4.0 out of 5 stars
4 out of 5
1 global rating
How are ratings calculated?
To calculate the overall star rating and percentage breakdown by star, we don’t use a simple average. Instead, our system considers things like how recent a review is and if the reviewer bought the item on Amazon. It also analyzes reviews to verify trustworthiness.

