WELCOME TO BSDU - KNOWLEDGE RESOURCE CENTER


BHARTIYA SKILL DEVELOPMENT UNIVERSITY, JAIPUR
KNOWLEDGE RESOURCE CENTER (LIBRARY)
Online Public Access catalogue(OPAC)

“Library is a heart of an institution" ― Dr S. Radhakrishnan

“Never Stop Reading"

How to Think about Algorithms (Record no. 2490)

000 -LEADER
fixed length control field 02864nam a22002057a 4500
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20200224112635.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 200118b ||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 978-1-107-439887
028 ## - PUBLISHER NUMBER
Source Allied Informatics, Jaipur
Bill Number 7084
Bill Date 13/01/2020
Purchase Year 2019-20
040 ## - CATALOGING SOURCE
Original cataloging agency BSDU
Language of cataloging English
Transcribing agency BSDU
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 518.1
Item number EDM
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Edmonds,Jeff
245 ## - TITLE STATEMENT
Title How to Think about Algorithms
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. New Delhi
Name of publisher, distributor, etc. Cambridge University Press
Date of publication, distribution, etc. 2019
300 ## - PHYSICAL DESCRIPTION
Extent 448
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc. note This textbook, for second- or third-year students of computer science, presents insights, notations, and analogies to help them describe and think about algorithms like an expert, without grinding through lots of formal proof. Solutions to many problems are provided to let students check their progress, while class-tested PowerPoint slides are on the web for anyone running the course. By looking at both the big picture and easy step-by-step methods for developing algorithms, the author guides students around the common pitfalls. He stresses paradigms such as loop invariants and recursion to unify a huge range of algorithms into a few meta-algorithms. The book fosters a deeper understanding of how and why each algorithm works. These insights are presented in a careful and clear way, helping students to think abstractly and preparing them for creating their own innovative ways to solve problems.

Includes lots of exercises, with selected solutions in the text; PowerPoint slides for instructors available from the web
Presents the big picture and step-by-step methods for developing algorithms, while avoiding common pitfalls
Appendices give background on big-O notation, logic, asymptotics, and other mathematical tools

Part I. Iterative Algorithms and Loop Invariants:
1. Measures of progress and loop invariants
2. Examples using more of the input loop invariant
3. Abstract data types
4. Narrowing the search space: binary search
5. Iterative sorting algorithms
6. Euclid's GCD algorithm
7. The loop invariant for lower bounds
Part II. Recursion:
8. Abstractions, techniques, and theory
9. Some simple examples of recursive algorithms
10. Recursion on trees
11. Recursive images
12. Parsing with context-free grammars
Part III. Optimization Problems:
13. Definition of optimization problems
14. Graph search algorithms
15. Network flows and linear programming
16. Greedy algorithms
17. Recursive backtracking
18. Dynamic programming algorithms
19. Examples of dynamic programming
20. Reductions and NP-completeness
21. Randomized algorithms
Part IV. Appendix:
22. Existential and universal quantifiers
23. Time complexity
24. Logarithms and exponentials
25. Asymptotic growth
26. Adding made easy approximations
27. Recurrence relations
28. A formal proof of correctness
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Algorithms
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Koha item type Books
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Permanent Location Current Location Shelving location Date acquired Cost, normal purchase price Full call number Barcode Date last seen Cost, replacement price Price effective from Koha item type
          BSDU Knowledge Resource Center, Jaipur BSDU Knowledge Resource Center, Jaipur General Stacks 2020-01-18 795.00 518.1 EDM 018037 2020-02-12 795.00 2020-01-18 Books

2019. All rights reserved.
Implemented & Maintained by Total IT Software Solutions Pvt. Ltd.