Data structure with C (Record no. 3159)

MARC details
000 -LEADER
fixed length control field 05626nam a2200181 4500
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780070701984
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 0070701989
040 ## - CATALOGING SOURCE
Transcribing agency CUS
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.133
Item number LIP/D
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Lipschutz, Seymour
245 ## - TITLE STATEMENT
Title Data structure with C
Statement of responsibility, etc. Seymour Lipschutz
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc. New Delhi:
Name of publisher, distributor, etc. McGraw Hill,
Date of publication, distribution, etc. 2011.
300 ## - PHYSICAL DESCRIPTION
Extent xiii, 1.1 - 9.56 p.
505 ## - FORMATTED CONTENTS NOTE
Formatted contents note 1. INTRODUCTION AND OVERVIEW<br/>1.1 Introduction l.l<br/>1.2 Basic TenTiinoIogy;HElementary Data Organization LI<br/>1.3 Data Structures 1.3<br/>1.4 Data Structure Operations 1.9<br/>1.5 Abstract Data Types (ADT) 1.10<br/>1.6 Algorithms; Complexity, Time-Space Tradeoff 1.12<br/>Solved Problems 1.14<br/>Multiple Choice Questions 1.20<br/>Answers to Multiple Choice Questions 1.20<br/>2. PRELIMINARIES<br/>2.1 Introduction 2.1<br/>2.2 Math^atical Notations and Functions 2.2<br/>2.3 Algoriilihiic Notations 2.6<br/>2.4 Control Structures 2.9<br/>2.5 Complexity of Algorithms 2.15<br/>2.6 Other Asymptotic Notations for Complexity of Algorithms Q, 0, O 2.19<br/>2.7 Subalgorithms 2.20<br/>2.8 Variables, Data Types 2.22<br/>Solved Problems 2.25<br/>Supplementary Problems 2.35<br/>Programming Problems 2.36<br/>Multiple Choice Questions 2.37<br/>Answers to Multiple Choice Questions 2.37<br/>3. STRING PROCESSING<br/>3.1 Introduction 3.1<br/>3.2 Basic Terminology 3.1<br/>3.3 Storing Strings 3.2<br/>3.4 Character Data Type 3.6<br/>3.5 Strings as ADT 3.7<br/>3.6 String Operations 3.8<br/>3.7 Word/Text Processing 3.13<br/>3.8 Pattern Matching Algorithms 3.20<br/>Solved Problems 3.28<br/>Supplementary Problems 3.39<br/>Programming Problems 3.40<br/>Multiple Choice Questions 3.41<br/>Answers to Multiple Choice Questions 3.42<br/>4. ARRAYS, RECORDS AND POINTERS<br/>4.1 Introduction 4.1<br/>4.2 Linear Arrays 4.2<br/>4.3 Arrays as ADT 4.4<br/>4.4 Representation of Linear Arrays in Memory 4.6<br/>4.5 Traversing Linear Arrays 4.8<br/>4.6 Inserting and Deleting 4.10<br/>4.7 Sorting: Bubble Sort 4.15<br/>4.8 Searching; Linear Search 4.19<br/>4.9 Binary Search 4.22<br/>4.10 Multidimensional Arrays 4.27<br/>4.11 Representation of Polynomials Using Arrays 4.36<br/>4.12 Pointers; Pointer Arrays 4.40<br/>4.13 Dynamic Memory Management 4.47<br/>4.14 Records; Record Structures 4.49<br/>4.15 Representation of Records in Memory; Parallfel Arrays 4.52<br/>4.16 Matrices^ 4.54<br/>4.17 Sparse Matrices 4.60<br/>Solved Problems 4.65<br/>Supplementary Problems 4.80<br/>Programming Problems 4.81<br/>^ Mi^iple Choice Questions 4.85<br/>Answers to Multiple Choice Questions 4.85<br/>5. LINKED LISTS<br/>5.1 Introduction 5.1<br/>5.2 Linked Lists 5.2<br/>5.3 Representation of Linked Lists in Memory 5.4<br/>5.4 ^Traversing a Linked List 5.8<br/>5.5 Searching a Linked List 5.12<br/>5.6 Memory Allocation; Garbage Collection 5.17<br/>5.7 Insertion into a Linked List 5.22<br/>5.8 Deletion from a Linked List 5.32<br/>5.9 Header Linked Lists 5.38<br/>5.10 Circularly Linked Lists 5.47<br/>5.11 Two-way Lists (or Doubly Linked Lists) 5.52<br/>5.12 Josephus Problem and its Solution 5.63<br/>5.13 Buddy Systems 5.65<br/>Solved Problems 5.67<br/>Supplementary Problems 5.76<br/>Programming Problems 5.80<br/>Multiple Choice Questions 5.82<br/>Answers to Multiple Choice Questions 5.83<br/>6. STACKS, QUEUES, RECURSION<br/>6.1 Introduction 6.1<br/>6.2 Stacks 6.2<br/>6.3 Array Representation of Stacks 6.4<br/>6.4 Linked Representation of Stacks 6.8<br/>6.5 Stack as ADT 6.11<br/>6.6 Arithmetic Expressions; Polish Notation 6.J5<br/>6.7 Application of Stacks 6.25<br/>6.8 Recursion 6.33<br/>6.9 Towers of Hanoi 6.39<br/>6.10 Implementation of Recursive Procedures by Stacks 6.44<br/>6.11 Queues 6.50<br/>6.12 Linked Representation of Queues 6.57<br/>6.13 Queue as ADT 6.64<br/>6.14 Circular Queues 6.67<br/>6.15 Deques 6.78<br/>6.16 Priority Queues 6.79<br/>6.17 Applications of Queues 6.92<br/>Solved Problems 6.101<br/>Supplementary Problems 6.119<br/>Programming Problems 6.123<br/>Multiple Choice Questions 6.124<br/>Answers to Multiple Choice Questions 6.125<br/>7. TREES<br/>7.1 Introduction 7.1<br/>7.2 Binary Trees 7.1<br/>7.3 Representing Binary Trees in Memory 7.5<br/>7.4 Traversing Binary Trees 7.9<br/>7.5 Traversal Algorithms Using Stacks 7.12<br/>7.6 Header Nodes; Threads 7.23<br/>7.7 Threaded Binary Trees 7.27<br/>7.8 Binary Search Trees 7.28<br/>7.9 Searching and Inserting in Binary Search Trees 7.29<br/>7.10 Deleting in a Binary Search Tree 7.38<br/>7.11 Balanced Binary Trees 7.49<br/>7.12 AVL Search TREes 7.50<br/>7.13 Insejtion in an AVL Search Tree 7.51<br/>7.14 Deletion in an AVL Search Tree 7.57<br/>7.15 m-way Search Trees 7.61<br/>7.16 Searching. Insertion and Deletion in an m-way Search Tree 7.63<br/>7.17 B-Trees 7.66<br/>7.18 Searching, Insertion and Deletion in a B-tree 7.67<br/>7.19 B+-Trees 7.73<br/>7.20 Red-Black Trees 7.75<br/>7.21 Heap; Heapsort 7.90<br/>7.22 Path Lengths; Huffman's Algorithm 7.103<br/>7.23 General Trees 7.109<br/>7.24 Applications of Trees 7.112<br/>Solved Problems 7.114<br/>Supplementary Problems 7.132ยป<br/>Programming Problems 7.139<br/>Multiple Choice Questions 7.142<br/>Answers to Multiple Choice Questions 7.143<br/>8. GRAPHS AND THEIR APPLICATIONS<br/>8.1 Introduction 8.1<br/>8.2 Graph Theory Terminology 8.1<br/>8.3 Sequential Representation of Graphs; Adjacency Matrix; Path Matrix 8.5<br/>8.4 Warshall's Algorithm; Shortest Paths 8.9<br/>8.5 Linked Representation of a Graph 8.17<br/>8.6 Operations on Graphs 8.20<br/>8.7 Traversing a Graph 8.31<br/>8.8 Posets; Topological Sorting 8.40<br/>8.9 Spanning Trees 8.47<br/>Solved Problems 8.59<br/>Supplementary Problems 8.71<br/>Programming Problems 8.74<br/>Multiple Choice Questions 8.76<br/>Answers to Multiple Choice Questions 8.77<br/>9. SORTING AND SEARGHING<br/>9.1 Introduction 9.1<br/>9.2 Sorting 9.1<br/>9.3 Insertion Sort 9.6<br/>9.4 Selection Sort 9.10<br/>9.5 Merging 9.14<br/>9.6 Merge-Sort 9.19<br/>9.7 Shell Sort 9.31<br/>9.8 Radix Sort 9.34<br/>9.9 Searching and Data Modification 9.38<br/>9.10 Hashing 9.41<br/>Solved Problems 9.53<br/>Supplementary Problems 9.54<br/>Programming Problems 9.55<br/>Multiple Choice Questions 9.55<br/>Answers to Multiple Choice Questions 9.56
650 ## - SUBJECT
Keyword Programming language
650 ## - SUBJECT
Keyword Data structure with C
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type GN Books
Holdings
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 20/06/2016 005.133 LIP/D P33212 18/07/2022 16/06/2022 General Books
SIKKIM UNIVERSITY
University Portal | Contact Librarian | Library Portal

Powered by Koha