Beginning Data Structures Using C

3.67 avg rating
( 3 ratings by Goodreads )
 
9781466322547: Beginning Data Structures Using C
View all copies of this ISBN edition:
 
 

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.1 ARRAYS

1.2 STACKS

1.3 QUEUES

1.4 LINKED LISTS

1.5 TREES

1.6 GRAPHS

1.7 DATA STRUCTURE OPERATIONS

2. STACKS

2.1 POLISH NOTATION

2.2 TRANSFORMING AN INFIX EXPRESSION INTO A POSTFIX EXPRESSION

2.3 EVALUATION OF A POSTFIX EXPRESSION

3. QUEUES

3.1 CIRCULAR QUEUE

3.2 PRIORITY QUEUES

3.3 DEQUES

3.4 INPUT RESTRICTED DEQUE

3.5 OUTPUT RESTRICTED DEQUE

4. RECURSION

4.1 BACKTRACKING

4.2 FACTORIAL OF A NUMBER

4.3 MULTIPLYING TWO NUMBERS USING RECURSION

4.4 GREATEST COMMON DIVISOR

4.5 FIBONACCI SERIES

4.6 BINARY SEARCH USING RECURSION

4.7 TOWERS OF HANOI

4.8 8 QUEENS PROBLEM

4.9 GENERATING PERMUTATIONS

4.10 TO FIND OUT THE DETERMINANT OF A MATRIX

4.11 INVERSE OF A MATRIX

4.12 A RECURSIVE PROBLEM

5. LINKED LISTS

5.1 LINEAR LINKED LIST

5.2 CIRCULAR LINKED LIST

5.3 DOUBLY LINKED LIST

6. STACKS AND QUEUES USING LINKED LISTS

6.1 STACKS USING LINKED-LIST

6.2 QUEUE USING LINKED-LIST

6.3 PRIORITY QUEUE USING LINKED-LIST

7. TREES

7.1 BINARY TREES

7.2 COMPLETE BINARY TREES

7.3 DEPTH (OR HEIGHT) OF A TREE

7.4 BINARY SEARCH TREES

7.5 TRAVERSING IN TREES WITHOUT USING RECURSION

7.6 HEIGHT BALANCED TREES; AVL TREES

7.7 THREADED BINARY TREES; INORDER THREADING

8. GRAPHS

8.1 SIMPLE GRAPH

8.2 DIGRAPH (DIRECTED GRAPH)

8.3 SIMPLE DIRECTED GRAPH

8.4 WEIGHTED GRAPH

8.5 PATH

8.6 CYCLE

8.7 CONNECTED GRAPH

8.8 COMPLETE GRAPH

8.9 INCIDENCE AND DEGREE

8.10 NULL GRAPH

8.11 ADJACENCY MATRIX

8.12 PATH MATRIX

8.13 WARSHALL’S ALGORITHM

8.14 SHORTEST PATH ALGORITHM

8.15 GRAPH COLORING

8.16 HAMILTONIAN CYCLES

8.17 ADJACENCY LIST

8.18 GRAPH TRAVERSAL

8.19 MINIMUM COST SPANNING TREES

8.20 TOPOLOGICAL SORT

9. SEARCHING

9.1 SEQUENTIAL SEARCH

9.2 BINARY SEARCH

10. SORTING

10.1 BUBBLE SORT

10.2 SELECTION SORT

10.3 INSERTION SORT

10.4 SHELL SORT

10.5 MERGING OF TWO SORTED ARRAYS

10.6 MERGE SORT

10.7 MERGE SORT USING RECURSION

10.8 QUICKSORT

10.9 RADIX SORT

10.10 HEAP SORT

10.11 BINARY TREE SORT

10.12 ADDRESS CALCULATION SORT

"synopsis" may belong to another edition of this title.

Other Popular Editions of the Same Title

9788192336602: Beginning Data Structures Using C

Featured Edition

ISBN 10:  8192336603 ISBN 13:  9788192336602
Publisher: Self, 2011
Hardcover

Top Search Results from the AbeBooks Marketplace

1.

Mr. Yogish Sachdeva
ISBN 10: 1466322543 ISBN 13: 9781466322547
New Quantity Available: 1
Seller:
Sharehousegoods
(Milwaukee, WI, U.S.A.)
Rating
[?]

