<?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>The </nonSort>
    <title>art of computer programming</title>
    <subTitle>mathematical preliminaries redux; introduction to backtracking; dancing links</subTitle>
    <partNumber>volume 4, fascicle 5</partNumber>
  </titleInfo>
  <name type="personal">
    <namePart>Knuth, Donald E.</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">mau</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Boston</placeTerm>
    </place>
    <publisher>Addison-Wesley</publisher>
    <dateIssued>c2020</dateIssued>
    <dateIssued encoding="marc">2020</dateIssued>
    <copyrightDate encoding="marc">2019</copyrightDate>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>viii, 382 pages : illustrations ; 22 cm.</extent>
  </physicalDescription>
  <abstract>"This fascicle covers three separate topics: 1. Mathematical Preliminaries. Knuth writes that this portion of fascicle 5 "extends the 'Mathematical Preliminaries' of Section 1.2 in Volume 1 to things that I didn't know about in the 1960s. Most of this new material deals with probabilities and expectations of random events; there's also an introduction to the theory of martingales." 2. Backtracking: this section is the counterpart to section 7.2.1 which covered the generation of basic combinatorial patterns. This section covers non-basic patterns, ones where the developer needs to make tentative choices and then may need to backtrack when those choices need revision. 3. Dancing Links: this section is related to 2 above. It develops an important data structure technique that is suitable for backtrack programming described above"--</abstract>
  <note type="statement of responsibility">Donald E. Knuth.</note>
  <note>Includes index.</note>
  <note>CSE</note>
  <subject>
    <topic>Computer programming</topic>
  </subject>
  <subject>
    <topic>Computer algorithms</topic>
  </subject>
  <subject>
    <topic>Computer science</topic>
  </subject>
  <classification authority="ddc" edition="23">005.1</classification>
  <identifier type="isbn">9780134671796</identifier>
  <identifier type="isbn">9780134671791</identifier>
  <identifier type="lccn">2019946479</identifier>
  <location>
    <physicalLocation>Ayesha Abed Library</physicalLocation>
  </location>
  <recordInfo>
    <recordContentSource authority="marcorg">DLC</recordContentSource>
    <recordCreationDate encoding="marc">212701</recordCreationDate>
    <recordChangeDate encoding="iso8601">20211111150827.0</recordChangeDate>
    <recordIdentifier source="BD-DhAAL">37347</recordIdentifier>
    <languageOfCataloging>
      <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
    </languageOfCataloging>
  </recordInfo>
</mods>
