Interline Publishing
 [email protected] +91 98867 328 23 / 24 / 25   +91 80 2333 2824 Sign Up   Sign In
Interline Publishing
Skip to Reader

Set up video

    Subscription offer
         (Unlimited Download)
Amount Validity
र 100 6 months
र 200 1 year
     
Title      : Introduction to ADA
Subject      : Analysis and Design of Algorithms (ADA)
copyright © 2018   : Mangat J. S.
Author      : Mangat J. S.
Publisher      : Interlinepublishing
Chapters/Pages      : 15/200
Total Price      : Rs.      : 142
 
 
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 Algorithm Total views (1250)  
◙ What's an Algorithm, ◙ Solving a Problem, ◙ Understanding the Problem, ◙ Understanding the Computational Means, ◙ Choosing Appropriate Data Structure, ◙ Precision of Solution, ◙ Strategy to Conquer the Problem, ◙ Representing the Algorithm, ◙ Testing and Analyzing the Algorithm, ◙ Implementing the Algorithm, ` ......
Pages: 13
Price: Rs 0   
 
Fundamental of Analysis of Algorithms Total views (1232)  
◙ Introduction, ◙ Analyzing an Algorithm, ◙ Analysis of Non-recursive Algorithms, ◙ Analysis of Recursive Algorithms, ◙ Exercises, ◙ Solutions for Selected Problems.
Pages: 12
Price: Rs 9   
 
Efficiency of Algorithms: Asymptotic Notations Total views (1236)  
◙ Introduction, ◙ Asymptotic Notations, ◙ Big - Oh Notation, ◙ Big Omega () Notation, ◙ Theta () Notation, ◙ Classification of Efficiency, ◙ Mathematical Analysis of Algorithms, ◙ Mathematical Analysis of Non-recursive Algorithms, ◙ Mathematical Analysis of Recursive Algorithms, ◙ Exercises.
Pages: 10
Price: Rs 7.5   
 
Simply Go-Ahead: Brute Force Total views (1231)  
◙ Introduction, ◙ Sequential Search, ◙ String Matching, ◙ Bubble Sort ◙ Selection Sort, ◙ Exhaustive Search, ◙ Magic Square, ◙ Knapsack Problem, ◙ Travelling Salesman Problem, ◙ Assignment Problem, ◙ Application Programs, ◙ Selection Sort, ◙ Sequential Search, ◙ Exercises.
Pages: 16
Price: Rs 12   
 
Divide and Conquer I Total views (1231)  
◙ Introduction, ◙ Binary Search, ◙ Quicksort, ◙ Mergesort, ◙ External Sorting, ◙ Application Programs, ◙ Binary Search, ◙ Quick Sort, ◙ Merge Sort, ◙ Exercises.
Pages: 17
Price: Rs 12.75   
 
Divide and Conquer II Total views (1230)  
◙ Introduction, ◙ Multiplication of Large Integers, ◙ Multiplications of Matrices, ◙ Strassen's Algorithm, ◙ Winograd's Matrix Multiplication, ◙ Binary Tree Traversal, ◙ Inorder Traversal, ◙ Preorder Traversal, ◙ Postorder Traversal, ◙ Exercises.
Pages: 9
Price: Rs 6.75   
 
Decrease and Conquer Total views (1232)  
◙ Introduction, ◙ Tower of Hanoi, ◙ Generating Combinatorial Objects, ◙ Generating Subsets, ◙ Generating Permutations, ◙ Depth First Search, ◙ Topological Sorting, ◙ Source Removal, ◙ Breadth First Search, ◙ Insertion Sort, ◙ Application Programs, ◙ Breadth First Search, ◙ Depth First Search, ......
Pages: 26
Price: Rs 19.5   
 
Transform and Conquer Total views (1235)  
◙ Introduction, ◙ Presorting, ◙ Balanced Search Trees, ◙ AVL Tree, ◙ 2-3 Trees, ◙ Heapsort, ◙ Data Structure Heap, ◙ The Sorting Algorithm - Heapsort, ◙ Problem Reduction, ◙ Logn x, ◙ Paths of Length 'n' in Graphs, ◙ Least Common Multiple, ◙ Generating Subsets, ◙ Application Programs, & ......
Pages: 19
Price: Rs 14.25   
 
Space-Time Tradeoff I Total views (1239)  
◙ Introduction, ◙ Signal Generation, ◙ Input Enhancement in String Matching, ◙ Boyer - Moore (BM) Algorithm, ◙ Horspool's Algorithm, ◙ Sorting by Counting, ◙ Rank Sort, ◙ Distribution Counting, ◙ Application Programs, ◙ Horspool's Algorithm, ◙ Exercises.
Pages: 9
Price: Rs 6.75   
 
Space-Time Tradeoff II Total views (1241)  
◙ Introduction, ◙ Hashing, ◙ Open Hashing, ◙ Close Hashing, ◙ Exercises.
Pages: 4
Price: Rs 3   
 
Dynamic Programming Total views (1233)  
◙ Introduction, ◙ Binomial Coefficient, ◙ Floyd's Algorithm, ◙ Warshall's Algorithm, ◙ Knapsack Problem, ◙ Memory Function, ◙ Knapsack Problem, ◙ Application Programs, ◙ Binomial Coefficients, ◙ Floyd's Algorithm, ◙ Warshall's Algorithm, ◙ Knapsack Problem, ◙ Exercises.
Pages: 14
Price: Rs 10.5   
 
Greedy Strategy Total views (1234)  
◙ Introduction, ◙ Dijkstra's Algorithm, ◙ Prim's Algorithm, ◙ Kruksal's Algorithm, ◙ Huffman Codes, ◙ Application Programs, ◙ Dijkstra's Algorithm, ◙ Kruskal's Algorithm, ◙ Prim's Algorithm, ◙ Exercises.
Pages: 28
Price: Rs 21   
 
Limitation of Algorithm Power: Lower Bound Total views (1235)  
◙ Introduction, ◙ Lower Bounds, ◙ In-Out Lower Bound, ◙ Lower Bound Using Linear Reduction, ◙ Information Theoretic Lower Bound, ◙ Decision Trees, ◙ Lower Bound for Sorting, ◙ Exercises.
Pages: 4
Price: Rs 3   
 
Limitation of Algorithm Power: Classification of Problems Total views (1241)  
◙ Introduction, ◙ P-Class of Problems, ◙ Np-Class of Problems, ◙ Vertex Cover Problem, ◙ Np-Complete Problems, ◙ Exercises.
Pages: 3
Price: Rs 2.25   
 
Coping With Problem Bounds Total views (1239)  
◙ Introduction, ◙ Backtracking, ◙ Travelling Salesman Problem, ◙ N-Queens Problem, ◙ Branch and Bound, ◙ Travelling Salesman Problem, ◙ Assignment Problem, ◙ Approximation Algorithms, ◙ Travelling Salesman Problem, ◙ Vertex Cover Problem, ◙ Application Programs, ◙ N-Queens Problem, ◙ Subset ......
Pages: 16
Price: Rs 12   
 


 
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 © 2019 Interline Publishing. All rights reserved.