Beginning Data Structures Using C


LOOKING TO PLACE A BULK ORDER?CLICK HERE

Piracy-free
Piracy-free
Assured Quality
Assured Quality
Secure Transactions
Secure Transactions
Fast Delivery
Fast Delivery
Sustainably Printed
Sustainably Printed
Delivery Options
Please enter pincode to check delivery time.
*COD & Shipping Charges may apply on certain items.
Review final details at checkout.

About The Book

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 STRUCTURES1.1ARRAYS1.2STACKS1.3QUEUES1.4LINKED LISTS1.5TREES1.6GRAPHS1.7DATA STRUCTURE OPERATIONS2.STACKS2.1POLISH NOTATION2.2TRANSFORMING AN INFIX EXPRESSION INTO A POSTFIX EXPRESSION2.3EVALUATION OF A POSTFIX EXPRESSION3.QUEUES3.1CIRCULAR QUEUE3.2PRIORITY QUEUES3.3DEQUES3.4INPUT RESTRICTED DEQUE3.5OUTPUT RESTRICTED DEQUE4.RECURSION4.1BACKTRACKING4.2FACTORIAL OF A NUMBER4.3MULTIPLYING TWO NUMBERS USING RECURSION4.4GREATEST COMMON DIVISOR4.5FIBONACCI SERIES4.6BINARY SEARCH USING RECURSION4.7TOWERS OF HANOI4.88 QUEENS PROBLEM4.9GENERATING PERMUTATIONS4.10TO FIND OUT THE DETERMINANT OF A MATRIX4.11INVERSE OF A MATRIX4.12A RECURSIVE PROBLEM5.LINKED LISTS5.1LINEAR LINKED LIST5.2CIRCULAR LINKED LIST5.3DOUBLY LINKED LIST6.STACKS AND QUEUES USING LINKED LISTS6.1STACKS USING LINKED-LIST6.2QUEUE USING LINKED-LIST6.3PRIORITY QUEUE USING LINKED-LIST7.TREES7.1BINARY TREES7.2COMPLETE BINARY TREES7.3DEPTH (OR HEIGHT) OF A TREE7.4BINARY SEARCH TREES7.5TRAVERSING IN TREES WITHOUT USING RECURSION7.6HEIGHT BALANCED TREES; AVL TREES7.7THREADED BINARY TREES; INORDER THREADING8.GRAPHS8.1SIMPLE GRAPH8.2DIGRAPH (DIRECTED GRAPH)8.3SIMPLE DIRECTED GRAPH8.4WEIGHTED GRAPH8.5PATH8.6CYCLE8.7CONNECTED GRAPH8.8COMPLETE GRAPH8.9INCIDENCE AND DEGREE8.10NULL GRAPH8.11ADJACENCY MATRIX8.12PATH MATRIX8.13WARSHALL’S ALGORITHM8.14SHORTEST PATH ALGORITHM8.15GRAPH COLORING8.16HAMILTONIAN CYCLES8.17ADJACENCY LIST8.18GRAPH TRAVERSAL8.19MINIMUM COST SPANNING TREES8.20TOPOLOGICAL SORT9.SEARCHING9.1SEQUENTIAL SEARCH9.2BINARY SEARCH10.SORTING10.1BUBBLE SORT10.2SELECTION SORT10.3INSERTION SORT10.4SHELL SORT10.5MERGING OF TWO SORTED ARRAYS10.6MERGE SORT10.7MERGE SORT USING RECURSION10.8QUICKSORT10.9RADIX SORT10.10HEAP SORT10.11BINARY TREE SORT10.12ADDRESS CALCULATION SORT
downArrow

Details