Learning Resource and Development
Amazon cover image
Image from Amazon.com
Image from Coce

Data structures and algorithms / Shubham Gupta.

By: Material type: TextTextPublisher: Burlington, Ontario : Toronto Academic Press, 2024Edition: First editionDescription: xv, 223 pages : illustrations ; 25 cmContent type:
  • text
Media type:
  • unmediated
Carrier type:
  • volume
ISBN:
  • 9781774697665
Subject(s): DDC classification:
  • 23 005.73 G959d
LOC classification:
  • QA76.9.D35 G878 2024
Contents:
1. Fundamentals of data structures and algorithms -- 1.1 Issues solved by algorithms -- 1.2 Data structures -- 1.3 Algorithms like a technology -- 1.4 Algorithms and other technologies -- 1.5 Analyzing data structures and algorithms -- 2. Classification of algorithms -- 2.1 Deterministic and randomized algorithms -- 2.2 Online vs. Offline algorithms -- 2.3 Exact, approximate, heuristic, and operational algorithms -- 2.4 Classification according to main concept -- 3. Analysis of arrays and sets -- 3.1 Array: the foundational data structure -- 3.2 Efficiency affected in sets by single rule -- 4. Algorithm selection -- 4.1 Ordered arrays -- 4.2 Searching an ordered array -- 4.3 Binary search -- 4.4 Binary search vs. Linear search -- 5. Stacks and queues -- 5.1 Understanding stacks -- 5.2 Queues -- 5.3 Priority queues -- 6. Trees -- 6.1 Tree terminology -- 6.2 Tree analogy in computer -- 6.3 Basic binary tree operations -- 6.4 Finding a node -- 6.5 Inserting a node -- 6.6 Deleting a node -- 6.7 Traversing tree -- 6.8 The efficiency of binary tree -- 7. Search algorithms in data structures -- 7.1 Unordered linear search -- 7.2 Ordered linear search -- 7.3 Chunk search -- 7.4 Binary search -- 7.5 Searching in graphs -- 7.6 Graph Grep -- 7.7 Searching in trees -- 7.8 Searching in temporal probabilistic object data model -- 8. Governance of algorithms in data structures -- 8.1 Analytical framework -- 8.2 Governance options by risks -- 8.3 Limitations of algorithmic governance options.
Summary: "This book, written by Shubham Gupta, is an in-depth resource on data structures and algorithms, crucial elements in computer science for managing and processing data efficiently. It covers fundamental concepts, including arrays, linked lists, stacks, queues, trees, and various algorithms essential for solving computational problems. The book explains the temporal complexity of data operations and details the selection and governance of algorithms. Aimed at students and scholars, it serves as a comprehensive guide to understanding and applying data structures and algorithms in designing efficient software systems. Gupta, a seasoned software engineer, provides insights drawn from his extensive experience in software development."
Tags from this library: No tags from this library for this title. Log in to add tags.
Holdings
Item type Current library Shelving location Call number Copy number Status Date due Barcode
Books Books Main Library Circulation Section CIR 005.73 G959d 2024 (Browse shelf(Opens below)) 1-1 Available 030714

Includes bibliographical references and index.

1. Fundamentals of data structures and algorithms -- 1.1 Issues solved by algorithms -- 1.2 Data structures -- 1.3 Algorithms like a technology -- 1.4 Algorithms and other technologies -- 1.5 Analyzing data structures and algorithms -- 2. Classification of algorithms -- 2.1 Deterministic and randomized algorithms -- 2.2 Online vs. Offline algorithms -- 2.3 Exact, approximate, heuristic, and operational algorithms -- 2.4 Classification according to main concept -- 3. Analysis of arrays and sets -- 3.1 Array: the foundational data structure -- 3.2 Efficiency affected in sets by single rule -- 4. Algorithm selection -- 4.1 Ordered arrays -- 4.2 Searching an ordered array -- 4.3 Binary search -- 4.4 Binary search vs. Linear search -- 5. Stacks and queues -- 5.1 Understanding stacks -- 5.2 Queues -- 5.3 Priority queues -- 6. Trees -- 6.1 Tree terminology -- 6.2 Tree analogy in computer -- 6.3 Basic binary tree operations -- 6.4 Finding a node -- 6.5 Inserting a node -- 6.6 Deleting a node -- 6.7 Traversing tree -- 6.8 The efficiency of binary tree -- 7. Search algorithms in data structures -- 7.1 Unordered linear search -- 7.2 Ordered linear search -- 7.3 Chunk search -- 7.4 Binary search -- 7.5 Searching in graphs -- 7.6 Graph Grep -- 7.7 Searching in trees -- 7.8 Searching in temporal probabilistic object data model -- 8. Governance of algorithms in data structures -- 8.1 Analytical framework -- 8.2 Governance options by risks -- 8.3 Limitations of algorithmic governance options.

"This book, written by Shubham Gupta, is an in-depth resource on data structures and algorithms, crucial elements in computer science for managing and processing data efficiently. It covers fundamental concepts, including arrays, linked lists, stacks, queues, trees, and various algorithms essential for solving computational problems. The book explains the temporal complexity of data operations and details the selection and governance of algorithms. Aimed at students and scholars, it serves as a comprehensive guide to understanding and applying data structures and algorithms in designing efficient software systems. Gupta, a seasoned software engineer, provides insights drawn from his extensive experience in software development."

There are no comments on this title.

to post a comment.