Foundations of algorithms using C++ pseudocode / Richard E. Neapolitan, Kumarss Naimipour.

By:

Neapolitan, Richard E

Contributor(s):

Naimipour, Kumarss

Material type: Text

TextPublication details: Sudbury, Mass. : Jones and Bartlett Publishers, c1998.Edition: 2nd edDescription: xv, 523 p. : ill. ; 25 cmISBN:

9780763706203

Subject(s):

DDC classification:

005.1 21

Summary: Foundations of Algorithms Using C++ Pseudocode offers a well-balanced presentation on designing algorithms, complexity analysis of algorithms, & computational complexity that is accessible to mainstream computer science students who have a background in college algebra & discrete structures. To support their approach, the authors present mathematical concepts using Standard English & a simpler notation than is found in most texts. A review of essential mathematical concepts is presented in three appendices. In addition, they reinforce the explanations with numerous concrete examples to help students grasp theoretical concepts.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Copy number	Status	Date due	Barcode
Books	Main library General Stacks	005.1 / NE.F 1998 (Browse shelf(Opens below))	1	Available		004213

Browsing Main library shelves, Shelving location: General Stacks Close shelf browser (Hides shelf browser)

Previous								Next
Previous	005.1 / MC.P 2008 The practical guide to defect prevention /	005.1 / MI.P 2009 Practical formal software engineering :	005.1 / NA.O 2004 Open Source .Net development /	005.1 / NE.F 1998 Foundations of algorithms using C++ pseudocode /	005.1 / NI.A 2006 Applying domain-driven design and patterns :	005.1 / PF.S 2006 Software engineering :	005.1 / PF.S 2006 Software engineering :	Next

Rev. ed. of: Foundations of algorithms. Lexington, Mass. : D.C. Heath, c1996.

Includes bibliographical references (p. 513-515) and index.

Foundations of Algorithms Using C++ Pseudocode offers a well-balanced presentation on designing algorithms, complexity analysis of algorithms, & computational complexity that is accessible to mainstream computer science students who have a background in college algebra & discrete structures. To support their approach, the authors present mathematical concepts using Standard English & a simpler notation than is found in most texts. A review of essential mathematical concepts is presented in three appendices. In addition, they reinforce the explanations with numerous concrete examples to help students grasp theoretical concepts.

There are no comments on this title.

to post a comment.