Algorithms play a central role both in the theory and in the practice of computing. The goal of the authors was to write a textbook that would not trivialize the subject but would still be readable by most students on their own. The book contains over 120 exercises. Some of them are drills; others make important points about the material covered in the text or introduce new algorithms not covered there. The book also provides programming projects.
From the Table of Contents:
Chapter 1: Basic knowledge of Mathematics, Relations, Recurrence relation and Solution techniques, Function and Growth of functions.
Chapter 2: Different Sorting Techniques and their analysis.
Chapter 3: Greedy approach, Dynamic Programming, Branch and Bound techniques, Backtracking and Problems, Amortized analysis, and Order Statics.
Chapter 4: Graph algorithms, BFS, DFS, Spanning Tree, Flow Maximization Algorithms. Shortest Path Algorithms.
Chapter 5: Binary search tree, Red black Tree, Binomial heap, B-Tree and Fibonacci Heap.
Chapter 6: Approximation Algorithms, Sorting Networks, Matrix operations, Fast Fourier Transformation, Number theoretic Algorithm, Computational geometry Randomized Algorithms, String matching, NP-Hard, NP-Completeness, Cooks theorem.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Dr. Mangey Ram received the Ph.D. degree major in Mathematics and minor in Computer Science from G. B. Pant University of Agriculture and Technology, Pantnagar, India. He has been a Faculty Member for around ten years and has taught several core courses in pure and applied mathematics at undergraduate, postgraduate, and doctorate levels. He is currently a Professor at Graphic Era (Deemed to be University), Dehradun, India.
He is the Editor of the De Gruyter Series of Applications of Mathematical Engineering (AMEIS)
Dr. Sushil Chandra Dimri is presently working as Professor in the department of Computer Science at the Graphic Era University, Dehradun
Dr. Preeti Malik has received her Ph. D. Degree in 2017 from Gurukul Kangri University, INDIA. She has three years of teaching experience in Graphic Era University, INDIA. Currently, she is working as an Assistant Professor in the same university.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
EUR 16,94 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiEUR 7,63 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiDa: California Books, Miami, FL, U.S.A.
Condizione: New. Codice articolo I-9783110693416
Quantità: Più di 20 disponibili
Da: Speedyhen, London, Regno Unito
Condizione: NEW. Codice articolo NW9783110693416
Quantità: 2 disponibili
Da: Basi6 International, Irving, TX, U.S.A.
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Codice articolo ABEJUNE24-350373
Quantità: 3 disponibili
Da: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Condizione: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Codice articolo ABNR-18835
Quantità: 1 disponibili
Da: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo GB-9783110693416
Quantità: 1 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 42427503-n
Quantità: Più di 20 disponibili
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo GB-9783110693416
Quantità: 2 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition. Codice articolo 42427503
Quantità: Più di 20 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: New. Codice articolo 42427503-n
Quantità: Più di 20 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 210. Codice articolo 26377921841
Quantità: 4 disponibili