Principles of Data Structures Using C and C++

About the Book: Principles of DATA STRUCTURES using C and C++ covers all the fundamental topics to give a better understanding about the subject. The study of data structures is essential to every one who comes across with computer science. This book is written in accordance with the revised syllabu...

Full description

Saved in:
Bibliographic Details
Main Author: Das, Vinu V
Format: eBook
Language:English
Published: Daryaganj New Age International Ltd 2006
Edition:1
Subjects:
C (Computer program language)
Data structures (Computer science)
ISBN:8122418589, 9788122418583
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract About the Book: Principles of DATA STRUCTURES using C and C++ covers all the fundamental topics to give a better understanding about the subject. The study of data structures is essential to every one who comes across with computer science. This book is written in accordance with the revised syllabus for B.Tech./B.E. (both Computer Science and Electronics branches) and MCA. students of Kerala University, MG University, Calicut University, CUSAT Cochin (deemed) University. NIT Calicut (deemed) University, Anna University, UP Technical University, Amritha Viswa (deemed) Vidyapeeth, Karunya (deemed) University and Rajasthan Vidyapeeth (deemed) University. Moreover, this book covers almost all the topics of the other Indian and International Universities where this subject is there in their undergraduate and graduate programs. All effort is made to discuss the topics in the simplest possible way without loosing its qualities. Contents: Programming Methodologies Memory Management The Stack The Queue Linked List Sorting Techniques Searching and Hashing The Trees Graphs.
AbstractList About the Book: Principles of DATA STRUCTURES using C and C++ covers all the fundamental topics to give a better understanding about the subject. The study of data structures is essential to every one who comes across with computer science. This book is written in accordance with the revised syllabus for B.Tech./B.E. (both Computer Science and Electronics branches) and MCA. students of Kerala University, MG University, Calicut University, CUSAT Cochin (deemed) University. NIT Calicut (deemed) University, Anna University, UP Technical University, Amritha Viswa (deemed) Vidyapeeth, Karunya (deemed) University and Rajasthan Vidyapeeth (deemed) University. Moreover, this book covers almost all the topics of the other Indian and International Universities where this subject is there in their undergraduate and graduate programs. All effort is made to discuss the topics in the simplest possible way without loosing its qualities. Contents: Programming Methodologies Memory Management The Stack The Queue Linked List Sorting Techniques Searching and Hashing The Trees Graphs.
Author Das, Vinu V
Author_xml – sequence: 1
  fullname: Das, Vinu V
BookMark eNotjMtOwzAQRY14iLb0H7xiU0WyPXZiLyG0gFQJJB7bapyMUSCyS5z8P5Ho3Ryds7hLdhFTpDO2tFIprWyp3flJpDXWXbGFBm1LMEJcs3XO32JeWYHTasGK16GLTXfsKfMU-AOOyN_GYWrGaZjTR-7iF685xpbXm80NuwzYZ1qfuGKfu-17_VTsXx6f67t9geCEhqIij8ahDV5X1KoAZMg4aKUM5dysqIxFiSJ454Unr5sWfFOZEERArQhW7Pb_-Dik34nyeCCf0k9DcRywP2zva62VBIA_5vlFYA
ContentType eBook
DEWEY 001.64
005.133
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 8122428649
9788122428643
Edition 1
ExternalDocumentID EBC442133
GroupedDBID 089
A4J
AABBV
ABARN
ABIAV
ABMRC
ABQPQ
ACLGV
ADVEM
AERYV
AFOJC
AHWGJ
AJFER
AKHYG
ALMA_UNASSIGNED_HOLDINGS
AZZ
BBABE
CZZ
EBSCA
GEOUK
HF4
MYL
PQQKQ
ID FETCH-LOGICAL-a39043-7eba59a8fb47ed2f3e5e593d11f6fb480758a1a0fb9b0beb4cd3bc75ff0fa42e3
ISBN 8122418589
9788122418583
IngestDate Wed Dec 10 10:00:29 EST 2025
IsPeerReviewed false
IsScholarly false
LCCallNum_Ident QA76.9.D35 D37 2006
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-a39043-7eba59a8fb47ed2f3e5e593d11f6fb480758a1a0fb9b0beb4cd3bc75ff0fa42e3
OCLC 434863500
PQID EBC442133
PageCount 375
ParticipantIDs proquest_ebookcentral_EBC442133
PublicationCentury 2000
PublicationDate 2006
PublicationDateYYYYMMDD 2006-01-01
PublicationDate_xml – year: 2006
  text: 2006
