Beginning Data Structures Using C

Name: Beginning Data Structures Using C
SKU: aaeb69b88189eda6d5c736ed8d12fecf
Price: 24.99 EUR
Availability: InStock

1/1

Afbeelding van Beginning Data Structures Using C

Bol

Prijzen vanaf

24,99

Uitgelicht

	24,99	Naar shop
VERGELIJK ALLE AANBIEDERS (1)

Beschrijving

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

Lees meer

Vergelijk aanbieders (1)

Sorteren op:

€ 24,99 € 2,99 verzendkosten Totaal € 27,98

Beschrijving (1)

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

Lees meer