Data structures / (Record no. 3334)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 03724nam a2200157 4500 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9780070601680 (pb) |
| 040 ## - CATALOGING SOURCE | |
| Transcribing agency | CUS |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.73 |
| Item number | LIP/D |
| 100 ## - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Lipschutz, Seymour |
| 245 ## - TITLE STATEMENT | |
| Title | Data structures / |
| Statement of responsibility, etc. | Seymour Lipschutz and G.A Vijayalakshmi Pai |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication, distribution, etc. | New Delhi : |
| Name of publisher, distributor, etc. | Tata McGraw Hill , |
| Date of publication, distribution, etc. | 2006. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | xiv, (varied) |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 1. INTRODUCTION AND OVERVIEW<br/>1.1 Introduction<br/>1.2 Basic Terminology; Elementary Data Organization<br/>Data Structures<br/>E4 Data Structure Operations<br/>1,5 Algorithms: Complexity, Time-Space Tradeoff<br/>Solved Problems<br/>2. PRELIMINARIES<br/>2.1 Introduction<br/>2.2 Mathematical Notation and Functions<br/>2.3 Algorithmic Notation<br/>2.4 Control Structures<br/>2.5 Complexity of Algorithms<br/>2.6 Other Asymptotic Notations for Complexity of Algorithms Q, 0, o<br/>2.7 Subalgorithms<br/>2.8 Variables, Data Types<br/>Solved Problems<br/>Supplementary Problems.<br/>Programming Problems<br/>3. STRING PROCESSING<br/>3.1 Introduction<br/>3.2 Basic Terminology<br/>3.3 Storing Strings<br/>3.4 Character Data Type<br/>3.5 String Operations<br/>3.6 Word Processing<br/>3.7 Pattern Matching Algorithms<br/>Solved Problems<br/>Supplementary Problems<br/>Programming Problems<br/>4. ARRAYS, RECORDS AND POINTERS<br/>4.1 Introduction<br/>4.2 Linear Arrays<br/>4.3 Representation of Linear Arrays in Memory<br/>4.4 Traversing Linear Arrays<br/>^ Inserting and Deleting<br/>AJb Sorting; Bubble Sort<br/>^ Searching; Linear Search<br/>^8' Binary Search<br/>4.9 Multidimensional Arrays<br/>^.10 Pointers; Pointer Arrays<br/>4.11 Records; Record Structures<br/>4.12 Representation of Records in Memory; Parallel Arrays<br/>>kT3 Matrices<br/>4.14 Sparse Matrices<br/>Solved Problems<br/>Supplementary Problems<br/>Programming Problems<br/>5. LINKED LISTS<br/>5.1 Introduction<br/>5.2 Linked Lists<br/>5.3 Representation of Linked Lists in Memory<br/>5.4 Traversing a Linked List<br/>5.5 Searching a Linked List<br/>5.6 Memory Allocation; Garbage Collection<br/>5.7 Insertion into a Linke,d List<br/>5.8 Deletion from a Linked List<br/>5.9 Header Linked Lists<br/>5.10 Two-way Lists<br/>Solved Problems<br/>Supplementary Problems.<br/>Programming Problems<br/>6. STACKS, QUEUES, RECURSION<br/>6.1 Introduction<br/>Stacks<br/>Array Representation of Stacks<br/>6.4 Linked Representation of Stacks<br/>6.5 Arithmetic Expressions; Polish Notation<br/>^6j6^Quicksort, an Application of Stacks<br/>• 6.7 Recursion<br/>6.8 Towers of Hanoi<br/>6.9 Implementation of Recursive Procedures by Stacks<br/>6.10 Queues<br/>6.11 Linked Representation of Queues<br/>6.12 Deques<br/>6.13 Priority Queues .,<br/>Solved Problems<br/>Supplementary Problems.<br/>Programming Problems<br/>7. TREES<br/>7.1 Introduction.<br/>12 Binary Trees<br/>7.3 Representing Binary Trees in Memory<br/>7.4 Traversing Binary Trees<br/>7.5 Traversal Algorithms using Stacks<br/>7.6 Header Nodes; Threads<br/>7.7 Binary Search Trees<br/>7.8 Searching and Inserting in Binary Search Trees<br/>7.9 Deleting in a Binary Search Tree<br/>7.10 AVL Search Trees<br/>7.11 Insertion in an AVL Search Tree<br/>7.12 Deletion in an AVL Search Tree<br/>7.13 m-way Search Trees,<br/>7.14 Searching, Insertion and Deletion in an m-way Search Tree<br/>7.15 B Trees<br/>7.16 Searching, Insertion and Deletion in a B-tree<br/>7.17 Heap; Heapsort..<br/>7.18 Path Lengtiis; Huffman's Algorithm<br/>7.19 General Trees<br/>Solved Problems<br/>Supplementary Problems<br/>Programming Problems<br/>8. GRAPHS AND THEIR APPLICAnONS<br/>8.1 Introduction<br/>8.2 Graph Theory Terminology<br/>8.3 Sequential Representation of Graphs; Adjacency Matrix; Path Matrix<br/>8.4 Warshall's Algorithm; Shortest Paths<br/>8.5 Linked Representation of a Graph<br/>8.6 Operations on Graphs<br/>8.7 Traversing a Graph<br/>8.8 Posets; Topological Sorting<br/>Solved Problems<br/>Supplementary Problems<br/>Programming Problems<br/>9. SORTING AND SEARCHING<br/>9.1 Introduction<br/>9.2 Sorting<br/>9.3 Insertion Sort<br/>9.4 Selection Sort<br/>9.5 Merging<br/>9.6 Merge-Sort,<br/>9.7 Radix Sort<br/>9.8 Searching and Data Modification<br/>9.9 Hashing<br/>Supplementary Problems, |
| 650 ## - SUBJECT | |
| Keyword | Computer Programming |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | GN Books |
| Withdrawn status | Lost status | Damaged status | Not for loan | Home library | Current library | Shelving location | Date acquired | Full call number | Accession number | Date last seen | Date last checked out | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Central Library, Sikkim University | Central Library, Sikkim University | General Book Section | 21/06/2016 | 005.73 LIP/D | P33384 | 28/09/2022 | 12/09/2022 | General Books |