logo-home
logo
  2. Integral University
  3. Design and Analysis of Algorithm

Design and Analysis of Algorithm

Integral University

Here are the best resources to pass Design and Analysis of Algorithm. Find Design and Analysis of Algorithm study guides, notes, assignments, and much more.

Popular textbooks

Introduction to the Design and Analysis of Algorithms

Introduction to the Design and Analysis of Algorithms

Anany Levitin

3 documents

All 4 results

Sort by

Design and Analysis of Algorithm

  • Design and Analysis of Algorithm

  • Package deal • 3 items • 2018
  • Design Techniques: Divide and Conquer, The Greedy Method, Dynamic Programming, Elementary Graph Algorithms, Additional Topics.
    (0)
  • $5.76
  • + learn more
Design and Analysis of Algorithm:- (Additional Topics) Design and Analysis of Algorithm:- (Additional Topics)

  • Design and Analysis of Algorithm:- (Additional Topics)

  • Class notes • 7 pages • 2018
  • Available in package deal
    • Additional Topics: String Matching, NP-Completeness: P and NP, NP-Completeness, Important NPComplete problems, Approximation Algorithms, Randomized Algorithms.
    (0)
  • $3.84
  • + learn more
Design and Analysis of Algorithm:- (Elementary Graph Algorithms) Design and Analysis of Algorithm:- (Elementary Graph Algorithms)

  • Design and Analysis of Algorithm:- (Elementary Graph Algorithms)

  • Class notes • 12 pages • 2018
  • Available in package deal
    • Elementary Graph Algorithms: Representations of Graphs, Breadth First Search, Depth First Search, Minimum Spanning Trees: Kruskal and Prim’s Algorithms, Single Source Shortest Paths, All Pair Shortest Paths, Maximum Flow.
    (0)
  • $3.84
  • + learn more
Design and Analysis of Algorithm:- (Design Techniques: Divide and Conquer, The Greedy Method, Dynamic Programming) Design and Analysis of Algorithm:- (Design Techniques: Divide and Conquer, The Greedy Method, Dynamic Programming)

  • Design and Analysis of Algorithm:- (Design Techniques: Divide and Conquer, The Greedy Method, Dynamic Programming)

  • Class notes • 21 pages • 2018
  • Available in package deal
    • Design Techniques: Divide and Conquer: General Method, Binary Search, Finding Maximum and Minimum, Strassen’s Matrix Multiplication The Greedy Method: General Method: Knapsack Problem, Tree Vertex Splitting problem. Dynamic Programming: General Method, Multi-Stage Graph, String Editing. Backtracking: Basic 8 Queen Problem, Sum of Subset Problem.
    (0)
  • $3.84
  • + learn more