Book Description Condition: New. This is a brand new book! Fast Shipping - Safe and Secure Mailer - Our goal is to deliver a better item than what you are hoping for! If not we will make it right!. Seller Inventory # 1XG77X001HH6_ns

More information about this seller | Contact this seller

Buy New
US$ 12.79
Convert currency

Add to Basket

Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

2.

Sachdeva, Mr. Yogish
Published by CreateSpace Independent Publishing Platform (2011)
ISBN 10: 1466322543 ISBN 13: 9781466322547
New Paperback Quantity Available: 10
Seller:
Ergodebooks
(RICHMOND, TX, U.S.A.)
Rating
[?]

Book Description CreateSpace Independent Publishing Platform, 2011. Paperback. Condition: New. Seller Inventory # INGM9781466322547

More information about this seller | Contact this seller

Buy New
US$ 16.86
Convert currency

Add to Basket

Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

3.

Sachdeva, MR Yogish
Published by Createspace Independent Publishing Platform (2011)
ISBN 10: 1466322543 ISBN 13: 9781466322547
New Quantity Available: > 20
Print on Demand
Seller:
Pbshop
(Wood Dale, IL, U.S.A.)
Rating
[?]

Book Description Createspace Independent Publishing Platform, 2011. PAP. Condition: New. New Book. Shipped from US within 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # IQ-9781466322547

More information about this seller | Contact this seller

Buy New
US$ 18.16
Convert currency

Add to Basket

Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

4.

MR Yogish Sachdeva
Published by Createspace Independent Publishing Platform, United States (2011)
ISBN 10: 1466322543 ISBN 13: 9781466322547
New Paperback Quantity Available: 10
Print on Demand
Seller:
Book Depository International
(London, United Kingdom)
Rating
[?]

Book Description Createspace Independent Publishing Platform, United States, 2011. Paperback. Condition: New. Language: English . Brand New Book ***** Print on Demand *****. 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 , 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. Seller Inventory # APC9781466322547

More information about this seller | Contact this seller

Buy New
US$ 22.35
Convert currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, rates & speeds

5.

MR Yogish Sachdeva
Published by Createspace Independent Publishing Platform, United States (2011)
ISBN 10: 1466322543 ISBN 13: 9781466322547
New Paperback Quantity Available: 10
Print on Demand
Seller:
The Book Depository
(London, United Kingdom)
Rating
[?]

Book Description Createspace Independent Publishing Platform, United States, 2011. Paperback. Condition: New. Language: English . Brand New Book ***** Print on Demand *****.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 , 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. Seller Inventory # APC9781466322547

More information about this seller | Contact this seller

Buy New
US$ 23.12
Convert currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, rates & speeds

6.

Mr. Yogish Sachdeva
Published by CreateSpace Independent Publishing Platform (2011)
ISBN 10: 1466322543 ISBN 13: 9781466322547
New Paperback Quantity Available: 1
Seller:
Ergodebooks
(RICHMOND, TX, U.S.A.)
Rating
[?]

Book Description CreateSpace Independent Publishing Platform, 2011. Paperback. Condition: New. Seller Inventory # DADAX1466322543

More information about this seller | Contact this seller

Buy New
US$ 22.72
Convert currency

Add to Basket

Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

7.

Mr. Yogish Sachdeva
Published by CreateSpace Independent Publishing Platform (2011)
ISBN 10: 1466322543 ISBN 13: 9781466322547
New Softcover Quantity Available: 1
Seller:
Irish Booksellers
(Portland, ME, U.S.A.)
Rating
[?]

Book Description CreateSpace Independent Publishing Platform, 2011. Condition: New. book. Seller Inventory # M1466322543

More information about this seller | Contact this seller

Buy New
US$ 24.33
Convert currency

Add to Basket

Shipping: US$ 3.27
Within U.S.A.
Destination, rates & speeds

8.

Sachdeva, MR Yogish
ISBN 10: 1466322543 ISBN 13: 9781466322547
New Quantity Available: > 20
Print on Demand
Seller:
Books2Anywhere
(Fairford, GLOS, United Kingdom)
Rating
[?]

Book Description 2011. PAP. Condition: New. New Book. Delivered from our UK warehouse in 3 to 5 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # IQ-9781466322547

More information about this seller | Contact this seller

Buy New
US$ 16.56
Convert currency

Add to Basket

Shipping: US$ 11.52
From United Kingdom to U.S.A.
Destination, rates & speeds

9.

