Regular price €70.99
Quantity:
Ships in 10-20 days
Delivery/Collection within 10-20 working days
Shipping & Delivery
A01=Mangey Ram
A01=Preeti Malik
A01=Sushil C. Dimri
Age Group_Uncategorized
Age Group_Uncategorized
Algorithmen
Author_Mangey Ram
Author_Preeti Malik
Author_Sushil C. Dimri
automatic-update
Category1=Non-Fiction
Category=GPF
Category=UMB
Category=UYQ
Category=UYZM
COP=Germany
Delivery_Delivery within 10-20 working days
eq_bestseller
eq_computing
eq_isMigrated=0
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Language_English
PA=Available
Price_€50 to €100
PS=Active
softlaunch

Product details

  • ISBN 9783110693416
  • Weight: 316g
  • Dimensions: 170 x 240mm
  • Publication Date: 08 Mar 2021
  • Publisher: De Gruyter
  • Publication City/Country: DE
  • Product Form: Paperback
  • Language: English
Secure checkout Fast Shipping Easy returns

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.

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.


More from this author