大学计算机教育国外着名教材系列·数据结构 _生活百科

文章插图
大学计算机教育国外着名教材系列·数据结构【大学计算机教育国外着名教材系列·数据结构】《大学计算机教育国外着名教材系列·数据结构》是2009年9月1日清华大学出版社出版的图书。本书是一本数据结构的教材用书。
基本介绍书名：大学计算机教育国外着名教材系列·数据结构
又名：Data Structures Using C
ISBN：7302207313, 9787302207313
页数：604页
出版社：清华大学出版社
出版时间：2009年9月1日
装帧：平装
开本：32
从书名：大学计算机教育国外着名教材系列
作者简介作者：(印象)克里斯哈拉莫斯(R Krishnamoorthy) (印象)库玛纳维尔(G Indirani Kumravel)R Krishnamoorthy, PhD is Professor of Information Technology, BharathidasanInstitute of Technology, Bharathidasan University, Trichy. Dr R Krishnamoorthyreceived his M. Tech Degree in Computer Science and Engineering from IndianInstitute of Technology, Kanpur and PhD degree in Computer Science and Engineer-ing from Indian Institute of Technology, Kharagpur, with specialization in ComputerVision and Image Processing. He has 24 years of teaching experience. He is theauthor of three books, and forty-four technical papers published in National andInternational Conferences and International Journals. He has produced five PhDs. Heis member of CSI, ISTE, IEEE and ACM. His areas of interest include network secu-rity, image processing and software testing.G Indirani Kumaravel is Senior Lecturer in Computer Science and Engineering,Annamaiai University, Chidambaram. She received her M E degree in ComputerScience and Engineering from Annamalai University. Indirani has 12 years of teach-ing experience. She is a member of CSI. Her areas of interest include Speech andImage Processing.内容简介《数据结构(C语言版)》内容简介：有关数据结构的教材很多，而《数据结构(C语言版)》是一本非常有特点的教材，每章先简要介绍本章的主要内容，给出基本的知识背景，然后使用大量的示例、表格、插图和流程图来阐述各种概念和知识，方便了读者的理解，同时给出了大量的原始码，帮助读者实现实际的数据结构，每章后面提供了複习题、多项选择题和编程练习题，有助于读者巩固所学知识的理解，是一本非常理想的数据结构教材。每章先简要介绍本章的主要内容，给出基本的知识背景。使用了大量的已求解示例、表格、插图和流程图，大大方便了读者的理解。给出了大量的原始码，帮助读者实现实际的数据结构，从而提供程式的可靠性。每章后面提供了複习题、多项选择题和编程练习题，有助于巩固所学知识的理解。通过概念和编程示例来阐述每种数据结构的套用。目录Preface ix1. Data Structures-An Overview 11.1 Introduction 11.2 Data Types 31.3 Program Modules 41.4 Control Structures 71.5 Looping Structures 131.6 Arrays 161.7 Structures 241.8 Pointers 281.9 Recursion 31Review Yourself 35Multiple Choice Questions 36Programming Exercises 382. Strings and Character Manipulation 392.1 Introduction 392.2 Primitive Functions or Operations on Strings 392.3 Representation of Strings 412.4 String Manipulation in C 422.5 String Manipulation Applications 58Review Yourself 66Multiple Choice Questions 67Programming Exercises 673. Stacks 683.1 Introduction 683.2 Definition 683.3 Primitive Operations 693.4 An abstract Data Type (ADT) 703.5 Implementation 703.6 Applications of Stack 76Review Yourself 99Multiple Choice Questions 99Programming Exercises 1014. Queues 1024.1 Introduction 1024.2 Definition 1024.3 Operations on a Queue 1034.4 ADT for Queues 1044.5 Representation of Queue 1044.6 Various Other Queue Structures 112 4.7 Applications 152Review Yourself 165Multiple Choice Questions 165Programming Exercises 1655. Linked Lists 1685.1 Introduction 1685.2 Definition 1685.3 ADT for Linked List 1695.4 Singly Linked List 1695.5 Doubly Linked List 1845.6 Circular Linked Lists 1985.7 Sparse Matrices 2105.8 Applications 2325.9 Additional Programs 254Review Yourself 272Multiple Choice Questions 272Programming Exercises 2736. Trees 2746.1 Introduction 2746.2 Definition 2746.3 Terminologies Used 2746.4 Binary Tree 2766.5 Threaded Binary Trees2966.6 Heap Trees 3176.7 Deaps 3276.8 Huffman Algorithm 3376.9 Decision Trees 3446.10 Game Tree 3516.11 Applications 358Review Yourself 362Multiple Choice Questions 362Programming Exercises 3637. Graphs 3647.1 Introduction 3647.2 Definition 3657.3 Terminologies Used 3667.4 Representation of Graphs 3697.5 ADT for Graphs 3727.6 Extra Information that can be Retrieved from the Adjacency Matrix of the Graph 3737.7 Operations on Graphs 3747.8 Applications 4107.9 Unweighted Shortest Path for Graphs Using Adjacency Matrix 439 7.10 Introduction to NP-completeness 444Review Yourself 445Multiple Choice Questions 445Programming Exercises 4468. Sorting 4478.1 Introduction 4478.2 Definition 4488.3 Internal Sorting 4488.4 External Sorting 474Review Yourself 483Multiple Choice Questions 483Programming Exercises 4849. Searching 4859.1 Introduction 4859.2 Quantity Dependent Search Techniques 4859.3 Density Dependent Search Techniques 4909.4 Indexed Search Techniques 509Review Yourself 512Multiple Choice Questions 512Programming Exercises 51310. Search Trees 51410.1 Introduction 51410.2 Binary Search Tree (BST) 51410.3 AVL Trees 53010.4 B - Trees 54410.5 B+ - Trees 56210.6 Tries 572Review Yourself 587Multiple Choice Questions 587Programming Exercises 58811. File Structures 58911.1 Files 589Review Yourself 599Multiple Choice Questions 600Programming Exercises 600Index 602