<?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>02981nam a22004215i 4500</leader>
  <controlfield tag="003">OSt</controlfield>
  <controlfield tag="005">20260630034700.0</controlfield>
  <controlfield tag="008">260622t20232014ii a          000 0 eng  </controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">9789354977190</subfield>
  </datafield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="z">9789354978586</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="c">AKCL</subfield>
  </datafield>
  <datafield tag="042" ind1=" " ind2=" ">
    <subfield code="a">pcc</subfield>
  </datafield>
  <datafield tag="082" ind1=" " ind2=" ">
    <subfield code="a">005.133</subfield>
    <subfield code="b">THA-D3</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
    <subfield code="a">Thareja, Reema</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
    <subfield code="e">author</subfield>
    <subfield code="4">aut</subfield>
    <subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield>
    <subfield code="0">http://id.loc.gov/authorities/names/no2009156400</subfield>
    <subfield code="1">http://id.loc.gov/rwo/agents/no2009156400</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Data Structures Using C /</subfield>
    <subfield code="c">Reema Thareja.</subfield>
  </datafield>
  <datafield tag="250" ind1=" " ind2=" ">
    <subfield code="a">Third edition.</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">New Delhi:</subfield>
    <subfield code="b">Oxford University Press,</subfield>
    <subfield code="c">2026</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
    <subfield code="a">New Delhi, India :</subfield>
    <subfield code="b">Oxford University Press,</subfield>
    <subfield code="c">2023.</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="4">
    <subfield code="c">&#xA9;2014</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">xiv, 536 pages</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="c">24 cm</subfield>
  </datafield>
  <datafield tag="336" ind1=" " ind2=" ">
    <subfield code="a">text</subfield>
    <subfield code="b">txt</subfield>
    <subfield code="2">rdacontent</subfield>
    <subfield code="0">http://id.loc.gov/vocabulary/contentTypes/txt</subfield>
  </datafield>
  <datafield tag="337" ind1=" " ind2=" ">
    <subfield code="a">unmediated</subfield>
    <subfield code="b">n</subfield>
    <subfield code="2">rdamedia</subfield>
    <subfield code="0">http://id.loc.gov/vocabulary/mediaTypes/n</subfield>
  </datafield>
  <datafield tag="338" ind1=" " ind2=" ">
    <subfield code="a">volume</subfield>
    <subfield code="b">nc</subfield>
    <subfield code="2">rdacarrier</subfield>
    <subfield code="0">http://id.loc.gov/vocabulary/carriers/nc</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">This third edition of Data Structures using C is a comprehensive textbook for undergraduate engineering students of computer science as well as postgraduate students of computer applications to understand the fundamental concepts of data structures and their implementation in C programming language. The book covers all the essential topics of data structures, including arrays, linked lists, stacks, queues, trees, and graphs, providing readers with a thorough understanding of each concept's strengths and limitations. With clear explanations and easy-to-follow code examples, this book is perfect for students and professionals seeking a solid foundation in data structures and their applications.

The book utilizes a systematic approach wherein the design of each of the data structures is followed by algorithms of different operations that can be performed on them, and the analysis of these algorithms in terms of their running times.

New to the Third Edition

Sections on best practices to be followed while writing a C program, need and selection of a data structure
Updated chapters to demonstrate real-world applications of data structures
Appendices on code optimization techniques and case studies
Practical implementation of the algorithms using tested C programs
Objective type questions to enhance the analytical ability of the students</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2=" ">
    <subfield code="a">Computer Science </subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2=" ">
    <subfield code="a">Computer Programming </subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2=" ">
    <subfield code="a">Software Development </subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2=" ">
    <subfield code="a">Computer Program</subfield>
  </datafield>
  <datafield tag="758" ind1=" " ind2=" ">
    <subfield code="1">http://id.loc.gov/resources/instances/in01260003428</subfield>
  </datafield>
  <datafield tag="758" ind1=" " ind2=" ">
    <subfield code="4">http://id.loc.gov/ontologies/bibframe/instanceOf</subfield>
    <subfield code="1">http://id.loc.gov/resources/works/in01260003428</subfield>
  </datafield>
  <datafield tag="884" ind1=" " ind2=" ">
    <subfield code="a">DLC bibframe2marc v3.2-dev</subfield>
    <subfield code="g">20260622</subfield>
    <subfield code="q">DLC</subfield>
    <subfield code="u">https://github.com/lcnetdev/bibframe2marc/tree/v3.2-dev</subfield>
  </datafield>
  <datafield tag="906" ind1=" " ind2=" ">
    <subfield code="a">0</subfield>
    <subfield code="b">ibc</subfield>
    <subfield code="c">orignew</subfield>
    <subfield code="d">2</subfield>
    <subfield code="e">epcn</subfield>
    <subfield code="f">20</subfield>
    <subfield code="g">y-gencatlg</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="c">BK</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="2">ddc</subfield>
    <subfield code="n">0</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">44956</subfield>
    <subfield code="d">44956</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">AKCL</subfield>
    <subfield code="b">AKCL</subfield>
    <subfield code="d">2026-06-30</subfield>
    <subfield code="g">780.00</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">005.133 THA-D3</subfield>
    <subfield code="p">69312</subfield>
    <subfield code="r">2026-06-30 03:47:31</subfield>
    <subfield code="v">750.00</subfield>
    <subfield code="w">2026-06-30</subfield>
    <subfield code="y">BK</subfield>
  </datafield>
</record>