PublicationDecade 2000
PublicationPlace Daryaganj
PublicationPlace_xml – name: Daryaganj
PublicationYear 2006
Publisher New Age International Ltd
Publisher_xml – name: New Age International Ltd
SSID ssj0000673942
Score 1.8057326
Snippet About the Book: Principles of DATA STRUCTURES using C and C++ covers all the fundamental topics to give a better understanding about the subject. The study of...
SourceID proquest
SourceType Publisher
SubjectTerms C (Computer program language)
Data structures (Computer science)
TableOfContents Cover -- Preface -- Acknowledgement -- Contents -- Chapter 1 Programming Methodologies -- 1.1 An Introduction to data Structure -- 1.2 Algorithm -- 1.3 Stepwise Refinement Techniques -- 1.4 Modular Programming -- 1.5 Top-Down Algorithm Design -- 1.6 Bottom-Up Algorithm Design -- 1.7 Structured Programming -- 1.8 Analysis of Algorithm -- 1.9 Time-Space Trade off -- 1.10 Big "OH" Notation -- 1.11 Limitation of Big "OH" Notation -- 1.12 Classification of Data Structure -- 1.13. Arrays -- 1.14. Vectors -- 1.15. Lists -- 1.16. Files and Records -- 1.17 Characteristics of Strings -- Self Review Questions -- Chapter 2 Memory Management -- 2.1 Memory Allocation in C -- 2.2 Dynamic Memory Allocation in C++ -- 2.3 Free Storage List -- 2.4 Garbage Collection -- 2.5 Dangling Reference -- 2.6 Reference Counters -- 2.7 Storage Compaction -- 2.8 Boundary Tag Method -- Self Review Questions -- Chapter 3 The Stack -- 3.1 Operations Performed on Stack -- 3.2 Stack Implementation -- 3.3 Stack Using Arrays -- 3.4 Applications of Stacks -- 3.5 Converting Infix to Postfix Expression -- 3.6 Evaluating Postfix Expression -- Self Review Questions -- Chapter 4 The Queues -- 4.1 Algorithm for Queue Operations -- 4.2 Other Queues -- 4.3 Circular Queue -- 4.4. Deques -- 4.5 Applications of Queue -- Self Review Questions -- Chapter 5 Linked List -- 5.1. Linked Lists -- 5.2. Representation of Linked List -- 5.3 Advantages and Disadvantages -- 5.4 Operation on Linked List -- 5.5 Types of Linked List -- 5.6 Singly Linked List -- 5.7 Stack Using Linked List -- 5.8 Queue Using Linked List -- 5.9 Queue Using Two Stacks -- 5.10 Polynomials Using Linked List -- 5.11 Doubly Linked List -- 5.12 Circular Linked List -- 5.13 Priority Queues -- Self Review Questions -- Chapter 6 Sorting Techniques -- 6.1 Complexity of Sorting Algorithms -- 6.2 Bubble Sort -- 6.3 Selection Sort
6.4 Insertion Sort -- 6.5 Shell Sort -- 6.6 Quick Sort -- 6.7 Merge Sort -- 6.8 Radix Sort -- 6.9. Heap -- 6.10 External Sort -- Self Review Questions -- Chapter 7 Searching and Hashing -- 7.1 Linear or Sequential Searching -- 7.2 Binary Search -- 7.3 Interpolation Search -- 7.4 Fibonacci Search -- 7.5. Hashing -- Self Review Questions -- Chapter 8 The Trees -- 8.1 Basic Terminologies -- 8.2 Binary Trees -- 8.3 Binary Tree Representation -- 8.4 Operations on Binary Tree -- 8.5 Traversing Binary Trees Recursively -- 8.6 Traversing Binary Tree Non-Recursively -- 8.7 Binary Search Trees -- 8.8 Threaded Binary Tree -- 8.9 Expression Tree -- 8.10 Decision Tree -- 8.11 Fibanocci Tree -- 8.12 Selection Trees -- 8.13 Balanced Binary Trees -- 8.14 AVL Trees -- 8.15 M-Way Search Trees -- 8.16. 2-3 Trees -- 8.17. 2-3-4 Trees -- 8.18. Red-Black Tree -- 8.19. B-Tree -- 8.20 Splay Trees -- 8.21 Digital Search Trees -- 8.21. Tries -- Self Review Questions -- Chapter 9 Graphs -- 9.1 Basic Terminologies -- 9.2 Representation of Graph -- 9.3 Operations on Graph -- 9.4 Breadth First Search -- 9.5 Depth First Search -- 9.6 Minimum Spanning Tree -- 9.7 Shortest Path -- Self Review Questions -- Bibliography -- Index
Title Principles of Data Structures Using C and C++
URI https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=442133
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3NS8MwFA-6efDkN36bg3oZgbbpR3J0dSooc4cpu42kSWSXbrpN9uf7knYtTEQ8CCU0j5CS99qkee-X90Po0hjmxVx5RFGtSMiZJvAVMZLB8gQVA6-Ny67_lHS7bDDgvZKwa-roBJI8Z4sFn_yrqUEGxrZHZ_9g7qpTEMA9GB1KMDuUK3_EVbWweG_pN3fojFsxEzbmPHcxgmmrwAYUUM30KmjDVXupC0r0UT4vMa8_uQEsGvLmTa_4EWtkULFfZC6OxqKCO2Yl0XSnnYZhAHvW68k7sbRcNnxdcpSso_Ukhgmked95fnmsnFiW5YY7d0jVMy-yGtVP-rbIuZW7v42a2h7n2EFrOt9FW0sSC1zOaXuI1GrDY4Ot2nCtNuzUhlMMasNpq7WPXu86_fSBlBwSRFBukQWJliLighkZJloFhupIR5wq3zcxyGwuZiZ84RnJpSe1DDNFZZZExnhGhIGmB6iRj3N9iDBNjGJRpJXPeCipEpkXm4AZalvHMTtCF8uRDl2ou8TXDivNHv_a4gRt1tY9RQ0Yrz5DG9nnbDT9OC_1_wUYQAZt
linkProvider ProQuest Ebooks
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Principles+of+Data+Structures+Using+C+and+C%2B%2B&rft.au=Das%2C+Vinu+V&rft.date=2006-01-01&rft.pub=New+Age+International+Ltd&rft.isbn=9788122418583&rft.externalDocID=EBC442133
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9788122418583/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9788122418583/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9788122418583/sc.gif&client=summon&freeimage=true