Beginning Data Structures Using C

ISBN-13: 9781466322547 / Angielski / Miękka / 2011 / 524 str.

MR Yogish Sachdeva

Opis

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

Zawartość książki może nie spełniać oczekiwań – reklamacje nie obejmują treści, która mogła nie być redakcyjnie ani merytorycznie opracowana.