Local cover image
Local cover image
Amazon cover image
Image from Amazon.com

Data structures and algorithm / Prof. Ling Zau.

By: Material type: TextTextPublication details: New York, NY : Arcler Press LLC, c2016.Description: pages : illustrations ; 26 cmContent type:
  • text
Media type:
  • unmediated
Carrier type:
  • volume
ISBN:
  • 9781680940442
Subject(s): LOC classification:
  • QA76.73 Z1 2016
Contents:
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.
Summary: "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.
List(s) this item appears in: Print Books 2020
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Materials specified Status Notes Date due Barcode
Books Books Ladislao N. Diwa Memorial Library Reserve Section Non-fiction RUS QA76.73 Z1 2016 (Browse shelf(Opens below)) Room use only 76554 00076464

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.

"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.

Fund 164 SERV Enterprises Purchased 08/09/2018 76554 nej 5,596.00 2018-06-610 2018-1-0318

Click on an image to view it in the image viewer

Local cover image
Copyright © 2022. Cavite State University | Koha 22.05.00