<?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>
    <title>Computer Algorithms/ C++ (Included Design and Analysis of Algorithms Laboratory Manual Semister IV of Computer Science Engineering, VTU)</title>
    <subTitle>:Effective from Academic Year 2016-2017 by K Santhi Sree</subTitle>
  </titleInfo>
  <name type="personal">
    <namePart>Ellis Horowitz, Sartaj Sahni,  &amp; Sanguthevar Rajasekaran</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">ii</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Hyderabad</placeTerm>
    </place>
    <publisher>Universities Press (India) Private Limited</publisher>
    <dateIssued>2017</dateIssued>
    <edition>2nd ed.</edition>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>xxi, I-11 (Manual 41)</extent>
  </physicalDescription>
  <abstract>this is the thoroughly revised and updated edition of the text that helped establish computer algorithms as a discipline of computer Science. Using the popular object-oriented language C++, the text incorporates the latest research and state-of-the-art applications, bringing this classic to the forefront of modern computer Science education. A major strength of this text is its focus on design techniques rather than on individual algorithms.
 The second edition of computer algorithms/c++ emphasizes:


Design techniques: divide and conquer, the greedy method, dynamic programming, Backtracking, and branch and bound are illustrated with several examples. Each algorithm is completely analysed.
The latest research: a thorough treatment of probabilistic and parallel algorithms is included.
full integration of randomized algorithms: performance with nonrandomized algorithms is thoroughly compared.

computer algorithms/C++ is appropriate as a core text for upper- and graduate-level courses in algorithms.</abstract>
  <subject>
    <topic>Computer Algorithms C++  I Design and Analysis of Algorithms Laboratory Manual I Computer Science</topic>
  </subject>
  <classification authority="ddc">005.131 HOR</classification>
  <identifier type="isbn">9789386235145</identifier>
  <recordInfo>
    <recordContentSource authority="marcorg"/>
    <recordCreationDate encoding="marc">230822</recordCreationDate>
    <recordChangeDate encoding="iso8601">20230901111827.0</recordChangeDate>
  </recordInfo>
</mods>
