<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <nonSort>A </nonSort>
    <title>textbook of data structures and algorithms 1</title>
    <subTitle>mastering linear data structures</subTitle>
  </titleInfo>
  <name type="personal">
    <namePart>Pai, G A Vijayalakshmi</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
    <role>
      <roleTerm type="text">author.</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">nju</placeTerm>
    </place>
    <dateIssued encoding="marc">2022</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent> xiv, 266 pages : illustrations ; 24 cm.</extent>
  </physicalDescription>
  <abstract>Data structures and algorithms is a fundamental course in Computer Science, which enables learners across any discipline to develop the much-needed foundation of efficient programming, leading to better problem solving in their respective disciplines. A Textbook of Data Structures and Algorithms is a textbook that can be used as course material in classrooms, or as self-learning material. The book targets novice learners aspiring to acquire advanced knowledge of the topic. Therefore, the content of the book has been pragmatically structured across three volumes and kept comprehensive enough to help them in their progression from novice to expert. With this in mind, the book details concepts, techniques and applications pertaining to data structures and algorithms, independent of any programming language. It includes 181 illustrative problems and 276 review questions to reinforce a theoretical understanding and presents a suggestive list of 108 programming assignments to aid in the implementation of the methods covered</abstract>
  <tableOfContents>Introduction -- Analysis of algorithms -- Arrays -- Stacks -- Queues -- Linked lists -- Linked stacks and linked queues.</tableOfContents>
  <note type="statement of responsibility">G A Vijayalakshmi Pai.</note>
  <note>Includes bibliographical references and index.</note>
  <subject authority="lcsh">
    <topic>Data structures (Computer science)</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Computer algorithms</topic>
  </subject>
  <classification authority="lcc">QA76.9.D35</classification>
  <classification authority="ddc" edition="23">005.73 P152t</classification>
  <identifier type="isbn">9781786308696</identifier>
  <identifier type="lccn">2022945771</identifier>
  <recordInfo>
    <recordContentSource authority="marcorg">DLC</recordContentSource>
    <recordCreationDate encoding="marc">220903</recordCreationDate>
    <recordChangeDate encoding="iso8601">20250327131018.0</recordChangeDate>
    <recordIdentifier source="CSPC">22776790</recordIdentifier>
    <languageOfCataloging>
      <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
    </languageOfCataloging>
  </recordInfo>
</mods>
