Normal view MARC view ISBD view

Fundamentals of Data Structures in C:/ (Record no. 10042)

MARC details
000 -LEADER
fixed length control field	11115nam a22001937a 4500
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field	250624b \|\|\|\|\|\|\|\| \|\|\|\| 00\| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number	978-81-7371-605-8
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Edition number	23
Classification number	005.133
Item number	HOR
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name	Horowitz, Ellis
245 ## - TITLE STATEMENT
Title	Fundamentals of Data Structures in C:/
Statement of responsibility, etc.	Ellis Horowitz, Sartaj Sahni & Susan Anderson-Freed
250 ## - EDITION STATEMENT
Edition statement	2nd ed.
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc.	Hyderabad:
Name of publisher, distributor, etc.	Universities Press,
Date of publication, distribution, etc.	2023.
300 ## - PHYSICAL DESCRIPTION
Extent	xvii, 617p. : ill. ;
Other physical details	Softbound,
Dimensions	17.5*23.5 cm.
505 ## - FORMATTED CONTENTS NOTE
FORMATTED CONTENTS NOTE	CHAPTER 1 BASIC CONCEPTS.................................... 1<br/> 1.1 Overview: System Life Cycle........................... 1<br/> 1.2 Algorithm Specification............................... 4<br/> 1.2.1 Introduction................................... 4<br/> 1.2.2 Recursive Algorithms........................... 10<br/> 1.3 Data Abstraction...................................... 14<br/> 1.4 Performance Analysis.................................. 18<br/> 1.4.1 Space Complexity............................... 19<br/> 1.4.2 Time Complexity................................ 21<br/> 1.4.3 Asymptotic Notation............................ 30<br/> 1.4.4 Comparing Time Complexities.................... 37<br/> 1.5 Performance Measurement............................... 40<br/> 1.6 References and Selected Readings...................... 46<br/>CHAPTER 2 ARRAYS AND STRUCTURES........................... 47<br/> 2.1 The Array as an Abstract Data Type.................... 47<br/> 2.2 The Polynomial Abstract Data Type..................... 51<br/> 2.3 The Sparse Matrix Abstract Data Type.................. 59<br/> 2.3.1 Introduction................................... 59<br/> 2.3.2 Transposing a Matrix........................... 61<br/> 2.3.3 Matrix Multiplication......................... 65<br/> 2.4 The Representation of Multidimensional Arrays......... 71<br/> 2.5 The String Abstract Data Type......................... 75<br/> 2.5.1 Introduction................................... 75<br/> 2.5.2 Pattern Matching............................... 80<br/> 2.6 Structures and Unions................................. 86<br/> 2.6.0 Structures.................................... 86<br/> 2.6.1 Unions........................................ 89<br/> 2.6.1 Internal Implementation of Structures 90<br/> 2.6.1 Self-Referential Structures................... 90<br/> 2.7 References and Selected Readings...................... 92<br/> 2.8 Additional Exercises.................................. 92<br/>CHAPTER 3 STACKS AND QUEUES............................... 99<br/> 3.1 The Stack Abstract Data Type.......................... 99<br/> 3.2 The Queue Abstract Data Type.......................... 103<br/> 3.3 A Mazing Problem...................................... 110<br/> 3.4 Evaluation of Expressions............................. 116<br/> 3.4.1 Introduction................................... 116<br/> 3.4.2 Evaluatng Postfix Expressions.................. 117<br/> 3.4.3 Infix to Postfix............................... 120<br/> 3.5 Multiple Stacks and Queues............................ 127<br/> 3.6 Selected Readings and References...................... 130<br/> 3.7 Additional Exercises.................................. 131<br/>CHAPTER 4 LINKED LISTS.................................... 134<br/> 4.1 Pointers.............................................. 134<br/> 4.1.1 Pointer Can Be Dangerous....................... 136<br/> 4.1.2 Using Dynamically Allocated Storage............ 137<br/> 4.2 Singly Linked Lists................................... 138<br/> 4.3 Dynamically Linked Stacks and Queues.................. 146<br/> 4.4 Polynomials........................................... 150<br/> 4.4.1 Representing Polynomials as Singly Linked Lists 150<br/> 4.4.2 Adding Polynomials............................. 151<br/> 4.4.3 Erasing Polynomials............................ 155<br/> 4.4.4 Polynomials as Circularly Linked Lists......... 156<br/> 4.4.5 Summary........................................ 161<br/> 4.5 Additional List Operations............................ 162<br/> 4.5.1 Operations for Singly Linked Lists............. 162<br/> 4.5.2 Operations for Doubly Linked Lists............. 164<br/> 4.6 Equivalence Relations................................. 165<br/> 4.7 Sparse Matrices....................................... 171<br/> 4.8 Doubly Linked Lists................................... 179<br/> 4.9 References and Selected Readings...................... 182<br/>4.10 Additional Exercises.................................. 183<br/>CHAPTER 5 TREES........................................... 186<br/> 5.1 Introduction.......................................... 186<br/> 5.1.1 Terminology.................................... 186<br/> 5.1.2 Representation of Trees........................ 189<br/> 5.2 Binary Trees.......................................... 191<br/> 5.2.1 The Abstract Data Type......................... 191<br/> 5.2.2 Properties of Binary Trees..................... 193<br/> 5.2.3 Binary Tree Representations.................... 196<br/> 5.3 Binary Tree Traversals................................ 200<br/> 5.4 Additional Binary Tree Operations..................... 206<br/> 5.5 Threaded Binary Trees................................. 212<br/> 5.6 Heaps................................................. 218<br/> 5.6.1 The Heap Abstract Data Type.................... 219<br/> 5.6.2 Priority Queues................................ 220<br/> 5.6.3 Insertion into a max heap...................... 222<br/> 5.6.4 Deletion from a max heap....................... 223<br/> 5.7 Binary Search Trees................................... 227<br/> 5.7.1 Introduction................................... 227<br/> 5.7.2 Searching a Binary Search Tree................. 228<br/> 5.7.3 Inserting an Element into a Binary Search Tree 229<br/> 5.7.4 Deleting an Element from a Binary Search Tree 230<br/> 5.7.5 Height of a Binary Search Tree................. 232<br/> 5.8 Forests............................................... 234<br/> 5.8.1 Transforming a Forest into a Binary Search Tree 234<br/> 5.8.2 Forest Traversals.............................. 235<br/> 5.9 Set Representation.................................... 236<br/> 5.9.1 Union and Find Operations...................... 237<br/> 5.9.2 Equivalence Relations.......................... 245<br/> 5.10 Counting Binary Trees................................. 245<br/> 5.11 References and Selected Readings...................... 252<br/> 5.12 Additional Exercises.................................. 252<br/>CHAPTER 6 GRAPHS.......................................... 255<br/> 6.1 The Graph Abstract Data Type.......................... 255<br/> 6.1.1 Introduction................................... 255<br/> 6.1.2 Definitions.................................... 257<br/> 6.1.3 Graph Representations.......................... 262<br/> 6.2 Elementary Graph Operations........................... 270<br/> 6.2.1 Depth First Search............................. 270<br/> 6.2.2 Breadth First Search........................... 271<br/> 6.2.3 Connected Components........................... 273<br/> 6.2.4 Spanning Trees 274<br/> 6.2.4 Biconnected Components, Articulation Points 274<br/> 6.3 Minimum Cost Spanning Trees........................... 280<br/> 6.4 Shortest Paths and Transitive Closure................. 289<br/> 6.4.1 Single Source All Destination.................. 290<br/> 6.4.2 All Pairs Shortest Paths....................... 292<br/> 6.4.3 Transitive Closure............................. 296<br/> 6.5 Activity Networks..................................... 300<br/> 6.5.1 Activity on Vertex (AOV) Networks.............. 300<br/> 6.5.2 Activity on Edge (AOE) Networks................ 306<br/> 6.6 References and Selected Readings...................... 314<br/> 6.7 Additional Exercises.................................. 315<br/>CHAPTER 7 SORTING......................................... 317<br/> 7.1 Searching and List Verification....................... 317<br/> 7.1.1 Introduction................................... 317<br/> 7.1.2 Sequential Search.............................. 336<br/> 7.1.3 Binary Search.................................. 336<br/> 7.1.4 List Verification.............................. 336<br/> 7.2 Definitions........................................... 408<br/> 7.3 Insertion Sort........................................ 408<br/> 7.4 Quick Sort............................................ 410<br/> 7.5 Optimal Sorting Time.................................. 414<br/> 7.6 Merge Sort............................................ 416<br/> 7.6.1 Introduction................................... 336<br/> 7.6.2 Iterative Merge Sort........................... 336<br/> 7.6.3 Recursive Merge Sort........................... 336<br/> 7.7 Heap Sort............................................. 424<br/> 7.8 Radix Sort............................................ 426<br/> 7.9 List and Table Sorts.................................. 432<br/> 7.10 External Sorts........................................ 416<br/> 7.10.1 Run Generation................................. 336<br/> 7.10.2 External Merge Sort............................ 336<br/> 7.11 Summary............................................... 446<br/> 7.12 References and Selected Readings...................... 446<br/> 7.13 Additional Exercises.................................. 446<br/>CHAPTER 8 HASHING......................................... 493<br/> 8.1 Symbol Tables......................................... 493<br/> 8.2 Static Hashing........................................ 495<br/> 8.2.1 Hash Tables.................................... 495<br/> 8.2.2 Hashing Functions.............................. 497<br/> 8.2.3 Linear Open Addressing......................... 501<br/> 8.2.4 Chaining....................................... 508<br/> 8.2.5 Theoretical Evaluation of Overflow Techniques 508<br/> 8.3 Dynamic Hashing....................................... 509<br/> 8.3.1 Dynamic Hashing Using Directories.............. 509<br/> 8.3.2 Analysis of Directory Dynamic Hashing.......... 510<br/> 8.3.3 Directoryless Dynamic Hashing.................. 519<br/> 8.4 References and Selected Readings...................... 523<br/>CHAPTER 9 HEAP STRUCTURES................................. 528<br/> 9.1 Min-Max Heaps......................................... 528<br/> 9.2 Deaps................................................. 534<br/> 9.3 Leftist Trees......................................... 541<br/> 9.4 Fibonacci Heaps....................................... 547<br/> 9.5 References and Selected Readings...................... 631<br/>CHAPTER 10 SEARCH STRUCTURES.............................. 528<br/>10.1 Optimal Binary Search Trees........................... 566<br/>10.2 AVL Trees............................................. 572<br/>10.3 2-3 Trees............................................. 591<br/>10.4 2-3-4 Trees........................................... 599<br/>10.5 Red-Black Trees....................................... 611<br/>10.6 Splay Trees........................................... 618<br/>10.7 Digital Search Trees.................................. 625<br/>10.8 B-Trees............................................... 660<br/>10.9 Tries................................................. 680<br/>10.10 Differential Files.................................... 698<br/>10.11 References and Selected Readings...................... 631<br/>INDEX....................................................... 575
700 ## - ADDED ENTRY--PERSONAL NAME
Personal name	Sartaj Sahni
700 ## - ADDED ENTRY--PERSONAL NAME
Personal name	Susan Anderson-Freed
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme	Dewey Decimal Classification
Koha item type	Books

Holdings
Source of classification or shelving scheme	Collection code	Home library	Current library	Shelving location	Date acquired	Cost, normal purchase price	Full call number	Barcode	Date last seen	Copy number	Price effective from	Koha item type
Dewey Decimal Classification	Non-fiction	Tetso College Library	Tetso College Library	Computer Science	24/06/2025	298.00	005.133 HOR	15128	24/06/2025	1	24/06/2025	Books
Dewey Decimal Classification	Non-fiction	Tetso College Library	Tetso College Library	Computer Science	24/06/2025	298.00	005.133 HOR	15129	24/06/2025	2	24/06/2025	Books
Dewey Decimal Classification	Non-fiction	Tetso College Library	Tetso College Library	Computer Science	24/06/2025	298.00	005.133 HOR	15130	24/06/2025	3	24/06/2025	Books