TY - BOOK
AU - Zau, Ling
TI - Data structures and algorithm
SN - 9781680940442
AV - QA76.73 Z1 2016
PY - 2016///
CY - New York, NY
PB - Arcler Press LLC
KW - Data structures (Computer science)
KW - Computer algorithms
N1 - Includes index; Chapter 1: Introduction to data structures -- Concept of data type -- Definition of stacks -- Concept of queues -- Linked lists -- Binary trees -- Other data structures -- Algorithm complexity -- Computational complexity: intractable problems -- Definition of recursion -- Chapter 2: Arrays and pointers -- Declaration of array -- One dimensional and mutli-dimensional arrays -- Overview of pointers -- Array of pointers -- Chapter 3: Operation on array -- Representation of sparse matrices -- Sparse matrix storage formats -- Some program of operation on array -- Chapter 4: Linked list -- Classification of linked list -- Pointer -- Application of linked lists -- Operation on linked lists -- Doubly linked list -- Chapter5: Queues -- Implementation of queues -- Sequential representation of queue -- Linear queue -- Circular queue -- Operations of queue -- Applications of queues -- Chapter 6: Algorithms -- Sorting algorithms -- Numeric -- Chapter 7: Definition of searching -- Strings -- Counting the number of words in a string -- Index
N2 - "A data structure is a specialized format for organizing and storing data. General data structure types contain the array, the file, the record, the table, the tree, and so on. Any data structure is designed to organize data to suit a specific purpose so that it can be accessed and worked with in appropriate ways. In computer programming, a data structure may be selected or designed to store data for the purpose of working on it with various algorithms. This book offers a means to manage large amounts of data efficiently for uses such as large databases and internet indexing services. Typically, well-organized data structures are crucial to designing efficient algorithms."--Back cover
ER -