Digital Book Store Pvt. Ltd.     +91 80 23332824

This Site is being upgraded.

Please click here to be redirected to our sister site: https://www.interlinepublishing.com
to continue search and further transactions.


Chapters | Pages: 5 | 89

Design and Analysis of Algorithms/15CS43

Subject : DESIGN AND ANALYSIS OF ALGORITHMS
Author : Dr T Venkatesh
Publisher : Ghousia College of Engineering

Price: 43

To Purchase, select the individual chapter(s) or click "Select all" for the complete book.
Please scroll down to view chapter(s).

Chapters

Select All
 MODULE-01 Introduction

Introduction: What is an Algorithm? , Algorithm Specification, Analysis Framework, Performance Analysis: Space complexity, Time complexity, Asymptotic Notations: Big-oh notation(O),Omega notation(Ω),Theta notation(ϴ), and Little-oh notation(o), Mathematical analysis of Non-Recursive and recursive Algorithm with Examples. Important Problem Types: Sorting, Searching, String processing, ......

Pages: 18

Total views (28)

Price : Rs 0

Lite Preview

 MODULE-02 / Divide and Conquer:

Divide and Conquer: General method, Binary search, Recurrence equation for divide and conquer, Finding the maximum and minimum, Merge sort, Quick sort , Strassen’s matrix multiplication, Advantages and Disadvantages of divide and conquer. Decrease and Conquer Approach: Topological Sort.

Pages: 21

Total views (7)

Price : Rs 12.6

Lite Preview

 MODULE-03 / Greedy Method:

Greedy Method: General method, Coin Change Problem, Knapsack Problem, Job sequencing with deadlines. Minimum cost spanning trees: Prim’s Algorithm, Kruskal’s Algorithm. Single source shortest paths: Dijkstra’s Algorithm. Optimal Tree problem: Huffman Trees and Codes.Transform and Conquer Approach: Heaps and Heap Sort.

Pages: 20

Total views (0)

Price : Rs 12

Lite Preview

 MODULE-04/1 / Dynamic Programming:

Dynamic Programming: General method with examples, Multistage Graphs, Transitive Closure: Warshall’s Algorithm, All Pairs Shortest paths: Floyd’s Algorithm, Optimal Binary Search Trees, Knapsack problem, Bellman-Ford Algorithm, Travelling Sales Person problem, Reliability design.

Pages: 10

Total views (0)

Price : Rs 6

Lite Preview

 MODULE-04/2 / Dynamic Programming:

Dynamic Programming

Pages: 20

Total views (0)

Price : Rs 12

Lite Preview

Total 0 Chapter(s) Shortlisted and Price Rs. .00     Purchase Now