數(shù)據(jù)結(jié)構(gòu)

前言

C programming language offers several facilities to group data together in conve-nient packages, or data structures. With the emergence of C as the most popularlanguage of implementation, it has been used in this book to extensively examinedata structures.This Book is Meant for...Keeping in mind the level of beginners, the book is written without any prerequisites.It is an ideal textbook for students of various courses in Computer Science at thediploma, polytechnic, undergraduate and postgraduate levels, and also for newprogrammers who wish to know about the usage of different data structures in theirproject.Student Friend ly Approach...Students will gain a good appreciation of the subject as this book has a clear displayof syntax and abundant programming examples. To simplify concepts, the data struc-tures are implemented using C language, in a step-by-step manner.

內(nèi)容概要

有關(guān)數(shù)據(jù)結(jié)構(gòu)的教材很多，而本書是一本非常有特點(diǎn)的教材，每章先簡(jiǎn)要介紹本章的主要內(nèi)容，給出基本的知識(shí)背景，然后使用大量的示例、表格、插圖和流程圖來闡述各種概念和知識(shí)，方便了讀者的理解，同時(shí)給出了大量的源代碼，幫助讀者實(shí)現(xiàn)實(shí)際的數(shù)據(jù)結(jié)構(gòu)，每章后面提供了復(fù)習(xí)題、多項(xiàng)選擇題和編程練習(xí)題，有助于讀者鞏固所學(xué)知識(shí)的理解，是一本非常理想的數(shù)據(jù)結(jié)構(gòu)教材。    每章先簡(jiǎn)要介紹本章的主要內(nèi)容，給出基本的知識(shí)背景。    使用了大量的已求解示例、表格、插圖和流程圖，大大方便了讀者的理解。    給出了大量的源代碼，幫助讀者實(shí)現(xiàn)實(shí)際的數(shù)據(jù)結(jié)構(gòu)，從而提供程序的可靠性。    每章后面提供了復(fù)習(xí)題、多項(xiàng)選擇題和編程練習(xí)題，有助于鞏固所學(xué)知識(shí)的理解。    通過概念和編程示例來闡述每種數(shù)據(jù)結(jié)構(gòu)的應(yīng)用。

作者簡(jiǎn)介

作者：(印象)克里斯哈拉莫斯(R Krishnamoorthy) (印象)庫(kù)瑪納維爾(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.

書籍目錄

Preface1. Data Structures—An Overview   1.1 Introduction   1.2 Data Types   1.3 Program Modules   1.4 Control Structures   1.5 Looping Structures   1.6 Arrays   1.7 Structures   1.8 Pointers   1.9 Recursion  Review Yourself  Multiple Choice Questions   Programming Exercises 2. Strings and Character Manipulation   2.1 Introduction   2.2 Primitive Functions or Operations on Strings   2.3 Representation of Strings   2.4 String Manipulation in C   2.5 String Manipulation Applications   Review Yourself   Multiple Choice Questions   Programming Exercises 3. Stacks  3.1 Introduction   3.2 Definition   3.3 Primitive Operations   3.4 An abstract Data Type (ADT)   3.5 Implementation   3.6 Applications of Stack   Review Yourself   Multiple Choice Questions   Programming Exercises 4. Queues    4.1 Introduction  4.2 Definition   4.3 Operations on a Queue   4.4 ADT for Queues   4.5 Representation of Queue   4.6 Various Other Queue Structures   4.7 Applications   Review Yourself   Multiple Choice Questions   Programming Exercises 5. Linked Lists    5.1 Introduction  5.2 Definition   5.3 ADT for Linked List   5.4 Singly Linked List  5.5 Doubly Linked List  5.6 Circular Linked Lists   5.7 Sparse Matrices  5.8 Applications   5.9 Additional Programs   Review Yourself   Multiple Choice Questions   Programming Exercises 6. Trees   6.1 Introduction   6.2 Definition   6.3 Terminologies Used   6.4 Binary Tree   6.5 Threaded Binary Trees   6.6 Heap Trees   6.7 Deaps   6.8 Huffman Algorithm   6.9 Decision Trees   6.10 Game Tree   6.11 Applications    Review Yourself   Multiple Choice Questions   Programming Exercises 7. Graphs8. Sorting 9. Searching10. Search Trees11. File Structures  Index

章節(jié)摘錄

插圖：

編輯推薦

《數(shù)據(jù)結(jié)構(gòu)(C語言版)》：大學(xué)計(jì)算機(jī)教育國(guó)外著名教材系列(影印版)

圖書封面

圖書標(biāo)簽Tags

無

評(píng)論、評(píng)分、閱讀與下載

---

    數(shù)據(jù)結(jié)構(gòu) PDF格式下載

---