Normal view MARC view ISBD view

Fundamentals of data structure in C (Record no. 14615)

MARC details
000 -LEADER
fixed length control field	09731nam a22002177a 4500
005 - DATE & TIME
control field	20260323135019.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field	260323b \|\|\|\|\|\|\|\| \|\|\|\| 00\| 0 eng d
020 ## - ISBN
International Standard Book Number	9788173716058
Price	495.00
040 ## - CATALOGING SOURCE
Original cataloging agency	S.X.U.K
041 ## - Language
Language	English
082 ## - DDC NUMBER
Classification number	R 005.73 HOR(FUN)Ed2
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name	Horowitz, Ellis
245 ## - TITLE STATEMENT
Title	Fundamentals of data structure in C
Statement of responsibility	Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed
250 ## - EDITION STATEMENT
Edition statement	2nd ed.
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc	Kolkata
Name of publisher, distributor, etc	University press
Date of publication, distribution, etc	2023
300 ## - PHYSICAL DESCRIPTION
Pages	xvii,617p.
Other Details	P.B.
500 ## - GENERAL NOTE
General note	<br/>CHAPTER 1 BASIC CONCEPTS<br/>1.1 Overview: System Life Cycle<br/>1.2 Pointers and Dynamic Memory Allocation<br/> 1.2.1 Pointers<br/>1.2.2 Dynamic Memory Allocation<br/>1.2.3 Pointers Can Be Dangerous<br/>1.3 Algorithm Specification<br/> 1.3.1 Introduction<br/>1.3.2 Recursive Algorithms<br/>1.4 Data Abstraction<br/>1.5 Performance Analysis<br/> 1.5.1 Space Complexity<br/>1.5.2 Time Complexity<br/>1.5.3 Asymptotic Notation<br/>1.5.4 Practical Complexities<br/>1.6 Performance Measurement<br/> 1.6.1 Clocking<br/> 1.6.2 Generating Test Data<br/>1.7 Referenes And Selected Readings<br/> <br/>CHAPTER 2 ARRAYS AND STRUCTURES<br/>2.1 Arrays<br/> 2.1.1 The Abstract Data Type<br/> 2.1.2 Arrays in C<br/>2.2 Dynamically Allocated Arrays<br/> 2.2.1 One-dimensional Arrays<br/> 2.2.2 Two-dimensional Arrays<br/>2.3 Structures and Unions<br/> 2.3.1 Strctures<br/> 2.3.2 Unions<br/> 2.3.3 Internal Representation of Structures<br/> 2.3.4 Self-referential Structures<br/>2.4 Polynomials<br/> 2.4.1 The Abstract Data Type<br/> 2.4.2 Polynomial Representation<br/> 2.4.3 Polynomial Addition<br/>2.5 Sparse Matrices<br/> 2.5.1 The Abstract Data Type<br/> 2.5.2 Sparse Matrix Representation<br/> 2.5.3 Transposing a Matrix<br/> 2.5.4 Matrix Multiplication<br/>2.6 Representation of Multidimensional Arrays<br/>2.7 Strings<br/> 2.7.1 The Abstract Data Type<br/> 2.7.2 Strings in C<br/> 2.7.3 Pattern Matching<br/>2.8 References and Selected Readings<br/>2.9 Additional Exercises<br/> <br/>CHAPTER 3 STACKS AND QUEUES<br/>3.1 Stacks<br/>3.2 Stacks Using Dynamic Arrays<br/>3.3 Queues<br/>3.4 Circular Queues Using Dynamic Arrays<br/>3.5 A Mazing Problem<br/>3.6 Evaluation of Expressions<br/> 3.6.1 Expressions<br/> 3.6.2 Evaluating Postfix Expressions<br/>3.7 Multiple Stacks and Queues<br/><br/>3.7 Additional Exercises<br/> <br/>CHAPTER 4 LINKED LISTS<br/>4.1 Singly Linked Lists and Chains<br/>4.2 Representing Chains in C<br/>4.3 Linked Stacks and Queues<br/>4.4 Polynomials<br/> 4.4.1 Polynomial Representation<br/> 4.4.2 Adding Polynomials<br/> 4.4.3 Erasing Polynomials<br/> 4.4.4 Circular List Representation of Polynomials<br/> 4.4.5 Summary<br/>4.5 Additional List Operations<br/> 4.5.1 Operations for Chains<br/> 4.5.2 Operations for Circularly Linked Lists<br/>4.6 Equivalence Classes<br/>4.7 Sparse Matrices<br/> 4.7.1 Sparse Matrix Representation<br/> 4.7.2 Sparse Matrix Input<br/> 4.7.3 Sparse Matrix Output<br/> 4.7.4 Erasing a Sparse Matrix<br/>4.8 Doubly Linked Lists<br/> <br/>CHAPTER 5 TREES<br/>5.1 Introduction<br/> 5.1.1 Terminology<br/> 5.1.2 Representation of Trees<br/>5.2 Binary Trees<br/> 5.2.1 The Abstract Data Type<br/> 5.2.2 Properties of Binary Trees<br/> 5.2.3 Binary Tree Representations<br/>5.3 Binary Tree Traversals<br/> <br/>5.3.1 Inorder Traversal<br/><br/> 5.3.2 Preorder Traversal<br/> 5.3.3Postorder Traversal<br/> 5.3.4 Iterative Inorder Traversal<br/> 5.3.5 Level-Order Traversal<br/> 5.3.6 Traversal Without a Stack<br/>5.4 Additional Binary Tree Operations<br/> 5.4.1 Copying Binary Trees<br/> 5.4.2 Testing Equality<br/> 5.4.3 The Satisfiability Problem<br/>5.5 Threaded Binary Trees<br/> 5.5.1 Threads<br/> 5.5.2 Inorder Traversal of a Threaded Binary Tree<br/> 5.5.3 Inserting a Node into a Threaded Binary Tree<br/>5.6 Heaps<br/> 5.6.1 Priority Ques<br/> 5.6.2 Definition of a Max Heap<br/> 5.6.3 Insertion into a Max Heap<br/> 5.6.4 Deletion from a Max Heap<br/>5.7 Binary Search Trees<br/> 5.7.1 Definition<br/> 5.7.2 Searching a Binary Search Tree<br/> 5.7.3 Insertion into a Binary Search Tree<br/> 5.7.4 Deletion from a Binary Search Tree<br/> 5.7.5 Joining and Splitting Binary Search Trees<br/> 5.7.6 Height of a Binary Search Tree<br/>5.8 Selection Trees<br/> <br/>5.8.1 Introduction<br/><br/><br/> 5.8.2 Winner Trees<br/> 5.8.3 Loser Trees<br/>5.9 Forests<br/><br/> 5.9.1 Transforming a Forest into a Binary Tree<br/> 5.9.2 Forest Traversals<br/>5.10 Representation of Disjoint Sets<br/> <br/>5.10.1 Introduction<br/><br/> 5.10.2 Union and find Operations<br/> 5.10.3 Application to Equivalence Classes<br/>5.11 Counting Binary Trees<br/> 5.11.1 Distinct Binary Trees<br/> 5.11.2 Stack Permutations<br/> 5.11.3 Matrix Multiplication<br/> 5.11.4 Number of Distinct Binary Trees<br/>5.12 References and Selected Readings<br/> <br/>CHAPTER 6 GRAPHS<br/>6.1 The Graph Abstract Data Type<br/> 6.1.1 Introduction<br/> 6.1.2 Definitions<br/> 6.1.3 Graph Representations<br/>6.2 Elementary Graph Operations<br/> 6.2.1 Depth First Search<br/> 6.2.2 Breadth First Search<br/> 6.2.3 Connected Components<br/> 6.2.4 Spanning Trees<br/> 6.2.5 Biconnected Components<br/>6.3 Minimum Cost Spanning Trees<br/> 6.3.1 Kruskal’s Algorithm<br/> 6.3.2 Prim’s Algorithm<br/> 6.3.3 Sollin’s Algorithm<br/>6.4 Shortest Paths and Transitive Closure<br/> 6.4.1 Single Source/All Destination: Nonnegative Edge Costs<br/> 6.4.2 Single Source/all Destination: General Weights<br/> 6.4.3 All Pairs Shortest Paths<br/> 6.4.4 Transitive Closure<br/>6.5 Activity Networks<br/> 6.5.1 Activity-on-Vertex (AOV) Networks<br/> 6.5.2 Activity-on-Edge (AOE) Networks<br/>6.6 References and Selected Readings<br/>6.7 Additional Exercises<br/> <br/>CHAPTER 7 SORTING<br/>7.1 Motivation<br/>7.2 Insertion Sort<br/>7.3 Quick Sort<br/>7.4 How Fast Can We Sort?<br/>7.5 Merge Sort<br/> 7.5.1 Merging<br/> 7.5.2 Interative Merge Sort<br/> 7.5.3 Recursive Merge Sort<br/>7.6 Heap Sort<br/>7.7 Sorting on Several Keys<br/>7.8 List and Table Sorts<br/>7.9 Summary of Internal Sorting<br/>7.10 External Sorting<br/> 7.10.1 Introduction<br/> 7.10.2 k-way Merging<br/> 7.10.3 Buffer Handling for Parallel Operation<br/> 7.10.4 Run Generation<br/> 7.10.5 Optimal Merging of Runs<br/>7.11 References and Selected Readings<br/> <br/>CHAPTER 8 HASHING<br/>8.1 Introduction<br/><br/>8.2 Static Hashing<br/> 8.2.1 Hash Tables<br/> 8.2.2 Hash Functions<br/> 8.2.3 Overflow Handling<br/> 8.2.4 Theoretical Evaluation of Overflow Techniques<br/>8.3 Dynamic Hashing<br/> 8.3.1 Motivation for Dynamic Hashing<br/> 8.3.2 Dynamic Hashing using Directories<br/> 8.3.3 Directoryless Dynamic Hashing<br/>8.4 Bloom Filters<br/> 8.4.1 An Application--Differential Files<br/> 8.4.2 Bloom Filter Design<br/>8.5 References and selected Readings<br/> <br/>CHAPTER 9 PRIORITY QUEUES<br/>9.1 Single- and Double-Ended Priority Queues<br/>9.2 Leftist Trees<br/> 9.2.1 Height-Biased Leftist Trees<br/> 9.2.2 Weight-Biased Leftist Trees<br/>9.3 Binomial Heaps<br/> 9.3.1 Cost Amortization<br/> 9.3.2 Definition of Binomial Heaps<br/> 9.3.3 Insertion into a Binomial Heap<br/> 9.3.4 Melding Two Binomial Heaps<br/> 9.3.5 Deletion of Min Element<br/> 9.3.6 Analysis<br/>9.4 Fibonacci Heaps<br/> 9.4.1 Definition<br/> 9.4.2 Deletion from an f-heap<br/> 9.4.3 Decrease Key<br/> 9.4.4 Cascading Cut<br/> 9.4.5 Analysis<br/> 9.4.6 Application to The Shortest Paths Problem<br/>9.5 Pairing Heaps<br/> 9.5.1 Definition<br/> 9.5.2 Meld and Insert<br/> 9.5.3 Decrease Key<br/> 9.5.4 Delete Min<br/> 9.5.5 Arbitrary Delete<br/> 9.5.6 Implementation Considerations<br/> 9.5.7 Complexity<br/>9.6 Symmetric Min-Max Heaps<br/> 9.6.1 Definition and Properties<br/> 9.6.2 SMMH Representation<br/> 9.6.3 Inserting into an SMMH<br/> 9.6.4 Deleting from an SMMH<br/>9.7 Interval Heaps<br/> 9.7.1 Definition and Properties<br/> 9.7.2 Inserting into an Interval Heap<br/> 9.7.3 Deleting the Min Element<br/> 9.7.4 Initializing an Interval Heap<br/> 9.7.5 Complexity of Interval Heap Operations<br/> 9.7.6 The Complementary Range Search Problem<br/>9.8 References and Selected Readings<br/> <br/>CHAPTER 10 EFFICIENT BINARY SEARCH TREES<br/>10.1 Optimal Binary Search Trees<br/>10.2 AVL Trees<br/>10.3 Red-Black Trees<br/> 10.3.1 Definition<br/> 10.3.2 Representation of a Red-Black Tree<br/> 10.3.3 Searching a Red-Black Tree<br/> 10.3.4 Inserting to a Red-Black Tree<br/> 10.3.5 Deletion from a Red-Black Tree<br/> 10.3.6 Joining Red-Black Trees<br/> 10.3.7 Splitting a Red-Black Tree<br/>10.4 Splay Trees<br/> 10.4.1 Bottom-Up Splay Trees<br/> 10.4.2 Top-Down Splay Trees<br/>10.5 References and Selected Readings<br/> <br/>CHAPTER 11 MULTIWAY SEARCH TREES<br/>11.1 m-way Search Trees<br/> 11.1.1 Definition and Properties<br/> 11.1.2 Searching an m-way Search Tree<br/>11.2 B-Trees<br/> 11.2.1 Definition and Properties<br/> 11.2.2 Number of Elements in a B-Tree<br/> 11.2.3 Insertion into a B-tree<br/> 11.2.4 Deletion from a B-tree<br/>11.3 B-Trees<br/> 11.3.1 Definition<br/> 11.3.2 Searching a B____________Tree<br/> 11.3.3 Insertion into a B____________Tree<br/> 11.3.4 Deletion from a B____________Tree<br/>11.4 References and Selected Readings<br/> <br/>CHAPTER 12 DIGITAL SEARCH STRUCTURES<br/>12.1 Digital Search Trees<br/> <br/>12.1.1 Definition<br/><br/> 12.1.2 Search, Insert and Delete<br/>12.2 Binary Tries and Patricia<br/> 12.2.1 Binary Tries<br/> 12.2.2 Compressed Binary Tries<br/> 12.2.3 Patricia<br/>12.3 Multiway Tries<br/> 12.3.1 Definition<br/> 12.3.2 Searching a Trie<br/> 12.3.3 Sampling Strategies<br/> 12.3.4 Insertion into a Trie<br/> 12.3.5 Deletion from a Trie<br/> 12.3.6 Keys with Different Length<br/> 12.3.7 Height of a Trie<br/> 12.3.8 Space Required and Alternative Node Structures<br/> 12.3.9 Prefix Search and Applications<br/> 12.3.10 Compressed Tries<br/> 12.3.11 Compressed Tries with Skip Fields<br/> 12.3.12 Compressed Tries with Labeled Edges<br/> 12.3.13 Space Required by a Compressed Trie<br/>12.4 Suffix Trees<br/> 12.4.1 Have you Seen this String?<br/> 12.4.2 The Suffix Tree Data Structure<br/> 12.4.3 Let’s Find That Substring (Searching a Suffix Tree)<br/> 12.4.4 Other Nifty Things You Can Do with a Suffix Tree<br/>12.5 Tries and Internet Packet Forwarding<br/> 12.5.1 IP Routing<br/> 12.5.2 I-Bit Tries<br/> 12.5.3 Fixed-Stride Tries<br/> 12.5.4 Variable-Stride Tries<br/>12.6 References and Selected Readings<br/>
650 ## - Subject
Subject	C Programming language
700 ## - Added Entry Personal Name
Relator Code	auth.
Added Entry Personal Name	Sahni, Ellis
--	Anderson-Freed, Susan
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type	B.Tech Reference

