<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>03238nam a2200301 i 4500</leader>
  <controlfield tag="003">CSPC</controlfield>
  <controlfield tag="005">20251120163027.0</controlfield>
  <controlfield tag="008">251104s2024    onca     b    001 0 eng d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">9781774697665</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="a">CSPC</subfield>
    <subfield code="b">eng</subfield>
    <subfield code="c">CSPC</subfield>
    <subfield code="e">rda</subfield>
  </datafield>
  <datafield tag="050" ind1="0" ind2="0">
    <subfield code="a">QA76.9.D35</subfield>
    <subfield code="b">G878 2024 </subfield>
  </datafield>
  <datafield tag="082" ind1="0" ind2="0">
    <subfield code="2">23</subfield>
    <subfield code="a">005.73</subfield>
    <subfield code="b">G959d</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
    <subfield code="a">Gupta, Shubham,</subfield>
    <subfield code="e">author.</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Data structures and algorithms /</subfield>
    <subfield code="c">Shubham Gupta.</subfield>
  </datafield>
  <datafield tag="250" ind1=" " ind2=" ">
    <subfield code="a">First edition.</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
    <subfield code="a">Burlington, Ontario :</subfield>
    <subfield code="b">Toronto Academic Press,</subfield>
    <subfield code="c">2024.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">xv, 223 pages :</subfield>
    <subfield code="b">illustrations ;</subfield>
    <subfield code="c">25 cm.</subfield>
  </datafield>
  <datafield tag="336" ind1=" " ind2=" ">
    <subfield code="2">rdacontent</subfield>
    <subfield code="a">text</subfield>
  </datafield>
  <datafield tag="337" ind1=" " ind2=" ">
    <subfield code="2">rdamedia</subfield>
    <subfield code="a">unmediated</subfield>
  </datafield>
  <datafield tag="338" ind1=" " ind2=" ">
    <subfield code="2">rdacarrier</subfield>
    <subfield code="a">volume</subfield>
  </datafield>
  <datafield tag="504" ind1=" " ind2=" ">
    <subfield code="a">Includes bibliographical references and index.</subfield>
  </datafield>
  <datafield tag="505" ind1="0" ind2=" ">
    <subfield code="a">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.</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">"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."</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Algorithms.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Data structures (Computer science).</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="2">ddc</subfield>
    <subfield code="n">0</subfield>
    <subfield code="c">BK</subfield>
    <subfield code="e">23</subfield>
    <subfield code="h">005.73</subfield>
    <subfield code="i">G959d</subfield>
    <subfield code="k">CIR</subfield>
    <subfield code="m">2024</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="2">ddc</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="a">CSPC</subfield>
    <subfield code="b">CSPC</subfield>
    <subfield code="c">CIR</subfield>
    <subfield code="d">2025-11-04</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">CIR 005.73 G959d 2024</subfield>
    <subfield code="p">030714</subfield>
    <subfield code="r">2025-11-04 17:10:01</subfield>
    <subfield code="t">1-1</subfield>
    <subfield code="w">2025-11-04</subfield>
    <subfield code="y">BK</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">30833</subfield>
    <subfield code="d">30833</subfield>
  </datafield>
</record>
