數據結構(C語言版)(R Krishnam著書籍)

書籍信息,內容簡介,圖書目錄,

書籍信息

作者:R Krishnam
定價:39元
ISBN:9787302207313
出版日期:2009.09.01

內容簡介

有關數據結構的教材很多,而本書是一本非常有特點的教材,每章先簡要介紹本章的主要內容,給出基本的知識背景,然後使用大量的示例、表格、插圖和流程圖來闡述各種概念和知識,方便了讀者的理解,同時給出了大量的原始碼,幫助讀者實現實際的數據結構,每章後面提供了複習題、多項選擇題和編程練習題,有助於讀者鞏固所學知識的理解,是一本非常理想的數據結構教材。 ·每章先簡要介紹本章的主要內容,給出基本的知識背景。 ·使用了大量的已求解示例、表格、插圖和流程圖,大大方便了讀者的理解。 ·給出了大量的原始碼,幫助讀者實現實際的數據結構,從而提供程式的可靠性。 ·每章後面提供了複習題、多項選擇題和編程練習題,有助於鞏固所學知識的理解。 ·通過概念和編程示例來闡述每種數據結構的套用。

圖書目錄

Prefaceix
1.DataStructures—AnOverview1
1.1Introduction1
1.2DataTypes3
1.3ProgramModules4
1.4ControlStructures7
1.5LoopingStructures13
1.6Arrays16
1.7Structures24
1.8Pointers28
1.9Recursion31 ReviewYourself35 MultipleChoiceQuestions36 ProgrammingExercises38
2.StringsandCharacterManipulation39
2.1Introduction39
2.2PrimitiveFunctionsorOperationsonStrings39
2.3RepresentationofStrings41
2.4StringManipulationinC42
2.5StringManipulationApplications58 ReviewYourself66 MultipleChoiceQuestions67 ProgrammingExercises67
3.Stacks68
3.1Introduction68
3.2Definition68
3.3PrimitiveOperations69
3.4AnabstractDataType(ADT)70
3.5Implementation70
3.6ApplicationsofStack76
ReviewYourself99
MultipleChoiceQuestions99
ProgrammingExercises101
4.Queues102
4.1Introduction102
4.2Definition102
4.3OperationsonaQueue103
4.4ADTforQueues104
4.5RepresentationofQueue104
4.6VariousOtherQueueStructures1
2
4.7Applications152
ReviewYourself165
MultipleChoiceQuestions165
ProgrammingExercises165
5.LinkedLists168
5.1Introduction168
5.2Definition168
5.3ADTforLinkedList169
5.4SinglyLinkedList169
5.5DoublyLinkedList184
5.6CircularLinkedLists198
5.7SparseMatrices210
5.8Applications232
5.9AdditionalPrograms254
ReviewYourself272
MultipleChoiceQuestions272
ProgrammingExercises273
6.Trees274
6.1Introduction274
6.2Definition274
6.3TerminologiesUsed274
6.4BinaryTree276
6.5ThreadedBinaryTrees296
6.6HeapTrees317
6.7Deaps327
6.8HuffmanAlgorithm337
6.9DecisionTrees344
6.10GameTree351
6.11Applications358
ReviewYourself362
MultipleChoiceQuestions362
ProgrammingExercises363
7.Graphs364
7.1Introduction364
7.2Definition365
7.3TerminologiesUsed366
7.4RepresentationofGraphs369
7.5ADTforGraphs372
7.6ExtraInformationthatcanbeRetrievedfromtheAdjacency
MatrixoftheGraph373
7.7OperationsonGraphs374
7.8Applications410
7.9UnweightedShortestPathforGraphsUsingAdjacencyMatrix439
7.10IntroductiontoNP-completeness444
ReviewYourself445
MultipleChoiceQuestions445
ProgrammingExercises446
8.Sorting447
8.1Introduction447
8.2Definition448
8.3InternalSorting448
8.4ExternalSorting474
ReviewYourself483
MultipleChoiceQuestions483
ProgrammingExercises484
9.Searching485
9.1Introduction485
9.2QuantityDependentSearchTechniques485
9.3DensityDependentSearchTechniques490
9.4IndexedSearchTechniques509
ReviewYourself512
MultipleChoiceQuestions512
ProgrammingExercises513
10.SearchTrees514
10.1Introduction514
10.2BinarySearchTree(BST)514
10.3AVLTrees530
10.4B-Trees544
10.5B+-Trees562
10.6Tries572
ReviewYourself587
MultipleChoiceQuestions587
ProgrammingExercises588
11.FileStructures589
11.1Files589
ReviewYourself599
MultipleChoiceQuestions600
ProgrammingExercises600
Index602

相關詞條

熱門詞條

聯絡我們