Important features like greedy algorithm, dynamic algorithm, string matching algorithm, branch and bound algorithm, NP hard and NP complete problems are suitably highlighted.

Solved and frequently asked questions in the various competitive examinations, sample papers of the past examinations are provided which will serve as a useful reference source.

Description
The book has been written in such a way that the concepts and working of algorithms are explained in detail, with adequate examples. To make clarity on the topic, diagrams, calculation of complexity, algorithms are given extensively throughout. Many examples are provided which are helpful in understanding the algorithms by various strategies. This content is user-focused and has been highly updated including algorithms and their real-world examples.

What You Will Learn

Algorithm & Algorithmic Strategy, Complexity of Algorithms

Divide-and-Conquer, Greedy, Backtracking, String-Matching Algorithm

Dynamic Programming, P and NP Problems

Graph Theory, Complexity of Algorithms

Who This Book is For
The book would serve as an extremely useful text for BCA, MCA, M. Sc. (Computer Science), PGDCA, BE (Information Technology) and B. Tech. and M. Tech. students.

Table of Contents
1. Algorithm & Algorithmic Strategy
2. Complexity of Algorithms
3. Divide-and-Conquer Algorithms
4. Greedy Algorithm
5. Dynamic Programming
6. Graph Theory
7. Backtracking Algorithms
8. Complexity of Algorithms
9. String-Matching Algorithms
10. P and NP Problems

About the Author
Shefali Singhal is working as an Assistant professor in Computer science and Engineering department, Manav Rachna International University. She has completed her MTech. form YMCA University in Computer Engineering. Her research interest includes Programming Languages, Computer Network, Data mining, and Theory of computation.

Neha Garg is working as an Assistant professor in in Computer science and Engineering department, Manav Rachna International University. She has completed her MTech. Form Banasthali University, Rajasthan in Information Technology. Her research interest includes Programming Languages, Data Structure, Operating System, Database Management Systems.

Rese�a del editor

Book has been written in such a way that the concepts and working of algorithms are explained in detail, with adequate examples. To make clarity on the topic, diagrams, calculation of complexity, algorithms are given extensively throughout. Many examples are provided which are helpful in understanding the algorithms by various strategies. This content is user-focused and has been highly updated including algorithms and their real-world examples. Key features � This book is specially designed for beginners and explains all aspects of algorithm and its analysis in a simple and systematic manner. � Algorithms and their working are explained in detail with the help of several illustrative examples. � Important features like greedy algorithm, dynamic algorithm, string matching algorithm, branch and bound algorithm, NP hard and NP complete problems are suitably highlighted. � Solved and frequently asked questions in the various competitive examinations, sample papers of the past examinations are provided which will serve as a useful reference source. Contents � Algorithm & Algorithmic Strategy � Complexity of Algorithms � Divide-and-Conquer Algorithms � Greedy Algorithm � Dynamic Programming � Graph Theory � Backtracking Algorithms � Branch and Bound Algorithms � String-Matching Algorithms � P and NP Problems

��ber diesen Titel� kann sich auf eine andere Ausgabe dieses Titels beziehen.

Anbieterinformationen

ThriftBooks is a fully independent seller of used books, having sold more than 160 million used and new books since we started in 2003. Each quality used book is sorted, graded, shelved and shipped by hand by our team of dedicated employees in our seven warehouses across the US. We have the best selection of books, in the right condition and format, at everyday low prices. We also have a dedicated, US-based Customer Service team, ranked in the top three by Newsweek for Best Customer Service in 2018 and 2019, so you can shop with confidence. We support and invest in our employees, appreciate and value our customers, and truly believe in the power of the written word to educate, energize, and engage readers of all ages and interests.

Zur Homepage des Verk�ufers

Unternehmensdaten des Verk�ufers

Thrift Books Global, LLC
18300 Cascade Ave S, Ste 150, Seattle, WA, 98188, U.S.A.

Gesch�ftsbedingungen und Versandinformationen

Verkaufsbedingungen

We guarantee the condition of every book as it's described
on the Abebooks website. If you're dissatisfied with your
purchase (Incorrect Book/Not as Described/Damaged) or if the
order hasn't arrived, you're eligible for a refund within 30
days of the estimated delivery date. If you've changed your
mind about a book that you've ordered, please use the "Ask
bookseller a question link to contact us" and we'll respond
as soon as possible.

Versandbedingungen

All domestic Standard and Expedited shipments are distributed from our warehouses by OSM, then handed off to the USPS for final delivery.

2-Day Shipping is delivered by FedEx, which does not deliver to PO boxes.

International shipments are tendered to the local postal service in the destination country for final delivery – we do not use courier services for international deliveries.