数据结构(C语言版)(大学计算机教育国外著名教材系列(影印版))

《数据结构(C语言版)》：大学计算机教育国外有名教材系列(影印版)

《数据结构(C语言版)》内容简介：有关数据结构的教材很多，而《数据结构(C语言版)》是一本很好有特点的教材，每章先简要介绍本章的主要内容，给出基本的知识背景，然后使用大量的示例、表格、插图和流程图来阐述各种概念和知识，方便了读者的理解，同时给出了大量的源代码，帮助读者实现实际的数据结构，每章后面提供了复习题、多项选择题和编程练习题，有助于读者巩固所学知识的理解，是一本很好理想的数据结构教材。
每章先简要介绍本章的主要内容，给出基本的知识背景。
使用了大量的已求解示例、表格、插图和流程图，大大方便了读者的理解。
给出了大量的源代码，帮助读者实现实际的数据结构，从而提供程序的可靠性。
每章后面提供了复习题、多项选择题和编程练习题，有助于巩固所学知识的理解。
通过概念和编程示例来阐述每种数据结构的应用。

作者：(印象)里斯哈拉莫斯(RKrishnamoorthy)(印象)库玛纳维尔(GIndiraniKumravel)

RKrishnamoorthy,PhDisProfessorofInformationTechnology,BharathidasanInstituteofTechnology,BharathidasanUniversity,Trichy.DrRKrishnamoorthyreceivedhisM.TechDegreeinComputerScienceandEngineeringfromIndianInstituteofTechnology,KanpurandPhDdegreeinComputerScienceandEngineer-ingfromIndianInstituteofTechnology,Kharagpur,withspecializationinComputerVisionandImageProcessing.Hehas24yearsofteachingexperience.Heistheauthorofthreebooks,andforty-fourtechnicalpaperspublishedinNationalandInternationalConferencesandInternationalJournals.HehasproducedfivePhDs.HeismemberofCSI,ISTE,IEEEandACM.Hisareasofinterestincludenetworksecu-rity,imageprocessingandsoftwaretesting.
GIndiraniKumaravelisSeniorLecturerinComputerScienceandEngineering,AnnamaiaiUniversity,Chidambaram.ShereceivedherMEdegreeinComputerScienceandEngineeringfromAnnamalaiUniversity.Indiranihas12yearsofteach-ingexperience.SheisamemberofCSI.HerareasofinterestincludeSpeechandImageProcessing.

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.6VariousOtherQueueStructures112
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.6ExtraInformationthatcanbeRetrievedfromtheAdjacencyMatrixoftheGraph373
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