Interline Publishing
 info@interlinepublishing.com +91 98867 328 23 / 24 / 25   +91 80 2333 2824 Sign Up   Sign In
Interline Publishing
Skip to Reader

Procedure video
     
Home Authors Readers Search Claims Help Contact
Title      : Analysis and Design of algorithms
Subject      : Analysis and Design of Algorithms (ADA)
copyright © 2019   : Sri Nandi Publications
Author      : Padma Reddy A M
Publisher      : Sri Nandi Publications
Chapters/Pages      : 10/423
Total Price      : Rs.      : 62
 
 
To Purchase, select the individual chapter(s) or click "Select all" for the complete book.

Please scroll down to view chapter(s).
Chapters
     
Introduction to algorithms Total views (155)  
• Notion of Algorithm • Formal definition and review of Asymptotic Notations: Big-Oh Notation Big-omega Notation, Big-theta Notation, • Informal Definitions of Asymptotic notations: Big-Oh, Big-omega and Big-theta, Mathematical Analysis of Non-Recursive • Mathematical Analysis of Recursive Algorithms
Pages: 108
Price: Rs 0   
 
Brute Force Total views (33)  
This chapter includes topics such as Brute Force technique, Selection sort, Bubble sort, Sequential search, Brute force string matching
Pages: 19
Price: Rs 3.8   
 
Divide and Conquer Total views (20)  
This chapter includes topics such as, General method of divide and conquer, Design and analysis of various problems such as Merge sort, Quick sort, Binary search, Defective chess board, Multiplication of two large numbers, Strassen’s matrix multiplication
Pages: 62
Price: Rs 12.4   
 
Greedy Technique Total views (55)  
This chapter includes various topics such as , The general method of greedy technique to solve problems such as Knapsack problem , Job sequencing with deadlines, Single source shortest paths-dijkstra's algorithm, Minimum cost spanning trees:Prim’s algorithm, Kruskal’s algorithm
Pages: 54
Price: Rs 10.8   
 
Dynamic Programming Total views (37)  
This chapter includes topics such as: General method of solving problem using dynamic programming, Computing binomial co-efficient, Warshall’s Algorithm, Floyd’s Algorithm (All pairs shortest path problem), 0/1 Knapsack Problem and Memory functions, Single-Source Shortest Paths: General Weights, Traveling salesperson problem
Pages: 50
Price: Rs 10   
 
Decrease and Conquer Total views (18)  
This chapter includes topics such as: Concept of Decrease and Conquer Technique, Decrease by constant, Decrease by constant factor, Variable size decrease, Insertion sort, Graph Traversals: Depth-First Search (DFS), Analysis of DFS, Breadth-First Search (BFS), Analysis of BFS, Applications of graph traversals, Topological Sorting Using DFS algorithm and Source removal algorithm
Pages: 42
Price: Rs 8.4   
 
Space and Time Tradeoffs Total views (8)  
This chapter includes topics such as: • Sorting by Counting, Comparison counting sort, Distribution counting sort, Input Enhancement in string matching, Horspool’s Algorithm, Boyer-Moore Algorithm
Pages: 22
Price: Rs 4.4   
 
Limitations of Algorithm Power Total views (10)  
This chapter includes topics such as: Lower-Bound Arguments, Decision Trees, P, NP and NP-Complete Problems, Challenges of Numerical algorithms
Pages: 10
Price: Rs 2   
 
Coping with the Limitations of Algorithm Power Total views (14)  
This chapter includes topics such as: Backtracking, n – queen’s problem, Hamiltonian circuit problem, Sum of subset problem, Branch and bound, Assignment Problem, Knapsack Problem, Traveling Salesperson Problem. Approximate algorithms for NP-Hard , Traveling Salesperson Problem, Knapsack Problem
Pages: 42
Price: Rs 8.4   
 
PRAM Algorithms Total views (18)  
This chapter includes topics such as: Introduction to parallel algorithms, Computational Model, Parallel Algorithms for: Prefix Computation, List Ranking. Graph Problems
Pages: 14
Price: Rs 2.8   
 


 
Home
About Us
Payments
Contact Us
Claims
Help
Advertising Guidelines
Safe and Secure Payment
All major credit and debit cards are accepted.
Policies: Terms of Use | Privacy    Copyright © 2021 Interline Publishing. All rights reserved.