Description
This book is an ideal test to provide in depth knowledge on design and analysis of algorith. The purpose of the book is to make the students understand the fundamentals of design and analysis of algorithm convenietly. It is meant to be used as a text book for B.Sc/BCA/MCA/M.Sc/ B.E./B.Tech/M.Sc/MS/M.Tech and diploma courses, and as a reference book
Table of Contents
UNIT – 1
Chapter 1: Data Structure Basics
Chapter 2: Analysis of Algorithms
Chapter 3: Growth of Functions
Chapter 4: Sorting Algorithms
UNIT – 2
Chapter 1: B-trees: Balanced Trees
Chapter 2: Binary Search Trees
Chapter 3: Disjoint Sets
UNIT – 3
Chapter 1: Dynamic Programming
Chapter 2: The Greedy Method
Chapter 3: Backtracking
Chapter 4: Divide and Conquer
Chapter 5: Branch and Bound
UNIT – 4
Chapter 1: Chapter 2: Graphs
Single- Source Shortest Path
Chapter 3: All-Pairs Shortest Paths
Chapter 4: Dijkstra’s Algorithm
Chapter 5: Minimum-Cost Spanning Trees
UNIT – 5
Chapter 1: String Matching
Chapter 2: Randomization
Chapter 3: Amortized Analysis of Data Structure
Author
Jatinder Singh
Er. Jatinder Singh (Asst. Professor) Dept.of I.T. , S.S.S. College of Engg. And Tech. Gurdaspur (PB)
Reviews
There are no reviews yet.