Computer Algorithms, Introduction to Design and Analysis / Vishwajit k. barbudhe, Shraddha N. Zanjat, Bhavana S. Karmore

By:

Barbudhe, Vishwajit K

Contributor(s):

9786202528849

Subject(s):

Computer algorithms

DDC classification:

004 23

Review: "This edition features an increased emphasis on algorithm design techniques such as divide-and-conquer and greedy algorithms, along with the addition of new topics and exercises. It continues the tradition of solid mathematical analysis and clear writing style: emphasizes the development of algorithms through a step-by-step process rather than by merely presenting the end result; stresses the importance of the algorithm analysis process - continuously re-evaluating, modifying, and perhaps rejecting algorithms until a satisfactory solution is attained; provides extensive treatment of recursion with a clear, student-friendly review of how it works and why it is a valuable programming technique; uses a Java-like pseudocode; and includes an appendix with java examples."--BOOK JACKET.

List(s) this item appears in: Diploma in Computer Science

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Shelving location	Call number	URL	Copy number	Status	Notes	Date due	Barcode	Course reserves
BOOK GPS	FRANCIS LIGHT LIBRARY			Link to resource		Not for loan
ACADEMIC	FRANCIS LIGHT LIBRARY	SHELVES 1	004 BAR (Browse shelf(Opens below))		1	Available	DCS1353 (Data Structures and Algorithms)		00001383	Diploma in Computer Science

Browsing FRANCIS LIGHT LIBRARY shelves, Shelving location: SHELVES 1 Close shelf browser (Hides shelf browser)

								Next
	001.4 LEE Practical research : planning and design /	001.422 HAY Introduction to mediation, moderation, and conditional process analysis : a regression-based approach /	003.83 CAR Discrete-event system simulation.	004 BAR Computer Algorithms, Introduction to Design and Analysis /	004 INF Information Systems, Logistics, and Supply Chain : 6th International Conference, ILS 2016, Bordeaux, France, June 1-4, 2016, Revised Selected Papers /	004.01/51 FOR Discrete mathematics for computer science : an example-based introduction /	004.01/51 FOR Discrete mathematics for computer science : an example-based introduction /	Next

"This edition features an increased emphasis on algorithm design techniques such as divide-and-conquer and greedy algorithms, along with the addition of new topics and exercises. It continues the tradition of solid mathematical analysis and clear writing style: emphasizes the development of algorithms through a step-by-step process rather than by merely presenting the end result; stresses the importance of the algorithm analysis process - continuously re-evaluating, modifying, and perhaps rejecting algorithms until a satisfactory solution is attained; provides extensive treatment of recursion with a clear, student-friendly review of how it works and why it is a valuable programming technique; uses a Java-like pseudocode; and includes an appendix with java examples."--BOOK JACKET.

There are no comments on this title.

to post a comment.