CMRTC College Data Share

Skip to content
Jump to main navigation and login

Nav view search

Navigation

Search

You are here: Home

Computer Science & IT

Design and Analysis of Algorithms

Design and Analysis of Algorithms

01 Overview Of Course

02 FrameWork OFAlgorithms

03 Algorithms Analysis Framework - II

04 Asymptotic Notations

05 Algorithm Design

06 Divide And Conquer-I

07 Divide And Conquer -II

08 Divide And Conquer -III Surfing Lower Bounds

09 Divide And Conquer -IV Closest Pair

10 Greedy Algorithms -I

11 Greedy Algorithms - II

12 Greedy Algorithms - III

13 Greedy Algorithms - IV

14 Pattern Matching - I

15 Pattern Matching - II

16 Combinational Search and Optimization I

17 Combinational Search and Optimization II

18 Dynamic Programming

19 Longest Common Subsequences

20 Matric Chain Multiplication

21 Scheduling with Startup and Holding Costs

22 Average case Analysis of Quicksort

23 Bipartite Maximum Matching

24 Lower Bounds for Sorting

25 Element Distinctness Lower Bounds

26 NP Completeness

27 NP - Completeness - II

28 NP-Completeness - III

29 NP-Completeness - IV

30 NP-Completeness - V

31 NP-Completeness - VI

Powered by Phoca Download