Holdings
Source of classification or shelving scheme	Not for loan	Koha collection	Location (home branch)	Sublocation or collection (holding branch)	Shelving location	Date acquired	Source of acquisition	Cost, normal purchase price	Serial Enumeration / chronology	Koha full call number	Barcode (Accession No.)	Koha date last seen	Copy Number	Price effective from	Koha item type
Dewey Decimal Classification	Not For Loan	Reference	St. Xavier's Univeristy B.Tech Library	St. Xavier's Univeristy B.Tech Library	Reference Section	03/23/2026	Any Book Supply	495.00	S.X.U.K	R 005.73 HOR(FUN)Ed2	UT724	03/23/2026	724	03/23/2026	B.Tech Reference
Dewey Decimal Classification			St. Xavier's Univeristy B.Tech Library	St. Xavier's Univeristy B.Tech Library	Lending Section	03/23/2026	Any Book Supply	495.00	S.X.U.K	005.73 HOR(FUN)Ed2	T725	03/23/2026	725	03/23/2026	B.Tech
Dewey Decimal Classification			St. Xavier's Univeristy B.Tech Library	St. Xavier's Univeristy B.Tech Library	Lending Section	03/23/2026	Any Book Supply	495.00	S.X.U.K	005.73 HOR(FUN)Ed2.C1	T726	03/23/2026	726	03/23/2026	B.Tech
Dewey Decimal Classification			St. Xavier's Univeristy B.Tech Library	St. Xavier's Univeristy B.Tech Library	Lending Section	03/23/2026	Any Book Supply	495.00	S.X.U.K	005.73 HOR(FUN)Ed2.C2	T727	03/23/2026	727	03/23/2026	B.Tech
Dewey Decimal Classification			St. Xavier's Univeristy B.Tech Library	St. Xavier's Univeristy B.Tech Library	Lending Section	03/23/2026	Any Book Supply	495.00	S.X.U.K	005.73 HOR(FUN)Ed2.C3	T728	03/23/2026	728	03/23/2026	B.Tech
Dewey Decimal Classification			St. Xavier's Univeristy B.Tech Library	St. Xavier's Univeristy B.Tech Library	Lending Section	03/23/2026	Any Book Supply	495.00	S.X.U.K	005.73 HOR(FUN)Ed2.C4	T729	03/23/2026	729	03/23/2026	B.Tech
Dewey Decimal Classification			St. Xavier's Univeristy B.Tech Library	St. Xavier's Univeristy B.Tech Library	Lending Section	03/23/2026	Any Book Supply	495.00	S.X.U.K	005.73 HOR(FUN)Ed2.C5	T730	03/23/2026	730	03/23/2026	B.Tech
Dewey Decimal Classification			St. Xavier's Univeristy B.Tech Library	St. Xavier's Univeristy B.Tech Library	Lending Section	03/23/2026	Any Book Supply	495.00	S.X.U.K	005.73 HOR(FUN)Ed2.C6	T731	03/23/2026	731	03/23/2026	B.Tech
Dewey Decimal Classification			St. Xavier's Univeristy B.Tech Library	St. Xavier's Univeristy B.Tech Library	Lending Section	03/23/2026	Any Book Supply	495.00	S.X.U.K	005.73 HOR(FUN)Ed2.C7	T732	03/23/2026	732	03/23/2026	B.Tech
Dewey Decimal Classification			St. Xavier's Univeristy B.Tech Library	St. Xavier's Univeristy B.Tech Library	Reference Section	03/23/2026	Any Book Supply	495.00	S.X.U.K	005.73 HOR(FUN)Ed2.C8	T733	03/23/2026	733	03/23/2026	B.Tech