Algorithms: Design and Analysis
Giới thiệu về sách điện tử này
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.
Xếp hạng và đánh giá
Giới thiệu tác giả
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.