Mr. Yogish Sachdeva
Published by CreateSpace Independent Publishing Platform
ISBN 10: 1466322543 ISBN 13: 9781466322547
New Paperback Quantity Available: > 20
Print on Demand
Seller:
BuySomeBooks
(Las Vegas, NV, U.S.A.)
Rating
[?]

Book Description CreateSpace Independent Publishing Platform. Paperback. Condition: New. This item is printed on demand. 522 pages. Dimensions: 8.5in. x 5.5in. x 1.2in.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 sachdevayogishyahoo. 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. 1 ARRAYS 1. 2 STACKS 1. 3 QUEUES 1. 4 LINKED LISTS 1. 5 TREES 1. 6 GRAPHS 1. 7 DATA STRUCTURE OPERATIONS 2. STACKS 2. 1 POLISH NOTATION 2. 2 TRANSFORMING AN INFIX EXPRESSION INTO A POSTFIX EXPRESSION 2. 3 EVALUATION OF A POSTFIX EXPRESSION 3. QUEUES 3. 1 CIRCULAR QUEUE 3. 2 PRIORITY QUEUES 3. 3 DEQUES 3. 4 INPUT RESTRICTED DEQUE 3. 5 OUTPUT RESTRICTED DEQUE 4. RECURSION 4. 1 BACKTRACKING 4. 2 FACTORIAL OF A NUMBER 4. 3 MULTIPLYING TWO NUMBERS USING RECURSION 4. 4 GREATEST COMMON DIVISOR 4. 5 FIBONACCI SERIES 4. 6 BINARY SEARCH USING RECURSION 4. 7 TOWERS OF HANOI 4. 8 8 QUEENS PROBLEM 4. 9 GENERATING PERMUTATIONS 4. 10 TO FIND OUT THE DETERMINANT OF A MATRIX 4. 11 INVERSE OF A MATRIX 4. 12 A RECURSIVE PROBLEM 5. LINKED LISTS 5. 1 LINEAR LINKED LIST 5. 2 CIRCULAR LINKED LIST 5. 3 DOUBLY LINKED LIST 6. STACKS AND QUEUES USING LINKED LISTS 6. 1 STACKS USING LINKED-LIST 6. 2 QUEUE USING LINKED-LIST 6. 3 PRIORITY QUEUE USING LINKED-LIST 7. TREES 7. 1 BINARY TREES 7. 2 COMPLETE BINARY TREES 7. 3 DEPTH (OR HEIGHT) OF A TREE 7. 4 BINARY SEARCH TREES 7. 5 TRAVERSING IN TREES WITHOUT USING RECURSION 7. 6 HEIGHT BALANCED TREES; AVL TREES 7. 7 THREADED BINARY TREES; INORDER THREADING 8. GRAPHS 8. 1 SIMPLE GRAPH 8. 2 DIGRAPH (DIRECTED GRAPH) 8. 3 SIMPLE DIRECTED GRAPH 8. 4 WEIGHTED GRAPH 8. 5 PATH 8. 6 CYCLE 8. 7 CONNECTED GRAPH 8. 8 COMPLETE GRAPH 8. 9 INCIDENCE AND DEGREE 8. 10 NULL GRAPH 8. 11 ADJACENCY MATRIX 8. 12 PATH MATRIX 8. 13 WARSHALLS ALGORITHM 8. 14 SHORTEST PATH ALGORITHM 8. 15 GRAPH COLORING 8. 16 HAMILTONIAN CYCLES 8. 17 ADJACENCY LIST 8. 18 GRAPH TRAVERSAL 8. 19 MINIMUM COST SPANNING TREES 8. 20 TOPOLOGICAL SORT 9. SEARCHING 9. 1 SEQUENTIAL SEARCH 9. 2 BINARY SEARCH 10. SORTING 10. 1 BUBBLE SORT 10. 2 SELECTION SORT 10. 3 INSERTION SORT 10. 4 SHELL SORT 10. 5 MERGING OF TWO SORTED ARRAYS 10. 6 MERGE SORT 10. 7 MERGE SORT USING RECURSION 10. 8 QUICKSORT 10. 9 RADIX SORT 10. 10 HEAP SORT 10. 11 BINARY TREE SORT 10. 12 ADDRESS CALCULATION SORT This item ships from La Vergne,TN. Paperback. Seller Inventory # 9781466322547

More information about this seller | Contact this seller

Buy New
US$ 32.96
Convert currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, rates & speeds